Curated List
Blind 75 — The Complete LeetCode Problem List
The original Blind 75 — 75 must-know coding interview problems curated by an ex-Meta engineer. Organized by pattern with free progress tracking. Ace your FAANG interview.
20
Easy
48
Medium
7
Hard
0 / 75 solved
| Two Sum | Easy | ||
| Best Time to Buy and Sell Stock | Easy | ||
| Contains Duplicate | Easy | ||
| Product of Array Except Self | Medium | ||
| Maximum Subarray | Medium | ||
| Maximum Product Subarray | Medium | ||
| Find Minimum in Rotated Sorted Array | Medium | ||
| Search in Rotated Sorted Array | Medium | ||
| 3Sum | Medium | ||
| Container With Most Water | Medium |
| Sum of Two Integers | Medium | ||
| Number of 1 Bits | Easy | ||
| Counting Bits | Easy | ||
| Missing Number | Easy | ||
| Reverse Bits | Easy |
| Climbing Stairs | Easy | ||
| Coin Change | Medium | ||
| Longest Increasing Subsequence | Medium | ||
| Longest Common Subsequence | Medium | ||
| Word Break | Medium | ||
| Combination Sum | Medium | ||
| House Robber | Medium | ||
| House Robber II | Medium | ||
| Decode Ways | Medium | ||
| Unique Paths | Medium | ||
| Jump Game | Medium |
| Clone Graph | Medium | ||
| Course Schedule | Medium | ||
| Pacific Atlantic Water Flow | Medium | ||
| Number of Islands | Medium | ||
| Longest Consecutive Sequence | Medium | ||
| Alien Dictionary Premium | Hard | ||
| Graph Valid Tree Premium | Medium | ||
| Number of Connected Components Premium | Medium |
| Insert Interval | Medium | ||
| Merge Intervals | Medium | ||
| Non-overlapping Intervals | Medium | ||
| Meeting Rooms Premium | Easy | ||
| Meeting Rooms II Premium | Medium |
| Reverse Linked List | Easy | ||
| Linked List Cycle | Easy | ||
| Merge Two Sorted Lists | Easy | ||
| Merge K Sorted Lists | Hard | ||
| Remove Nth Node From End of List | Medium | ||
| Reorder List | Medium |
| Set Matrix Zeroes | Medium | ||
| Spiral Matrix | Medium | ||
| Rotate Image | Medium | ||
| Word Search | Medium |
| Longest Substring Without Repeating Characters | Medium | ||
| Longest Repeating Character Replacement | Medium | ||
| Minimum Window Substring | Hard | ||
| Valid Anagram | Easy | ||
| Group Anagrams | Medium | ||
| Valid Parentheses | Easy | ||
| Valid Palindrome | Easy | ||
| Longest Palindromic Substring | Medium | ||
| Palindromic Substrings | Medium | ||
| Encode and Decode Strings Premium | Medium |
| Maximum Depth of Binary Tree | Easy | ||
| Same Tree | Easy | ||
| Invert Binary Tree | Easy | ||
| Binary Tree Maximum Path Sum | Hard | ||
| Binary Tree Level Order Traversal | Medium | ||
| Serialize and Deserialize Binary Tree | Hard | ||
| Subtree of Another Tree | Easy | ||
| Construct Binary Tree from Preorder and Inorder | Medium | ||
| Validate Binary Search Tree | Medium | ||
| Kth Smallest Element in a BST | Medium | ||
| Lowest Common Ancestor of a BST | Easy | ||
| Implement Trie (Prefix Tree) | Medium | ||
| Design Add and Search Words Data Structure | Medium | ||
| Word Search II | Hard |
| Top K Frequent Elements | Medium | ||
| Find Median From Data Stream | Hard |
Want more curated problems?
Check our Essential 75 (frequency-based), LeetCode interview questions by pattern, or browse 206+ problems.
Blind 75 vs. Essential 75 — What's the difference?
Blind 75
- • Original list curated on Blind by an ex-Facebook engineer
- • Organized by data structure category (Array, Graph, DP…)
- • The industry standard — what most FAANG prep guides reference
- • Some problems overlap across categories, which is intentional
Essential 75
- • Our curated list, filtered by interview frequency from 200+ problems
- • Organized by pattern (Sliding Window, Two Pointers, BFS…)
- • Teaches you how to recognize problem types, not just solve them
- • Better starting point if you're new to pattern-based prep
Not sure which to pick? Start with the Essential 75 if you want a pattern-first approach, or use both lists together for comprehensive coverage.