Curated List · NeetCode
NeetCode 150: Complete LeetCode Problem List & Tracker
The 64 highest-signal coding interview problems curated by NeetCode. Organized by pattern — complete the list and cover every core algorithmic pattern tested at FAANG.
✓ Solutions Available
Python • JS • Java • C++
Practice Mode Enabled
17
Easy
41
Medium
6
Hard
0 / 64 solved
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Two Sum
#Array
#Hash Map | Easy | Solution | ||
| Contains Duplicate
#Array
#Hash Table
#Sorting | Easy | Solution | ||
| Valid Anagram
#String
#Hash Map
#Sorting | Easy | Solution | ||
| Group Anagrams
#String
#Hash Map
#Sorting | Medium | Solution | ||
| Top K Frequent Elements
#Array
#Hash Map
#Heap | Medium | Solution | ||
| Product of Array Except Self
#Array
#Prefix Product | Medium | Solution | ||
| Longest Consecutive Sequence
#Array
#Hash Set | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Valid Palindrome
#String
#Two Pointers | Easy | Solution | ||
| 3Sum
#Array
#Two Pointers
#Sorting | Medium | Solution | ||
| Container With Most Water
#Array
#Two Pointers
#Greedy | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Longest Substring Without Repeating Characters
#String
#Hash Map
#Sliding Window | Medium | Solution | ||
| Minimum Window Substring
#String
#Hash Map
#Sliding Window | Hard | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Valid Parentheses
#String
#Stack | Easy | Solution | ||
| Min Stack
#Stack
#Design | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Binary Search
#Array
#Binary Search | Easy | Solution | ||
| Search in Rotated Sorted Array
#Array
#Binary Search | Medium | Solution | ||
| Time Based Key-Value Store
#Hash Map
#Binary Search
#Design | Medium | Solution |
| 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 | ||
| Reorder List
#Linked List
#Two Pointers
#Stack | Medium | Solution | ||
| Remove Nth Node From End of List
#Linked List
#Two Pointers | Medium | Solution | ||
| Merge K Sorted Lists
#Linked List
#Heap
#Divide and Conquer | Hard | Solution |
| 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 | ||
| Lowest Common Ancestor of a BST
#Tree
#DFS
#BST | Easy | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Implement Trie (Prefix Tree)
#Design
#Trie | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Kth Largest Element in an Array
#Array
#Heap
#Sorting | Medium | Solution | ||
| Find Median From Data Stream
#Two Heaps
#Design
#Sorting | Hard | Solution |
| 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 |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Subsets
#Array
#Backtracking
#Bit Manipulation | Medium | Solution | ||
| Combination Sum
#Array
#Backtracking | Medium | Solution | ||
| Permutations
#Array
#Backtracking | Medium | Solution |
| 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 | ||
| Longest Common Subsequence
#String
#DP | 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 | ||
| Maximum Subarray
#Array
#DP
#Divide and Conquer | Medium | Solution | ||
| Edit Distance
#String
#DP | Hard | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Merge Intervals
#Array
#Sorting | Medium | Solution | ||
| Non-overlapping Intervals
#Array
#Greedy
#Dynamic Programming | Medium | Solution | ||
| Insert Interval
#Array | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Jump Game
#Array
#Greedy
#DP | Medium | Solution | ||
| Gas Station
#Array
#Greedy | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Set Matrix Zeroes
#Array
#Matrix | Medium | Solution | ||
| Rotate Image
#Array
#Matrix
#Math | Medium | Solution | ||
| Spiral Matrix
#Array
#Matrix
#Simulation | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Number of 1 Bits
#Divide and Conquer
#Bit Manipulation | Easy | Solution | ||
| Counting Bits
#DP
#Bit Manipulation | Easy | Solution | ||
| Reverse Bits
#Divide and Conquer
#Bit Manipulation | Easy | Solution | ||
| Missing Number
#Array
#Math
#Bit Manipulation | Easy | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Longest Repeating Character Replacement
#String
#Sliding Window | Medium | Solution |
Want more curated problems?
Check our Blind 75 or Essential 75 for shorter lists, or browse 321+ problems by pattern.