有些题目没有，要么是进度还没到，要么就是付费题目没钱买，要么就是还没思路，我的进度。
| id | 标题 | 难度 | 语言 |
|---|---|---|---|
| 230 | Kth Smallest Element in a BST | Medium | [C++](./Algorithms/Medium/Kth Smallest Element in a BST.md) |
| 229 | Majority Element II | Medium | [C++](./Algorithms/Medium/Majority Element II.md) |
| 228 | Summary Ranges | Medium | [C++](./Algorithms/Medium/Summary Ranges.md) |
| 227 | Basic Calculator II | Medium | [C++](./Algorithms/Medium/Basic Calculator II.md) |
| 226 | Invert Binary Tree | Easy | [C++](./Algorithms/Easy/Invert Binary Tree.md) |
| 225 | Implement Stack using Queues | Easy | [C++](./Algorithms/Easy/Implement Stack using Queues.md) |
| 224 | Basic Calculator | Hard | [C++](./Algorithms/Hard/Basic Calculator.md) |
| 223 | Rectangle Area | Easy | [C++](./Algorithms/Easy/Rectangle Area.md) |
| 222 | Count Complete Tree Nodes | Medium | [C++](./Algorithms/Medium/Count Complete Tree Nodes.md) |
| 219 | Contains Duplicate II | Easy | [C++](./Algorithms/Easy/Contains Duplicate II.md) |
| 217 | Contains Duplicate | Easy | [C++](./Algorithms/Easy/Contains Duplicate.md) |
| 216 | Combination Sum III | Medium | [C++](./Algorithms/Medium/Combination Sum III.md) |
| 215 | Kth Largest Element in an Array | Medium | [C++](./Algorithms/Medium/Kth Largest Element in an Array.md) |
| 213 | House Robber II | Medium | [C++](./Algorithms/Medium/House Robber II.md) |
| 211 | Add and Search Word - Data structure design | Medium | [C++](./Algorithms/Medium/Add and Search Word - Data structure design.md) |
| 210 | Course Schedule II | Medium | [C++](./Algorithms/Medium/Course Schedule II.md) |
| 209 | Minimum Size Subarray Sum | Medium | [C++](./Algorithms/Medium/Minimum Size Subarray Sum.md) |
| 208 | Implement Trie (Prefix Tree) | Medium | [C++](./Algorithms/Medium/Implement Trie (Prefix Tree).md) |
| 207 | Course Schedule | Medium | [C++](./Algorithms/Medium/Course Schedule.md) |
| 206 | Reverse Linked List | Easy | [C++](./Algorithms/Easy/Reverse Linked List.md) |
| 205 | Isomorphic Strings | Easy | [C++](./Algorithms/Easy/Isomorphic Strings.md) |
| 204 | Count Primes | Easy | [C++](./Algorithms/Easy/Count Primes.md) |
| 203 | Remove Linked List Elements | Easy | [C++](./Algorithms/Easy/Remove Linked List Elements.md) |
| 202 | Happy Number | Easy | [C++](./Algorithms/Easy/Happy Number.md) |
| 201 | Bitwise AND of Numbers Range | Medium | [C++](./Algorithms/Medium/Bitwise AND of Numbers Range.md) |
| 199 | Binary Tree Right Side View | Medium | [C++](./Algorithms/Medium/Binary Tree Right Side View.md) |
| 198 | House Robber | Easy | [C++](./Algorithms/Easy/House Robber.md) |
| 196 | Delete Duplicate Emails | Easy | [Mysql](./Database/Easy/Delete Duplicate Emails.md) |
| 195 | Tenth Line | Easy | [Shell](./Shell/Easy/Tenth Line.md) |
| 193 | Valid Phone Numbers | Easy | [Shell](./Shell/Easy/Valid Phone Numbers.md) |
| 192 | Word Frequency | Medium | [Shell](./Shell/Medium/Word Frequency.md) |
| 191 | Number of 1 Bits | Easy | [C++](./Algorithms/Easy/Number of 1 Bits.md) |
| 190 | Reverse Bits | Easy | [C++](./Algorithms/Easy/Reverse Bits.md) |
| 189 | Rotate Array | Easy | [C++](./Algorithms/Easy/Rotate Array.md) |
| 187 | Repeated DNA Sequences | Medium | [C++](./Algorithms/Medium/Repeated DNA Sequences.md) |
| 186 | Reverse Words in a String II | Medium | 没钱买 |
| 184 | Department Highest Salary | Medium | [Mysql](./Database/Medium/Department Highest Salary.md) |
| 183 | Customers Who Never Order | Easy | [Mysql](./Database/Easy/Customers Who Never Order.md) |
| 182 | Duplicate Emails | Easy | [Mysql](./Database/Easy/Duplicate Emails.md) |
| 181 | Employees Earning More Than Their Managers | Easy | [Mysql](./Database/Easy/Employees Earning More Than Their Managers.md) |
| 180 | Consecutive Numbers | Medium | [Mysql](./Database/Medium/Consecutive Numbers.md) |
| 179 | Largest Number | Medium | [C++](./Algorithms/Medium/Largest Number.md) |
| 178 | Rank Scores | Medium | [Mysql](./Database/Medium/Rank Scores.md) |
| 177 | Nth Highest Salary | Medium | [Mysql](./Database/Medium/Nth Highest Salary.md) |
| 176 | Second Highest Salary | Easy | [Mysql](./Database/Easy/Second Highest Salary.md) |
| 175 | Combine Two Tables | Easy | [Mysql](./Database/Easy/Combine Two Tables.md) |
| 173 | Binary Search Tree Iterator | Medium | [C++](./Algorithms/Medium/Binary Search Tree Iterator.md) |
| 172 | Factorial Trailing Zeroes | Easy | [C++](./Algorithms/Easy/Factorial Trailing Zeroes.md) |
| 171 | Excel Sheet Column Number | Easy | [C++](./Algorithms/Easy/Excel Sheet Column Number.md) |
| 170 | Two Sum III - Data structure design | Easy | 没钱买 |
| 169 | Majority Element | Easy | [C++](./Algorithms/Easy/Majority Element.md) |
| 168 | Excel Sheet Column Title | Easy | [C++](./Algorithms/Easy/Excel Sheet Column Title.md) |
| 167 | Two Sum II - Input array is sorted | Medium | [C++](./Algorithms/Medium/Two Sum II - Input array is sorted.md) |
| 165 | Compare Version Numbers | Easy | [C++](./Algorithms/Easy/Compare Version Numbers.md) |
| 164 | Maximum Gap | Hard | [C++](./Algorithms/Hard/Maximum Gap.md) |
| 163 | Missing Ranges | Medium | 没钱买 |
| 162 | Find Peak Element | Medium | [C++](./Algorithms/Medium/Find Peak Element.md) |
| 161 | One Edit Distance | Medium | 没钱买 |
| 160 | Intersection of Two Linked Lists | Easy | [C++](./Algorithms/Easy/Intersection of Two Linked Lists.md) |
| 159 | Longest Substring with At Most Two Distinct Characters | Hard | 没钱买 |
| 158 | Read N Characters Given Read4 II - Call multiple times | Hard | 没钱买 |
| 157 | Read N Characters Given Read4 | Easy | 没钱买 |
| 156 | Binary Tree Upside Down | Medium | 没钱买 |
| 155 | Min Stack | Easy | [C++](./Algorithms/Easy/Min Stack.md) |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | [C++](./Algorithms/Hard/Find Minimum in Rotated Sorted Array II.md) |
| 153 | Find Minimum in Rotated Sorted Array | Medium | [C++](./Algorithms/Medium/Find Minimum in Rotated Sorted Array.md) |
| 152 | Maximum Product Subarray | Medium | [C++](./Algorithms/Medium/Maximum Product Subarray.md) |
| 151 | Reverse Words in a String | Medium | [C++](./Algorithms/Medium/Reverse Words in a String.md) |
| 150 | Evaluate Reverse Polish Notation | Medium | [C++](./Algorithms/Medium/Evaluate Reverse Polish Notation.md) |
| 149 | Max Points on a Line | Hard | [C++](./Algorithms/Hard/Max Points on a Line.md) |
| 148 | Sort List | Medium | [C++](./Algorithms/Medium/Sort List.md) |
| 147 | Insertion Sort List | Medium | [C++](./Algorithms/Medium/Insertion Sort List.md) |
| 145 | Binary Tree Postorder Traversal | Hard | [C++](./Algorithms/Hard/Binary Tree Postorder Traversal.md) |
| 144 | Binary Tree Preorder Traversal | Medium | [C++](./Algorithms/Medium/Binary Tree Preorder Traversal.md) |
| 143 | Reorder List | Medium | [C++](./Algorithms/Medium/Reorder List.md) |
| 142 | Linked List Cycle II | Medium | [C++](./Algorithms/Medium/Linked List Cycle II.md) |
| 141 | Linked List Cycle | Easy | [C++](./Algorithms/Easy/Linked List Cycle.md) |
| 140 | Word Break II | Hard | [C++](./Algorithms/Hard/Word Break II.md) |
| 139 | Word Break | Medium | [C++](./Algorithms/Medium/Word Break.md) |
| 137 | Single Number II | Medium | [C++](./Algorithms/Medium/Single Number II.md) |
| 136 | Single Number | Easy | [C++](./Algorithms/Easy/Single Number.md) |
| 135 | Candy | Hard | C++ |
| 134 | Gas Station | Medium | [C++](./Algorithms/Medium/Gas Station.md) |
| 131 | Palindrome Partitioning | Medium | [C++](./Algorithms/Medium/Palindrome Partitioning.md) |
| 129 | Sum Root to Leaf Numbers | Medium | [C++](./Algorithms/Medium/Sum Root to Leaf Numbers.md) |
| 125 | Valid Palindrome | Easy | [C++](./Algorithms/Easy/Valid Palindrome.md) |
| 122 | Best Time to Buy and Sell Stock II | Medium | [C++](./Algorithms/Medium/Best Time to Buy and Sell Stock II.md) |
| 121 | Best Time to Buy and Sell Stock | Easy | [C++](./Algorithms/Easy/Best Time to Buy and Sell Stock.md) |
| 120 | Triangle | Medium | C++ |
| 119 | Pascal's Triangle II | Easy | [C++](./Algorithms/Easy/Pascal's Triangle II.md) |
| 118 | Pascal's Triangle | Easy | [C++](./Algorithms/Easy/Pascal's Triangle.md) |
| 116 | Populating Next Right Pointers in Each Node | Medium | [C++](./Algorithms/Medium/Populating Next Right Pointers in Each Node.md) |
| 114 | Flatten Binary Tree to Linked List | Medium | [C++](./Algorithms/Medium/Flatten Binary Tree to Linked List.md) |
| 113 | Path Sum II | Medium | [C++](./Algorithms/Medium/Path Sum II.md) |
| 112 | Path Sum | Easy | [C++](./Algorithms/Easy/Path Sum.md) |
| 110 | Balanced Binary Tree | Easy | [C++](./Algorithms/Easy/Balanced Binary Tree.md) |
| 107 | Binary Tree Level Order Traversal II | Easy | [C++](./Algorithms/Easy/Binary Tree Level Order Traversal II.md) |
| 104 | Maximum Depth of Binary Tree | Easy | [C++](./Algorithms/Easy/Maximum Depth of Binary Tree.md) |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | [C++](./Algorithms/Medium/Binary Tree Zigzag Level Order Traversal.md) |
| 102 | Binary Tree Level Order Traversal | Easy | [C++](./Algorithms/Easy/Binary Tree Level Order Traversal.md) |
| 101 | Symmetric Tree | Easy | [C++](./Algorithms/Easy/Symmetric Tree.md) |
| 100 | Same Tree | Easy | [C++](./Algorithms/Easy/Same Tree.md) |
| 98 | Validate Binary Search Tree | Medium | [C++](./Algorithms/Medium/Validate Binary Search Tree.md) |
| 97 | Interleaving String | Hard | [C++](./Algorithms/Hard/Interleaving String.md) |
| 96 | Unique Binary Search Trees | Medium | [C++](./Algorithms/Medium/Unique Binary Search Trees.md) |
| 94 | Binary Tree Inorder Traversal | Medium | [C++](./Algorithms/Medium/Binary Tree Inorder Traversal.md) |
| 91 | Decode Ways | Medium | [C++](./Algorithms/Medium/Decode Ways.md) |
| 90 | Subsets II | Medium | [C++](./Algorithms/Medium/Subsets II.md) |
| 88 | Merge Sorted Array | Easy | [C++](./Algorithms/Easy/Merge Sorted Array.md) |
| 86 | Partition List | Medium | [C++](./Algorithms/Medium/Partition List.md) |
| 83 | Remove Duplicates from Sorted List | Easy | [C++](./Algorithms/Easy/Remove Duplicates from Sorted List.md) |
| 82 | Remove Duplicates from Sorted List II | Medium | [C++](./Algorithms/Medium/Remove Duplicates from Sorted List II.md) |
| 80 | Remove Duplicates from Sorted Array II | Medium | [C++](./Algorithms/Medium/Remove Duplicates from Sorted Array II.md) |
| 78 | Subsets | Medium | C++ |
| 77 | Combinations | Medium | C++ |
| 75 | Sort Colors | Medium | [C++](./Algorithms/Medium/Sort Colors.md) |
| 74 | Search a 2D Matrix | Medium | [C++](./Algorithms/Medium/Search a 2D Matrix.md) |
| 73 | Set Matrix Zeroes | Medium | [C++](./Algorithms/Medium/Set Matrix Zeroes.md) |
| 71 | Simplify Path | Medium | [C++](./Algorithms/Medium/Simplify Path.md) |
| 70 | Climbing Stairs | Easy | [C++](./Algorithms/Easy/Climbing Stairs.md) |
| 69 | Sqrt(x) | Medium | C++ |
| 67 | Add Binary | Easy | [C++](./Algorithms/Easy/Add Binary.md) |
| 66 | Plus One | Easy | [C++](./Algorithms/Easy/Plus One.md) |
| 64 | Minimum Path Sum | Medium | [C++](./Algorithms/Medium/Minimum Path Sum.md) |
| 63 | Unique Paths II | Medium | [C++](./Algorithms/Medium/Unique Paths II.md) |
| 62 | Unique Paths | Medium | [C++](./Algorithms/Medium/Unique Paths.md) |
| 61 | Rotate List | Medium | [C++](./Algorithms/Medium/Rotate List.md) |
| 60 | Permutation Sequence | Medium | [C++](./Algorithms/Medium/Permutation Sequence.md) |
| 59 | Spiral Matrix II | Medium | [C++](./Algorithms/Medium/Spiral Matrix II.md) |
| 58 | Length of Last Word | Easy | [C++](./Algorithms/Easy/Length of Last Word.md) |
| 56 | Merge Intervals | Hard | [C++](./Algorithms/Hard/Merge Intervals.md) |
| 57 | Insert Interval | Hard | [C++](./Algorithms/Hard/Insert Interval.md) |
| 55 | Jump Game | Medium | [C++](./Algorithms/Medium/Jump Game.md) |
| 54 | Spiral Matrix | Medium | [C++](./Algorithms/Medium/Spiral Matrix.md) |
| 53 | Maximum Subarray | Medium | [C++](./Algorithms/Medium/Maximum Subarray.md) |
| 52 | N-Queens II | Hard | [C++](./Algorithms/Hard/N-Queens II.md) |
| 51 | N-Queens | Hard | C++ |
| 50 | Pow(x, n) | Medium | [C++](./Algorithms/Medium/Pow(x, n).md) |
| 49 | Group Anagrams | Medium | [C++](./Algorithms/Medium/Group Anagrams.md) |
| 48 | Rotate Image | Medium | [C++](./Algorithms/Medium/Rotate Image.md) |
| 47 | Permutations II | Medium | [C++](./Algorithms/Medium/Permutations II.md) |
| 46 | Permutations | Medium | C++ |
| 45 | Jump Game II | Hard | [C++](./Algorithms/Hard/Jump Game II.md) |
| 42 | Trapping Rain Water | Hard | [C++](./Algorithms/Hard/Trapping Rain Water.md) |
| 41 | First Missing Positive | Hard | [C++](./Algorithms/Hard/First Missing Positive.md) |
| 40 | Combination Sum II | Medium | [C++](./Algorithms/Medium/Combination Sum II.md) |
| 39 | Combination Sum | Medium | [C++](./Algorithms/Medium/Combination Sum.md) |
| 36 | Valid Sudoku | Easy | [C++](./Algorithms/Easy/Valid Sudoku.md) |
| 35 | Search Insert Position | Medium | [C++](./Algorithms/Medium/Search Insert Position.md) |
| 34 | Search for a Range | Medium | [C++](./Algorithms/Medium/Search for a Range.md) |
| 31 | Next Permutation | Medium | [C++](./Algorithms/Medium/Next Permutation.md) |
| 28 | Implement strStr() | Easy | [C++](./Algorithms/Easy/Implement strStr().md) |
| 27 | Remove Element | Easy | [C++](./Algorithms/Easy/Remove Element.md) |
| 26 | Remove Duplicates from Sorted Array | Easy | [C++](./Algorithms/Easy/Remove Duplicates from Sorted Array.md) |
| 25 | Reverse Nodes in k-Group | Hard | [C++](./Algorithms/Hard/Reverse Nodes in k-Group.md) |
| 24 | Swap Nodes in Pairs | Easy | [C++](./Algorithms/Easy/Swap Nodes in Pairs.md) |
| 23 | Merge k Sorted Lists | Hard | [C++](./Algorithms/Hard/Merge k Sorted Lists.md) |
| 22 | Generate Parentheses | Medium | [C++](./Algorithms/Medium/Generate Parentheses.md) |
| 21 | Merge Two Sorted Lists | Easy | [C++](./Algorithms/Easy/Merge Two Sorted Lists.md) |
| 20 | Valid Parentheses | Easy | [C++](./Algorithms/Easy/Valid Parentheses.md) |
| 19 | Remove Nth Node From End of List | Easy | [C++](./Algorithms/Easy/Remove Nth Node From End of List.md) |
| 18 | 4Sum | Medium | C++ |
| 17 | Letter Combinations of a Phone Number | Medium | [C++](./Algorithms/Medium/Letter Combinations of a Phone Number.md) |
| 16 | 3Sum Closest | Medium | [C++](./Algorithms/Medium/3Sum Closest.md) |
| 15 | 3Sum | Medium | C++ |
| 14 | Longest Common Prefix | Easy | [C++](./Algorithms/Easy/Longest Common Prefix.md) |
| 13 | Roman to Integer | Easy | [C++](./Algorithms/Easy/Roman to Integer.md) |
| 12 | Integer to Roman | Medium | [C++](./Algorithms/Medium/Integer to Roman.md) |
| 11 | Container With Most Water | Medium | [C++](./Algorithms/Medium/Container With Most Water.md) |
| 10 | Regular Expression Matching | Hard | [C++](./Algorithms/Hard/Regular Expression Matching.md) |
| 9 | Palindrome Number | Easy | [C++](./Algorithms/Easy/Palindrome Number.md) |
| 8 | String to Integer | Easy | [C++](./Algorithms/Easy/String to Integer.md) |
| 7 | Reverse Integer | Easy | [C++](./Algorithms/Easy/Reverse Integer.md) |
| 6 | ZigZag Conversion | Easy | [C++](./Algorithms/Easy/ZigZag Conversion.md) |
| 5 | Longest Palindromic Substring | Medium | [C++](./Algorithms/Medium/Longest Palindromic Substring.md) |
| 3 | Longest Substring Without Repeating Characters | Medium | [C++](./Algorithms/Medium/Longest Substring Without Repeating Characters.md) |
| 2 | Add Two Numbers | Medium | [C++](./Algorithms/Medium/Add Two Numbers.md) |
| 1 | Two Sum | Easy | [C++](./Algorithms/Easy/Two Sum.md) |