# Two Sum Hash Map (Practice 4525): Warm-up
Interviewers love two sum hash map because it checks whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Use a dict from value to index while scanning once.
```python
def two_sum(nums, target):
seen = {}
for i, x in enumerate(nums):
if target - x in seen: return [seen[target - x], i]
seen[x] = i
```
## Complexity
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
## Interview pitfalls
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
## Practicing out loud
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [Linkjob AI](https://www.linkjob.ai/).