# Wavelet Tree Range Quantile: Practice Notes

Wavelet Tree Range Quantile shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each bit of the values splits a wavelet-tree node; a k-th query follows the bit that contains the k-th item and remaps k into that child.

## 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(log U) per quantile after O(n log U) build.

## Common mistake

Not remapping k when descending into the right child, which reports an element from the wrong half.

## 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 assistant for technical interviews.