Topics

20

Duration

40 Weeks

Progress

0/20

Learning Progress0%
Competitive Programming Roadmap

Advanced Data Structures

Learning Path

Follow these concepts in order to master this topic.

1
Review of STL Data Structures
2
Stack
3
Queue
4
Deque
5
Priority Queue
6
Binary Indexed Tree (Fenwick Tree)
7
Fenwick Tree Applications
8
Segment Tree
9
Segment Tree Variants
10
Lazy Propagation
11
Sprase Table
12
Disjoint Set Union Review
13
Ordered Set (PBDS)
14
Policy-Based Data Structures
15
Treap
16
AVL Tree
17
Red-Black Tree
18
Splay Tree
19
Persistent Segment Tree
20
Merge Sort Tree
21
Wavelet Tree
22
Square Root Decomposition
23
Mo's Algorithm
24
Advanced Range Query Problems
25
Choosing the Right Data Structure
26
Contest Data Structure Patterns

Practice Websites

Practice what you've learned.

Projects

Apply what you've learned by building real projects.

Build an Advanced Data Structures Library
Advanced
Implement Fenwick Tree, Segment Tree & PBDS from Scratch
Advanced
Solve 100 advanced Data Structure Problems
Advanced

Tools

Recommended tools for this topic.