Free to read · 22 interview patterns
Build a memory palace for the patterns interviews keep asking.
Every problem, solution, lesson, scene, dojo, and memory tool is free to explore. Sign in for daily code runs; Pro adds unlimited runs and remembers your learning across visits.
Scroll the tour: one illustrated room for every pattern the app teaches. Open any pattern to walk its memory room.
- Two sum II (sorted) Arrays
- Valid palindrome Strings
- Build a frequency table Hash Maps
- Reverse linked list Linked Lists
- Validate parentheses Stacks & Queues
- Tree traversals Trees
- Implement trie methods Tries
- Heap operations Heaps
- Search a sorted matrix Matrices
- Department top three salaries Database
- Subsets Backtracking
- Number of Islands Graphs
- Topological sort (DFS post-order) Graphs
- Binary search Binary Search
- Climbing Stairs Dynamic Programming
- Edit Distance Dynamic Programming
- Interval scheduling (activity selection) Greedy
- Minimum window substring Sliding Window
- 3Sum Sorting
- Merge intervals Intervals
- Subarray sum equals k Prefix Sum
- Pow(x, n) Math
- File line iterator Streams & I/O
- LRU cache System Design