The Gauntlet · Interview Prep

NeetCode 150

The essential 150 LeetCode problems, curated by NeetCode. Full Python solutions, hints, complexity analysis, and a live code editor for every single problem.

150Problems
18Categories
29Easy
92Medium
29Hard
How to use this: Pick a category. Each problem has a description, test cases, a Hint button, a Show Solution button, and a live Python editor (Let's Code) where you can write and run your solution right in the browser.
All 18 Categories
01 · 9 Problems
Arrays & Hashing
Hash maps, sets, counters — the building blocks of fast lookup and frequency problems.
Easy ×2Medium ×7
02 · 5 Problems
Two Pointers
Left/right pointers that move inward to eliminate the O(n²) brute force on sorted arrays.
Easy ×1Medium ×3Hard ×1
03 · 6 Problems
Sliding Window
Expand and contract a window over arrays or strings to find optimal sub-structures.
Easy ×1Medium ×3Hard ×2
04 · 7 Problems
Stack
LIFO order, monotonic stacks, and stack-based simulations for bracket and histogram problems.
Easy ×1Medium ×5Hard ×1
05 · 7 Problems
Binary Search
Apply binary search beyond sorted arrays — search on the answer for optimization problems.
Easy ×1Medium ×5Hard ×1
06 · 11 Problems
Linked List
Pointer manipulation, Floyd's cycle detection, dummy head nodes, and k-group reversals.
Easy ×3Medium ×6Hard ×2
07 · 15 Problems
Trees
DFS recursion, BFS level-order, BST properties, and path sum problems across binary trees.
Easy ×6Medium ×7Hard ×2
08 · 3 Problems
Tries
Prefix trees for word search, autocomplete, and wildcard matching with DFS.
Medium ×2Hard ×1
09 · 7 Problems
Heap / Priority Queue
Min/max heaps for top-K elements, streaming median, and efficient greedy merging.
Easy ×2Medium ×4Hard ×1
10 · 9 Problems
Backtracking
Explore all possibilities by choosing, recursing, and undoing. Prune early to keep it efficient.
Medium ×8Hard ×1
11 · 13 Problems
Graphs
DFS/BFS, Union-Find, topological sort — islands, components, and course scheduling.
Medium ×12Hard ×1
12 · 6 Problems
Advanced Graphs
Dijkstra, Bellman-Ford, Prim's MST, Hierholzer's Euler path, and alien dictionary.
Medium ×2Hard ×4
13 · 12 Problems
1D Dynamic Programming
Fibonacci, house robber, coin change, LIS — the classic 1D DP recurrences every engineer must know.
Easy ×3Medium ×9
14 · 11 Problems
2D Dynamic Programming
Grid paths, LCS, edit distance, interleaving strings, and the hardest DP patterns.
Medium ×7Hard ×4
15 · 8 Problems
Greedy
Make locally optimal choices. Kadane's, jump game, gas station, partition labels.
Medium ×8
16 · 6 Problems
Intervals
Merge, insert, sort by end time — the activity selection and sweep line patterns.
Easy ×1Medium ×4Hard ×1
17 · 8 Problems
Math & Geometry
Matrix rotation, spiral traversal, fast exponentiation, and cycle detection in number sequences.
Easy ×3Medium ×5
18 · 7 Problems
Bit Manipulation
XOR for cancel/toggle, AND for masking, shifts and counting bits — elegant O(1) tricks.
Easy ×5Medium ×2