← PATTERN ATLAS
PATTERN 10 · 3 PROBLEMS

Tries & prefix search

Store shared prefixes once so character-by-character decisions become direct transitions.

Start the first lesson ↗
MASTER KEYA path is a prefix; an end marker is a word.
0OF 3
RECALLED
RECOGNITION SIGNAL

Each character is one edge; word completion is separate from path existence.

01
Not started

Implement Trie (Prefix Tree)

Each character is one edge; word completion is separate from path existence.

↗
02
Not started

Design Add and Search Words Data Structure

A wildcard branches across all children at exactly one depth.

↗
03
Not started

Word Search II

A trie shares prefix work across many words and prunes impossible paths.

↗