Blind 75
All 75 freeBuild your coding interview foundations, one pattern at a time. Work through 75 problems with examples, hints, and solution approaches—at your own pace.
Your progress0 / 75 complete
Saved in this browser when storage is available. No account needed.
75 questions
Arrays & hashing
0 / 8
Two pointers
0 / 3
Sliding window
0 / 4
Stack
0 / 1
Linked lists
0 / 6
Trees
0 / 11
- Invert Binary TreeEasy
- Maximum Depth of Binary TreeEasy
- Same TreeEasy
- Subtree of Another TreeEasy
- Lowest Common Ancestor of a Binary Search TreeMedium
- Binary Tree Level Order TraversalMedium
- Validate Binary Search TreeMedium
- Kth Smallest Element in a BSTMedium
- Construct Binary Tree From Preorder and Inorder TraversalMedium
- Binary Tree Maximum Path SumHard
- Serialize and Deserialize Binary TreeHard
Tries
0 / 3
Heaps
0 / 1
Backtracking
0 / 2
Graphs
0 / 7
Dynamic programming
0 / 12
Greedy
0 / 2
Intervals
0 / 5
Blind 75 is a public study list created by Yangshun Tay. The prompts and explanations here are independently written by PracHub. This collection is separate from our company-reported interview questions.