Advanced Data Structures
Tries, segment trees, union-find, and specialized structures
Tries, segment trees, union-find, and specialized structures
Sections
Articles
Fenwick Tree (Binary Indexed Tree)
Fenwick Tree (Binary Indexed Tree) title: Fenwick Tree - Binary Indexed Tree topic: Data Structures …
Tries / Prefix Trees
Tries / Prefix Trees 1. Summary / TL;DR Trie (pronounced “try”) is a tree for storing …
Sparse Table
Sparse Table title: Sparse Table - Static Range Queries topic: Data Structures difficulty: Medium …
Skip List
Skip List title: Skip List - Probabilistic Data Structure topic: Data Structures difficulty: Medium …
Union-Find / Disjoint Set Union
Union-Find / Disjoint Set Union (DSU) 1. Summary / TL;DR Union-Find tracks elements partitioned into …
Bloom Filters & Probabilistic Data Structures
Bloom Filters & Probabilistic Data Structures title: Bloom Filters and Probabilistic Data …
Suffix Array & Suffix Tree
Suffix Array & Suffix Tree title: Suffix Array and Suffix Tree topic: Data Structures …
Cache Data Structures (LRU, LFU)
Cache Data Structures (LRU, LFU) title: Cache Data Structures - LRU and LFU Caches topic: Data …