Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
LeetCode
LeetCode Top Interview 150
LeetCode’s official 150-question interview study plan.
150 practice entries
0 / 150 completed0%
Array & String
0 / 24
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Merge Sorted Array | Easy | Open ↗ | — | |
| Remove Element | Easy | Open ↗ | — | |
| Remove Duplicates from Sorted Array | Easy | Open ↗ | — | |
| Remove Duplicates from Sorted Array II | Medium | Open ↗ | — | |
| Majority Element | Easy | Open ↗ | — | |
| Rotate Array | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock | Easy | Open ↗ | — | |
| Best Time to Buy and Sell Stock II | Medium | Open ↗ | — | |
| Jump Game | Medium | Open ↗ | — | |
| Jump Game II | Medium | Open ↗ | — | |
| H-Index | Medium | Open ↗ | — | |
| Insert Delete GetRandom O(1) | Medium | Open ↗ | — | |
| Product of Array Except Self | Medium | Open ↗ | — | |
| Gas Station | Medium | Open ↗ | — | |
| Candy | Hard | Open ↗ | — | |
| Trapping Rain Water | Hard | Open ↗ | — | |
| Roman to Integer | Easy | Open ↗ | — | |
| Integer to Roman | Medium | Open ↗ | — | |
| Length of Last Word | Easy | Open ↗ | — | |
| Longest Common Prefix | Easy | Open ↗ | — | |
| Reverse Words in a String | Medium | Open ↗ | — | |
| Zigzag Conversion | Medium | Open ↗ | — | |
| Find the Index of the First Occurrence in a String | Easy | Open ↗ | — | |
| Text Justification | Hard | Open ↗ | — |
Two Pointers
0 / 5
Sliding Window
0 / 4
Matrix
0 / 5
Hashmap
0 / 9
Intervals
0 / 4
Stack
0 / 5
Linked List
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Linked List Cycle | Easy | Open ↗ | — | |
| Add Two Numbers | Medium | Open ↗ | — | |
| Merge Two Sorted Lists | Easy | Open ↗ | — | |
| Copy List with Random Pointer | Medium | Open ↗ | — | |
| Reverse Linked List II | Medium | Open ↗ | — | |
| Reverse Nodes in k-Group | Hard | Open ↗ | — | |
| Remove Nth Node From End of List | Medium | Open ↗ | — | |
| Remove Duplicates from Sorted List II | Medium | Open ↗ | — | |
| Rotate List | Medium | Open ↗ | — | |
| Partition List | Medium | Open ↗ | — | |
| LRU Cache | Medium | Open ↗ | — |
Binary Tree General
0 / 14
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Maximum Depth of Binary Tree | Easy | Open ↗ | — | |
| Same Tree | Easy | Open ↗ | — | |
| Invert Binary Tree | Easy | Open ↗ | — | |
| Symmetric Tree | Easy | Open ↗ | — | |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | Open ↗ | — | |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | Open ↗ | — | |
| Populating Next Right Pointers in Each Node II | Medium | Open ↗ | — | |
| Flatten Binary Tree to Linked List | Medium | Open ↗ | — | |
| Path Sum | Easy | Open ↗ | — | |
| Sum Root to Leaf Numbers | Medium | Open ↗ | — | |
| Binary Tree Maximum Path Sum | Hard | Open ↗ | — | |
| Binary Search Tree Iterator | Medium | Open ↗ | — | |
| Count Complete Tree Nodes | Easy | Open ↗ | — | |
| Lowest Common Ancestor of a Binary Tree | Medium | Open ↗ | — |
Binary Tree BFS
0 / 4
Binary Search Tree
0 / 3
Graph General
0 / 6
Graph BFS
0 / 3
Trie
0 / 3
Backtracking
0 / 7
Divide & Conquer
0 / 4
Kadane's Algorithm
0 / 2
Binary Search
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Search Insert Position | Easy | Open ↗ | — | |
| Search a 2D Matrix | Medium | Open ↗ | — | |
| Find Peak Element | Medium | Open ↗ | — | |
| Search in Rotated Sorted Array | Medium | Open ↗ | — | |
| Find First and Last Position of Element in Sorted Array | Medium | Open ↗ | — | |
| Find Minimum in Rotated Sorted Array | Medium | Open ↗ | — | |
| Median of Two Sorted Arrays | Hard | Open ↗ | — |
Heap
0 / 4
Bit Manipulation
0 / 6
Math
0 / 6
1D Dynamic Programming
0 / 5
Multidimensional Dynamic Programming
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Triangle | Medium | Open ↗ | — | |
| Minimum Path Sum | Medium | Open ↗ | — | |
| Unique Paths II | Medium | Open ↗ | — | |
| Longest Palindromic Substring | Medium | Open ↗ | — | |
| Interleaving String | Medium | Open ↗ | — | |
| Edit Distance | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock III | Hard | Open ↗ | — | |
| Best Time to Buy and Sell Stock IV | Hard | Open ↗ | — | |
| Maximal Square | Medium | Open ↗ | — |