Skip to content

InterviewExplainer

Dashboard Interview Q&A DSA Problems Mock Interview Pricing

Loading…

Interview prep that respects your time. Real questions, clear answers, structured paths.

Platform

Browse Domains
Dashboard
Mock InterviewsSoon
Search Questions
Prep by Topic
DSA Problems

Company

About
Support
Pricing

Legal

Privacy Policy
Terms of Service
Cookie Policy

© 2026 InterviewExplainer. Built for people who’d rather prep than guess.

Made with care, not clutter.

Home DSAStudy plansNeetCode 150 — Expanded Coding Interview Roadmap

Curated study plan

NeetCode 150 — Expanded Coding Interview Roadmap

Blind 75 + the 75 follow-ups you'll meet in real interviews.

Start first problem Jump to problem list

Curated by Navdeep Singh (NeetCode).Original source

106

Problems

10–14 weeks at ~2 problems per day

Duration

106/106

Solutions ready

Java · Py

Languages

Walkthroughs authored100%

Difficulty split

26Easy

72Medium

8Hard

About this plan

NeetCode 150 builds on Blind 75 by adding the second problem in each family — the one interviewers use as a follow-up once you solve the starter. If Blind 75 is 'can you survive a FAANG loop', NeetCode 150 is 'can you own the loop'.

Every problem has Java and Python solutions with line-by-line walkthroughs and an interview-voice script on InterviewExplainer. This ordering groups problems topically, closely matching NeetCode's roadmap layout.

Why this sheet

Worth your time because…

150 problems is the sweet spot between breadth and feasibility for a 3-month prep cycle.
Covers every follow-up interviewers ask once you solve the 'easy' version of a pattern.
Explicit pattern grouping teaches you to recognise the pattern before writing code.
Every problem on this list links to a full walkthrough with Java + Python — no paywall.

How to use it

Work through it like this

1Finish Blind 75 before starting this list — the overlap is intentional.
2Do each group end-to-end rather than jumping across topics.
3For the 'medium' problems, always attempt an O(n) solution first even when O(n log n) is fine — interviewers reward tighter bounds.
4Rehearse the interview-voice answer for each problem out loud before moving on.

The problem set

All 106 problems

1Arrays & Hashing

10 problems

01Contains Duplicateeasy 02Valid Anagrameasy 03Two Sumeasy 04Group Anagramsmedium 05Top K Frequent Elementsmedium 06Product of Array Except Selfmedium 07Valid Sudokumedium 08Encode and Decode Stringsmedium 09Longest Consecutive Sequencemedium 10First Unique Character in a Stringeasy

2Two Pointers

4 problems

11Valid Palindromeeasy 123Summedium 13Container With Most Watermedium 14Trapping Rain Waterhard

3Sliding Window

5 problems

15Best Time to Buy and Sell Stockeasy 16Longest Substring Without Repeating Charactersmedium 17Longest Repeating Character Replacementmedium 18Permutation in Stringmedium 19Minimum Window Substringhard

4Stack

5 problems

20Valid Parentheseseasy 21Min Stackmedium 22Evaluate Reverse Polish Notationmedium 23Generate Parenthesesmedium 24Daily Temperaturesmedium

5Binary Search

6 problems

25Binary Searcheasy 26Search a 2D Matrixmedium 27Koko Eating Bananasmedium 28Find Minimum in Rotated Sorted Arraymedium 29Search in Rotated Sorted Arraymedium 30Median of Two Sorted Arrayshard

6Linked List

7 problems

31Reverse Linked Listeasy 32Merge Two Sorted Listseasy 33Reorder Listmedium 34Remove Nth Node From End of Listmedium 35Copy List with Random Pointermedium 36Linked List Cycle Detectioneasy 37LRU Cachemedium

7Trees

13 problems

38Invert Binary Treeeasy 39Maximum Depth of Binary Treeeasy 40Balanced Binary Treeeasy 41Same Treeeasy 42Subtree of Another Treeeasy 43Lowest Common Ancestor of a BSTmedium 44Binary Tree Level Order Traversalmedium 45Binary Tree Right Side Viewmedium 46Validate Binary Search Treemedium 47Kth Smallest Element in a BSTmedium 48Construct Binary Tree from Preorder and Inorder Traversalmedium 49Binary Tree Maximum Path Sumhard 50Binary Tree Traversal (In/Pre/Post)easy

8Tries

4 problems

51Implement Trie (Prefix Tree)medium 52Design Add and Search Words Data Structuremedium 53Word Search IIhard 54Replace Wordsmedium

9Heap / Priority Queue

3 problems

55K Closest Points to Originmedium 56Task Schedulermedium 57Find Median from Data Streamhard

10Backtracking

7 problems

58Subsetsmedium 59Combination Summedium 60Permutationsmedium 61Word Searchmedium 62Palindrome Partitioningmedium 63Letter Combinations of a Phone Numbermedium 64N-Queenshard

11Graphs

8 problems

65Number of Islandsmedium 66Clone Graphmedium 67Pacific Atlantic Water Flowmedium 68Rotting Orangesmedium 69Course Schedule (Topological Sort)medium 70Number of Connected Components in an Undirected Graphmedium 71Graph Valid Treemedium 72Word Ladderhard

121-D Dynamic Programming

10 problems

73Climbing Stairseasy 74House Robbermedium 75House Robber IImedium 76Longest Palindromic Substringmedium 77Palindromic Substringsmedium 78Decode Waysmedium 79Coin Changemedium 80Maximum Product Subarraymedium 81Word Breakmedium 82Longest Increasing Subsequencemedium

132-D Dynamic Programming

2 problems

83Unique Pathsmedium 84Longest Common Subsequencemedium

14Greedy

6 problems

85Maximum Subarray (Kadane's)medium 86Jump Gamemedium 87Jump Game IImedium 88Gas Stationmedium 89Hand of Straightsmedium 90Merge Triplets to Form Target Tripletmedium

15Intervals

5 problems

91Insert Intervalmedium 92Merge Intervalsmedium 93Non-overlapping Intervalsmedium 94Meeting Roomseasy 95Meeting Rooms IImedium

16Math & Geometry

5 problems

96Rotate Imagemedium 97Spiral Matrixmedium 98Set Matrix Zeroesmedium 99Happy Numbereasy 100Plus Oneeasy

17Bit Manipulation

6 problems

101Single Numbereasy 102Number of 1 Bitseasy 103Counting Bitseasy 104Reverse Bitseasy 105Missing Numbereasy 106Sum of Two Integersmedium

Keep exploring

Other curated plans

hackerearth 150

Browse the whole DSA hub

All plans, modules & problems

Back to DSA hub