# Succinct Bitvector Rank Select: Explained
Succinct Bitvector Rank Select shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Break the bit string into superblocks and blocks, store prefix ranks, and answer rank in a few table lookups; select walks those prefixes.
## 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) extra bits for o(n)-space rank/select.
## Common mistake
Storing a full prefix-sum array of n integers, which is not succinct.
## 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 AI tool for job interviews.