Up to date (2016-01-08), there are 309 Algorithms / 13 Database / 4 Shell questions on LeetCode Online Judge.
The number of questions is increasing recently.
Here is the classification of all 326 questions.
For more questions and solutions, you can see my LintCode repository.
I'll keep updating for full summary and better solutions. Stay tuned for updates.
(Notes: "📖" means you need to subscribe to LeetCode premium membership for the access to premium questions. )
- Bit Manipulation
- Array
- String
- Linked List
- Stack
- Queue
- Heap
- Tree
- Hash Table
- Data Structure
- Math
- Two Pointers
- Sort
- Divide and Conquer
- Binary Search
- Binary Search Tree
- Breadth-First Search
- Depth-First Search
- Backtracking
- Dynamic Programming
- Greedy
- Design
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 136 | Single Number | C++ Python | O(n) | O(1) | Medium || 137 | Single Number II | C++ Python | O(n) | O(1) | Medium || 190 | Reverse Bits | C++ Python | O(1) | O(1) | Easy || 191 |Number of 1 Bits | C++ Python | O(1) | O(1) | Easy || 201 | Bitwise AND of Numbers Range | C++ Python | O(1) | O(1) | Medium || 231 | Power of Two | C++ Python | O(1) | O(1) | Easy | LintCode | 260 | Single Number III | C++ Python | O(n) | O(1) | Medium || 268| Missing Number | C++ Python | O(n) | O(1) | Medium | LintCode || 318| Maximum Product of Word Lengths | C++ Python | O(n) ~ O(n^2) | O(n) | Medium || Bit Manipulation, Counting Sort, Pruning|
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 15 | 3 Sum | C++ Python | O(n^2) | O(1) | Medium || 16 | 3 Sum Closest | C++ Python | O(n^2) | O(1) | Medium || 26 | Remove Duplicates from Sorted Array| Python | O(n) | O(1) | Easy || 27 | Remove Element | Python | O(n) | O(1) | Easy || 31 | Next Permutation| Python | O(n) | O(1) | Medium || Tricky 41 | First Missing Positive| Python | O(n) | O(1) | Hard || Tricky 48 | Rotate Image | Python | O(n^2) | O(1) | Medium || 54 | Spiral Matrix | C++ Python | O(m * n) | O(1) | Medium || 59 | Spiral Matrix II | C++ Python | O(n^2) | O(1) | Medium || 66 | Plus One | Python | O(n) | O(1) | Easy || 73 | Set Matrix Zeroes | Python | O(m * n) | O(1) | Medium || 80 | Remove Duplicates from Sorted Array II| Python | O(n) | O(1) | Medium || 118 | Pascal's Triangle| Python | O(n^2) | O(n) | Easy || 119 | Pascal's Triangle II| Python | O(n^2) | O(n) | Easy || 121 | Best Time to Buy and Sell Stock| Python | O(n) | O(1) | Medium || 128 | Longest Consecutive Sequence| Python | O(n) | O(n) | Hard || Tricky 157 | Read N Characters Given Read4 | Python | O(n) | O(1) | Easy |📖| 158 | Read N Characters Given Read4 II - Call multiple times | Python | O(n) | O(1) | Hard |📖| 163 | Missing Ranges| Python | O(n) | O(1) | Medium | 📖 | 169 | Majority Element | Python | O(n) | O(1) | Easy | 189 | Rotate Array | Python | O(n) | O(1) | Easy || 209 | Minimum Size Subarray Sum | [Python] (./Python/minimum-size-subarray-sum.py) | O(n) | O(1) | Medium | | Binary Search 215 | Kth Largest Element in an Array | [C++] (./C++/kth-largest-element-in-an-array.cpp) [Python] (./Python/kth-largest-element-in-an-array.py)| O(n) ~ O(n^2) | O(1) | Medium | EPI| 228 | Summary Ranges | [C++] (./C++/summary-ranges.cpp) [Python] (./Python/summary-ranges.py)| O(n) | O(1) | Easy | | 229 | Majority Element II | C++ Python | O(n) | O(1) | Medium | | 238 | Product of Array Except Self | C++ Python | O(n) | O(1) | Medium | LintCode | 240 | Search a 2D Matrix II | C++ Python | O(m + n) | O(1) | Medium | EPI, LintCode | 243| Shortest Word Distance | C++ Python | O(n) | O(1) | Easy |📖|| 245| [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance III/) | C++ Python | O(n) | O(1) | Medium |📖|| 251| Flatten 2D Vector | C++ Python | O(1) | O(1) | Medium |📖|| 277| Find the Celebrity | C++ Python | O(n) | O(1) | Medium |📖, EPI || 289| Game of Life | C++ Python | O(m * n) | O(1) | Medium ||| 293| Flip Game | C++ Python | O(n * (c+1)) | O(1) | Easy |📖|| 296| Best Meeting Point | C++ Python | O(m * n) | O(m + n) | Medium |📖|| 311| Sparse Matrix Multiplication | C++ Python | O(m * n * l) | O(m * l) | Medium |📖||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
5| Longest Palindromic Substring | Python | O(n) | O(n) | Medium || Manacher's Algorithm
6| ZigZag Conversion | Python | O(n) | O(1) | Easy ||
8| String to Integer (atoi) | Python | O(n) | O(1) | Easy ||
14| Longest Common Prefix | Python | O(n) | O(1) | Easy ||
28| Implement strStr() | Python | O(n + m) | O(m) | Easy || KMP Algorithm
38| Count and Say | Python| O(n * 2^n) | O(2^n) | Easy ||
43| Multiply Strings | Python | O(m * n) | O(m + n) | Medium ||
58| Length of Last Word | Python | O(n) | O(1) | Easy ||
67| Add Binary | Python | O(n) | O(1) | Easy ||
68| Text Justification | Python | O(n) | O(1) | Hard ||
125| Valid Palindrome | Python | O(n) | O(1) | Easy ||
151| Reverse Words in a String | Python | O(n) | O(n) | Medium ||
161| One Edit Distance | Python | O(m + n) | O(1) | Medium |📖|
165| Compare Version Numbers | Python | O(n) | O(1) | Easy ||
186| Reverse Words in a String II | Python | O(n) | O(1) | Medium | 📖 |
214| Shortest Palindrome | C++ Python | O(n) | O(n) | Hard || KMP Algorithm Manacher's Algorithm
271| Encode and Decode Strings | C++ Python | O(n) | O(1) | Medium | 📖 |
273| Integer to English Words | C++ Python | O(logn) | O(1) | Medium | |
306| Addictive Number | C++ Python | O(n^3) | O(n) | Medium | |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
2| Add Two Numbers | Python | O(n) | O(1) | Medium ||
24| Swap Nodes in Pairs| Python | O(n) | O(1) | Medium ||
25| Reverse Nodes in k-Group| Python | O(n) | O(1) | Hard ||
61| Rotate List| Python | O(n) | O(1) | Medium ||
82| Remove Duplicates from Sorted List II| Python | O(n) | O(1) | Medium ||
83| Remove Duplicates from Sorted List| Python | O(n) | O(1) | Easy ||
92| Reverse Linked List II| Python | O(n) | O(1) | Medium ||
138| Copy List with Random Pointer | Python | O(n) | O(1) | Hard ||
160| Intersection of Two Linked Lists| Python | O(m + n) | O(1) | Easy ||
203| Remove Linked List Elements| Python | O(n) | O(1) | Easy ||
206| Reverse Linked List| Python | O(n) | O(1) | Easy ||
234| Palindrome Linked List| C++ Python | O(n) | O(1) | Easy ||
237| Delete Node in a Linked List| C++ Python | O(1) | O(1) | Easy | LintCode |
242| Valid Anagram| C++ Python | O(n) | O(1) | Easy | LintCode |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
20| Valid Parentheses| Python | O(n) | O(n) | Easy ||
32| Longest Valid Parentheses| Python | O(n) | O(1) | Hard ||
71| Simplify Path| Python | O(n) | O(n) | Medium ||
101| Symmetric Tree| Python | O(n) | O(h) | Easy ||
150| Evaluate Reverse Polish Notation| Python| O(n)| O(n)| Medium ||
155| Min Stack | Python | O(n) | O(1) | Easy ||
173| Binary Search Tree Iterator | Python | O(1)| O(h)| Medium ||
224| Basic Calculator | C++ Python | O(n)| O(n)| Medium ||
227| Basic Calculator II | C++ Python | O(n)| O(n)| Medium ||
232| Implement Queue using Stacks | C++ Python | O(1), amortized| O(n)| Easy | EPI, LintCode |
255| Verify Preorder Sequence in Binary Search Tree | C++ Python | O(n)| O(1)| Medium |📖||
272| Closest Binary Search Tree Value II | C++ Python | O(h + k)| O(h)| Hard |📖||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 239| Sliding Window Maximum| C++ Python | O(n) | O(k) | Hard | EPI, LintCode | 281| Zigzag Iterator| C++ Python | O(n) | O(k) | Medium |📖||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 23| Merge k Sorted Lists | Python | O(nlogk)| O(k)| Hard || 264| Ugly Number II | C++ Python | O(n) | O(1) | Medium | CTCI, LintCode | BST, Heap | 295| Find Median from Data Stream | C++ Python | O(nlogn) | O(n) | Hard | EPI, LintCode | BST, Heap | 313| Super Ugly Number | C++ Python | O(n * k) | O(n + k) | Medium || BST, Heap |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
94 | Binary Tree Inorder Traversal | Python | O(n)| O(1)| Medium || Morris Traversal |
99 | Recover Binary Search Tree | Python | O(n)| O(1)| Hard || Morris Traversal
144 | Binary Tree Preorder Traversal | Python | O(n)| O(1)| Medium || Morris Traversal
145 | Binary Tree Postorder Traversal | Python | O(n)| O(1)| Hard || Morris Traversal
208 | Implement Trie (Prefix Tree) | Python | O(n) | O(1) | Medium || Trie
211 | Add and Search Word - Data structure design | C++ Python | O(min(n, h)) | O(min(n, h)) | Medium || Trie, DFS
226| Invert Binary Tree | C++ Python | O(n) | O(h), O(w) | Easy ||
297 | Serialize and Deserialize Binary Tree | C++ Python | O(n) | O(h) | Medium | LintCode | DFS
307 | Range Sum Query - Mutable | C++ Python | ctor: O(n), update: O(logn), query: O(logn) | O(n) | Medium | LintCode | DFS, Segment Tree, BIT
308 | Range Sum Query 2D - Mutable | C++ Python | ctor: O(m * n), update: O(logm + logn), query: O(logm + logn) | O(m * n) | Hard | 📖 | DFS, Segment Tree, BIT
315|Count of Smaller Numbers After Self| C++ Python| O(nlogn) | O(n) | Hard | LintCode | BST, BIT |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 1| Two Sum | Python | O(n) | O(n) | Medium || 3| Longest Substring Without Repeating Characters | Python | O(n) | O(1) | Medium || 18| 4 Sum |Python | O(n^2 * p) | O(n^2 * p) | Medium || 30| Substring with Concatenation of All Words | Python | O(m * n * k) | O(n * k) | Hard || 36| Valid Sudoku | Python | O(n^2) | O(n) | Easy || 49| Group Anagrams | Python | O(nlogg) | O(n) | Medium || 76| Minimum Window Substring | Python | O(n) | O(k) | Hard || 149| Max Points on a Line | Python | O(n^2) | O(n) | Hard || 159| Longest Substring with At Most Two Distinct Characters| Python | O(n^2) | O(1) | Hard |📖| 170| Two Sum III - Data structure design | Python | O(n) | O(n) | Easy | 📖 | 187| Repeated DNA Sequences | Python | O(n) | O(n) | Medium || 202| Happy Number | C++ Python | O(k) | O(k) | Easy || 204| Count Primes | Python | O(n) | O(n) | Easy || 205| Isomorphic Strings | Python | O(n) | O(1) | Easy || 217| Contains Duplicate | C++ Python | O(n) | O(n) | Easy || 219| Contains Duplicate II | C++ Python | O(n) | O(n) | Easy || 244| Shortest Word Distance II | C++ Python | ctor: O(n), lookup: O(a + b) | O(n) | Medium |📖|| 246| Strobogrammatic Number | C++ Python | O(n) | O(1) | Easy |📖|| 249| Group Shifted Strings | C++ Python | O(nlogn) | O(n) | Easy |📖|| 266| Palindrome Permutation | C++ Python | O(n) | O(1) | Easy |📖|| 288| Unique Word Abbreviation | C++ Python | ctor: O(n), lookup: O(1) | O(k) | Easy |📖|| 290| Word Pattern | C++ Python | O(n) | O(c) | Easy | variant of Isomorphic Strings || 299| Bulls and Cow | C++ Python | O(n) | O(1) | Easy ||| 305| Number of Islands II | C++ Python | O(k) | O(k)| Hard | LintCode, 📖 | Union Find 314| Binary Tree Vertical Order Traversal | C++ Python | O(n) | O(n)| Medium | 📖 | BFS 323| Number of Connected Components in an Undirected Graph | C++ Python | O(n) | O(n)| Medium | 📖 | Union Find 325| Maximum Size Subarray Sum Equals k | C++ Python | O(n) | O(n)| Easy | 📖 |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 146| LRU Cache | Python | O(1) | O(n) | Hard || 225| Implement Stack using Queues | C++ Python | push: O(n), pop: O(1), top: O(1) | O(n) | Medium ||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
7| Reverse Integer | Python | O(logn) | O(1) | Easy ||
9| Palindrome Number | Python | O(1) | O(1) | Easy ||
12| Integer to Roman | Python | O(n) | O(1) | Medium ||
13| Roman to Integer | Python | O(n) | O(1) | Easy ||
29| Divide Two Integers | Python | O(logn) | O(1) | Medium ||
60| Permutation Sequence | Python | O(n^2) | O(n) | Medium || Cantor Ordering
65| Valid Number | Python | O(n) | O(1) | Hard || Automata
89| Gray Code | Python | O(2^n) | O(1) | Medium ||
166| Fraction to Recurring Decimal | Python | O(logn) | O(1) | Medium ||
168| Excel Sheet Column Title | Python | O(logn) | O(1) | Easy ||
171| Excel Sheet Column Number | Python | O(n) | O(1) | Easy ||
172| Factorial Trailing Zeroes | Python | O(logn) | O(1) | Easy ||
223| Rectangle Area | C++ Python | O(1) | O(1) | Easy ||
233| Number of Digit One | C++ Python | O(logn) | O(1) | Medium | CTCI, LintCode|
248| Strobogrammatic Number III | C++ Python | O(5^(n/2)) | O(n) | Hard |📖||
258| Add Digits | C++ Python | O(1) | O(1) | Easy |||
263| Ugly Number | C++ Python | O(logn) | O(1) | Easy |||
292| Nim Game | C++ Python | O(1) | O(1) | Easy | LintCode ||
319 | Bulb Switcher | C++ Python | O(1) | O(1) | Medium |||
326 | Power of Three | C++ Python | O(1) | O(1) | Easy |||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 21| Merge Two Sorted Lists| Python | O(n) | O(1) | Easy || 56| Merge Intervals| Python | O(nlogn) | O(1) | Hard || 57| Insert Interval| Python | O(n) | O(1) | Hard || 75| Sort Colors | C++ Python | O(n) | O(1) | Medium || Tri Partition 88| Merge Sorted Array| Python | O(n) | O(1) | Easy || 147| Insertion Sort List|Python | O(n^2) | O(1) | Medium || 148| Sort List | Python | O(nlogn) | O(logn) | Medium || 164| Maximum Gap | Python| O(n) | O(n) | Hard || Tricky 179| Largest Number | Python | O(nlogn) | O(1) | Medium || 218| The Skyline Problem | C++ Python | O(nlogn) | O(n) | Hard || Sort, BST| 252| Meeting Rooms | C++ Python | O(nlogn) | O(n) | Easy |📖| | 253| Meeting Rooms II | C++ Python | O(nlogn) | O(n) | Medium |📖| | 274| H-Index | C++ Python | O(n) | O(n) | Medium || Counting Sort | 280| Wiggle Sort | C++ Python | O(n) | O(1) | Medium |📖| | 324| Wiggle Sort II | C++ Python | O(n) ~ O(n^2) | O(1) | Medium | variant of Sort Colors | Tri Partition |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
19| Remove Nth Node From End of List| Python | O(n) | O(1) | Easy ||
86| Partition List| Python | O(n) | O(1) | Medium ||
141| Linked List Cycle| C++ Python | O(n) | O(1) | Medium ||
142| Linked List Cycle II| C++ Python | O(n) | O(1) | Medium ||
143| Reorder List| Python | O(n) | O(1) | Medium ||
167| Two Sum II - Input array is sorted | Python | O(n) | O(1) | Medium | 📖 |
259 | 3Sum Smaller | C++ Python | O(n^2) | O(1) | Medium | 📖, LintCode |
283 | Move Zeros | C++ Python | O(n) | O(1) | Easy | |
287| Find the Duplicate Number| C++ Python | O(n) | O(1) | Hard | | Binary Search, Two Pointers |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
95| Unique Binary Search Trees II | Python | O(4^n / n^(3/2) | O(4^n / n^(3/2) | Medium ||
98| Validate Binary Search Tree|Python| O(n) | O(1) | Medium ||
100| Same Tree |Python | O(n) | O(h) | Easy ||
104| Maximum Depth of Binary Tree|Python| O(n) | O(h) | Easy ||
105| Construct Binary Tree from Preorder and Inorder Traversal | Python | O(n) | O(n) | Medium ||
106| Construct Binary Tree from Inorder and Postorder Traversal | Python | O(n) | O(n) | Medium ||
108| Convert Sorted Array to Binary Search Tree | Python | O(n) | O(logn) | Medium ||
109| Convert Sorted List to Binary Search Tree | Python | O(n) | O(logn) | Medium ||
110| Balanced Binary Tree | Python | O(n)| O(h) | Easy ||
111| Minimum Depth of Binary Tree|Python| O(n) | O(h) | Easy ||
114| Flatten Binary Tree to Linked List|Python| O(n) | O(h) | Medium ||
116| Populating Next Right Pointers in Each Node|Python| O(n) | O(1) | Medium ||
124| Binary Tree Maximum Path Sum| Python | O(n)| O(h)| Hard ||
129| Sum Root to Leaf Numbers | Python | O(n) | O(h) | Medium ||
156| Binary Tree Upside Down | Python | O(n) | O(1) | Medium |📖|
241| Different Ways to Add Parentheses | C++ Python | O(n * 4^n / n^(3/2)) | O(n * 4^n / n^(3/2)) | Medium ||
298 | Binary Tree Longest Consecutive Sequence | C++ Python | O(n) | O(h) | Medium |📖|
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 4| Median of Two Sorted Arrays | Python | O(log(min(m, n))) | O(1) | Hard || 33| Search in Rotated Sorted Array | Python | O(logn) | O(1) | Hard || 34| Search for a Range | Python | O(logn) | O(1) | Medium || 35| Search Insert Position | Python | O(logn) | O(1) | Medium || 50| Pow(x, n) | Python | O(logn) | O(logn) | Medium || 69| Sqrt(x) | Python | O(logn) | O(1) | Medium || 74| Search a 2D Matrix | Python | O(logm + logn) | O(1) | Medium || 81| Search in Rotated Sorted Array II | Python | O(logn) | O(1) | Medium || 153| Find Minimum in Rotated Sorted Array | Python | O(logn) | O(1) | Medium || 154| Find Minimum in Rotated Sorted Array II | Python | O(logn) ~ O(n) | O(1) | Hard || 162| Find Peak Element | Python | O(logn) | O(1) | Medium || 222| Count Complete Tree Nodes | C++ Python | O((logn)^2) | O(1) | Medium || 275| H-Index II | C++ Python | O(logn) | O(1) | Medium || Binary Search | 278| First Bad Version | C++ Python | O(logn) | O(1) | Easy | LintCode || 300| Longest Increasing Subsequence | C++ Python | O(nlogn) | O(n) | Medium | CTCI, LintCode | Binary Search, DP| 302| Smallest Rectangle Enclosing Black Pixels| C++ Python | O(nlogn) | O(1) | Medium | 📖 |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 220| Contains Duplicate III | C++ Python | O(nlogk) | O(k) | medium || 230 | Kth Smallest Element in a BST | C++ Python | O(max(h, k)) | O(min(h, k)) | Medium || 235 | Lowest Common Ancestor of a Binary Search Tree | C++ Python | O(h) | O(1) | Easy | EPI | 270| Closest Binary Search Tree Value| C++ Python | O(h) | O(1) | Easy | 📖 | 285| Inorder Successor in BST| C++ Python | O(h) | O(1) | Medium | 📖 |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| -----
102| Binary Tree Level Order Traversal| Python| O(n)| O(n)| Easy ||
107| Binary Tree Level Order Traversal II| Python | O(n)| O(n)| Easy ||
103| Binary Tree Zigzag Level Order Traversal| Python | O(n)| O(n)| Medium ||
117| Populating Next Right Pointers in Each Node II|Python| O(n) | O(1) | Hard ||
127| Word Ladder|Python | O(n * d) | O(d) | Medium ||
130| Surrounded Regions|C++ Python| O(m * n) | O(m + n) | Medium ||
133| Clone Graph| Python | O(n) | O(n) | Medium ||
207| Course Schedule| Python | O(|V| + |E|) | O(|E|) | Medium || Topological Sort |
210| Course Schedule II| Python | O(|V| + |E|) | O(|E|) | Medium || Topological Sort |
261| Graph Valid Tree| C++ Python | O(|V| + |E|) | O(|V| + |E|) | Medium | 📖 |
269| Alien Dictionary | C++ Python | O(n) | O(1) | Hard |📖| Topological Sort, BFS, DFS |
286| Walls and Gates| C++ Python | O(m * n) | O(g) | Medium | 📖 |
310| Minimum Height Trees| C++ Python | O(n) | O(n) | Medium ||
317| Shortest Distance from All Buildings| C++ Python | O(k * m * n) | O(m * n) | Hard | 📖 |
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 112| Path Sum | Python | O(n) | O(h) | Easy || 113| Path Sum II | Python | O(n) | O(h) | Medium || 199| Binary Tree Right Side View | Python | O(n) | O(h) | Medium || 200| Number of Islands | Python | O(m * n) | O(m * n)| Medium || 236 | Lowest Common Ancestor of a Binary Tree | C++ Python | O(h) | O(h) | Medium | EPI | 247| Strobogrammatic Number II | C++ Python | O(n^2 * 5^(n/2)) | O(n) | Medium |📖|| 250| Count Univalue Subtrees | C++ Python | O(n) | O(h) | Medium |📖|| 257| Binary Tree Paths | C++ Python | O(n * h) | O(h) | Easy ||| 282| Expression Add Operators | C++ Python | O(4^n) | O(n) | Hard ||| 301| Remove Invalid Parentheses | C++ Python | O(C(n, c)) | O(c) | Medium |||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 17| Letter Combinations of a Phone Number| Python | O(n * 4^n) | O(n) | Medium || 22| Generate Parentheses| Python| O(4^n / n^(3/2)) | O(n) | Medium || 37| Sudoku Solver | Python | O((9!)^9) | O(1) | Hard || 39| Combination Sum| Python | O(k * n^k) | O(k) | Medium || 40| Combination Sum II| Python| O(k * C(n, k))| O(k) | Medium || 46| Permutations| Python | O(n * n!) | O(n) | Medium || 47| Permutations II| Python | O(n * n!) | O(n) | Hard || 51| N-Queens | Python | O(n!) | O(n) | Hard || 52| N-Queens-II | Python | O(n!) | O(n) | Hard || 77| Combinations | Python | O(n!) | O(n) | Medium || 79| Word Search | Python | O(m * n * l) | O(l) | Medium || 93| Restore IP Addresses | Python | O(1) | O(1) | Medium || 78| Subsets | Python | O(n * 2^n) | O(1) | Medium || 90| Subsets II | Python | O(n * 2^n) | O(1) | Medium || 126| Word Ladder II |Python | O(n * d) | O(d) | Hard || 131| Palindrome Partitioning | Python | O(n^2) ~ O(2^n) | O(n^2) | Medium || 140| Word Break II | Python | O(n^2) | O(n) | Hard || 212| Word Search II | C++ Python | O(m * n * l) | O(l) | Hard | LintCode | Trie, DFS 216| Combination Sum III| C++ Python | O(k * C(n, k)) | O(k) | Medium || 254| Factor Combinations | C++ Python | O(nlogn) | O(logn) | Medium |📖|| 267| Palindrome Permutation II | C++ Python | O(n * n!) | O(n) | Medium |📖|| 291| Word Pattern II | C++ Python | O(n * C(n - 1, c - 1)) | O(n + c) | Hard |📖|| 294| Flip Game II | C++ Python | O(n + c^2) | O(c) | Medium |📖| DP, Hash | 320| Generalized Abbreviation | C++ Python | O(n * 2^n) | O(n) | Medium |📖||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 10| Regular Expression Matching | Python | O(m * n) | O(n) | Hard || 53| Maximum Subarray|Python| O(n) | O(1) | Medium || 62| Unique Paths | Python| O(m * n) | O(m + n) | Medium || 63| Unique Paths II | Python | O(m * n) | O(m + n) | Medium || 64| Minimum Path Sum|Python| O(m * n) | O(m + n) | Medium || 70| Climbing Stairs| Python | O(n) | O(1) | Easy || 72| Edit Distance|Python| O(m * n) | O(m + n) | Hard || 85| Maximal Rectangle|Python| O(n^2) | O(n) | Hard || 87| Scramble String | Python | O(n^4) | O(n^3) | Hard || 91| Decode Ways | Python| O(n) | O(1) | Medium || 96| Unique Binary Search Trees | Python | O(n) | O(1) | Medium || Math 97| Interleaving String|Python| O(m * n) | O(m + n) | Hard || 115| Distinct Subsequences|Python| O(n^2) | O(n) | Hard || 120| Triangle | Python | O(m * n) | O(n) | Medium || 123| Best Time to Buy and Sell Stock III | Python | O(n) | O(1) | Hard || 132| Palindrome Partitioning II | Python | O(n^2) | O(n^2) | Hard || 139| Word Break | Python | O(n^2) | O(n) | Medium || 152| Maximum Product Subarray|Python| O(n) | O(1) | Medium || 174| Dungeon Game | Python| O(m * n) | O(m + n) | Hard || 188| Best Time to Buy and Sell Stock IV| Python | O(k * n) | O(k) | Hard || 198| House Robber| Python | O(n) | O(1) | Easy || 213| House Robber II| C++ Python | O(n) | O(1) | Medium || 221| Maximal Square| C++ Python | O(n^2) | O(n) | Medium | EPI | 256| Paint House | C++ Python | O(n)| O(1)| Medium |📖|| 265| Paint House II | C++ Python | O(n * k)| O(k)| Hard |📖|| 276| Paint Fence | C++ Python | O(n)| O(1)| Easy |📖|| 279| Perfect Squares| C++ Python | O(n * sqrt(n)) | O(n) | Medium || Hash | 303| Range Sum Query - Immutable| C++ Python | ctor: O(n), lookup: O(1) | O(n) | Easy || 304| Range Sum Query 2D - Immutable| C++ Python | ctor: O(m * n), lookup: O(1) | O(m * n) | Medium || 309| Best Time to Buy and Sell Stock with Cooldown | C++ Python | O(n) | O(1) | Medium || 312| Burst Balloons | C++ Python | O(n^3) | O(n^2) | Medium || 322| Coin Change | C++ Python | O(n * k) | O(k) | Medium ||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 11| Container With Most Water| Python | O(n) | O(1) | Medium || 42| Trapping Rain Water | Python | O(n) | O(1) | Hard || Tricky 44| Wildcard Matching | Python | O(m + n) | O(1) | Hard || Tricky 45| Jump Game II | Python | O(n) | O(1) | Hard || 55| Jump Game | Python | O(n) | O(1) | Medium || 84| Largest Rectangle in Histogram | Python | O(n) | O(n) | Hard || Tricky 122| Best Time to Buy and Sell Stock II| Python | O(n) | O(1) | Medium || 134| Gas Station| Python | O(n) | O(1) | Medium || 135| Candy| Python | O(n) | O(n) | Hard || 316| Remove Duplicate Letters | C++ Python | O(n)| O(k)| Medium || Stack | 321| Create Maximum Number| C++ Python | O(k * (m + n + k)) ~ O(k * (m + n + k^2))| O(m + n + k^2) | Hard | variant of Delete Digits | Greedy, DP
##Design
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 284| Peeking Iterator| C++ Python | O(1) | O(1) | Medium ||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 175| Combine Two Tables | MySQL | O(m + n) | O(m + n) | Easy || 176| Second Highest Salary | MySQL | O(n) | O(1) | Easy || 177| Nth Highest Salary | MySQL | O(n^2) | O(n) | Medium || 178| Rank Scores | MySQL | O(n^2) | O(n) | Medium || 180| Consecutive Numbers | MySQL | O(n) | O(n) | Medium || 181| Employees Earning More Than Their Managers | MySQL | O(n^2) | O(1) | Easy || 182| Duplicate Emails | MySQL | O(n^2) | O(n) | Easy || 183| Customers Who Never Order | MySQL | O(n^2) | O(1) | Easy || 184| Department Highest Salary | MySQL | O(n^2) | O(n) | Medium || 185| Department Top Three Salaries | MySQL | O(n^2) | O(n) | Hard || 196| Delete Duplicate Emails | MySQL | O(n^2) | O(n) | Easy || 197| Rising Temperature | MySQL | O(n^2) | O(n) | Easy || 262| Trips and Users | MySQL | O((t * u) + tlogt) | O(t) | Hard ||
-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------| ----- 192 | Word Frequency | Shell | O(n) | O(k) | Medium || 193 | Valid Phone Numbers | Shell | O(n) | O(1) | Easy || 194 | Transpose File | Shell | O(n^2) | O(n^2) | Medium || 195 | Tenth Line | Shell | O(n) | O(1) | Easy ||