Skip to content

Latest commit

 

History

History
251 lines (210 loc) · 22 KB

File metadata and controls

251 lines (210 loc) · 22 KB

NeetCode 150 — The Gold Standard

The Blind 75 grown up. NeetCode doubled the list, kept the signal, and organized it by pattern so you're actually learning techniques — not just solving random problems. This is the go-to for FAANG prep.

1. Arrays & Hashing (9 problems)

# Difficulty Problem LeetCode Solution
217 Easy Contains Duplicate Link Solution
242 Easy Valid Anagram Link Solution
1 Easy Two Sum Link Solution
49 Medium Group Anagrams Link Solution
347 Medium Top K Frequent Elements Link Solution
238 Medium Product of Array Except Self Link Solution
36 Medium Valid Sudoku Link Solution
271 Medium Encode and Decode Strings Link Solution
128 Medium Longest Consecutive Sequence Link Solution

2. Two Pointers (5 problems)

# Difficulty Problem LeetCode Solution
125 Easy Valid Palindrome Link Solution
167 Medium Two Sum II Link Solution
15 Medium 3Sum Link Solution
11 Medium Container With Most Water Link Solution
42 Hard Trapping Rain Water Link Solution

3. Sliding Window (6 problems)

# Difficulty Problem LeetCode Solution
121 Easy Best Time to Buy and Sell Stock Link Solution
3 Medium Longest Substring Without Repeating Characters Link Solution
424 Medium Longest Repeating Character Replacement Link Solution
567 Medium Permutation in String Link Solution
76 Hard Minimum Window Substring Link Solution
239 Hard Sliding Window Maximum Link Solution

4. Stack (7 problems)

# Difficulty Problem LeetCode Solution
20 Easy Valid Parentheses Link Solution
155 Medium Min Stack Link Solution
150 Medium Evaluate Reverse Polish Notation Link Solution
22 Medium Generate Parentheses Link Solution
739 Medium Daily Temperatures Link Solution
853 Medium Car Fleet Link Solution
84 Hard Largest Rectangle in Histogram Link Solution

5. Binary Search (7 problems)

# Difficulty Problem LeetCode Solution
704 Easy Binary Search Link Solution
74 Medium Search a 2D Matrix Link Solution
875 Medium Koko Eating Bananas Link Solution
153 Medium Find Minimum in Rotated Sorted Array Link Solution
33 Medium Search in Rotated Sorted Array Link Solution
981 Medium Time Based Key-Value Store Link Solution
4 Hard Median of Two Sorted Arrays Link Solution

6. Linked List (11 problems)

# Difficulty Problem LeetCode Solution
206 Easy Reverse Linked List Link Solution
21 Easy Merge Two Sorted Lists Link Solution
143 Medium Reorder List Link Solution
19 Medium Remove Nth Node From End of List Link Solution
138 Medium Copy List with Random Pointer Link Solution
2 Medium Add Two Numbers Link Solution
141 Easy Linked List Cycle Link Solution
287 Medium Find the Duplicate Number Link Solution
146 Medium LRU Cache Link Solution
23 Hard Merge k Sorted Lists Link Solution
25 Hard Reverse Nodes in k-Group Link Solution

7. Trees (15 problems)

# Difficulty Problem LeetCode Solution
226 Easy Invert Binary Tree Link Solution
104 Easy Maximum Depth of Binary Tree Link Solution
543 Easy Diameter of Binary Tree Link Solution
110 Easy Balanced Binary Tree Link Solution
100 Easy Same Tree Link Solution
572 Easy Subtree of Another Tree Link Solution
235 Medium Lowest Common Ancestor of a Binary Search Tree Link Solution
102 Medium Binary Tree Level Order Traversal Link Solution
199 Medium Binary Tree Right Side View Link Solution
1448 Medium Count Good Nodes in Binary Tree Link Solution
98 Medium Validate Binary Search Tree Link Solution
230 Medium Kth Smallest Element in a BST Link -
105 Medium Construct Binary Tree from Preorder and Inorder Traversal Link -
124 Hard Binary Tree Maximum Path Sum Link -
297 Hard Serialize and Deserialize Binary Tree Link -

8. Tries (3 problems)

# Difficulty Problem LeetCode Solution
208 Medium Implement Trie (Prefix Tree) Link Solution
211 Medium Design Add and Search Words Data Structure Link Solution
212 Hard Word Search II Link -

9. Heap / Priority Queue (7 problems)

# Difficulty Problem LeetCode Solution
703 Easy Kth Largest Element in a Stream Link Solution
1046 Easy Last Stone Weight Link Solution
973 Medium K Closest Points to Origin Link -
215 Medium Kth Largest Element in an Array Link Solution
621 Medium Task Scheduler Link Solution
355 Medium Design Twitter Link -
295 Hard Find Median from Data Stream Link Solution

10. Backtracking (9 problems)

# Difficulty Problem LeetCode Solution
78 Medium Subsets Link Solution
39 Medium Combination Sum Link Solution
46 Medium Permutations Link Solution
90 Medium Subsets II Link Solution
40 Medium Combination Sum II Link -
79 Medium Word Search Link -
131 Medium Palindrome Partitioning Link -
17 Medium Letter Combinations of a Phone Number Link -
51 Hard N-Queens Link -

11. Graphs (13 problems)

# Difficulty Problem LeetCode Solution
200 Medium Number of Islands Link Solution
133 Medium Clone Graph Link Solution
695 Medium Max Area of Island Link -
417 Medium Pacific Atlantic Water Flow Link -
130 Medium Surrounded Regions Link -
994 Medium Rotting Oranges Link -
286 Medium Walls and Gates Link -
207 Medium Course Schedule Link Solution
210 Medium Course Schedule II Link -
684 Medium Redundant Connection Link -
323 Medium Number of Connected Components in an Undirected Graph Link Solution
261 Medium Graph Valid Tree Link -
127 Hard Word Ladder Link -

12. Advanced Graphs (6 problems)

# Difficulty Problem LeetCode Solution
332 Hard Reconstruct Itinerary Link -
1584 Medium Min Cost to Connect All Points Link -
743 Medium Network Delay Time Link -
778 Hard Swim in Rising Water Link -
269 Hard Alien Dictionary Link -
787 Medium Cheapest Flights Within K Stops Link -

13. 1-D Dynamic Programming (12 problems)

# Difficulty Problem LeetCode Solution
70 Easy Climbing Stairs Link Solution
746 Easy Min Cost Climbing Stairs Link Solution
198 Medium House Robber Link Solution
213 Medium House Robber II Link Solution
5 Medium Longest Palindromic Substring Link Solution
647 Medium Palindromic Substrings Link Solution
91 Medium Decode Ways Link Solution
322 Medium Coin Change Link Solution
152 Medium Maximum Product Subarray Link -
139 Medium Word Break Link -
300 Medium Longest Increasing Subsequence Link -
416 Medium Partition Equal Subset Sum Link -

14. 2-D Dynamic Programming (11 problems)

# Difficulty Problem LeetCode Solution
62 Medium Unique Paths Link Solution
1143 Medium Longest Common Subsequence Link Solution
309 Medium Best Time to Buy and Sell Stock with Cooldown Link -
518 Medium Coin Change II Link -
494 Medium Target Sum Link -
97 Medium Interleaving String Link -
329 Hard Longest Increasing Path in a Matrix Link -
115 Hard Distinct Subsequences Link -
72 Hard Edit Distance Link -
312 Hard Burst Balloons Link -
10 Hard Regular Expression Matching Link -

15. Greedy (8 problems)

# Difficulty Problem LeetCode Solution
53 Medium Maximum Subarray Link Solution
55 Medium Jump Game Link -
45 Medium Jump Game II Link -
134 Medium Gas Station Link -
846 Medium Hand of Straights Link -
1899 Medium Merge Triplets to Form Target Triplet Link -
763 Medium Partition Labels Link -
678 Medium Valid Parenthesis String Link -

16. Intervals (6 problems)

# Difficulty Problem LeetCode Solution
57 Medium Insert Interval Link -
56 Medium Merge Intervals Link Solution
435 Medium Non-overlapping Intervals Link -
252 Easy Meeting Rooms Link -
253 Medium Meeting Rooms II Link -
1851 Hard Minimum Interval to Include Each Query Link -

17. Math & Geometry (8 problems)

# Difficulty Problem LeetCode Solution
48 Medium Rotate Image Link Solution
54 Medium Spiral Matrix Link -
73 Medium Set Matrix Zeroes Link -
202 Easy Happy Number Link Solution
66 Easy Plus One Link Solution
50 Medium Pow(x, n) Link Solution
43 Medium Multiply Strings Link -
2013 Medium Detect Squares Link -

18. Bit Manipulation (7 problems)

# Difficulty Problem LeetCode Solution
136 Easy Single Number Link Solution
191 Easy Number of 1 Bits Link Solution
338 Easy Counting Bits Link Solution
190 Easy Reverse Bits Link Solution
268 Easy Missing Number Link Solution
371 Medium Sum of Two Integers Link -
7 Medium Reverse Integer Link -

Summary

Total: 150 problems

18 categories, easy-to-hard within each one. The ordering matters — don't skip ahead. Finish a section before moving on, and you'll find later sections click faster because the foundations are there.