# Meet In The Middle Subset Sums: Interview Notes
Meet In The Middle Subset Sums shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Split items in half, enumerate subset sums of each, sort one side and binary search for complements.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(2^(n/2) * n).
## Common mistake
Enumerating the full 2^n set anyway when merging.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at undetectable AI interview copilot.