TOPIC
DESIGN
Every design problem in the series, in the order the worlds teach them.
8 STAGES
EASY1:40Design HashSet
LC 705▶ START
EASY1:38Design HashMap
LC 706▶ START
MEDIUM1:26Min Stack
LC 155▶ START
EASY1:42Implement Queue using Stacks
LC 232▶ START
MEDIUM1:40Design Circular Queue
LC 622▶ START
MEDIUM1:46Snapshot Array
LC 1146▶ START
MEDIUM1:42Binary Search Tree Iterator
LC 173▶ START
HARD1:40LFU Cache
LC 460▶ START
More topics
- Dynamic programming 19
- Backtracking 17
- Greedy 17
- Tree recursion 13
- Bit manipulation 8
- Two pointers 8
- Hash map 7
- Heap 7
- Binary search 6
- Breadth-first search 5
- Linked list 5
- Fast and slow pointers 4
- Grid search 4
- Shortest path 4
- Depth-first search 3
- Math 3
- Carry 2
- Hash set 2
- Matrix 2
- Monotonic stack 2
- Prefix sums 2
- Sliding window 2
- Stack 2
- Topological sort 2
- Trie 2