Data Structures -> Wavelet Tree
Static range order-statistics and value-counting structure that rewrites one queried interval through value partitions with prefix-left counts.
- Topic slug:
data-structures/wavelet-tree
- Tutorial page: Open tutorial
- Ladder page: Open ladder
- Repo problems currently tagged here:
1
- Repo companion pages:
5
- Curated external problems:
3
Microtopics
- range-kth-smallest
- prefix-left-counts
- static-order-statistics
- coordinate-compression
- count-leq
- wavelet-vs-persistent
Learning Sources
Practice Sources
Repo Companion Material
Curated External Problems
Core
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| MKTHNUM - K-th Number |
SPOJ |
Hard |
Order Statistics |
Query-Heavy; Data-Structure-Heavy |
Coordinate Compression; Wavelet Tree; Range Order Statistics |
Range-Kth; Static-Queries |
The canonical first static range k-th-smallest problem and the cleanest first benchmark for this lane. |
Practice
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Range K-th Smallest |
Library Checker |
Hard |
- |
Query-Heavy; Data-Structure-Heavy |
Wavelet Tree; Coordinate Compression; Static Queries |
Range-Kth |
An official verifier-style benchmark once the basic wavelet-tree descent is trusted. |
Classics
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| K-query |
SPOJ |
Hard |
Threshold Counting, Classic |
Query-Heavy; Classic |
Wavelet Tree; Range Counting; Coordinate Compression |
Threshold-Count |
A classic follow-up showing the same lane extends naturally from k-th queries to value-threshold counts. |
Repo Problems
| Code |
Title |
Fit |
Difficulty |
Pattern |
Note |
Solution |
MKTHNUM |
K-th Number |
primary |
hard |
- |
Note |
Code |
Regeneration
python3 scripts/generate_problem_catalog.py