Loading...
Blind 75 — all 75 problems
The classic Blind 75 coding interview problem set covering arrays, trees, graphs, dynamic programming, and more. Master these 75 problems to ace technical interviews.
Arrays & Hashing
Backtracking
Bit Manipulation
Dynamic Programming
Graphs
Heap / Priority Queue
Linked List
Math & Geometry
Sliding Window
Trees
- Invert Binary TreeEasy
- Maximum Depth of Binary TreeEasy
- Same TreeEasy
- Subtree of Another TreeEasy
- Lowest Common Ancestor of a BSTMedium
- Binary Tree Level Order TraversalMedium
- Validate Binary Search TreeMedium
- Kth Smallest Element in a BSTMedium
- Construct Binary Tree from Preorder and InorderMedium
- Binary Tree Maximum Path SumHard
- Serialize and Deserialize Binary TreeHard