NeetCode 150 List: All 150 Problems with Visual Solutions
The NeetCode 150 is the Blind 75 plus 75 more problems, arranged as a roadmap of 18 patterns. Here is the full list in that order. Every one of the 150 links to a FaangPrep lesson that runs the solution step by step, so you can watch the pointers, the stack or the DP table change instead of reading code cold.
Short on time? Do the Blind 75 first: those 75 problems are marked B75 below. Each pattern heading links to the pattern page, which explains when the pattern applies before you start its problems. The patterns cheat sheet has a code template for each.
NeetCode is a separate site; this page only maps its public list to our lessons.
Arrays & Hashing (9)
Count, deduplicate or look up in O(1) instead of rescanning.
001
002
003
004
005
006
007
008
009
Two Pointers (5)
A sorted array or a string read from both ends.
010
011
012
013
014
Sliding Window (6)
The best contiguous run under a constraint.
015
016
017
018
019
020
Stack (7)
Matching pairs, or the next greater/smaller element.
021
022
023
024
025
026
027
Binary Search (7)
A sorted space, or a yes/no answer that flips once.
028
029
030
031
032
033
034
Linked List (11)
Pointer rewiring, fast/slow pointers, dummy heads.
035
036
037
038
039
040
041
042
043
044
045
Trees (15)
Recursion that returns something from each subtree.
046
047
048
049
050
051
052
Lowest Common Ancestor of a Binary Search Treevia the binary tree version (LeetCode 236), which also solves the BST case
053
054
055
056
057
058
059
060
Tries (3)
Many words sharing prefixes.
061
062
063
Heap / Priority Queue (7)
Repeatedly take the smallest or largest; top k.
064
065
066
067
068
069
070
Backtracking (9)
Generate every valid combination, undoing each choice.
071
072
073
074
075
076
077
078
079
Graphs (13)
Grids and networks: BFS for distance, DFS for reach.
080
081
082
Max Area of Islandvia Number of Islands: the same flood fill, counting cells instead of islands
083
084
085
086
087
088
089
090
091
092
Advanced Graphs (6)
Weighted shortest paths, MSTs, ordering.
093
094
095
096
097
098
1-D Dynamic Programming (12)
Best answer for a prefix, built from smaller prefixes.
099
100
101
102
103
104
105
106
107
108
109
110
2-D Dynamic Programming (11)
Two indexes: two strings, a grid, or item × capacity.
111
112
113
114
115
116
117
118
119
120
121
Greedy (8)
A local choice that provably never needs undoing.
122
Maximum SubarrayKadane's algorithm
123
124
125
126
127
128
129
Intervals (6)
Sort by start, then merge or count overlaps.
130
131
132
133
134
135
Math & Geometry (8)
Matrix walks and arithmetic edge cases.
136
137
138
139
140
141
142
143
Bit Manipulation (7)
XOR tricks, masks and counting bits.
144
145
146
147
148
149
150
NeetCode 150 questions, answered
What is the NeetCode 150?
A list of 150 LeetCode problems grouped into 18 patterns (arrays and hashing, two pointers, sliding window, stack, binary search, linked list, trees, tries, heaps, backtracking, graphs, advanced graphs, 1-D and 2-D DP, greedy, intervals, math and geometry, bit manipulation). It contains all of the Blind 75 plus 75 more problems that fill in the patterns the Blind 75 covers thinly.
NeetCode 150 vs Blind 75: which should I do?
If your interview is a few weeks away, do the Blind 75 first; every one of those problems is also in the NeetCode 150, so nothing is wasted. With more time, the extra 75 problems are worth it: they add more stack, binary search, heap, backtracking and graph practice, which is where most people are weakest.
How long does the NeetCode 150 take?
It depends on your starting point. As a rough guide, three to four problems a day, with review, is about six to eight weeks. Going pattern by pattern is faster than random order, because each problem reuses the idea from the one before it.
Is the NeetCode 150 enough for FAANG interviews?
It covers the core patterns that most coding rounds are built from, so it is a strong base. It is not company-specific and it does not include timed practice; once you can solve its problems without hints, practise new problems under a timer and explain your approach out loud.
How is Grind 75 different?
Grind 75 is a newer list by the author of the original Blind 75 post. It is 75 problems by default and can be resized and scheduled by week. The three lists overlap heavily; pick one and finish it rather than switching between them.