http://leetcode.cloudfoundry.com/
| Id | Question | Difficulty | Freqency | Data Structures | Algorithms | |
|---|---|---|---|---|---|---|
| 1 | Two Sum | 2 | 5 |
|
|
|
| 2 | Add Two Numbers | 3 | 4 |
|
|
|
| 3 | Longest Substring Without Repeating Characters | 3 | 2 |
|
|
|
| 4 | Median of Two Sorted Arrays | 5 | 3 |
|
|
|
| 5 | Longest Palindromic Substring | 4 | 2 |
|
|
|
| 6 | ZigZag Conversion | 3 | 1 |
|
|
|
| 7 | Reverse Integer | 2 | 3 |
|
|
|
| 8 | String to Integer (atoi) | 2 | 5 |
|
|
|
| 9 | Palindrome Number | 2 | 2 |
|
|
|
| 10 | Regular Expression Matching | 5 | 3 |
|
|
|
| 11 | Container With Most Water | 3 | 2 |
|
|
|
| 12 | Integer to Roman | 3 | 4 |
|
|
|
| 13 | Roman to Integer | 2 | 4 |
|
|
|
| 14 | Longest Common Prefix | 2 | 1 |
|
|
|
| 15 | 3Sum | 3 | 5 |
|
|
|
| 16 | 3Sum Closest | 3 | 1 |
|
|
|
| 17 | Letter Combinations of a Phone Number | 3 | 3 |
|
|
|
| 18 | 4Sum | 3 | 2 |
|
|
|
| 19 | Remove Nth Node From End of List | 2 | 3 |
|
|
|
| 20 | Valid Parentheses | 2 | 5 |
|
|
|
| 21 | Merge Two Sorted Lists | 2 | 5 |
|
|
|
| 22 | Generate Parentheses | 3 | 4 |
|
|
|
| 23 | Merge k Sorted Lists | 3 | 4 |
|
|
|
| 24 | Swap Nodes in Pairs | 2 | 4 |
|
|
|
| 25 | Reverse Nodes in k-Group | 4 | 2 |
|
|
|
| 26 | Remove Duplicates from Sorted Array | 1 | 3 |
|
|
|
| 27 | Remove Element | 1 | 4 |
|
|
|
| 28 | Implement strStr() | 4 | 5 |
|
|
|
| 29 | Divide Two Integers | 4 | 3 |
|
|
|
| 30 | Substring with Concatenation of All Words | 3 | 1 |
|
|
|
| 31 | Next Permutation | 5 | 2 |
|
|
|
| 32 | Longest Valid Parentheses | 4 | 1 |
|
|
|
| 33 | Search in Rotated Sorted Array | 4 | 3 |
|
|
|
| 34 | Search for a Range | 4 | 3 |
|
|
|
| 35 | Search Insert Position | 2 | 2 |
|
|
|
| 36 | Valid Sudoku | 2 | 2 |
|
|
|
| 37 | Sudoku Solver | 4 | 2 |
|
|
|
| 38 | Count and Say | 2 | 1 |
|
|
|
| 39 | Combination Sum | 3 | 3 |
|
|
|
| 40 | Combination Sum II | 4 | 2 |
|
|
|
| 41 | First Missing Positive | 5 | 2 |
|
|
|
| 42 | Trapping Rain Water | 4 | 2 |
|
|
|
| 43 | Multiply Strings | 4 | 3 |
|
|
|
| 44 | Wildcard Matching | 5 | 3 |
|
|
|
| 45 | Jump Game II | 4 | 2 |
|
|
|
| 46 | Permutations | 3 | 4 |
|
|
|
| 47 | Permutations II | 4 | 2 |
|
|
|
| 48 | Rotate Image | 4 | 2 |
|
|
|
| 49 | Anagrams | 3 | 4 |
|
|
|
| 50 | Pow(x, n) | 3 | 5 |
|
|
|
| 51 | N-Queens | 4 | 3 |
|
|
|
| 52 | N-Queens II | 4 | 3 |
|
|
|
| 53 | Maximum Subarray | 3 | 3 |
|
|
|
| 54 | Spiral Matrix | 4 | 2 |
|
|
|
| 55 | Jump Game | 3 | 2 |
|
|
|
| 56 | Merge Intervals | 4 | 5 |
|
|
|
| 57 | Insert Interval | 4 | 5 |
|
|
|
| 58 | Length of Last Word | 1 | 1 |
|
|
|
| 59 | Spiral Matrix II | 3 | 2 |
|
|
|
| 60 | Permutation Sequence | 5 | 1 |
|
|
|
| 61 | Rotate List | 3 | 2 |
|
|
|
| 62 | Unique Paths | 2 | 3 |
|
|
|
| 63 | Unique Paths II | 3 | 3 |
|
|
|
| 64 | Minimum Path Sum | 3 | 3 |
|
|
|
| 65 | Valid Number | 2 | 5 |
|
|
|
| 66 | Plus One | 1 | 2 |
|
|
|
| 67 | Add Binary | 2 | 4 |
|
|
|
| 68 | Text Justification | 4 | 2 |
|
|
|
| 69 | Sqrt(x) | 4 | 4 |
|
|
|
| 70 | Climbing Stairs | 2 | 5 |
|
|
|
| 71 | Simplify Path | 3 | 1 |
|
|
|
| 72 | Edit Distance | 4 | 3 |
|
|
|
| 73 | Set Matrix Zeroes | 3 | 5 |
|
|
|
| 74 | Search a 2D Matrix | 3 | 3 |
|
|
|
| 75 | Sort Colors | 4 | 2 |
|
|
|
| 76 | Minimum Window Substring | 4 | 2 |
|
|
|
| 77 | Combinations | 3 | 4 |
|
|
|
| 78 | Subsets | 3 | 4 |
|
|
|
| 79 | Word Search | 3 | 4 |
|
|
|
| 80 | Remove Duplicates from Sorted Array II | 2 | 2 |
|
|
|
| 81 | Search in Rotated Sorted Array II | 5 | 3 |
|
|
|
| 82 | Remove Duplicates from Sorted List II | 3 | 3 |
|
|
|
| 83 | Remove Duplicates from Sorted List | 1 | 3 |
|
|
|
| 84 | Largest Rectangle in Histogram | 5 | 2 |
|
|
|
| 85 | Maximal Rectangle | 5 | 1 |
|
|
|
| 86 | Partition List | 3 | 3 |
|
|
|
| 87 | Scramble String | 5 | 2 |
|
|
|
| 88 | Merge Sorted Array | 2 | 5 |
|
|
|
| 89 | Gray Code | 4 | 2 |
|
|
|
| 90 | Subsets II | 4 | 2 |
|
|
|
| 91 | Decode Ways | 3 | 4 |
|
|
|
| 92 | Reverse Linked List II | 3 | 2 |
|
|
|
| 93 | Restore IP Addresses | 3 | 3 |
|
|
|
| 94 | Binary Tree Inorder Traversal | 4 | 3 |
|
|
|
| 95 | Unique Binary Search Trees II | 4 | 1 |
|
|
|
| 96 | Unique Binary Search Trees | 3 | 1 |
|
|
|
| 97 | Interleaving String | 5 | 2 |
|
|
|
| 98 | Validate Binary Search Tree | 3 | 5 |
|