# Two Sum Hash Variants (Practice 5048): Walkthrough

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Scan once and store complement indices in a hash map so each lookup is O(1).

```python
def two_sum(a,t):
    seen={}
    for i,x in enumerate(a):
        if t-x in seen: return [seen[t-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 [real-time interview help](https://www.linkjob.ai/).