Topics

The roadmap. Pick a topic to read the concept and drill it.

Arrays & Hashing

24 cards

Lists, dicts, sets, and counting patterns.

Not started0%

Two Pointers

6 cards

Converging/parallel index scans.

Not started0%

Stack

6 cards

LIFO patterns and monotonic stacks.

Not started0%

Binary Search

6 cards

Search over sorted data and answer spaces.

Not started0%

Sliding Window

6 cards

Contiguous subarray/substring windows.

Not started0%

Linked List

6 cards

Pointer manipulation and dummy heads.

Not started0%

Trees

7 cards

Traversals, recursion, BST invariants.

Not started0%

Tries

5 cards

Prefix trees for word lookups.

Not started0%

Heap / Priority Queue

8 cards

heapq, top-k, and streaming medians.

Not started0%

Backtracking

6 cards

Choose / explore / un-choose recursion.

Not started0%

Graphs

7 cards

BFS, DFS, and union-find on grids/adjacency.

Not started0%

Advanced Graphs

6 cards

Dijkstra, MST, topological sort.

Not started0%

1-D DP

5 cards

Linear dynamic programming.

Not started0%

2-D DP

6 cards

Grid and interval dynamic programming.

Not started0%

Greedy

5 cards

Locally optimal choices.

Not started0%

Intervals

6 cards

Merging, inserting, and scheduling ranges.

Not started0%

Math & Geometry

5 cards

Number theory and coordinate tricks.

Not started0%

Bit Manipulation

6 cards

Masks, shifts, and XOR tricks.

Not started0%