Problem: Given an array of integers and a target sum, find two numbers in the array that add up to the target.
Key points:
- Input: Integer array and target number
- Output: Indices of two numbers that sum to target
- Each input has exactly one solution
- Same element cannot be used twice
- Time complexity: O(n) using hash table
- Space complexity: O(n)