# Sum Over Subsets DP: Walkthrough
Sum Over Subsets DP shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Iterate bits outermost and add f[mask ^ bit] into f[mask] when the bit is set, so each mask gets the sum of all its submasks.
## 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(n * 2^n).
## Common mistake
Looping masks outermost, which double counts submasks.
## 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 real-time AI interview assistant for live interviews.