NeetCode 150

NeetCode 150 is the list most people mean when they say “the LeetCode list”. It extends Blind 75 with the coverage Blind 75 is thin on — greedy, advanced graphs, and a proper split between one- and two-dimensional DP — and every problem has a video solution, which is why it has largely displaced the original.

Use it if you already know what a hash map and a binary tree are, and you want interview coverage rather than a CS course. Do not use it as your first exposure to data structures; Striver’s A2Z is the better start there.

The categories map almost one-to-one onto this course’s phases, so you can work the sheet and read the matching pattern page side by side.

Track it here

Your progress is shared with every other list on this site — tick a problem off here and it is ticked off on its pattern page and in every other sheet that includes it. That is the point of tracking them in one place.

NeetCode 150

by NeetCode · original sheet

150 problems

The de-facto default. Extends Blind 75 with deeper coverage of greedy, advanced graphs and 2-D DP, and every problem has a video walkthrough.

150 problems

27 easy102 medium21 hard

AllEasyMediumHard

Unsolved onlyExportImportReset

▾Arrays & Hashing · 99

• ○217Contains Duplicateeasyamazonapplemicrosoft
• ○242Valid Anagrameasyamazonmetabloomberg
• ○1Two Sumeasyamazongooglemetamicrosoftapplebloomberg
• ○49Group Anagramsmediumamazonmetauberbloomberg
• ○347Top K Frequent Elementsmediumamazonmetauberbytedance
• ○238Product of Array Except Selfmediumamazonmetamicrosoftapple
• ○36Valid Sudokumedium
• ○271Encode and Decode Stringspremiummedium
• ○128Longest Consecutive Sequencemedium

▾Two Pointers · 55

• ○125Valid Palindromeeasy
• ○167Two Sum II - Input Array Is Sortedmedium
• ○153Summediumamazonmetamicrosoftapplebloomberg
• ○11Container With Most Watermediumamazonmetabloomberg
• ○42Trapping Rain Waterhardamazongooglemetabloomberg

▾Sliding Window · 66

• ○121Best Time to Buy and Sell Stockeasyamazonmetamicrosoftbloomberg
• ○3Longest Substring Without Repeating Charactersmediumamazongooglemetamicrosoftbloomberg
• ○424Longest Repeating Character Replacementmedium
• ○567Permutation in Stringmedium
• ○76Minimum Window Substringhardmetaamazongoogleuber
• ○239Sliding Window Maximumhardamazongooglebytedance

▾Stack · 77

• ○20Valid Parentheseseasyamazongooglemetamicrosoftbloomberg
• ○155Min Stackmedium
• ○150Evaluate Reverse Polish Notationmedium
• ○22Generate Parenthesesmedium
• ○739Daily Temperaturesmediumamazonmetabloomberg
• ○853Car Fleetmedium
• ○84Largest Rectangle in Histogramhardgoogleamazonbytedance

▾Binary Search · 77

• ○704Binary Searcheasy
• ○74Search a 2D Matrixmedium
• ○875Koko Eating Bananasmediumgoogleamazonbytedance
• ○153Find Minimum in Rotated Sorted Arraymedium
• ○33Search in Rotated Sorted Arraymediumamazonmetamicrosoftbloomberg
• ○981Time Based Key-Value Storemedium
• ○4Median of Two Sorted Arrayshardgoogleamazonmicrosoftbytedance

▾Linked List · 1111

• ○206Reverse Linked Listeasyamazonmicrosoftapplebloombergmeta
• ○21Merge Two Sorted Listseasyamazonmicrosoftapplebloomberg
• ○141Linked List Cycleeasyamazonmicrosoftbloomberg
• ○143Reorder Listmediumamazonmetabloomberg
• ○19Remove Nth Node From End of Listmedium
• ○138Copy List with Random Pointermediumamazonmicrosoftbloombergapple
• ○2Add Two Numbersmedium
• ○287Find the Duplicate Numbermedium
• ○146LRU Cachemediumamazonmicrosoftbloomberggoogleuber
• ○23Merge k Sorted Listshard
• ○25Reverse Nodes in k-Grouphard

▾Trees · 1515

• ○226Invert Binary Treemedium
• ○104Maximum Depth of Binary Treeeasy
• ○543Diameter of Binary Treeeasy
• ○110Balanced Binary Treeeasy
• ○100Same Treeeasy
• ○572Subtree of Another Treeeasy
• ○235Lowest Common Ancestor of a Binary Search Treemedium
• ○102Binary Tree Level Order Traversalmediumamazonmetamicrosoftbytedance
• ○199Binary Tree Right Side Viewmedium
• ○1448Count Good Nodes in Binary Treemedium
• ○98Validate Binary Search Treemedium
• ○230Kth Smallest Element in a BSTmedium
• ○105Construct Binary Tree from Preorder and Inorder Traversalmedium
• ○124Binary Tree Maximum Path Sumhard
• ○297Serialize and Deserialize Binary Treehardmetaamazongooglebloomberg

▾Tries · 33

• ○208Implement Trie (Prefix Tree)mediumgoogleamazonbloomberg
• ○211Design Add and Search Words Data Structuremedium
• ○212Word Search IIhardgoogleamazonbytedance

▾Heap / Priority Queue · 77

• ○703Kth Largest Element in a Streameasy
• ○1046Last Stone Weighteasy
• ○973K Closest Points to Originmedium
• ○215Kth Largest Element in an Arraymedium
• ○621Task Schedulermediummetaamazonuber
• ○355Design Twittermedium
• ○295Find Median from Data Streamhardamazongooglemetabloomberg

▾Backtracking · 99

• ○78Subsetsmedium
• ○39Combination Summedium
• ○40Combination Sum IImedium
• ○46Permutationsmedium
• ○90Subsets IImedium
• ○79Word Searchmedium
• ○131Palindrome Partitioningmedium
• ○17Letter Combinations of a Phone Numbermedium
• ○51N-Queenshard

▾Graphs · 1313

• ○200Number of Islandsmediumamazongooglemetamicrosoftbytedance
• ○695Max Area of Islandmedium
• ○133Clone Graphmediummetagoogleamazon
• ○286Walls and Gatespremiummedium
• ○994Rotting Orangesmediumamazonmicrosoftbytedance
• ○417Pacific Atlantic Water Flowmedium
• ○130Surrounded Regionsmedium
• ○207Course Schedulemediumgoogleamazonmetabytedance
• ○210Course Schedule IImedium
• ○261Graph Valid Treepremiummedium
• ○323Number of Connected Components in an Undirected Graphpremiummedium
• ○684Redundant Connectionmedium
• ○127Word Ladderhardamazongooglebytedance

▾Advanced Graphs · 66

• ○332Reconstruct Itineraryhard
• ○1584Min Cost to Connect All Pointsmediumamazonuber
• ○743Network Delay Timemediumgoogleuberamazon
• ○778Swim in Rising Waterhard
• ○269Alien Dictionarypremiumhardgooglemetaamazon
• ○787Cheapest Flights Within K Stopsmediumgoogleuberamazon

▾1-D Dynamic Programming · 1212

• ○70Climbing Stairseasy
• ○746Min Cost Climbing Stairseasy
• ○198House Robbermedium
• ○213House Robber IImedium
• ○5Longest Palindromic Substringmedium
• ○647Palindromic Substringsmedium
• ○91Decode Waysmedium
• ○322Coin Changemediumamazongooglemicrosoftbytedance
• ○152Maximum Product Subarraymedium
• ○139Word Breakmediumgoogleamazonmetabytedance
• ○300Longest Increasing Subsequencemediumgooglemicrosoftbytedanceuber
• ○416Partition Equal Subset Summedium

▾2-D Dynamic Programming · 1111

• ○62Unique Pathsmedium
• ○1143Longest Common Subsequencemediumgoogleamazonmicrosoft
• ○309Best Time to Buy and Sell Stock with Cooldownmedium
• ○518Coin Change IImedium
• ○494Target Summedium
• ○97Interleaving Stringmedium
• ○329Longest Increasing Path in a Matrixhard
• ○115Distinct Subsequenceshard
• ○72Edit Distancemediumgoogleamazonmicrosoftbytedance
• ○312Burst Balloonshard
• ○10Regular Expression Matchinghard

▾Greedy · 88

• ○53Maximum Subarraymediumamazonmicrosoftbloombergapple
• ○55Jump Gamemedium
• ○45Jump Game IImedium
• ○134Gas Stationmedium
• ○846Hand of Straightsmedium
• ○1899Merge Triplets to Form Target Tripletmedium
• ○763Partition Labelsmedium
• ○678Valid Parenthesis Stringmedium

▾Intervals · 66

• ○57Insert Intervalmedium
• ○56Merge Intervalsmediumgooglemetaamazonuberbloomberg
• ○435Non-overlapping Intervalsmedium
• ○252Meeting Roomspremiumeasy
• ○253Meeting Rooms IIpremiummedium
• ○1851Minimum Interval to Include Each Queryhard

▾Math & Geometry · 88

• ○48Rotate Imagemedium
• ○54Spiral Matrixmedium
• ○73Set Matrix Zeroesmedium
• ○202Happy Numbereasy
• ○66Plus Oneeasy
• ○50Pow(x, n)medium
• ○43Multiply Stringsmedium
• ○2013Detect Squaresmedium

▾Bit Manipulation · 77

• ○136Single Numbereasy
• ○191Number of 1 Bitseasy
• ○338Counting Bitseasy
• ○190Reverse Bitseasy
• ○268Missing Numbereasy
• ○371Sum of Two Integersmedium
• ○7Reverse Integermedium

Before you start this sheet

Do the consensus problems first. They are the problems every sheet author independently agreed on, so they are the highest-value problems available regardless of which sheet you eventually commit to.