Curated List
Essential 75 — Highest-Frequency LeetCode Problems 2026
The 75 highest-frequency coding interview problems, curated from our full catalog and organized by pattern. If you only have time for one list, make it this one.
17
Easy
51
Medium
7
Hard
0 / 75 solved View full dashboard →
Sliding Window 2 problems
Two Pointers 8 problems
| Two Sum II - Input Array Is Sorted | Medium | ||
| 3Sum | Medium | ||
| Container With Most Water | Medium | ||
| Trapping Rain Water | Hard | ||
| Valid Palindrome | Easy | ||
| Remove Duplicates from Sorted Array | Easy | ||
| Sort Colors | Medium | ||
| Squares of a Sorted Array | Easy |
Binary Search 6 problems
| Binary Search | Easy | ||
| Search in Rotated Sorted Array | Medium | ||
| Find Minimum in Rotated Sorted Array | Medium | ||
| Search a 2D Matrix | Medium | ||
| Capacity to Ship Packages Within D Days | Medium | ||
| Median of Two Sorted Arrays | Hard |
Prefix Sum 2 problems
| Subarray Sum Equals K | Medium | ||
| Product of Array Except Self | Medium |
Hash Map / Set 7 problems
| Two Sum | Easy | ||
| Group Anagrams | Medium | ||
| Top K Frequent Elements | Medium | ||
| Valid Anagram | Easy | ||
| Longest Consecutive Sequence | Medium | ||
| Contains Duplicate | Easy | ||
| LRU Cache | Medium |
Stack 3 problems
| Valid Parentheses | Easy | ||
| Min Stack | Medium | ||
| Daily Temperatures | Medium |
Queue / BFS 4 problems
| Number of Islands | Medium | ||
| Rotting Oranges | Medium | ||
| Binary Tree Level Order Traversal | Medium | ||
| 01 Matrix | Medium |
Heap / Priority Queue 4 problems
| Kth Largest Element in an Array | Medium | ||
| Find Median from Data Stream | Hard | ||
| Merge K Sorted Lists | Hard | ||
| K Closest Points to Origin | Medium |
Linked List 6 problems
| Reverse Linked List | Easy | ||
| Linked List Cycle | Easy | ||
| Merge Two Sorted Lists | Easy | ||
| Add Two Numbers | Medium | ||
| Remove Nth Node From End of List | Medium | ||
| Copy List with Random Pointer | Medium |
Trees / DFS 5 problems
| Invert Binary Tree | Easy | ||
| Maximum Depth of Binary Tree | Easy | ||
| Validate Binary Search Tree | Medium | ||
| Lowest Common Ancestor of a BST | Medium | ||
| Binary Tree Maximum Path Sum | Hard |
Graphs 1 problems
| Clone Graph | Medium |
Dynamic Programming 9 problems
| Climbing Stairs | Easy | ||
| House Robber | Medium | ||
| Coin Change | Medium | ||
| Longest Increasing Subsequence | Medium | ||
| Longest Common Subsequence | Medium | ||
| Word Break | Medium | ||
| Unique Paths | Medium | ||
| Maximum Subarray | Medium | ||
| Decode Ways | Medium |
Greedy 2 problems
| Jump Game | Medium | ||
| Jump Game II | Medium |
Backtracking 4 problems
| Permutations | Medium | ||
| Subsets | Medium | ||
| Combination Sum | Medium | ||
| Word Search | Medium |
Trie 1 problems
| Implement Trie (Prefix Tree) | Medium |
Monotonic Stack 1 problems
Topological Sort 2 problems
| Course Schedule | Medium | ||
| Course Schedule II | Medium |
Bit Manipulation 3 problems
| Single Number | Easy | ||
| Missing Number | Easy | ||
| Counting Bits | Easy |
Intervals 2 problems
| Merge Intervals | Medium | ||
| Insert Interval | Medium |
Matrix 3 problems
| Rotate Image | Medium | ||
| Spiral Matrix | Medium | ||
| Set Matrix Zeroes | Medium |
Want more problems?
The full catalog has 206+ problems with pattern filters, difficulty filters, and company tags.
Essential 75 vs. Blind 75 — What's the difference?
Essential 75
- • Filtered by interview frequency from 200+ real problems
- • Organized by coding pattern (Sliding Window, Two Pointers…)
- • Teaches you to recognize pattern types on sight
- • Best for pattern-first learners and structured prep
Blind 75
- • Original list curated on Blind by an ex-Facebook engineer
- • Organized by data structure (Array, Graph, DP…)
- • The industry-standard reference — broadly cited in FAANG prep
- • Good complement once you've built your pattern intuition
Start here for a structured, pattern-based approach. Then cross-check your coverage against the Blind 75 to make sure you haven't missed anything.