Two Sum

Problem

Return indices of two numbers summing to target.

Example

[2,7,11,15], 9 -> [0,1]

Constraints

• 2 ≤ n ≤ 10^4

Approach

Hash map. Intuit coding rounds skew LC-easy/medium with emphasis on clarity.