Fade to Solo

Patterns

18 patterns, curriculum order. Each strip is the fade — study cooling into solo.

01

Arrays & Hashing

0/5

signal O(1) lookups, dedupe, or counting frequencies

02

Two Pointers

0/5

signal sorted array, pair/triplet, or converging from both ends

03

Sliding Window

0/5

signal longest / shortest / best contiguous subarray or substring

04

Stack

0/5

signal matching pairs, undo, or "next greater" (monotonic stack)

05

Binary Search

0/5

signal sorted input — or "minimise the max / search on the answer"

06

Linked List

0/6

signal reorder/reverse in place, or fast–slow pointers for cycle/middle

07

Trees

0/8

signal recurse on subtrees — return-up vs pass-down; BFS for levels

08

Graphs (BFS/DFS)

0/6

signal grid or adjacency; components; unweighted shortest path → BFS

09

1-D Dynamic Programming

0/6

signal count ways / best value with overlapping subproblems along a line

10

Heap / Priority Queue

0/5

signal top-K, running median, or repeatedly grab the min/max

11

Backtracking

0/5

signal generate all subsets/combos/permutations — choose·explore·unchoose

12

Intervals

0/4

signal overlapping ranges → sort by start/end, then sweep

13

Greedy

0/5

signal local best choice provably gives the global best; one pass

14

2-D Dynamic Programming

0/4

signal two sequences or a grid; state depends on two indices

15

Tries

0/3

signal prefix search, autocomplete, dictionary of words

16

Advanced Graphs

0/4

signal ordering with dependencies (topo), or union-find to merge sets

17

Bit Manipulation

0/4

signal XOR tricks, counting bits, no-extra-space via bits

18

Math & Geometry

0/4

signal in-place matrix moves, simulation, number tricks