# Iterating All Submasks Of A Mask: Walkthrough
Iterating All Submasks Of A Mask shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Loop sub = (sub - 1) & mask until it reaches zero; the total over all masks is 3^n.
## 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(3^n) over every mask.
## Common mistake
Missing the empty submask because the loop stops before processing zero.
## 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 learn more.