Official Study Plan · LeetCode 75
LeetCode 75 Study Plan: Essential Problems & Tracker
LeetCode's official curated study plan — 54 essential and trending problems. Free tracker, no sign-up.
✓ Solutions Available
Python • JS • Java • C++
Practice Mode Enabled
11
Easy
36
Medium
7
Hard
0 / 54 solved
Array
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Two Sum
#Array
#Hash Map | Easy | Solution | ||
| 3Sum
#Array
#Two Pointers
#Sorting | Medium | Solution | ||
| Container With Most Water
#Array
#Two Pointers
#Greedy | Medium | Solution | ||
| Maximum Subarray
#Array
#DP
#Divide and Conquer | Medium | Solution | ||
| Product of Array Except Self
#Array
#Prefix Product | Medium | Solution |
String
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Longest Substring Without Repeating Characters
#String
#Hash Map
#Sliding Window | Medium | Solution | ||
| Group Anagrams
#String
#Hash Map
#Sorting | Medium | Solution | ||
| Longest Palindromic Substring
#String
#Dynamic Programming | Medium | Solution |
Two Pointers
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Valid Palindrome
#String
#Two Pointers | Easy | Solution | ||
| Trapping Rain Water
#Array
#Two Pointers
#Stack | Hard | Solution |
Sliding Window
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Minimum Window Substring
#String
#Hash Map
#Sliding Window | Hard | Solution | ||
| Longest Repeating Character Replacement
#String
#Sliding Window | Medium | Solution |
Stack
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Valid Parentheses
#String
#Stack | Easy | Solution |
Binary Search
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Search in Rotated Sorted Array
#Array
#Binary Search | Medium | Solution |
Linked List
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Reverse Linked List
#Linked List
#Recursion | Easy | Solution | ||
| Merge Two Sorted Lists
#Linked List
#Recursion | Easy | Solution | ||
| Linked List Cycle
#Linked List
#Two Pointers
#Hash Table | Easy | Solution | ||
| Remove Nth Node From End of List
#Linked List
#Two Pointers | Medium | Solution | ||
| Reorder List
#Linked List
#Two Pointers
#Stack | Medium | Solution | ||
| Merge K Sorted Lists
#Linked List
#Heap
#Divide and Conquer | Hard | Solution |
Tree
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Invert Binary Tree
#Tree
#DFS
#BFS | Easy | Solution | ||
| Maximum Depth of Binary Tree
#Tree
#DFS
#BFS | Easy | Solution | ||
| Binary Tree Maximum Path Sum
#Tree
#DFS
#DP | Hard | Solution | ||
| Binary Tree Level Order Traversal
#Tree
#BFS | Medium | Solution | ||
| Serialize and Deserialize Binary Tree
#Tree
#DFS
#BFS | Hard | Solution | ||
| Validate Binary Search Tree
#Tree
#DFS
#BST | Medium | Solution | ||
| Kth Smallest Element in a BST
#Tree
#DFS
#BST | Medium | Solution | ||
| Lowest Common Ancestor of a BST
#Tree
#DFS
#BST | Easy | Solution |
Graph
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Number of Islands
#Array
#DFS
#BFS | Medium | Solution | ||
| Clone Graph
#Graph
#DFS
#BFS | Medium | Solution | ||
| Pacific Atlantic Water Flow
#Graph
#DFS
#BFS | Medium | Solution | ||
| Course Schedule
#Graph
#DFS
#BFS | Medium | Solution | ||
| Rotting Oranges
#Array
#BFS
#Matrix | Medium | Solution |
Backtracking
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Subsets
#Array
#Backtracking
#Bit Manipulation | Medium | Solution | ||
| Combination Sum
#Array
#Backtracking | Medium | Solution | ||
| Permutations
#Array
#Backtracking | Medium | Solution |
Dynamic Programming
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Climbing Stairs
#DP
#Math
#Memoization | Easy | Solution | ||
| Coin Change
#Array
#DP
#BFS | Medium | Solution | ||
| Longest Increasing Subsequence
#Array
#DP
#Binary Search | Medium | Solution | ||
| Word Break
#String
#DP
#Hash Set | Medium | Solution | ||
| House Robber
#Array
#DP | Medium | Solution | ||
| Unique Paths
#Math
#DP
#Combinatorics | Medium | Solution | ||
| Decode Ways
#String
#DP | Medium | Solution | ||
| Edit Distance
#String
#DP | Hard | Solution |
Intervals
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Merge Intervals
#Array
#Sorting | Medium | Solution | ||
| Non-overlapping Intervals
#Array
#Greedy
#Dynamic Programming | Medium | Solution |
Greedy
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Jump Game
#Array
#Greedy
#DP | Medium | Solution | ||
| Gas Station
#Array
#Greedy | Medium | Solution |
Matrix
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Set Matrix Zeroes
#Array
#Matrix | Medium | Solution | ||
| Rotate Image
#Array
#Matrix
#Math | Medium | Solution |
Heap
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Top K Frequent Elements
#Array
#Hash Map
#Heap | Medium | Solution | ||
| Find Median From Data Stream
#Two Heaps
#Design
#Sorting | Hard | Solution |
Hash Map
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Longest Consecutive Sequence
#Array
#Hash Set | Medium | Solution | ||
| Valid Anagram
#String
#Hash Map
#Sorting | Easy | Solution |
Want more curated problems?
Check Blind 75, Grind 75, or NeetCode 150 for different curated lists.