Curated List of Top 75 LeetCode
| Problem | Difficulty | Category | Tags | LeetCode |
|---|---|---|---|---|
| [Two Sum] |  |
Array |
Array, Hash Table |
🔗 |
| [Best Time to Buy and Sell Stock] | |
Array |
Array, Dynamic Programming |
🔗 |
| [Contains Duplicate] | |
Array |
Array, Hash Table, Sorting |
🔗 |
| [Product of Array Except Self] |  |
Array |
Array, Prefix Sum |
🔗 |
| [Maximum Subarray] | |
Array |
Array, Divide and Conquer, Dynamic Programming |
🔗 |
| [Maximum Product Subarray] | |
Array |
Array, Dynamic Programming |
🔗 |
| [Find Minimum in Rotated Sorted Array] | |
Array |
Array, Binary Search |
🔗 |
| [Search in Rotated Sorted Array] | |
Array |
Array, Binary Search |
🔗 |
| [3Sum] | |
Array |
Array, Two Pointers, Sorting |
🔗 |
| [Container With Most Water] | |
Array |
Array, Two Pointers, Greedy |
🔗 |
| [Sum of Two Integers] | |
Binary |
Math, Bit Manipulation |
🔗 |
| [Number of 1 Bits] | |
Binary |
Divide and Conquer, Bit Manipulation |
🔗 |
| [Counting Bits] | |
Binary |
Dynamic Programming, Bit Manipulation |
🔗 |
| [Missing Number] | |
Binary |
Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting |
🔗 |
| [Reverse Bits] | |
Binary |
Divide and Conquer, Bit Manipulation |
🔗 |
| [Climbing Stairs] | |
Dynamic Programming |
Math, Dynamic Programming, Memorization |
🔗 |
| [Coin Change] | |
Dynamic Programming |
Array, Dynamic Programming, Breadth-First-Search |
🔗 |
| [Longest Increasing Subsequence] | |
Dynamic Programming |
Array, Binary Search, Dynamic Programming |
🔗 |
| [Longest Common Subsequence] | |
Dynamic Programming |
String, Dynamic Programming |
🔗 |
| [Word Break Problem] | |
Dynamic Programming |
Array, Hash Table, String, Dynamic Programming, Trie, Memorization |
🔗 |
| [Combination Sum IV] | |
Dynamic Programming |
Array, Dynamic Programming |
🔗 |
| [House Robber] | |
Dynamic Programming |
Array, Dynamic Programming |
🔗 |
| [House Robber II] | |
Dynamic Programming |
Array, Dynamic Programming |
🔗 |
| [Decode Ways] | |
Dynamic Programming |
String, Dynamic Programming |
🔗 |
| [Unique Paths] | |
Dynamic Programming |
Math, Dynamic Programming, Combinatorics |
🔗 |
| [Jump Game] | |
Dynamic Programming |
Array, Dynamic Programming, Greedy |
🔗 |
| [Clone Graph] | |
Graph |
Hash Table, Depth-First-Search, Breadth-First-Search, Graph |
🔗 |
| [Course Schedule] | |
Graph |
Depth-First-Search, Breadth-First-Search, Graph, Topological Sort |
🔗 |
| [Pacific Atlantic Water Flow] | |
Graph |
Array, Depth-First-Search, Breadth-First-Search, Matrix |
🔗 |
| [Number of Islands] | |
Graph |
Array, Depth-First-Search, Breadth-First-Search, Union Find, Matrix |
🔗 |
| [Longest Consecutive Sequence] | |
Graph |
Array, Hash Table, Union Find |
🔗 |
| [Alien Dictionary (Leetcode Premium)] | Graph |
🔗 | ||
| [Graph Valid Tree (Leetcode Premium)] | Graph |
🔗 | ||
| [Number of Connected Components in an Undirected Graph (Leetcode Premium)] | Graph |
🔗 | ||
| [Insert Interval] | |
Interval |
Array |
🔗 |
| [Merge Intervals] | |
Interval |
Array, Sorting |
🔗 |
| [Non-overlapping Intervals] | |
Interval |
Array, Dynamic Programming, Greedy, Sorting |
🔗 |
| [Meeting Rooms (Leetcode Premium)] | Interval |
🔗 | ||
| [Meeting Rooms II (Leetcode Premium)] | Interval |
🔗 | ||
| [Reverse a Linked List] | |
Linked List |
Linked List, Recursion |
🔗 |
| [Detect Cycle in a Linked List] | |
Linked List |
Hash Table, Linked List, Two Pointers |
🔗 |
| [Merge Two Sorted Lists] | |
Linked List |
Linked List, Recursion |
🔗 |
| [Merge K Sorted Lists] |  |
Linked List |
Linked List, Divide and Conquer, Heap(Priority Queue), Merge Sort |
🔗 |
| [Remove Nth Node From End Of List] | |
Linked List |
Linked List, Two Pointers |
🔗 |
| [Reorder List] | |
Linked List |
Linked List, Two Pointers, Stack, Recursion |
🔗 |
| [Set Matrix Zeroes] | |
Matrix |
Array, Hash Table, Matrix |
🔗 |
| [Spiral Matrix] | |
Matrix |
Array, Matrix, Simulation |
🔗 |
| [Rotate Image] | |
Matrix |
Array, Math, Matrix |
🔗 |
| [Word Search] | |
Matrix |
Array, Backtracking, Matrix |
🔗 |
| [Longest Substring Without Repeating Characters] | |
String |
Hash Table, String, Sliding Window |
🔗 |
| [Longest Repeating Character Replacement] | |
String |
Hash Table, String, Sliding Window |
🔗 |
| [Minimum Window Substring] | |
String |
Hash Table, String, Sliding Window |
🔗 |
| [Valid Anagram] | |
String |
Hash Table, String, Sorting |
🔗 |
| [Group Anagrams] | |
String |
Array, Hash Table, String, Sorting |
🔗 |
| [Valid Parentheses] | |
String |
String, Stack |
🔗 |
| [Valid Palindrome] | |
String |
Two Pointer, String |
🔗 |
| [Longest Palindromic Substring] | |
String |
String, Dynamic Programming |
🔗 |
| [Palindromic Substrings] | |
String |
String, Dynamic Programming |
🔗 |
| [Encode and Decode Strings (Leetcode Premium)] | String |
🔗 | ||
| [Maximum Depth of Binary Tree] | |
Tree |
Tree, Depth-First-Search, Breadth-First-Search, Binary Tree |
🔗 |
| [Same Trees] | |
Tree |
Tree, Depth-First-Search, Breadth-First-Search, Binary Tree |
🔗 |
| [Invert/Flip Binary Tree] | |
Tree |
Depth-First-Search, Breadth-First-Search, Binary Tree |
🔗 |
| [Binary Tree Maximum Path Sum] | |
Tree |
Dynamic Programming, Tree, Depth-First-Search, Binary Tree |
🔗 |
| [Binary Tree Level Order Traversal] | |
Tree |
Tree, Breadth-First-Search, Binary Tree |
🔗 |
| [Serialize and Deserialize Binary Tree] | |
Tree |
String, Tree, Depth-First-Seaarch, Breadth-First-Search, Design, Binary Tree |
🔗 |
| [Subtree of Another Tree] | |
Tree |
Tree, Depth-First-Search, String Matching, Binary Tree, Hash Function |
🔗 |
| [Construct Binary Tree from Preorder and Inorder Traversal] | |
Tree |
Array, Hash Table, Divide and Conquer, Tree, Binary Tree |
🔗 |
| [Validate Binary Search Tree] | |
Tree |
Tree, Depth-First-Search, Binary Search Tree, Binary Tree |
🔗 |
| [Kth Smallest Element in a BST] | |
Tree |
Tree, Depth-First-Search, Binary Search Tree, Binary Tree |
🔗 |
| [Lowest Common Ancestor of BST] | |
Tree |
Tree, Depth-First-Search, Binary Search Tree, Binary Tree |
🔗 |
| [Implement Trie (Prefix Tree)] | |
Tree |
Hash Table, String, Design, Trie |
🔗 |
| [Add and Search Word] | |
Tree |
String, Depth-First Search, Design, Trie |
🔗 |
| [Word Search II] | |
Tree |
Array, String, Backtracking, Trie, Matrix |
🔗 |
| [Merge K Sorted Lists] | |
Heap |
Linked List, Divide and Conquer, Heap(Priority Queue), Merge Sort |
🔗 |
| [Top K Frequent Elements] | |
Heap |
Array, Hash Table, Divide and Conquer, Bucket Sort, Counting |
🔗 |
| [Find Median from Data Stream] | |
Heap |
Two Pointers, Design, Sorting, Heap, Data Stream |
🔗 |