Problem List

All LeetCode problems organized by pattern. Solve in priority order within each section.

Legend:

  • βœ… Must-do β€” foundational, appears in almost every interview loop
  • ⚑ High value β€” strong ROI, top-tier company favorite
  • πŸ“– Learning problem β€” builds intuition, less common in interviews

HashMap

# Problem Difficulty Frequency Priority
1 Two Sum Easy Very High βœ…
49 Group Anagrams Medium Very High βœ…
128 Longest Consecutive Sequence Medium Very High βœ…
217 Contains Duplicate Easy High βœ…
242 Valid Anagram Easy High βœ…
347 Top K Frequent Elements Medium Very High βœ…
560 Subarray Sum Equals K Medium High βœ…
383 Ransom Note Easy Medium ⚑
290 Word Pattern Easy Medium ⚑
454 4Sum II Medium Medium ⚑
525 Contiguous Array Medium Medium ⚑
974 Subarray Sums Divisible by K Medium Medium ⚑

Two Pointers

# Problem Difficulty Frequency Priority
125 Valid Palindrome Easy High βœ…
167 Two Sum II - Sorted Array Medium High βœ…
15 3Sum Medium Very High βœ…
11 Container With Most Water Medium Very High βœ…
42 Trapping Rain Water Hard Very High βœ…
18 4Sum Medium Medium ⚑
283 Move Zeroes Easy High βœ…
344 Reverse String Easy Medium ⚑
977 Squares of a Sorted Array Easy Medium ⚑
16 3Sum Closest Medium Medium ⚑

Sliding Window

# Problem Difficulty Frequency Priority
643 Maximum Average Subarray I Easy Medium βœ…
3 Longest Substring Without Repeating Characters Medium Very High βœ…
567 Permutation in String Medium High βœ…
76 Minimum Window Substring Hard Very High βœ…
239 Sliding Window Maximum Hard High βœ…
424 Longest Repeating Character Replacement Medium High βœ…
209 Minimum Size Subarray Sum Medium High ⚑
438 Find All Anagrams in a String Medium High ⚑
1004 Max Consecutive Ones III Medium Medium ⚑
1343 Number of Sub-arrays of Size K and Avg >= Threshold Medium Low πŸ“–

Stack

# Problem Difficulty Frequency Priority
20 Valid Parentheses Easy Very High βœ…
155 Min Stack Medium Very High βœ…
739 Daily Temperatures Medium Very High βœ…
853 Car Fleet Medium Medium ⚑
84 Largest Rectangle in Histogram Hard High βœ…
150 Evaluate Reverse Polish Notation Medium High βœ…
22 Generate Parentheses Medium High βœ…
496 Next Greater Element I Easy Medium ⚑
503 Next Greater Element II Medium Medium ⚑
85 Maximal Rectangle Hard Medium ⚑
901 Online Stock Span Medium Medium ⚑

Linked List

# Problem Difficulty Frequency Priority
206 Reverse Linked List Easy Very High βœ…
21 Merge Two Sorted Lists Easy Very High βœ…
141 Linked List Cycle Easy High βœ…
142 Linked List Cycle II Medium High βœ…
19 Remove Nth Node From End Medium High βœ…
143 Reorder List Medium High βœ…
23 Merge K Sorted Lists Hard Very High βœ…
160 Intersection of Two Linked Lists Easy High ⚑
234 Palindrome Linked List Easy Medium ⚑
92 Reverse Linked List II Medium Medium ⚑
138 Copy List with Random Pointer Medium High βœ…
25 Reverse Nodes in K-Group Hard Medium ⚑

Recursion / Divide & Conquer

# Problem Difficulty Frequency Priority
509 Fibonacci Number Easy Low πŸ“–
50 Pow(x, n) Medium High βœ…
215 Kth Largest Element in an Array Medium Very High βœ…
148 Sort List Medium High βœ…
23 Merge K Sorted Lists Hard Very High βœ…
240 Search a 2D Matrix II Medium Medium ⚑
315 Count of Smaller Numbers After Self Hard Medium ⚑
4 Median of Two Sorted Arrays Hard High ⚑

Tree DFS

# Problem Difficulty Frequency Priority
104 Maximum Depth of Binary Tree Easy Very High βœ…
226 Invert Binary Tree Easy Very High βœ…
543 Diameter of Binary Tree Easy Very High βœ…
110 Balanced Binary Tree Easy High βœ…
100 Same Tree Easy High βœ…
572 Subtree of Another Tree Easy High βœ…
112 Path Sum Easy High βœ…
113 Path Sum II Medium Medium ⚑
124 Binary Tree Maximum Path Sum Hard Very High βœ…
236 Lowest Common Ancestor of Binary Tree Medium Very High βœ…
105 Construct Tree from Preorder and Inorder Medium High βœ…
437 Path Sum III Medium High ⚑
297 Serialize and Deserialize Binary Tree Hard High ⚑

Tree BFS

# Problem Difficulty Frequency Priority
102 Binary Tree Level Order Traversal Medium Very High βœ…
199 Binary Tree Right Side View Medium Very High βœ…
1161 Maximum Level Sum of Binary Tree Medium Medium ⚑
103 Binary Tree Zigzag Level Order Medium High βœ…
116 Populating Next Right Pointers Medium Medium ⚑
111 Minimum Depth of Binary Tree Easy Medium ⚑
637 Average of Levels in Binary Tree Easy Medium ⚑
515 Find Largest Value in Each Tree Row Medium Low πŸ“–

BST

# Problem Difficulty Frequency Priority
700 Search in a BST Easy Medium βœ…
701 Insert into a BST Medium Medium βœ…
450 Delete Node in a BST Medium Medium ⚑
98 Validate Binary Search Tree Medium Very High βœ…
230 Kth Smallest Element in BST Medium High βœ…
235 Lowest Common Ancestor of BST Medium High βœ…
108 Convert Sorted Array to BST Easy Medium ⚑
173 BST Iterator Medium Medium ⚑
285 Inorder Successor in BST Medium Medium ⚑

Heap / Priority Queue

# Problem Difficulty Frequency Priority
703 Kth Largest Element in Stream Easy High βœ…
1046 Last Stone Weight Easy Medium ⚑
973 K Closest Points to Origin Medium Very High βœ…
215 Kth Largest Element in an Array Medium Very High βœ…
621 Task Scheduler Medium High βœ…
355 Design Twitter Medium Medium ⚑
295 Find Median from Data Stream Hard High βœ…
23 Merge K Sorted Lists Hard Very High βœ…
502 IPO Hard Low πŸ“–
632 Smallest Range Covering Elements from K Lists Hard Low πŸ“–

Graph BFS / DFS on Grids

# Problem Difficulty Frequency Priority
200 Number of Islands Medium Very High βœ…
695 Max Area of Island Medium High βœ…
994 Rotting Oranges Medium Very High βœ…
286 Walls and Gates Medium High βœ…
417 Pacific Atlantic Water Flow Medium High βœ…
130 Surrounded Regions Medium Medium ⚑
1020 Number of Enclaves Medium Medium ⚑
1091 Shortest Path in Binary Matrix Medium Medium ⚑
827 Making a Large Island Hard Medium ⚑
542 01 Matrix Medium High βœ…

Graph DFS

# Problem Difficulty Frequency Priority
133 Clone Graph Medium High βœ…
207 Course Schedule Medium Very High βœ…
323 Number of Connected Components Medium High βœ…
261 Graph Valid Tree Medium High βœ…
332 Reconstruct Itinerary Hard Medium ⚑
1376 Time Needed to Inform All Employees Medium Medium ⚑
399 Evaluate Division Medium Medium ⚑
802 Find Eventual Safe States Medium Medium ⚑

Greedy

# Problem Difficulty Frequency Priority
455 Assign Cookies Easy Medium βœ…
1710 Maximum Units on a Truck Easy Medium βœ…
55 Jump Game Medium Very High βœ…
45 Jump Game II Medium High βœ…
435 Non-overlapping Intervals Medium High βœ…
452 Minimum Number of Arrows to Burst Balloons Medium Medium ⚑
56 Merge Intervals Medium Very High βœ…
57 Insert Interval Medium High βœ…
134 Gas Station Medium High ⚑
763 Partition Labels Medium Medium ⚑
846 Hand of Straights Medium Medium ⚑

# Problem Difficulty Frequency Priority
704 Binary Search Easy High βœ…
374 Guess Number Higher or Lower Easy Medium βœ…
35 Search Insert Position Easy High βœ…
33 Search in Rotated Sorted Array Medium Very High βœ…
81 Search in Rotated Sorted Array II Medium Medium ⚑
153 Find Minimum in Rotated Sorted Array Medium Very High βœ…
74 Search a 2D Matrix Medium High βœ…
875 Koko Eating Bananas Medium High βœ…
1011 Capacity To Ship Packages Within D Days Medium High βœ…
410 Split Array Largest Sum Hard Medium ⚑
4 Median of Two Sorted Arrays Hard High ⚑
162 Find Peak Element Medium High ⚑
34 Find First and Last Position of Element Medium High βœ…

Backtracking

# Problem Difficulty Frequency Priority
78 Subsets Medium Very High βœ…
90 Subsets II Medium Medium ⚑
77 Combinations Medium High βœ…
46 Permutations Medium Very High βœ…
47 Permutations II Medium Medium ⚑
39 Combination Sum Medium Very High βœ…
40 Combination Sum II Medium Medium ⚑
216 Combination Sum III Medium Medium ⚑
131 Palindrome Partitioning Medium High βœ…
17 Letter Combinations of a Phone Number Medium High βœ…
79 Word Search Medium High βœ…
51 N-Queens Hard High βœ…
52 N-Queens II Hard Low πŸ“–
37 Sudoku Solver Hard Medium ⚑

Dynamic Programming β€” 1D

# Problem Difficulty Frequency Priority
70 Climbing Stairs Easy Very High βœ…
746 Min Cost Climbing Stairs Easy High βœ…
198 House Robber Medium Very High βœ…
213 House Robber II Medium High βœ…
322 Coin Change Medium Very High βœ…
518 Coin Change II Medium High βœ…
139 Word Break Medium Very High βœ…
300 Longest Increasing Subsequence Medium Very High βœ…
416 Partition Equal Subset Sum Medium High βœ…
91 Decode Ways Medium High βœ…
338 Counting Bits Easy Medium ⚑
152 Maximum Product Subarray Medium Very High βœ…
53 Maximum Subarray (Kadane’s) Medium Very High βœ…
377 Combination Sum IV Medium Medium ⚑

Dynamic Programming β€” 2D

# Problem Difficulty Frequency Priority
62 Unique Paths Medium High βœ…
63 Unique Paths II Medium Medium ⚑
64 Minimum Path Sum Medium High βœ…
1143 Longest Common Subsequence Medium Very High βœ…
72 Edit Distance Medium High βœ…
115 Distinct Subsequences Hard Medium ⚑
312 Burst Balloons Hard Medium ⚑
10 Regular Expression Matching Hard Medium ⚑
97 Interleaving String Medium Medium ⚑
309 Best Time to Buy and Sell Stock with Cooldown Medium Medium ⚑
123 Best Time to Buy and Sell Stock III Hard High ⚑
188 Best Time to Buy and Sell Stock IV Hard Medium πŸ“–

Trie

# Problem Difficulty Frequency Priority
208 Implement Trie Medium High βœ…
211 Design Add and Search Words Medium High βœ…
212 Word Search II Hard Medium ⚑
648 Replace Words Medium Low πŸ“–
421 Maximum XOR of Two Numbers in an Array Medium Low πŸ“–

Union Find

# Problem Difficulty Frequency Priority
547 Number of Provinces Medium High βœ…
684 Redundant Connection Medium High βœ…
128 Longest Consecutive Sequence Medium Very High βœ…
721 Accounts Merge Medium High βœ…
1584 Min Cost to Connect All Points Medium Medium ⚑
990 Satisfiability of Equality Equations Medium Medium ⚑
1319 Number of Operations to Make Network Connected Medium Medium ⚑
685 Redundant Connection II Hard Low πŸ“–

Topological Sort

# Problem Difficulty Frequency Priority
207 Course Schedule Medium Very High βœ…
210 Course Schedule II Medium Very High βœ…
269 Alien Dictionary Hard High βœ…
329 Longest Increasing Path in a Matrix Hard Medium ⚑
1203 Sort Items by Groups Respecting Dependencies Hard Low πŸ“–
310 Minimum Height Trees Medium Medium ⚑
444 Sequence Reconstruction Medium Low πŸ“–

Dijkstra’s Algorithm

# Problem Difficulty Frequency Priority
743 Network Delay Time Medium High βœ…
1631 Path With Minimum Effort Medium High βœ…
787 Cheapest Flights Within K Stops Medium High βœ…
1514 Path With Maximum Probability Medium Medium ⚑
778 Swim in Rising Water Hard Medium ⚑
1368 Minimum Cost to Make at Least One Valid Path Hard Low πŸ“–

Bellman-Ford

# Problem Difficulty Frequency Priority
787 Cheapest Flights Within K Stops Medium High βœ…
743 Network Delay Time Medium High ⚑
1334 Find City With Smallest Number of Neighbors Medium Medium ⚑

# Problem Difficulty Frequency Priority
1091 Shortest Path in Binary Matrix Medium Medium ⚑
505 The Maze II Medium Low πŸ“–
1263 Minimum Moves to Move a Box to Target Hard Low πŸ“–

Segment Tree

# Problem Difficulty Frequency Priority
307 Range Sum Query - Mutable Medium High βœ…
315 Count of Smaller Numbers After Self Hard Medium ⚑
493 Reverse Pairs Hard Low πŸ“–
218 The Skyline Problem Hard Medium ⚑
308 Range Sum Query 2D - Mutable Hard Low πŸ“–

Fenwick Tree / BIT

# Problem Difficulty Frequency Priority
307 Range Sum Query - Mutable Medium High βœ…
315 Count of Smaller Numbers After Self Hard Medium βœ…
493 Reverse Pairs Hard Low πŸ“–
327 Count of Range Sum Hard Low πŸ“–

AVL Trees / Balanced BST

# Problem Difficulty Frequency Priority
1382 Balance a Binary Search Tree Medium Low ⚑
315 Count of Smaller Numbers After Self Hard Medium ⚑
480 Sliding Window Median Hard Medium ⚑

Suffix Array

# Problem Difficulty Frequency Priority
1044 Longest Duplicate Substring Hard Low πŸ“–
1062 Longest Repeating Substring Medium Low πŸ“–
718 Maximum Length of Repeated Subarray Medium Medium ⚑

Miscellaneous β€” Must Know

These don’t fit neatly into one pattern but appear very frequently.

# Problem Pattern Difficulty Frequency Priority
121 Best Time to Buy and Sell Stock Array Easy Very High βœ…
238 Product of Array Except Self Array Medium Very High βœ…
271 Encode and Decode Strings String Medium High βœ…
371 Sum of Two Integers Bit Manipulation Medium High βœ…
191 Number of 1 Bits Bit Manipulation Easy High βœ…
268 Missing Number Bit Manipulation Easy High βœ…
146 LRU Cache Design Medium Very High βœ…
380 Insert Delete GetRandom O(1) Design Medium High βœ…
252 Meeting Rooms Intervals Easy High βœ…
253 Meeting Rooms II Intervals Medium Very High βœ