# T-Digest Quantile Sketch: Study Guide
T-Digest Quantile Sketch shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Maintain centroids with a size bound that is tighter near 0 and 1 so tail quantiles stay accurate while the sketch stays compact.
## 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(k) space for compression parameter k; merges are linear in k.
## Common mistake
Using equal-weight centroids, which wastes accuracy on the tails.
## 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 best AI tool for coding tests and OAs.