NeetCode 150: Complete Problem List

The NeetCode 150 is a curated list of 150 LeetCode problems organized by the NeetCode Roadmap. It expands on the original Blind 75 by adding deeper coverage across 18 topics, including categories like greedy algorithms, advanced graphs, and 2D dynamic programming that the Blind 75 barely touches.

This list is for candidates who have 2-3 months to prepare and want comprehensive pattern coverage. Most developers complete it in 6-8 weeks at 10 hours per week. While the Blind 75 gives you one or two examples per pattern, the NeetCode 150 gives you enough repetition within each topic to build real fluency. By the time you finish the graph section, for example, you will have solved 19 graph problems covering BFS, DFS, topological sort, union-find, Dijkstra, and more. For an honest review of what the list covers and where it falls short, see Is NeetCode 150 Good?

The problems are sequenced within each category from easier to harder. The roadmap also suggests an order between categories: start with arrays, then two pointers, then sliding window, and build up to graphs and dynamic programming. This progression ensures you have the prerequisites for each new topic.

1. Follow the roadmap order. The categories are sequenced intentionally. Arrays before two pointers before sliding window. Trees before tries. Graphs before advanced graphs. Each section builds on patterns from previous ones.

2. Do not skip Easy problems. The Easy problems in each category establish the foundational pattern. Skipping them and jumping to Medium problems is why many people get stuck. The Easy problems are quick wins that build confidence and pattern vocabulary.

3. Review the NeetCode video explanations. Each problem has a video walkthrough on NeetCode that explains the intuition, not just the code. Understanding why a solution works is more valuable than memorizing the implementation.

4. Start mock interviews early. After completing 50-60 problems, start practicing under interview conditions. An AI-powered mock interview gives you real-time feedback on your problem-solving approach, communication, and code quality — the things that matter beyond just getting the right answer.

Blind 75 is the original curated list. 75 problems organized by topic. It covers all essential patterns but has only 1-2 problems per sub-topic. Best for tight timelines under 6 weeks.

Grind 75 is the Blind 75 successor with better ordering and time estimates. Same 75-problem scope, but optimized for time-boxed preparation. Best for people who know exactly how many hours per week they can commit.

NeetCode 150 (this page) is the comprehensive option. 150 problems across 18 categories, with enough depth in each to build real pattern fluency. Includes everything important from Blind 75 plus categories it misses entirely (greedy, advanced graphs, 2D DP). Best if you have 2-3 months.

Not sure which to pick? Read our Blind 75 vs NeetCode 150 comparison or NeetCode 150 vs Grind 75 comparison for full problem-by-problem breakdowns. Already done the list? See what to do after NeetCode 150. Or check which problems your target company actually asks on our company interview questions page.

The NeetCode 150 list contains 28 Easy, 97 Medium, and 25 Hard problems. The recommended order follows the NeetCode Roadmap: start with Arrays and Hashing (9 problems), then Two Pointers (5), Sliding Window (6), Stack (7), Binary Search (7), Linked List (11), Trees (15), Tries (3), Heap / Priority Queue (7), Backtracking (9), Graphs (19), Dynamic Programming (23), Greedy (8), Intervals (6), Math and Geometry (8), and Bit Manipulation (7).

Within each category, problems are ordered from easier to harder. The first problem in each section teaches the core pattern, and later problems add constraints or combine patterns. For example, the Trees section starts with Invert Binary Tree (Easy) and builds up to Binary Tree Maximum Path Sum (Hard). By the time you reach the hard problems, you have seen the pattern enough times that the jump feels manageable.

If you are short on time, filter to Easy and Medium problems only. That gives you 125 problems covering every pattern. The 25 Hard problems add depth but are not required for most interviews outside of Google and quantitative trading firms.

We analyzed 1,500+ real interview questions across FAANG companies and mapped them against the NeetCode 150 problems. The coverage varies by company:

• Amazon: ~39% of reported questions map directly to NeetCode 150 patterns
• Meta: ~35% coverage, heavy on trees and graphs
• Google: ~29% coverage, more emphasis on advanced graph and DP problems
• Microsoft: ~33% coverage, strong overlap with arrays and linked lists
• Apple: ~31% coverage, balanced across categories

The NeetCode 150 does not cover every possible interview question, but it covers every important pattern. Once you recognize the underlying pattern, solving a new variation of a problem you have already practiced is significantly faster. For a full company-by-company breakdown, read Is NeetCode 150 Enough? or browse company-specific interview questions.