Curated Lists

Blind 75 & NeetCode 150

The most referenced problem lists in the industry. Track your progress through either list independently. Problems sync with your main roadmap progress.

Blind 75 progress0/76 (0%)
0/19
Easy
0/48
Medium
0/9
Hard
76 problems
Arrays & Hashing0/11
Two SumEasysolutionLC ↗
Contains DuplicateEasyLC ↗
Product of Array Except SelfMediumsolutionLC ↗
Longest Consecutive SequenceHardsolutionLC ↗
Set Matrix ZeroesMediumLC ↗
Spiral MatrixMediumLC ↗
Rotate ImageMediumLC ↗
Valid AnagramEasyLC ↗
Group AnagramsMediumsolutionLC ↗
Encode and Decode StringsMediumsolutionLC ↗
Top K Frequent ElementsMediumsolutionLC ↗
Sliding Window0/4
Best Time to Buy and Sell StockEasyLC ↗
Longest Substring Without Repeating CharactersMediumsolutionLC ↗
Longest Repeating Character ReplacementMediumLC ↗
Minimum Window SubstringHardsolutionLC ↗
Dynamic Programming0/13
Maximum SubarrayMediumsolutionLC ↗
Maximum Product SubarrayMediumLC ↗
Climbing StairsEasysolutionLC ↗
Coin ChangeMediumsolutionLC ↗
Longest Increasing SubsequenceMediumLC ↗
Longest Common SubsequenceMediumsolutionLC ↗
Word BreakMediumsolutionLC ↗
House RobberMediumLC ↗
House Robber IIMediumLC ↗
Decode WaysMediumLC ↗
Unique PathsMediumLC ↗
Longest Palindromic SubstringMediumLC ↗
Palindromic SubstringsMediumLC ↗
Binary Search0/2
Find Minimum in Rotated Sorted ArrayMediumsolutionLC ↗
Search in Rotated Sorted ArrayMediumsolutionLC ↗
Two Pointers0/3
3SumMediumsolutionLC ↗
Container With Most WaterMediumsolutionLC ↗
Valid PalindromeEasyLC ↗
Bit Manipulation0/5
Sum of Two IntegersMediumLC ↗
Number of 1 BitsEasyLC ↗
Counting BitsEasyLC ↗
Missing NumberEasyLC ↗
Reverse BitsEasyLC ↗
Backtracking0/3
Combination SumMediumLC ↗
Word SearchMediumLC ↗
Word Search IIHardLC ↗
Greedy0/1
Jump GameMediumLC ↗
Graphs (DFS / BFS)0/6
Clone GraphMediumLC ↗
Course ScheduleMediumsolutionLC ↗
Pacific Atlantic Water FlowMediumLC ↗
Number of IslandsMediumsolutionLC ↗
Graph Valid TreeMediumLC ↗
Number of Connected ComponentsMediumLC ↗
Advanced Graphs0/1
Alien DictionaryHardLC ↗
Intervals0/5
Insert IntervalMediumLC ↗
Merge IntervalsMediumsolutionLC ↗
Non-overlapping IntervalsMediumLC ↗
Meeting RoomsEasyLC ↗
Meeting Rooms IIMediumLC ↗
Linked List0/6
Reverse Linked ListEasysolutionLC ↗
Linked List CycleEasyLC ↗
Merge Two Sorted ListsEasyLC ↗
Remove Nth Node From End of ListMediumLC ↗
Reorder ListMediumLC ↗
Merge K Sorted ListsHardLC ↗
Stack0/1
Valid ParenthesesEasysolutionLC ↗
Trees0/11
Maximum Depth of Binary TreeEasysolutionLC ↗
Same TreeEasyLC ↗
Invert Binary TreeEasyLC ↗
Binary Tree Maximum Path SumHardsolutionLC ↗
Binary Tree Level Order TraversalMediumsolutionLC ↗
Serialize and Deserialize Binary TreeHardsolutionLC ↗
Subtree of Another TreeEasyLC ↗
Construct Binary Tree from Preorder and InorderMediumLC ↗
Validate Binary Search TreeMediumLC ↗
Kth Smallest Element in a BSTMediumLC ↗
Lowest Common Ancestor of BSTMediumLC ↗
Tries0/2
Implement Trie (Prefix Tree)MediumLC ↗
Design Add and Search Words Data StructureMediumLC ↗
Heap / Priority Queue0/2
Merge K Sorted ListsHardLC ↗
Find Median from Data StreamHardsolutionLC ↗
Progress is saved on this device