# Wavelet Matrix Rank Select: Study Guide
Wavelet Matrix Rank Select shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store one bitvector per bit of the universe, stably partitioned; rank0/rank1 jumps between levels without explicit child pointers.
## 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 log σ) bits plus rank support, O(log σ) queries.
## Common mistake
Unstable partitioning so later levels no longer correspond to the previous range.
## 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 official website.