Curated List · Blind 75
Blind 75 List: Must-Solve LeetCode Problems by Pattern
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.
The Blind 75 list originated on the Blind platform. This page organizes the problems by pattern with our own templates and complexity notes.
✓ 75/75 Solutions Available
Python • JS • Java • C++
Practice Mode Active
20
Easy
48
Medium
7
Hard
0 / 75 solved
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Two Sum
#Array
#Hash Map | Easy | Solution | ||
| Best Time to Buy and Sell Stock
#Array
#Dynamic Programming | Easy | Solution | ||
| Contains Duplicate
#Array
#Hash Table
#Sorting | Easy | Solution | ||
| Product of Array Except Self
#Array
#Prefix Product | Medium | Solution | ||
| Maximum Subarray
#Array
#DP
#Divide and Conquer | Medium | Solution | ||
| Maximum Product Subarray
#Array
#Dynamic Programming | Medium | Solution | ||
| Find Minimum in Rotated Sorted Array
#Array
#Binary Search | Medium | Solution | ||
| Search in Rotated Sorted Array
#Array
#Binary Search | Medium | Solution | ||
| 3Sum
#Array
#Two Pointers
#Sorting | Medium | Solution | ||
| Container With Most Water
#Array
#Two Pointers
#Greedy | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Sum of Two Integers
#Math
#Bit Manipulation | Medium | Solution | ||
| Number of 1 Bits
#Divide and Conquer
#Bit Manipulation | Easy | Solution | ||
| Counting Bits
#DP
#Bit Manipulation | Easy | Solution | ||
| Missing Number
#Array
#Math
#Bit Manipulation | Easy | Solution | ||
| Reverse Bits
#Divide and Conquer
#Bit Manipulation | Easy | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Climbing Stairs
#DP
#Math
#Memoization | Easy | Solution | ||
| Coin Change
#Array
#DP
#BFS | Medium | Solution | ||
| Longest Increasing Subsequence
#Array
#DP
#Binary Search | Medium | Solution | ||
| Longest Common Subsequence
#String
#DP | Medium | Solution | ||
| Word Break
#String
#DP
#Hash Set | Medium | Solution | ||
| Combination Sum
#Array
#Backtracking | Medium | Solution | ||
| House Robber
#Array
#DP | Medium | Solution | ||
| House Robber II
#Array
#Dynamic Programming | Medium | Solution | ||
| Decode Ways
#String
#DP | Medium | Solution | ||
| Unique Paths
#Math
#DP
#Combinatorics | Medium | Solution | ||
| Jump Game
#Array
#Greedy
#DP | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Clone Graph
#Graph
#DFS
#BFS | Medium | Solution | ||
| Course Schedule
#Graph
#DFS
#BFS | Medium | Solution | ||
| Pacific Atlantic Water Flow
#Graph
#DFS
#BFS | Medium | Solution | ||
| Number of Islands
#Array
#DFS
#BFS | Medium | Solution | ||
| Longest Consecutive Sequence
#Array
#Hash Set | Medium | Solution | ||
| Alien Dictionary Premium
#Array
#String
#Graph | Hard | Solution | ||
| Graph Valid Tree Premium
#Depth-First Search
#Breadth-First Search
#Union Find | Medium | Solution | ||
| Number of Connected Components Premium
#Graph
#DFS
#Union Find | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Insert Interval
#Array | Medium | Solution | ||
| Merge Intervals
#Array
#Sorting | Medium | Solution | ||
| Non-overlapping Intervals
#Array
#Greedy
#Dynamic Programming | Medium | Solution | ||
| Meeting Rooms Premium
#Array
#Sorting | Easy | Solution | ||
| Meeting Rooms II Premium
#Array
#Greedy
#Sorting | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Reverse Linked List
#Linked List
#Recursion | Easy | Solution | ||
| Linked List Cycle
#Linked List
#Two Pointers
#Hash Table | Easy | Solution | ||
| Merge Two Sorted Lists
#Linked List
#Recursion | Easy | Solution | ||
| Merge K Sorted Lists
#Linked List
#Heap
#Divide and Conquer | Hard | Solution | ||
| Remove Nth Node From End of List
#Linked List
#Two Pointers | Medium | Solution | ||
| Reorder List
#Linked List
#Two Pointers
#Stack | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Set Matrix Zeroes
#Array
#Matrix | Medium | Solution | ||
| Spiral Matrix
#Array
#Matrix
#Simulation | Medium | Solution | ||
| Rotate Image
#Array
#Matrix
#Math | Medium | Solution | ||
| Word Search
#Array
#Matrix
#Backtracking | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Longest Substring Without Repeating Characters
#String
#Hash Map
#Sliding Window | Medium | Solution | ||
| Longest Repeating Character Replacement
#String
#Sliding Window | Medium | Solution | ||
| Minimum Window Substring
#String
#Hash Map
#Sliding Window | Hard | Solution | ||
| Valid Anagram
#String
#Hash Map
#Sorting | Easy | Solution | ||
| Group Anagrams
#String
#Hash Map
#Sorting | Medium | Solution | ||
| Valid Parentheses
#String
#Stack | Easy | Solution | ||
| Valid Palindrome
#String
#Two Pointers | Easy | Solution | ||
| Longest Palindromic Substring
#String
#Dynamic Programming | Medium | Solution | ||
| Palindromic Substrings
#String
#Dynamic Programming | Medium | Solution | ||
| Encode and Decode Strings Premium
#Array
#String
#Design | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Maximum Depth of Binary Tree
#Tree
#DFS
#BFS | Easy | Solution | ||
| Same Tree
#Tree
#Depth-First Search
#Breadth-First Search | Easy | Solution | ||
| Invert Binary Tree
#Tree
#DFS
#BFS | Easy | Solution | ||
| Binary Tree Maximum Path Sum
#Tree
#DFS
#DP | Hard | Solution | ||
| Binary Tree Level Order Traversal
#Tree
#BFS | Medium | Solution | ||
| Serialize and Deserialize Binary Tree
#Tree
#DFS
#BFS | Hard | Solution | ||
| Subtree of Another Tree
#Tree
#Depth-First Search
#String Matching | Easy | Solution | ||
| Construct Binary Tree from Preorder and Inorder
#Array
#Hash Table
#Divide and Conquer | Medium | Solution | ||
| Validate Binary Search Tree
#Tree
#DFS
#BST | Medium | Solution | ||
| Kth Smallest Element in a BST
#Tree
#DFS
#BST | Medium | Solution | ||
| Lowest Common Ancestor of a BST
#Tree
#DFS
#BST | Easy | Solution | ||
| Implement Trie (Prefix Tree)
#Design
#Trie | Medium | Solution | ||
| Design Add and Search Words Data Structure
#Design
#Trie
#DFS | Medium | Solution | ||
| Word Search II
#Array
#String
#Backtracking | Hard | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Top K Frequent Elements
#Array
#Hash Map
#Heap | Medium | Solution | ||
| Find Median From Data Stream
#Two Heaps
#Design
#Sorting | Hard | Solution |
Want more curated problems?
Check our Essential 75 (frequency-based), LeetCode interview questions by pattern, or browse 321+ 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.