01 — one page
The ultimate quick-reference board. 11 core DSA chapters boiled down to syntax-highlighted code templates, time complexities, and key structures. Print it, pin it, or keep it open during practice.
01
Arrays + Hashing
O(1) lookups & frequencies
02
Two Pointers
Sorted arrays & nodes
03
Sliding Window
Contiguous subarrays
04
Binary Search
Logarithmic target searches
05
Stack / Monotonic Stack
Nested parsing & order
06
Linked List
Pointer manipulations
07
Trees
Hierarchical DFS/BFS paths
08
Heap
Dynamic min/max & streaming
09
Graphs
Networks & connectivity
010
Backtracking
Recursive searches & states
011
DP
Memoized state transitions