Explain how you would solve the Two Sum problem on an array, then discuss the time complexity of your approach and compare it with the brute-force solution.
Array traversalHash table usageSearch optimizationTime and space complexity analysis| Approach | Runtime | Memory |
|---|---|---|
| Nested loops | O(n^2) | O(1) |
| Hash table | O(n) average | O(n) |