Skip to main content

Problem list

NeetCode 150

NeetCode 150 was created by NeetCode (a popular YouTube channel) as an expanded version of Blind 75. It includes additional problems for better pattern coverage and is organized by difficulty within each pattern. Many consider it the definitive interview prep list.

Recommended schedule

6 blocks
  1. 01Weeks 1-2Arrays, Two Pointers, Sliding Window20 problems
  2. 02Weeks 3-4Stack, Binary Search, Linked List25 problems
  3. 03Weeks 5-6Trees, Tries18 problems
  4. 04Weeks 7-8Heap, Backtracking, Graphs29 problems
  5. 05Weeks 9-10Dynamic Programming23 problems
  6. 06Weeks 11-12Greedy, Intervals, Math, Bit Manipulation29 problems

Problems by pattern

17 patterns
  • Arrays & Hashing

    9 problems

    Contains Duplicate · Valid Anagram · Two Sum · Group Anagrams · Top K Frequent Elements · Product of Array Except Self · Valid Sudoku · Encode and Decode Strings · +1 more

  • Two Pointers

    5 problems

    Valid Palindrome · Two Sum II · 3Sum · Container With Most Water · Trapping Rain Water

  • Sliding Window

    6 problems

    Best Time to Buy and Sell Stock · Longest Substring Without Repeating Characters · Longest Repeating Character Replacement · Permutation in String · Minimum Window Substring · Sliding Window Maximum

  • Stack

    7 problems

    Valid Parentheses · Min Stack · Evaluate Reverse Polish Notation · Generate Parentheses · Daily Temperatures · Car Fleet · Largest Rectangle in Histogram

  • Binary Search

    7 problems

    Binary Search · Search a 2D Matrix · Koko Eating Bananas · Find Minimum in Rotated Sorted Array · Search in Rotated Sorted Array · Time Based Key-Value Store · Median of Two Sorted Arrays

  • Linked List

    11 problems

    Reverse Linked List · Merge Two Sorted Lists · Reorder List · Remove Nth Node From End · Copy List with Random Pointer · Add Two Numbers · Linked List Cycle · Find the Duplicate Number · +3 more

  • Trees

    15 problems

    Invert Binary Tree · Maximum Depth · Diameter of Binary Tree · Balanced Binary Tree · Same Tree · Subtree of Another Tree · LCA of BST · Level Order Traversal · +7 more

  • Tries

    3 problems

    Implement Trie · Design Add and Search Words · Word Search II

  • Heap / Priority Queue

    7 problems

    Kth Largest Element in Stream · Last Stone Weight · K Closest Points · Kth Largest Element in Array · Task Scheduler · Design Twitter · Find Median from Data Stream

  • Backtracking

    9 problems

    Subsets · Combination Sum · Permutations · Subsets II · Combination Sum II · Word Search · Palindrome Partitioning · Letter Combinations · +1 more

  • Graphs

    13 problems

    Number of Islands · Clone Graph · Max Area of Island · Pacific Atlantic · Surrounded Regions · Rotting Oranges · Walls and Gates · Course Schedule · +5 more

  • 1-D Dynamic Programming

    12 problems

    Climbing Stairs · Min Cost Climbing Stairs · House Robber · House Robber II · Longest Palindromic Substring · Palindromic Substrings · Decode Ways · Coin Change · +4 more

  • 2-D Dynamic Programming

    11 problems

    Unique Paths · Longest Common Subsequence · Best Time to Buy/Sell Stock with Cooldown · Coin Change II · Target Sum · Interleaving String · Longest Increasing Path in Matrix · Distinct Subsequences · +3 more

  • Greedy

    8 problems

    Maximum Subarray · Jump Game · Jump Game II · Gas Station · Hand of Straights · Merge Triplets · Partition Labels · Valid Parenthesis String

  • Intervals

    6 problems

    Insert Interval · Merge Intervals · Non-overlapping Intervals · Meeting Rooms · Meeting Rooms II · Minimum Interval to Include Each Query

  • Math & Geometry

    8 problems

    Rotate Image · Spiral Matrix · Set Matrix Zeroes · Happy Number · Plus One · Pow(x, n) · Multiply Strings · Detect Squares

  • Bit Manipulation

    7 problems

    Single Number · Number of 1 Bits · Counting Bits · Reverse Bits · Missing Number · Sum of Two Integers · Reverse Integer

Study tips

5
  • Start with Blind 75 problems first (they're marked)
  • Watch NeetCode explanations for problems you struggle with
  • Aim for 2-3 problems per day for sustainable progress
  • Do weekly reviews of problems from earlier weeks
  • Track which patterns you're weakest in and focus there