Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
NeetCode
NeetCode 150
A focused roadmap of interview patterns and essential problems.
150 practice entries · Source checked
0 / 150 completed0%
About this source edition
NeetCode 150
“Source checked” is when this edition was retrieved, not a claim that the creator updated it then.
Original sheet ↗Dataset source ↗Arrays & Hashing
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Contains Duplicate | Easy | Open ↗ | ||
| Valid Anagram | Easy | Open ↗ | ||
| Two Sum | Easy | Open ↗ | ||
| Group Anagrams | Medium | Open ↗ | ||
| Top K Frequent Elements | Medium | Open ↗ | ||
| Product of Array Except Self | Medium | Open ↗ | ||
| Valid Sudoku | Medium | Open ↗ | ||
| Encode and Decode Strings | Medium | Open ↗ | ||
| Longest Consecutive Sequence | Medium | Open ↗ |
Two Pointers
0 / 5
Sliding Window
0 / 6
Stack
0 / 7
Binary Search
0 / 7
Linked List
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Reverse Linked List | Easy | Open ↗ | ||
| Merge Two Sorted Lists | Easy | Open ↗ | ||
| Reorder List | Medium | Open ↗ | ||
| Remove Nth Node From End of List | Medium | Open ↗ | ||
| Copy List With Random Pointer | Medium | Open ↗ | ||
| Add Two Numbers | Medium | Open ↗ | ||
| Linked List Cycle | Easy | Open ↗ | ||
| Find The Duplicate Number | Medium | Open ↗ | ||
| LRU Cache | Medium | Open ↗ | ||
| Merge K Sorted Lists | Hard | Open ↗ | ||
| Reverse Nodes In K Group | Hard | Open ↗ |
Trees
0 / 15
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Invert Binary Tree | Easy | Open ↗ | ||
| Maximum Depth of Binary Tree | Easy | Open ↗ | ||
| Diameter of Binary Tree | Easy | Open ↗ | ||
| Balanced Binary Tree | Easy | Open ↗ | ||
| Same Tree | Easy | Open ↗ | ||
| Subtree of Another Tree | Easy | Open ↗ | ||
| Lowest Common Ancestor of a Binary Search Tree | Medium | Open ↗ | ||
| Binary Tree Level Order Traversal | Medium | Open ↗ | ||
| Binary Tree Right Side View | Medium | Open ↗ | ||
| Count Good Nodes In Binary Tree | Medium | Open ↗ | ||
| Validate Binary Search Tree | Medium | Open ↗ | ||
| Kth Smallest Element In a Bst | Medium | Open ↗ | ||
| Construct Binary Tree From Preorder And Inorder Traversal | Medium | Open ↗ | ||
| Binary Tree Maximum Path Sum | Hard | Open ↗ | ||
| Serialize And Deserialize Binary Tree | Hard | Open ↗ |
Tries
0 / 3
Heap / Priority Queue
0 / 7
Backtracking
0 / 9
Graphs
0 / 13
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Number of Islands | Medium | Open ↗ | ||
| Clone Graph | Medium | Open ↗ | ||
| Max Area of Island | Medium | Open ↗ | ||
| Pacific Atlantic Water Flow | Medium | Open ↗ | ||
| Surrounded Regions | Medium | Open ↗ | ||
| Rotting Oranges | Medium | Open ↗ | ||
| Walls And Gates | Medium | Open ↗ | ||
| Course Schedule | Medium | Open ↗ | ||
| Course Schedule II | Medium | Open ↗ | ||
| Redundant Connection | Medium | Open ↗ | ||
| Number of Connected Components In An Undirected Graph | Medium | Open ↗ | ||
| Graph Valid Tree | Medium | Open ↗ | ||
| Word Ladder | Hard | Open ↗ |
Advanced Graphs
0 / 6
1-D Dynamic Programming
0 / 12
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Climbing Stairs | Easy | Open ↗ | ||
| Min Cost Climbing Stairs | Easy | Open ↗ | ||
| House Robber | Medium | Open ↗ | ||
| House Robber II | Medium | Open ↗ | ||
| Longest Palindromic Substring | Medium | Open ↗ | ||
| Palindromic Substrings | Medium | Open ↗ | ||
| Decode Ways | Medium | Open ↗ | ||
| Coin Change | Medium | Open ↗ | ||
| Maximum Product Subarray | Medium | Open ↗ | ||
| Word Break | Medium | Open ↗ | ||
| Longest Increasing Subsequence | Medium | Open ↗ | ||
| Partition Equal Subset Sum | Medium | Open ↗ |
2-D Dynamic Programming
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Unique Paths | Medium | Open ↗ | ||
| Longest Common Subsequence | Medium | Open ↗ | ||
| Best Time to Buy And Sell Stock With Cooldown | Medium | Open ↗ | ||
| Coin Change II | Medium | Open ↗ | ||
| Target Sum | Medium | Open ↗ | ||
| Interleaving String | Medium | Open ↗ | ||
| Longest Increasing Path In a Matrix | Hard | Open ↗ | ||
| Distinct Subsequences | Hard | Open ↗ | ||
| Edit Distance | Medium | Open ↗ | ||
| Burst Balloons | Hard | Open ↗ | ||
| Regular Expression Matching | Hard | Open ↗ |