Data Structures
The containers: trees, heaps, hash tables, tries, range structures.
Topics
Problems attacked from this category
- Array range queries10
- Disjoint sets and connectivity5
- Disk-friendly ordered indexing3
- Double-ended priority queues2
- DP transition optimization1
- Dynamic hashing2
- Dynamic trees3
- Exact cover1
- Hash collision resolution8
- Hash function families2
- Integer and monotone priority queues3
- Integer predecessor search4
- List update3
- Optimal weighted search trees2
- Ordered dictionaries and balanced search trees14
- Perfect hashing of static sets2
- Persistent maps3
- Persistent sequences2
- Priority queues9
- Rank and select queries2
- Search in a sorted array7
- Spatial indexing2
- String-keyed dictionaries and tries6
- Text editor buffers3
- Unimodal extremum search2