Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
NeetCode
NeetCode 250
An expanded interview-prep roadmap that builds on NeetCode 150.
250 practice entries
0 / 250 completed0%
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 ↗ | — | |
| Encode and Decode Strings | Medium | Open ↗ | — | |
| Product of Array Except Self | Medium | Open ↗ | — | |
| Valid Sudoku | 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 ↗ | — | |
| Linked List Cycle | 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 ↗ | — | |
| 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 | Hard | Open ↗ | — | |
| Burst Balloons | Hard | Open ↗ | — | |
| Regular Expression Matching | Hard | Open ↗ | — |
Greedy
0 / 8
Intervals
0 / 6
Math & Geometry
0 / 8
Bit Manipulation
0 / 7
Arrays & Hashing — Extended
0 / 23
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Chocolate Distribution | Easy | Open ↗ | — | |
| Contains Duplicate II | Easy | Open ↗ | — | |
| Degree of an Array | Easy | Open ↗ | — | |
| Design HashMap | Easy | Open ↗ | — | |
| Design HashSet | Easy | Open ↗ | — | |
| Compare Version Numbers | Medium | Open ↗ | — | |
| Construct Quad Tree | Medium | Open ↗ | — | |
| Contiguous Array | Medium | Open ↗ | — | |
| Corporate Flight Bookings | Medium | Open ↗ | — | |
| Count and Say | Medium | Open ↗ | — | |
| Count Good Numbers | Medium | Open ↗ | — | |
| Custom Sort String | Medium | Open ↗ | — | |
| Delete the Middle Node of a Linked List | Medium | Open ↗ | — | |
| Design Browser History | Medium | Open ↗ | — | |
| Design Circular Queue | Medium | Open ↗ | — | |
| Design Linked List | Medium | Open ↗ | — | |
| Design Underground System | Medium | Open ↗ | — | |
| All Oone Data Structure | Hard | Open ↗ | — | |
| Count of Smaller Numbers After Self | Hard | Open ↗ | — | |
| First Missing Positive | Hard | Open ↗ | — | |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Open ↗ | — | |
| LFU Cache | Hard | Open ↗ | — | |
| Longest Duplicate Substring | Hard | Open ↗ | — |
Two Pointers — Extended
0 / 3
Sliding Window — Extended
0 / 3
Stacks & Queues — Extended
0 / 8
Binary Search — Extended
0 / 4
Linked List — Extended
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Delete Node in a Linked List | Medium | Open ↗ | — |
Trees — Extended
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Closest Binary Search Tree Value | Easy | Open ↗ | — | |
| Convert Sorted Array to Binary Search Tree | Easy | Open ↗ | — | |
| Binary Search Tree Iterator | Medium | Open ↗ | — | |
| Construct Binary Search Tree from Preorder Traversal | Medium | Open ↗ | — | |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | Open ↗ | — | |
| Convert BST to Greater Tree | Medium | Open ↗ | — | |
| Delete Node in a BST | Medium | Open ↗ | — |
Tries — Extended
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Concatenated Words | Hard | Open ↗ | — |
Heap & Priority Queue — Extended
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| IPO | Hard | Open ↗ | — |
Backtracking — Extended
0 / 3
Graphs — Extended
0 / 17
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Average of Levels in Binary Tree | Easy | Open ↗ | — | |
| Binary Tree Inorder Traversal | Easy | Open ↗ | — | |
| Binary Tree Paths | Easy | Open ↗ | — | |
| Binary Tree Postorder Traversal | Easy | Open ↗ | — | |
| Binary Tree Preorder Traversal | Easy | Open ↗ | — | |
| 01 Matrix | Medium | Open ↗ | — | |
| All Nodes Distance K in Binary Tree | Medium | Open ↗ | — | |
| All Paths From Source to Target | Medium | Open ↗ | — | |
| Amount of Time for Binary Tree to Be Infected | Medium | Open ↗ | — | |
| As Far from Land as Possible | Medium | Open ↗ | — | |
| Binary Tree Level Order Traversal II | Medium | Open ↗ | — | |
| Binary Tree Vertical Order Traversal | Medium | Open ↗ | — | |
| Binary Tree Zigzag Level Order Traversal | Medium | Open ↗ | — | |
| Boundary of Binary Tree | Medium | Open ↗ | — | |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | Open ↗ | — | |
| Distribute Coins in Binary Tree | Medium | Open ↗ | — | |
| Longest Cycle in a Graph | Hard | Open ↗ | — |
Advanced Graphs — Extended
0 / 4
Dynamic Programming — Extended
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Arithmetic Slices | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | Open ↗ | — | |
| Combination Sum IV | Medium | Open ↗ | — | |
| Count Square Submatrices with All Ones | Medium | Open ↗ | — | |
| Delete and Earn | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock III | Hard | Open ↗ | — | |
| Best Time to Buy and Sell Stock IV | Hard | Open ↗ | — | |
| Cherry Pickup II | Hard | Open ↗ | — | |
| Frog Jump | Hard | Open ↗ | — |