PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 64: Offline Range Queries and Query Reordering
← All DSA chapters

Part XI · Chapter 64

Offline Range Queries and Query Reordering
  1. 64.01Offline vs online
  2. 64.02Mo's algorithm
  3. 64.03Mo variations
  4. 64.04Parallel binary search
  5. 64.05CDQ divide and conquer
  6. 64.06Small-to-large technique
    1. Merge smaller map into larger
    2. Subtree color frequencies
    3. Amortized O(n log n) intuition
  7. 64.07Offline dynamic connectivity
← All DSA chapters

Part XI · Chapter 64

Offline Range Queries and Query Reordering
  1. 64.01Offline vs online
  2. 64.02Mo's algorithm
  3. 64.03Mo variations
  4. 64.04Parallel binary search
  5. 64.05CDQ divide and conquer
  6. 64.06Small-to-large technique
    1. Merge smaller map into larger
    2. Subtree color frequencies
    3. Amortized O(n log n) intuition
  7. 64.07Offline dynamic connectivity
Home/DSA/Offline Range Queries and Query Reordering/Small-to-large technique
64.06Advanced / Expert3 topics

Small-to-large technique

Part of Chapter 64: Offline Range Queries and Query Reordering.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

64.06.1

Merge smaller map into larger

Explanation coming soon.

64.06.2

Subtree color frequencies

Explanation coming soon.

64.06.3

Amortized O(n log n) intuition

Explanation coming soon.

← Previous · 64.05

CDQ divide and conquer

Next · 64.07 →

Offline dynamic connectivity

On this page

  • Merge smaller map into larger
  • Subtree color frequencies
  • Amortized O(n log n) intuition