Until 2019-05-14 22:38:33, I have solved 107 / 850 problems while 0 are still locked.
Completion statistic:
- JavaScript: 0
- Python: 0
- C++: 114
- Java: 0
Note: đź”’ means you need to buy a book from LeetCode
| ID | Title | Difficulty | JavaScript | Python | C++ | Java |
|---|---|---|---|---|---|---|
| 001 | Two Sum | Easy | To Do | To Do | C++ | To Do |
| 002 | Add Two Numbers | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/002.%20Add%20Two%20Number\02.Add Two Number.cpp) | To Do |
| 003 | Longest Substring Without Repeating Characters | Medium | To Do | To Do | C++ | To Do |
| 004 | Median of Two Sorted Arrays | Hard | To Do | To Do | To Do | To Do |
| 005 | Longest Palindromic Substring | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/005.%20Longest%20Palindromic%20Substrin\5. Longest Palindromic Substring.cpp) | To Do |
| 006 | ZigZag Conversion | Medium | To Do | To Do | To Do | To Do |
| 007 | Reverse Integer | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/007.%20Reverse%20Intege\7.Reverse Integer.cpp) | To Do |
| 008 | String to Integer (atoi) | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/008.%20String%20to%20Integer%20(atoi\String to Integer (atoi).cpp) | To Do |
| 009 | Palindrome Number | Easy | To Do | To Do | To Do | To Do |
| 010 | Regular Expression Matching | Hard | To Do | To Do | To Do | To Do |
| 011 | Container With Most Water | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/011.%20Container%20With%20Most%20Wate\011. Container With Most Water.cpp) | To Do |
| 012 | Integer to Roman | Medium | To Do | To Do | To Do | To Do |
| 013 | Roman to Integer | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/013.%20Roman%20to%20Intege\13. Roman to Integer.cpp) | To Do |
| 014 | Longest Common Prefix | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/014.%20Longest%20Common%20Prefi\14Longest Common Prefix.cpp) | To Do |
| 015 | 3Sum | Medium | To Do | To Do | C++ | To Do |
| 016 | 3Sum Closest | Medium | To Do | To Do | To Do | To Do |
| 017 | Letter Combinations of a Phone Number | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/017.%20Letter%20Combinations%20of%20a%20Phone%20Numbe\17. Letter Combinations of a Phone Number.cpp) | To Do |
| 018 | 4Sum | Medium | To Do | To Do | To Do | To Do |
| 019 | Remove Nth Node From End of List | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/019.%20Remove%20Nth%20Node%20From%20End%20of%20Lis\19.Remove Nth Node From End of List.cpp) | To Do |
| 020 | Valid Parentheses | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/020.%20Valid%20Parenthese\20. Valid Parentheses.cpp) | To Do |
| 021 | Merge Two Sorted Lists | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/021.%20Merge%20Two%20Sorted%20List\21.Merge Two Sorted Lists.cpp) | To Do |
| 022 | Generate Parentheses | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/022.%20Generate%20Parenthese\022. Generate Parenthese.cpp) | To Do |
| 023 | Merge k Sorted Lists | Hard | To Do | To Do | To Do | To Do |
| 024 | Swap Nodes in Pairs | Medium | To Do | To Do | To Do | To Do |
| 025 | Reverse Nodes in k-Group | Hard | To Do | To Do | To Do | To Do |
| 026 | Remove Duplicates from Sorted Array | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/026.%20Remove%20Duplicates%20from%20Sorted%20Arra\26.Remove Duplicates from Sorted Array.cpp) | To Do |
| 027 | Remove Element | Easy | To Do | To Do | To Do | To Do |
| 028 | Implement strStr() | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/028.%20Implement%20strStr(\28.Implement strStr().cpp) | To Do |
| 029 | Divide Two Integers | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/029.%20Divide%20Two%20Integer\029. Divide Two Integer.cpp) | To Do |
| 030 | Substring with Concatenation of All Words | Hard | To Do | To Do | To Do | To Do |
| 031 | Next Permutation | Medium | To Do | To Do | To Do | To Do |
| 032 | Longest Valid Parentheses | Hard | To Do | To Do | To Do | To Do |
| 033 | Search in Rotated Sorted Array | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/033.%20Search%20in%20Rotated%20Sorted%20Arra\033. Search in Rotated Sorted Array.cpp) | To Do |
| 034 | Find First and Last Position of Element in Sorted Array | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Arra\034. Find First and Last Position of Element in Sorted Array.cpp) | To Do |
| 035 | Search Insert Position | Easy | To Do | To Do | To Do | To Do |
| 036 | Valid Sudoku | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/036.%20Valid%20Sudok\036. Valid Sudok.cpp) | To Do |
| 037 | Sudoku Solver | Hard | To Do | To Do | To Do | To Do |
| 038 | Count and Say | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/038.%20Count%20and%20Sa\38.Count and Say.cpp) | To Do |
| 039 | Combination Sum | Medium | To Do | To Do | To Do | To Do |
| 040 | Combination Sum II | Medium | To Do | To Do | To Do | To Do |
| 041 | First Missing Positive | Hard | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/041.%20First%20Missing%20Positiv\41. First Missing Positive.cpp) | To Do |
| 042 | Trapping Rain Water | Hard | To Do | To Do | To Do | To Do |
| 043 | Multiply Strings | Medium | To Do | To Do | To Do | To Do |
| 044 | Wildcard Matching | Hard | To Do | To Do | To Do | To Do |
| 045 | Jump Game II | Hard | To Do | To Do | To Do | To Do |
| 046 | Permutations | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/046.%20Permutation\46. Permutations.cpp) | To Do |
| 047 | Permutations II | Medium | To Do | To Do | To Do | To Do |
| 048 | Rotate Image | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/048.%20Rotate%20Imag\48. Rotate Image.cpp) | To Do |
| 049 | Group Anagrams | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/049.%20Group%20Anagram\49. Group Anagrams.cpp) | To Do |
| 050 | Pow(x, n) | Medium | To Do | To Do | C++ | To Do |
| 051 | N-Queens | Hard | To Do | To Do | To Do | To Do |
| 052 | N-Queens II | Hard | To Do | To Do | To Do | To Do |
| 053 | Maximum Subarray | Easy | To Do | To Do | C++ | To Do |
| 054 | Spiral Matrix | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/054.%20Spiral%20Matrix\54. Spiral Matrix.cpp) | To Do |
| 055 | Jump Game | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/055.%20Jump%20Game\055. Jump Game.cpp) | To Do |
| 056 | Merge Intervals | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/056.%20Merge%20Interval\056. Merge Interval.cpp) | To Do |
| 057 | Insert Interval | Hard | To Do | To Do | To Do | To Do |
| 058 | Length of Last Word | Easy | To Do | To Do | To Do | To Do |
| 059 | Spiral Matrix II | Medium | To Do | To Do | To Do | To Do |
| 060 | Permutation Sequence | Medium | To Do | To Do | To Do | To Do |
| 061 | Rotate List | Medium | To Do | To Do | To Do | To Do |
| 062 | Unique Paths | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/062.%20Unique%20Path\062. Unique Path(2).cpp) | To Do |
| 063 | Unique Paths II | Medium | To Do | To Do | To Do | To Do |
| 064 | Minimum Path Sum | Medium | To Do | To Do | To Do | To Do |
| 065 | Valid Number | Hard | To Do | To Do | To Do | To Do |
| 066 | Plus One | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/066.%20Plus%20On\66.Plus One.cpp) | To Do |
| 067 | Add Binary | Easy | To Do | To Do | To Do | To Do |
| 068 | Text Justification | Hard | To Do | To Do | To Do | To Do |
| 069 | Sqrt(x) | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/069.%20Sqrt(x)\069. Sqrt(x).cpp) | To Do |
| 070 | Climbing Stairs | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/070.%20Climbing%20Stair\70. Climbing Stairs.cpp) | To Do |
| 071 | Simplify Path | Medium | To Do | To Do | To Do | To Do |
| 072 | Edit Distance | Hard | To Do | To Do | To Do | To Do |
| 073 | Set Matrix Zeroes | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/073.%20Set%20Matrix%20Zeroe\73. Set Matrix Zeroes.cpp) | To Do |
| 074 | Search a 2D Matrix | Medium | To Do | To Do | To Do | To Do |
| 075 | Sort Colors | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/075.%20Sort%20Color\075. Sort Color.cpp) | To Do |
| 076 | Minimum Window Substring | Hard | To Do | To Do | To Do | To Do |
| 077 | Combinations | Medium | To Do | To Do | To Do | To Do |
| 078 | Subsets | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/078.%20Subset\078. Subset.cpp) | To Do |
| 079 | Word Search | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/079.%20Word%20Searc\79.Word Search.cpp) | To Do |
| 080 | Remove Duplicates from Sorted Array II | Medium | To Do | To Do | To Do | To Do |
| 081 | Search in Rotated Sorted Array II | Medium | To Do | To Do | To Do | To Do |
| 082 | Remove Duplicates from Sorted List II | Medium | To Do | To Do | To Do | To Do |
| 083 | Remove Duplicates from Sorted List | Easy | To Do | To Do | To Do | To Do |
| 084 | Largest Rectangle in Histogram | Hard | To Do | To Do | To Do | To Do |
| 085 | Maximal Rectangle | Hard | To Do | To Do | To Do | To Do |
| 086 | Partition List | Medium | To Do | To Do | To Do | To Do |
| 087 | Scramble String | Hard | To Do | To Do | To Do | To Do |
| 088 | Merge Sorted Array | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/088.%20Merge%20Sorted%20Arra\88. Merge Sorted Array.cpp) | To Do |
| 089 | Gray Code | Medium | To Do | To Do | To Do | To Do |
| 090 | Subsets II | Medium | To Do | To Do | To Do | To Do |
| 091 | Decode Ways | Medium | To Do | To Do | To Do | To Do |
| 092 | Reverse Linked List II | Medium | To Do | To Do | To Do | To Do |
| 093 | Restore IP Addresses | Medium | To Do | To Do | To Do | To Do |
| 094 | Binary Tree Inorder Traversal | Medium | To Do | To Do | To Do | To Do |
| 095 | Unique Binary Search Trees II | Medium | To Do | To Do | To Do | To Do |
| 096 | Unique Binary Search Trees | Medium | To Do | To Do | To Do | To Do |
| 097 | Interleaving String | Hard | To Do | To Do | To Do | To Do |
| 098 | Validate Binary Search Tree | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/098.%20Validate%20Binary%20Search%20Tre\98. Validate Binary Search Tree.cpp) | To Do |
| 099 | Recover Binary Search Tree | Hard | To Do | To Do | To Do | To Do |
| 100 | Same Tree | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/1002.%20Find%20Common%20Character\1002. Find Common Character.cpp) | To Do |
| 101 | Symmetric Tree | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/101.%20Symmetric%20Tre\101.Symmetric Tree(iteration).cpp) | To Do |
| 102 | Binary Tree Level Order Traversal | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/102.%20Binary%20Tree%20Level%20Order%20Traversa\102. Binary Tree Level Order Traversal.cpp) | To Do |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | To Do | To Do | To Do | To Do |
| 104 | Maximum Depth of Binary Tree | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/104.%20Maximum%20Depth%20of%20Binary%20Tre\104. Maximum Depth of Binary Tree.cpp) | To Do |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversa\105. Construct Binary Tree from Preorder and Inorder Traversal.cpp) | To Do |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | To Do | To Do | To Do | To Do |
| 107 | Binary Tree Level Order Traversal II | Easy | To Do | To Do | To Do | To Do |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tre\108. Convert Sorted Array to Binary Search Tree.cpp) | To Do |
| 109 | Convert Sorted List to Binary Search Tree | Medium | To Do | To Do | To Do | To Do |
| 110 | Balanced Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 111 | Minimum Depth of Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 112 | Path Sum | Easy | To Do | To Do | To Do | To Do |
| 113 | Path Sum II | Medium | To Do | To Do | To Do | To Do |
| 114 | Flatten Binary Tree to Linked List | Medium | To Do | To Do | To Do | To Do |
| 115 | Distinct Subsequences | Hard | To Do | To Do | To Do | To Do |
| 116 | Populating Next Right Pointers in Each Node | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Nod\116. Populating Next Right Pointers in Each Node.cpp) | To Do |
| 117 | Populating Next Right Pointers in Each Node II | Medium | To Do | To Do | To Do | To Do |
| 118 | Pascal's Triangle | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/118.%20Pascal's%20Triangl\118. Pascal's Triangle.cpp) | To Do |
| 119 | Pascal's Triangle II | Easy | To Do | To Do | To Do | To Do |
| 120 | Triangle | Medium | To Do | To Do | To Do | To Do |
| 121 | Best Time to Buy and Sell Stock | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stoc\121. Best Time to Buy and Sell Stock.cpp) | To Do |
| 122 | Best Time to Buy and Sell Stock II | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II\Best Time to Buy and Sell Stock II.cpp) | To Do |
| 123 | Best Time to Buy and Sell Stock III | Hard | To Do | To Do | To Do | To Do |
| 124 | Binary Tree Maximum Path Sum | Hard | To Do | To Do | To Do | To Do |
| 125 | Valid Palindrome | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/125.%20Valid%20Palindrom\125. Valid Palindrome.cpp) | To Do |
| 126 | Word Ladder II | Hard | To Do | To Do | To Do | To Do |
| 127 | Word Ladder | Medium | To Do | To Do | To Do | To Do |
| 128 | Longest Consecutive Sequence | Hard | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/128.%20Longest%20Consecutive%20Sequenc\128. Longest Consecutive Sequence.cpp) | To Do |
| 129 | Sum Root to Leaf Numbers | Medium | To Do | To Do | To Do | To Do |
| 130 | Surrounded Regions | Medium | To Do | To Do | To Do | To Do |
| 131 | Palindrome Partitioning | Medium | To Do | To Do | To Do | To Do |
| 132 | Palindrome Partitioning II | Hard | To Do | To Do | To Do | To Do |
| 133 | Clone Graph | Medium | To Do | To Do | To Do | To Do |
| 134 | Gas Station | Medium | To Do | To Do | To Do | To Do |
| 135 | Candy | Hard | To Do | To Do | To Do | To Do |
| 136 | Single Number | Easy | To Do | To Do | C++ | To Do |
| 137 | Single Number II | Medium | To Do | To Do | To Do | To Do |
| 138 | Copy List with Random Pointer | Medium | To Do | To Do | To Do | To Do |
| 139 | Word Break | Medium | To Do | To Do | To Do | To Do |
| 140 | Word Break II | Hard | To Do | To Do | To Do | To Do |
| 141 | Linked List Cycle | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/141.%20Linked%20List%20Cycl\141. Linked List Cycle.cpp) | To Do |
| 142 | Linked List Cycle II | Medium | To Do | To Do | To Do | To Do |
| 143 | Reorder List | Medium | To Do | To Do | To Do | To Do |
| 144 | Binary Tree Preorder Traversal | Medium | To Do | To Do | To Do | To Do |
| 145 | Binary Tree Postorder Traversal | Hard | To Do | To Do | To Do | To Do |
| 146 | LRU Cache | Hard | To Do | To Do | To Do | To Do |
| 147 | Insertion Sort List | Medium | To Do | To Do | To Do | To Do |
| 148 | Sort List | Medium | To Do | To Do | To Do | To Do |
| 149 | Max Points on a Line | Hard | To Do | To Do | To Do | To Do |
| 150 | Evaluate Reverse Polish Notation | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/150.%20Evaluate%20Reverse%20Polish%20Notatio\150. Evaluate Reverse Polish Notation.cpp) | To Do |
| 151 | Reverse Words in a String | Medium | To Do | To Do | To Do | To Do |
| 152 | Maximum Product Subarray | Medium | To Do | To Do | To Do | To Do |
| 153 | Find Minimum in Rotated Sorted Array | Medium | To Do | To Do | To Do | To Do |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | To Do | To Do | To Do | To Do |
| 155 | Min Stack | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/155.%20Min%20Stac\155. Min Stack.cpp) | To Do |
| 160 | Intersection of Two Linked Lists | Easy | To Do | To Do | To Do | To Do |
| 162 | Find Peak Element | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/162.%20Find%20Peak%20Elemen\162. Find Peak Elemen.cpp) | To Do |
| 164 | Maximum Gap | Hard | To Do | To Do | To Do | To Do |
| 165 | Compare Version Numbers | Medium | To Do | To Do | To Do | To Do |
| 166 | Fraction to Recurring Decimal | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/166.%20Fraction%20to%20Recurring%20Decima\166. Fraction to Recurring Decimal.cpp) | To Do |
| 167 | Two Sum II - Input array is sorted | Easy | To Do | To Do | To Do | To Do |
| 168 | Excel Sheet Column Title | Easy | To Do | To Do | To Do | To Do |
| 169 | Majority Element | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/169.%20Majority%20Element\169. Majority Element.cpp) | To Do |
| 171 | Excel Sheet Column Number | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/171.%20Excel%20Sheet%20Column%20Number\171. Excel Sheet Column Number.cpp) | To Do |
| 172 | Factorial Trailing Zeroes | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/172.%20Factorial%20Trailing%20Zeroe\172. Factorial Trailing Zeroe.cpp) | To Do |
| 173 | Binary Search Tree Iterator | Medium | To Do | To Do | To Do | To Do |
| 174 | Dungeon Game | Hard | To Do | To Do | To Do | To Do |
| 179 | Largest Number | Medium | To Do | To Do | To Do | To Do |
| 187 | Repeated DNA Sequences | Medium | To Do | To Do | To Do | To Do |
| 188 | Best Time to Buy and Sell Stock IV | Hard | To Do | To Do | To Do | To Do |
| 189 | Rotate Array | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/189.%20Rotate%20Arra\189. Rotate Array.cpp) | To Do |
| 190 | Reverse Bits | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/190.%20Reverse%20Bit\190. Reverse Bit.cpp) | To Do |
| 191 | Number of 1 Bits | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/191.%20Number%20of%201%20Bit\191. Number of 1 Bit.cpp) | To Do |
| 198 | House Robber | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/198.%20House%20Robbe\198. House Robber.cpp) | To Do |
| 199 | Binary Tree Right Side View | Medium | To Do | To Do | To Do | To Do |
| 200 | Number of Islands | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/200.%20Number%20of%20Island\200. Number of Island.cpp) | To Do |
| 201 | Bitwise AND of Numbers Range | Medium | To Do | To Do | To Do | To Do |
| 202 | Happy Number | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/202.%20Happy%20Numbe\202.Happy Number.cpp) | To Do |
| 203 | Remove Linked List Elements | Easy | To Do | To Do | To Do | To Do |
| 204 | Count Primes | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/204.%20Count%20Prime\204. Count Primes.cpp) | To Do |
| 205 | Isomorphic Strings | Easy | To Do | To Do | To Do | To Do |
| 206 | Reverse Linked List | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/206.%20Reverse%20Linked%20Lis\206.Reverse Linked List(2).cpp) | To Do |
| 207 | Course Schedule | Medium | To Do | To Do | To Do | To Do |
| 208 | Implement Trie (Prefix Tree) | Medium | To Do | To Do | To Do | To Do |
| 209 | Minimum Size Subarray Sum | Medium | To Do | To Do | To Do | To Do |
| 210 | Course Schedule II | Medium | To Do | To Do | To Do | To Do |
| 211 | Add and Search Word - Data structure design | Medium | To Do | To Do | To Do | To Do |
| 212 | Word Search II | Hard | To Do | To Do | To Do | To Do |
| 213 | House Robber II | Medium | To Do | To Do | To Do | To Do |
| 214 | Shortest Palindrome | Hard | To Do | To Do | To Do | To Do |
| 215 | Kth Largest Element in an Array | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/215.%20Kth%20Largest%20Element%20in%20an%20Arra\215. Kth Largest Element in an Array.cpp) | To Do |
| 216 | Combination Sum III | Medium | To Do | To Do | To Do | To Do |
| 217 | Contains Duplicate | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/217.%20Contains%20Duplicat\217. Contains Duplicate.cpp) | To Do |
| 218 | The Skyline Problem | Hard | To Do | To Do | To Do | To Do |
| 219 | Contains Duplicate II | Easy | To Do | To Do | To Do | To Do |
| 220 | Contains Duplicate III | Medium | To Do | To Do | To Do | To Do |
| 221 | Maximal Square | Medium | To Do | To Do | To Do | To Do |
| 222 | Count Complete Tree Nodes | Medium | To Do | To Do | To Do | To Do |
| 223 | Rectangle Area | Medium | To Do | To Do | To Do | To Do |
| 224 | Basic Calculator | Hard | To Do | To Do | To Do | To Do |
| 225 | Implement Stack using Queues | Easy | To Do | To Do | To Do | To Do |
| 226 | Invert Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 227 | Basic Calculator II | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/227.%20Basic%20Calculator%20Il\227. Basic Calculator II.cpp) | To Do |
| 228 | Summary Ranges | Medium | To Do | To Do | To Do | To Do |
| 229 | Majority Element II | Medium | To Do | To Do | To Do | To Do |
| 230 | Kth Smallest Element in a BST | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/230.%20Kth%20Smallest%20Element%20in%20a%20BS\230.Kth Smallest Element in a BST.cpp) | To Do |
| 231 | Power of Two | Easy | To Do | To Do | To Do | To Do |
| 232 | Implement Queue using Stacks | Easy | To Do | To Do | To Do | To Do |
| 233 | Number of Digit One | Hard | To Do | To Do | To Do | To Do |
| 234 | Palindrome Linked List | Easy | To Do | To Do | C++ | To Do |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Easy | To Do | To Do | To Do | To Do |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 237 | Delete Node in a Linked List | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/237.%20Delete%20Node%20in%20a%20Linked%20Lis\237.Delete Node in a Linked List.cpp) | To Do |
| 238 | Product of Array Except Self | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/238.%20Product%20of%20Array%20Except%20Self\238. Product of Array Except Self.cpp) | To Do |
| 239 | Sliding Window Maximum | Hard | To Do | To Do | To Do | To Do |
| 240 | Search a 2D Matrix II | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/240.%20Search%20a%202D%20Matrix%20II\240. Search a 2D Matrix II.cpp) | To Do |
| 241 | Different Ways to Add Parentheses | Medium | To Do | To Do | To Do | To Do |
| 242 | Valid Anagram | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/242.%20Valid%20Anagra\242. Valid Anagram.cpp) | To Do |
| 257 | Binary Tree Paths | Easy | To Do | To Do | To Do | To Do |
| 258 | Add Digits | Easy | To Do | To Do | To Do | To Do |
| 260 | Single Number III | Medium | To Do | To Do | To Do | To Do |
| 263 | Ugly Number | Easy | To Do | To Do | To Do | To Do |
| 264 | Ugly Number II | Medium | To Do | To Do | To Do | To Do |
| 268 | Missing Number | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/268.%20Missing%20Numbe\268. Missing Number.cpp) | To Do |
| 273 | Integer to English Words | Hard | To Do | To Do | To Do | To Do |
| 274 | H-Index | Medium | To Do | To Do | To Do | To Do |
| 275 | H-Index II | Medium | To Do | To Do | To Do | To Do |
| 278 | First Bad Version | Easy | To Do | To Do | C++ | To Do |
| 279 | Perfect Squares | Medium | To Do | To Do | To Do | To Do |
| 282 | Expression Add Operators | Hard | To Do | To Do | To Do | To Do |
| 283 | Move Zeroes | Easy | To Do | To Do | C++ | To Do |
| 284 | Peeking Iterator | Medium | To Do | To Do | To Do | To Do |
| 287 | Find the Duplicate Number | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/287.%20Find%20the%20Duplicate%20Numbe\287. Find the Duplicate Number.cpp) | To Do |
| 289 | Game of Life | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/289.%20Game%20of%20Lif\289.Game of Life.cpp) | To Do |
| 290 | Word Pattern | Easy | To Do | To Do | To Do | To Do |
| 292 | Nim Game | Easy | To Do | To Do | To Do | To Do |
| 295 | Find Median from Data Stream | Hard | To Do | To Do | To Do | To Do |
| 297 | Serialize and Deserialize Binary Tree | Hard | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/297.%20Serialize%20and%20Deserialize%20Binary%20Tre\297. Serialize and Deserialize Binary Tree.cpp) | To Do |
| 299 | Bulls and Cows | Medium | To Do | To Do | To Do | To Do |
| 300 | Longest Increasing Subsequence | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/300.%20Longest%20Increasing%20Subsequence\300. Longest Increasing Subsequence.cpp) | To Do |
| 301 | Remove Invalid Parentheses | Hard | To Do | To Do | To Do | To Do |
| 303 | Range Sum Query - Immutable | Easy | To Do | To Do | To Do | To Do |
| 304 | Range Sum Query 2D - Immutable | Medium | To Do | To Do | To Do | To Do |
| 306 | Additive Number | Medium | To Do | To Do | To Do | To Do |
| 307 | Range Sum Query - Mutable | Medium | To Do | To Do | To Do | To Do |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | To Do | To Do | To Do | To Do |
| 310 | Minimum Height Trees | Medium | To Do | To Do | To Do | To Do |
| 312 | Burst Balloons | Hard | To Do | To Do | To Do | To Do |
| 313 | Super Ugly Number | Medium | To Do | To Do | To Do | To Do |
| 315 | Count of Smaller Numbers After Self | Hard | To Do | To Do | To Do | To Do |
| 316 | Remove Duplicate Letters | Hard | To Do | To Do | To Do | To Do |
| 318 | Maximum Product of Word Lengths | Medium | To Do | To Do | To Do | To Do |
| 319 | Bulb Switcher | Medium | To Do | To Do | To Do | To Do |
| 321 | Create Maximum Number | Hard | To Do | To Do | To Do | To Do |
| 322 | Coin Change | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/322.%20Coin%20Change\322. Coin Change.cpp) | To Do |
| 324 | Wiggle Sort II | Medium | To Do | To Do | To Do | To Do |
| 326 | Power of Three | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/326.%20Power%20of%20Thre\326.Power of Three.cpp) | To Do |
| 327 | Count of Range Sum | Hard | To Do | To Do | To Do | To Do |
| 328 | Odd Even Linked List | Medium | To Do | To Do | To Do | To Do |
| 329 | Longest Increasing Path in a Matrix | Hard | To Do | To Do | To Do | To Do |
| 330 | Patching Array | Hard | To Do | To Do | To Do | To Do |
| 331 | Verify Preorder Serialization of a Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 332 | Reconstruct Itinerary | Medium | To Do | To Do | To Do | To Do |
| 334 | Increasing Triplet Subsequence | Medium | To Do | To Do | C++ | To Do |
| 335 | Self Crossing | Hard | To Do | To Do | To Do | To Do |
| 336 | Palindrome Pairs | Hard | To Do | To Do | To Do | To Do |
| 337 | House Robber III | Medium | To Do | To Do | To Do | To Do |
| 338 | Counting Bits | Medium | To Do | To Do | To Do | To Do |
| 341 | Flatten Nested List Iterator | Medium | To Do | To Do | To Do | To Do |
| 342 | Power of Four | Easy | To Do | To Do | To Do | To Do |
| 343 | Integer Break | Medium | To Do | To Do | To Do | To Do |
| 344 | Reverse String | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/344.%20Reverse%20Strin\344. Reverse String.cpp) | To Do |
| 345 | Reverse Vowels of a String | Easy | To Do | To Do | To Do | To Do |
| 347 | Top K Frequent Elements | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/347.%20Top%20K%20Frequent%20Element\347. Top K Frequent Element.cpp) | To Do |
| 349 | Intersection of Two Arrays | Easy | To Do | To Do | To Do | To Do |
| 350 | Intersection of Two Arrays II | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/350.%20Intersection%20of%20Two%20Arrays%20II\350. Intersection of Two Arrays II.cpp) | To Do |
| 352 | Data Stream as Disjoint Intervals | Hard | To Do | To Do | To Do | To Do |
| 354 | Russian Doll Envelopes | Hard | To Do | To Do | To Do | To Do |
| 355 | Design Twitter | Medium | To Do | To Do | To Do | To Do |
| 357 | Count Numbers with Unique Digits | Medium | To Do | To Do | To Do | To Do |
| 363 | Max Sum of Rectangle No Larger Than K | Hard | To Do | To Do | To Do | To Do |
| 365 | Water and Jug Problem | Medium | To Do | To Do | To Do | To Do |
| 367 | Valid Perfect Square | Easy | To Do | To Do | To Do | To Do |
| 368 | Largest Divisible Subset | Medium | To Do | To Do | To Do | To Do |
| 371 | Sum of Two Integers | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/371.%20Sum%20of%20Two%20Integer\371. Sum of Two Integer.cpp) | To Do |
| 372 | Super Pow | Medium | To Do | To Do | To Do | To Do |
| 373 | Find K Pairs with Smallest Sums | Medium | To Do | To Do | To Do | To Do |
| 374 | Guess Number Higher or Lower | Easy | To Do | To Do | To Do | To Do |
| 375 | Guess Number Higher or Lower II | Medium | To Do | To Do | To Do | To Do |
| 376 | Wiggle Subsequence | Medium | To Do | To Do | To Do | To Do |
| 377 | Combination Sum IV | Medium | To Do | To Do | To Do | To Do |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | To Do | To Do | To Do | To Do |
| 380 | Insert Delete GetRandom O(1) | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/380.%20Insert%20Delete%20GetRandom%20O(1)\380. Insert Delete GetRandom O(1).cpp) | To Do |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/381.%20Insert%20Delete%20GetRandom%20O(1)%20-%20Duplicates%20allowe\381. Insert Delete GetRandom O(1) - Duplicates allowed.cpp) | To Do |
| 382 | Linked List Random Node | Medium | To Do | To Do | To Do | To Do |
| 383 | Ransom Note | Easy | To Do | To Do | To Do | To Do |
| 384 | Shuffle an Array | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/384.%20Shuffle%20an%20Arra\384.Shuffle an Array.cpp) | To Do |
| 385 | Mini Parser | Medium | To Do | To Do | To Do | To Do |
| 386 | Lexicographical Numbers | Medium | To Do | To Do | To Do | To Do |
| 387 | First Unique Character in a String | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/387.%20First%20Unique%20Character%20in%20a%20Strin\387.First Unique Character in a String.cpp) | To Do |
| 388 | Longest Absolute File Path | Medium | To Do | To Do | To Do | To Do |
| 389 | Find the Difference | Easy | To Do | To Do | To Do | To Do |
| 390 | Elimination Game | Medium | To Do | To Do | To Do | To Do |
| 391 | Perfect Rectangle | Hard | To Do | To Do | To Do | To Do |
| 392 | Is Subsequence | Medium | To Do | To Do | To Do | To Do |
| 393 | UTF-8 Validation | Medium | To Do | To Do | To Do | To Do |
| 394 | Decode String | Medium | To Do | To Do | To Do | To Do |
| 395 | Longest Substring with At Least K Repeating Characters | Medium | To Do | To Do | To Do | To Do |
| 396 | Rotate Function | Medium | To Do | To Do | To Do | To Do |
| 397 | Integer Replacement | Medium | To Do | To Do | To Do | To Do |
| 398 | Random Pick Index | Medium | To Do | To Do | To Do | To Do |
| 399 | Evaluate Division | Medium | To Do | To Do | To Do | To Do |
| 400 | Nth Digit | Easy | To Do | To Do | To Do | To Do |
| 401 | Binary Watch | Easy | To Do | To Do | To Do | To Do |
| 402 | Remove K Digits | Medium | To Do | To Do | To Do | To Do |
| 403 | Frog Jump | Hard | To Do | To Do | To Do | To Do |
| 404 | Sum of Left Leaves | Easy | To Do | To Do | To Do | To Do |
| 405 | Convert a Number to Hexadecimal | Easy | To Do | To Do | To Do | To Do |
| 406 | Queue Reconstruction by Height | Medium | To Do | To Do | To Do | To Do |
| 407 | Trapping Rain Water II | Hard | To Do | To Do | To Do | To Do |
| 409 | Longest Palindrome | Easy | To Do | To Do | To Do | To Do |
| 410 | Split Array Largest Sum | Hard | To Do | To Do | To Do | To Do |
| 412 | Fizz Buzz | Easy | To Do | To Do | C++ | To Do |
| 413 | Arithmetic Slices | Medium | To Do | To Do | To Do | To Do |
| 414 | Third Maximum Number | Easy | To Do | To Do | To Do | To Do |
| 415 | Add Strings | Easy | To Do | To Do | To Do | To Do |
| 416 | Partition Equal Subset Sum | Medium | To Do | To Do | To Do | To Do |
| 417 | Pacific Atlantic Water Flow | Medium | To Do | To Do | To Do | To Do |
| 419 | Battleships in a Board | Medium | To Do | To Do | To Do | To Do |
| 420 | Strong Password Checker | Hard | To Do | To Do | To Do | To Do |
| 421 | Maximum XOR of Two Numbers in an Array | Medium | To Do | To Do | To Do | To Do |
| 423 | Reconstruct Original Digits from English | Medium | To Do | To Do | To Do | To Do |
| 424 | Longest Repeating Character Replacement | Medium | To Do | To Do | To Do | To Do |
| 432 | All O`one Data Structure | Hard | To Do | To Do | To Do | To Do |
| 433 | Minimum Genetic Mutation | Medium | To Do | To Do | To Do | To Do |
| 434 | Number of Segments in a String | Easy | To Do | To Do | To Do | To Do |
| 435 | Non-overlapping Intervals | Medium | To Do | To Do | To Do | To Do |
| 436 | Find Right Interval | Medium | To Do | To Do | To Do | To Do |
| 437 | Path Sum III | Easy | To Do | To Do | To Do | To Do |
| 438 | Find All Anagrams in a String | Easy | To Do | To Do | To Do | To Do |
| 440 | K-th Smallest in Lexicographical Order | Hard | To Do | To Do | To Do | To Do |
| 441 | Arranging Coins | Easy | To Do | To Do | To Do | To Do |
| 442 | Find All Duplicates in an Array | Medium | To Do | To Do | To Do | To Do |
| 443 | String Compression | Easy | To Do | To Do | To Do | To Do |
| 445 | Add Two Numbers II | Medium | To Do | To Do | To Do | To Do |
| 446 | Arithmetic Slices II - Subsequence | Hard | To Do | To Do | To Do | To Do |
| 447 | Number of Boomerangs | Easy | To Do | To Do | To Do | To Do |
| 448 | Find All Numbers Disappeared in an Array | Easy | To Do | To Do | To Do | To Do |
| 449 | Serialize and Deserialize BST | Medium | To Do | To Do | To Do | To Do |
| 450 | Delete Node in a BST | Medium | To Do | To Do | To Do | To Do |
| 451 | Sort Characters By Frequency | Medium | To Do | To Do | To Do | To Do |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | To Do | To Do | To Do | To Do |
| 453 | Minimum Moves to Equal Array Elements | Easy | To Do | To Do | To Do | To Do |
| 454 | 4Sum II | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/454.%204Sum%20II\454.4Sum II.cpp) | To Do |
| 455 | Assign Cookies | Easy | To Do | To Do | To Do | To Do |
| 456 | 132 Pattern | Medium | To Do | To Do | To Do | To Do |
| 457 | Circular Array Loop | Medium | To Do | To Do | To Do | To Do |
| 458 | Poor Pigs | Hard | To Do | To Do | To Do | To Do |
| 459 | Repeated Substring Pattern | Easy | To Do | To Do | To Do | To Do |
| 460 | LFU Cache | Hard | To Do | To Do | To Do | To Do |
| 461 | Hamming Distance | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/461.%20Hamming%20Distanc\461. Hamming Distance.cpp) | To Do |
| 462 | Minimum Moves to Equal Array Elements II | Medium | To Do | To Do | To Do | To Do |
| 463 | Island Perimeter | Easy | To Do | To Do | To Do | To Do |
| 464 | Can I Win | Medium | To Do | To Do | To Do | To Do |
| 466 | Count The Repetitions | Hard | To Do | To Do | To Do | To Do |
| 467 | Unique Substrings in Wraparound String | Medium | To Do | To Do | To Do | To Do |
| 468 | Validate IP Address | Medium | To Do | To Do | To Do | To Do |
| 472 | Concatenated Words | Hard | To Do | To Do | To Do | To Do |
| 473 | Matchsticks to Square | Medium | To Do | To Do | To Do | To Do |
| 474 | Ones and Zeroes | Medium | To Do | To Do | To Do | To Do |
| 475 | Heaters | Easy | To Do | To Do | To Do | To Do |
| 476 | Number Complement | Easy | To Do | To Do | To Do | To Do |
| 477 | Total Hamming Distance | Medium | To Do | To Do | To Do | To Do |
| 479 | Largest Palindrome Product | Hard | To Do | To Do | To Do | To Do |
| 480 | Sliding Window Median | Hard | To Do | To Do | To Do | To Do |
| 481 | Magical String | Medium | To Do | To Do | To Do | To Do |
| 482 | License Key Formatting | Easy | To Do | To Do | To Do | To Do |
| 483 | Smallest Good Base | Hard | To Do | To Do | To Do | To Do |
| 485 | Max Consecutive Ones | Easy | To Do | To Do | To Do | To Do |
| 486 | Predict the Winner | Medium | To Do | To Do | To Do | To Do |
| 488 | Zuma Game | Hard | To Do | To Do | To Do | To Do |
| 491 | Increasing Subsequences | Medium | To Do | To Do | To Do | To Do |
| 492 | Construct the Rectangle | Easy | To Do | To Do | To Do | To Do |
| 493 | Reverse Pairs | Hard | To Do | To Do | To Do | To Do |
| 494 | Target Sum | Medium | To Do | To Do | To Do | To Do |
| 495 | Teemo Attacking | Medium | To Do | To Do | To Do | To Do |
| 496 | Next Greater Element I | Easy | To Do | To Do | To Do | To Do |
| 498 | Diagonal Traverse | Medium | To Do | To Do | To Do | To Do |
| 500 | Keyboard Row | Easy | To Do | To Do | To Do | To Do |
| 501 | Find Mode in Binary Search Tree | Easy | To Do | To Do | To Do | To Do |
| 502 | IPO | Hard | To Do | To Do | To Do | To Do |
| 503 | Next Greater Element II | Medium | To Do | To Do | To Do | To Do |
| 504 | Base 7 | Easy | To Do | To Do | To Do | To Do |
| 506 | Relative Ranks | Easy | To Do | To Do | To Do | To Do |
| 507 | Perfect Number | Easy | To Do | To Do | To Do | To Do |
| 508 | Most Frequent Subtree Sum | Medium | To Do | To Do | To Do | To Do |
| 513 | Find Bottom Left Tree Value | Medium | To Do | To Do | To Do | To Do |
| 514 | Freedom Trail | Hard | To Do | To Do | To Do | To Do |
| 515 | Find Largest Value in Each Tree Row | Medium | To Do | To Do | To Do | To Do |
| 516 | Longest Palindromic Subsequence | Medium | To Do | To Do | To Do | To Do |
| 517 | Super Washing Machines | Hard | To Do | To Do | To Do | To Do |
| 518 | Coin Change 2 | Medium | To Do | To Do | To Do | To Do |
| 520 | Detect Capital | Easy | To Do | To Do | To Do | To Do |
| 521 | Longest Uncommon Subsequence I | Easy | To Do | To Do | To Do | To Do |
| 522 | Longest Uncommon Subsequence II | Medium | To Do | To Do | To Do | To Do |
| 523 | Continuous Subarray Sum | Medium | To Do | To Do | To Do | To Do |
| 524 | Longest Word in Dictionary through Deleting | Medium | To Do | To Do | To Do | To Do |
| 525 | Contiguous Array | Medium | To Do | To Do | To Do | To Do |
| 526 | Beautiful Arrangement | Medium | To Do | To Do | To Do | To Do |
| 529 | Minesweeper | Medium | To Do | To Do | To Do | To Do |
| 530 | Minimum Absolute Difference in BST | Easy | To Do | To Do | To Do | To Do |
| 532 | K-diff Pairs in an Array | Easy | To Do | To Do | To Do | To Do |
| 535 | Encode and Decode TinyURL | Medium | To Do | To Do | To Do | To Do |
| 537 | Complex Number Multiplication | Medium | To Do | To Do | To Do | To Do |
| 538 | Convert BST to Greater Tree | Easy | To Do | To Do | To Do | To Do |
| 539 | Minimum Time Difference | Medium | To Do | To Do | To Do | To Do |
| 540 | Single Element in a Sorted Array | Medium | To Do | To Do | To Do | To Do |
| 541 | Reverse String II | Easy | To Do | To Do | To Do | To Do |
| 542 | 01 Matrix | Medium | To Do | To Do | To Do | To Do |
| 543 | Diameter of Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 546 | Remove Boxes | Hard | To Do | To Do | To Do | To Do |
| 547 | Friend Circles | Medium | To Do | To Do | To Do | To Do |
| 551 | Student Attendance Record I | Easy | To Do | To Do | To Do | To Do |
| 552 | Student Attendance Record II | Hard | To Do | To Do | To Do | To Do |
| 553 | Optimal Division | Medium | To Do | To Do | To Do | To Do |
| 554 | Brick Wall | Medium | To Do | To Do | To Do | To Do |
| 556 | Next Greater Element III | Medium | To Do | To Do | To Do | To Do |
| 557 | Reverse Words in a String III | Easy | To Do | To Do | To Do | To Do |
| 560 | Subarray Sum Equals K | Medium | To Do | To Do | To Do | To Do |
| 561 | Array Partition I | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/561.%20Array%20Partition%20I\561. Array Partition I.cpp) | To Do |
| 563 | Binary Tree Tilt | Easy | To Do | To Do | To Do | To Do |
| 564 | Find the Closest Palindrome | Hard | To Do | To Do | To Do | To Do |
| 565 | Array Nesting | Medium | To Do | To Do | To Do | To Do |
| 566 | Reshape the Matrix | Easy | To Do | To Do | To Do | To Do |
| 567 | Permutation in String | Medium | To Do | To Do | To Do | To Do |
| 572 | Subtree of Another Tree | Easy | To Do | To Do | To Do | To Do |
| 575 | Distribute Candies | Easy | To Do | To Do | To Do | To Do |
| 576 | Out of Boundary Paths | Medium | To Do | To Do | To Do | To Do |
| 581 | Shortest Unsorted Continuous Subarray | Easy | To Do | To Do | To Do | To Do |
| 583 | Delete Operation for Two Strings | Medium | To Do | To Do | To Do | To Do |
| 587 | Erect the Fence | Hard | To Do | To Do | To Do | To Do |
| 591 | Tag Validator | Hard | To Do | To Do | To Do | To Do |
| 592 | Fraction Addition and Subtraction | Medium | To Do | To Do | To Do | To Do |
| 593 | Valid Square | Medium | To Do | To Do | To Do | To Do |
| 594 | Longest Harmonious Subsequence | Easy | To Do | To Do | To Do | To Do |
| 598 | Range Addition II | Easy | To Do | To Do | To Do | To Do |
| 599 | Minimum Index Sum of Two Lists | Easy | To Do | To Do | To Do | To Do |
| 600 | Non-negative Integers without Consecutive Ones | Hard | To Do | To Do | To Do | To Do |
| 605 | Can Place Flowers | Easy | To Do | To Do | To Do | To Do |
| 606 | Construct String from Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 609 | Find Duplicate File in System | Medium | To Do | To Do | To Do | To Do |
| 611 | Valid Triangle Number | Medium | To Do | To Do | To Do | To Do |
| 617 | Merge Two Binary Trees | Easy | To Do | To Do | To Do | To Do |
| 621 | Task Scheduler | Medium | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/621.%20Task%20Schedule\621. Task Schedule.cpp) | To Do |
| 623 | Add One Row to Tree | Medium | To Do | To Do | To Do | To Do |
| 628 | Maximum Product of Three Numbers | Easy | To Do | To Do | To Do | To Do |
| 629 | K Inverse Pairs Array | Hard | To Do | To Do | To Do | To Do |
| 630 | Course Schedule III | Hard | To Do | To Do | To Do | To Do |
| 632 | Smallest Range | Hard | To Do | To Do | To Do | To Do |
| 633 | Sum of Square Numbers | Easy | To Do | To Do | To Do | To Do |
| 636 | Exclusive Time of Functions | Medium | To Do | To Do | To Do | To Do |
| 637 | Average of Levels in Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 638 | Shopping Offers | Medium | To Do | To Do | To Do | To Do |
| 639 | Decode Ways II | Hard | To Do | To Do | To Do | To Do |
| 640 | Solve the Equation | Medium | To Do | To Do | To Do | To Do |
| 643 | Maximum Average Subarray I | Easy | To Do | To Do | To Do | To Do |
| 645 | Set Mismatch | Easy | To Do | To Do | To Do | To Do |
| 646 | Maximum Length of Pair Chain | Medium | To Do | To Do | To Do | To Do |
| 647 | Palindromic Substrings | Medium | To Do | To Do | To Do | To Do |
| 648 | Replace Words | Medium | To Do | To Do | To Do | To Do |
| 649 | Dota2 Senate | Medium | To Do | To Do | To Do | To Do |
| 650 | 2 Keys Keyboard | Medium | To Do | To Do | To Do | To Do |
| 652 | Find Duplicate Subtrees | Medium | To Do | To Do | To Do | To Do |
| 653 | Two Sum IV - Input is a BST | Easy | To Do | To Do | To Do | To Do |
| 654 | Maximum Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 655 | Print Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 657 | Robot Return to Origin | Easy | To Do | To Do | To Do | To Do |
| 658 | Find K Closest Elements | Medium | To Do | To Do | To Do | To Do |
| 659 | Split Array into Consecutive Subsequences | Medium | To Do | To Do | To Do | To Do |
| 661 | Image Smoother | Easy | To Do | To Do | To Do | To Do |
| 662 | Maximum Width of Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 664 | Strange Printer | Hard | To Do | To Do | To Do | To Do |
| 665 | Non-decreasing Array | Easy | To Do | To Do | To Do | To Do |
| 667 | Beautiful Arrangement II | Medium | To Do | To Do | To Do | To Do |
| 668 | Kth Smallest Number in Multiplication Table | Hard | To Do | To Do | To Do | To Do |
| 669 | Trim a Binary Search Tree | Easy | To Do | To Do | To Do | To Do |
| 670 | Maximum Swap | Medium | To Do | To Do | To Do | To Do |
| 671 | Second Minimum Node In a Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 672 | Bulb Switcher II | Medium | To Do | To Do | To Do | To Do |
| 673 | Number of Longest Increasing Subsequence | Medium | To Do | To Do | To Do | To Do |
| 674 | Longest Continuous Increasing Subsequence | Easy | To Do | To Do | To Do | To Do |
| 675 | Cut Off Trees for Golf Event | Hard | To Do | To Do | To Do | To Do |
| 676 | Implement Magic Dictionary | Medium | To Do | To Do | To Do | To Do |
| 677 | Map Sum Pairs | Medium | To Do | To Do | To Do | To Do |
| 678 | Valid Parenthesis String | Medium | To Do | To Do | To Do | To Do |
| 679 | 24 Game | Hard | To Do | To Do | To Do | To Do |
| 680 | Valid Palindrome II | Easy | To Do | To Do | To Do | To Do |
| 682 | Baseball Game | Easy | To Do | To Do | To Do | To Do |
| 684 | Redundant Connection | Medium | To Do | To Do | To Do | To Do |
| 685 | Redundant Connection II | Hard | To Do | To Do | To Do | To Do |
| 686 | Repeated String Match | Easy | To Do | To Do | To Do | To Do |
| 687 | Longest Univalue Path | Easy | To Do | To Do | To Do | To Do |
| 688 | Knight Probability in Chessboard | Medium | To Do | To Do | To Do | To Do |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | To Do | To Do | To Do | To Do |
| 690 | Employee Importance | Easy | To Do | To Do | To Do | To Do |
| 691 | Stickers to Spell Word | Hard | To Do | To Do | To Do | To Do |
| 692 | Top K Frequent Words | Medium | To Do | To Do | To Do | To Do |
| 693 | Binary Number with Alternating Bits | Easy | To Do | To Do | To Do | To Do |
| 695 | Max Area of Island | Medium | To Do | To Do | To Do | To Do |
| 696 | Count Binary Substrings | Easy | To Do | To Do | To Do | To Do |
| 697 | Degree of an Array | Easy | To Do | To Do | To Do | To Do |
| 698 | Partition to K Equal Sum Subsets | Medium | To Do | To Do | To Do | To Do |
| 699 | Falling Squares | Hard | To Do | To Do | To Do | To Do |
| 712 | Minimum ASCII Delete Sum for Two Strings | Medium | To Do | To Do | To Do | To Do |
| 713 | Subarray Product Less Than K | Medium | To Do | To Do | To Do | To Do |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | To Do | To Do | To Do | To Do |
| 715 | Range Module | Hard | To Do | To Do | To Do | To Do |
| 717 | 1-bit and 2-bit Characters | Easy | To Do | To Do | To Do | To Do |
| 718 | Maximum Length of Repeated Subarray | Medium | To Do | To Do | To Do | To Do |
| 719 | Find K-th Smallest Pair Distance | Hard | To Do | To Do | To Do | To Do |
| 720 | Longest Word in Dictionary | Easy | To Do | To Do | To Do | To Do |
| 721 | Accounts Merge | Medium | To Do | To Do | To Do | To Do |
| 722 | Remove Comments | Medium | To Do | To Do | To Do | To Do |
| 724 | Find Pivot Index | Easy | To Do | To Do | To Do | To Do |
| 725 | Split Linked List in Parts | Medium | To Do | To Do | To Do | To Do |
| 726 | Number of Atoms | Hard | To Do | To Do | To Do | To Do |
| 728 | Self Dividing Numbers | Easy | To Do | To Do | To Do | To Do |
| 729 | My Calendar I | Medium | To Do | To Do | To Do | To Do |
| 730 | Count Different Palindromic Subsequences | Hard | To Do | To Do | To Do | To Do |
| 731 | My Calendar II | Medium | To Do | To Do | To Do | To Do |
| 732 | My Calendar III | Hard | To Do | To Do | To Do | To Do |
| 733 | Flood Fill | Easy | To Do | To Do | To Do | To Do |
| 735 | Asteroid Collision | Medium | To Do | To Do | To Do | To Do |
| 736 | Parse Lisp Expression | Hard | To Do | To Do | To Do | To Do |
| 738 | Monotone Increasing Digits | Medium | To Do | To Do | To Do | To Do |
| 739 | Daily Temperatures | Medium | To Do | To Do | To Do | To Do |
| 740 | Delete and Earn | Medium | To Do | To Do | To Do | To Do |
| 741 | Cherry Pickup | Hard | To Do | To Do | To Do | To Do |
| 709 | To Lower Case | Easy | To Do | To Do | To Do | To Do |
| 743 | Network Delay Time | Medium | To Do | To Do | To Do | To Do |
| 744 | Find Smallest Letter Greater Than Target | Easy | To Do | To Do | To Do | To Do |
| 745 | Prefix and Suffix Search | Hard | To Do | To Do | To Do | To Do |
| 746 | Min Cost Climbing Stairs | Easy | To Do | To Do | To Do | To Do |
| 747 | Largest Number At Least Twice of Others | Easy | To Do | To Do | To Do | To Do |
| 748 | Shortest Completing Word | Easy | To Do | To Do | To Do | To Do |
| 749 | Contain Virus | Hard | To Do | To Do | To Do | To Do |
| 752 | Open the Lock | Medium | To Do | To Do | To Do | To Do |
| 753 | Cracking the Safe | Hard | To Do | To Do | To Do | To Do |
| 754 | Reach a Number | Easy | To Do | To Do | To Do | To Do |
| 756 | Pyramid Transition Matrix | Medium | To Do | To Do | To Do | To Do |
| 757 | Set Intersection Size At Least Two | Hard | To Do | To Do | To Do | To Do |
| 761 | Special Binary String | Hard | To Do | To Do | To Do | To Do |
| 429 | N-ary Tree Level Order Traversal | Easy | To Do | To Do | To Do | To Do |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | To Do | To Do | To Do | To Do |
| 762 | Prime Number of Set Bits in Binary Representation | Easy | To Do | To Do | To Do | To Do |
| 763 | Partition Labels | Medium | To Do | To Do | To Do | To Do |
| 764 | Largest Plus Sign | Medium | To Do | To Do | To Do | To Do |
| 765 | Couples Holding Hands | Hard | To Do | To Do | To Do | To Do |
| 427 | Construct Quad Tree | Easy | To Do | To Do | To Do | To Do |
| 558 | Quad Tree Intersection | Easy | To Do | To Do | To Do | To Do |
| 559 | Maximum Depth of N-ary Tree | Easy | To Do | To Do | To Do | To Do |
| 589 | N-ary Tree Preorder Traversal | Easy | To Do | To Do | To Do | To Do |
| 590 | N-ary Tree Postorder Traversal | Easy | To Do | To Do | To Do | To Do |
| 766 | Toeplitz Matrix | Easy | To Do | To Do | To Do | To Do |
| 767 | Reorganize String | Medium | To Do | To Do | To Do | To Do |
| 768 | Max Chunks To Make Sorted II | Hard | To Do | To Do | To Do | To Do |
| 769 | Max Chunks To Make Sorted | Medium | To Do | To Do | To Do | To Do |
| 770 | Basic Calculator IV | Hard | To Do | To Do | To Do | To Do |
| 771 | Jewels and Stones | Easy | To Do | To Do | To Do | To Do |
| 700 | Search in a Binary Search Tree | Easy | To Do | To Do | To Do | To Do |
| 701 | Insert into a Binary Search Tree | Medium | To Do | To Do | To Do | To Do |
| 773 | Sliding Puzzle | Hard | To Do | To Do | To Do | To Do |
| 703 | Kth Largest Element in a Stream | Easy | To Do | To Do | To Do | To Do |
| 775 | Global and Local Inversions | Medium | To Do | To Do | To Do | To Do |
| 704 | Binary Search | Easy | To Do | To Do | To Do | To Do |
| 777 | Swap Adjacent in LR String | Medium | To Do | To Do | To Do | To Do |
| 778 | Swim in Rising Water | Hard | To Do | To Do | To Do | To Do |
| 779 | K-th Symbol in Grammar | Medium | To Do | To Do | To Do | To Do |
| 780 | Reaching Points | Hard | To Do | To Do | To Do | To Do |
| 781 | Rabbits in Forest | Medium | To Do | To Do | To Do | To Do |
| 782 | Transform to Chessboard | Hard | To Do | To Do | To Do | To Do |
| 783 | Minimum Distance Between BST Nodes | Easy | To Do | To Do | To Do | To Do |
| 784 | Letter Case Permutation | Easy | To Do | To Do | To Do | To Do |
| 785 | Is Graph Bipartite? | Medium | To Do | To Do | To Do | To Do |
| 786 | K-th Smallest Prime Fraction | Hard | To Do | To Do | To Do | To Do |
| 787 | Cheapest Flights Within K Stops | Medium | To Do | To Do | To Do | To Do |
| 788 | Rotated Digits | Easy | To Do | To Do | To Do | To Do |
| 789 | Escape The Ghosts | Medium | To Do | To Do | To Do | To Do |
| 790 | Domino and Tromino Tiling | Medium | To Do | To Do | To Do | To Do |
| 791 | Custom Sort String | Medium | To Do | To Do | To Do | To Do |
| 792 | Number of Matching Subsequences | Medium | To Do | To Do | To Do | To Do |
| 793 | Preimage Size of Factorial Zeroes Function | Hard | To Do | To Do | To Do | To Do |
| 794 | Valid Tic-Tac-Toe State | Medium | To Do | To Do | To Do | To Do |
| 795 | Number of Subarrays with Bounded Maximum | Medium | To Do | To Do | To Do | To Do |
| 796 | Rotate String | Easy | To Do | To Do | To Do | To Do |
| 797 | All Paths From Source to Target | Medium | To Do | To Do | To Do | To Do |
| 798 | Smallest Rotation with Highest Score | Hard | To Do | To Do | To Do | To Do |
| 799 | Champagne Tower | Medium | To Do | To Do | To Do | To Do |
| 705 | Design HashSet | Easy | To Do | To Do | To Do | To Do |
| 706 | Design HashMap | Easy | To Do | To Do | To Do | To Do |
| 801 | Minimum Swaps To Make Sequences Increasing | Medium | To Do | To Do | To Do | To Do |
| 802 | Find Eventual Safe States | Medium | To Do | To Do | To Do | To Do |
| 803 | Bricks Falling When Hit | Hard | To Do | To Do | To Do | To Do |
| 804 | Unique Morse Code Words | Easy | To Do | To Do | To Do | To Do |
| 805 | Split Array With Same Average | Hard | To Do | To Do | To Do | To Do |
| 806 | Number of Lines To Write String | Easy | To Do | To Do | To Do | To Do |
| 807 | Max Increase to Keep City Skyline | Medium | To Do | To Do | To Do | To Do |
| 808 | Soup Servings | Medium | To Do | To Do | To Do | To Do |
| 809 | Expressive Words | Medium | To Do | To Do | To Do | To Do |
| 810 | Chalkboard XOR Game | Hard | To Do | To Do | To Do | To Do |
| 811 | Subdomain Visit Count | Easy | To Do | To Do | To Do | To Do |
| 812 | Largest Triangle Area | Easy | To Do | To Do | To Do | To Do |
| 813 | Largest Sum of Averages | Medium | To Do | To Do | To Do | To Do |
| 814 | Binary Tree Pruning | Medium | To Do | To Do | To Do | To Do |
| 815 | Bus Routes | Hard | To Do | To Do | To Do | To Do |
| 816 | Ambiguous Coordinates | Medium | To Do | To Do | To Do | To Do |
| 817 | Linked List Components | Medium | To Do | To Do | To Do | To Do |
| 818 | Race Car | Hard | To Do | To Do | To Do | To Do |
| 819 | Most Common Word | Easy | To Do | To Do | To Do | To Do |
| 707 | Design Linked List | Easy | To Do | To Do | To Do | To Do |
| 820 | Short Encoding of Words | Medium | To Do | To Do | To Do | To Do |
| 821 | Shortest Distance to a Character | Easy | To Do | To Do | To Do | To Do |
| 822 | Card Flipping Game | Medium | To Do | To Do | To Do | To Do |
| 823 | Binary Trees With Factors | Medium | To Do | To Do | To Do | To Do |
| 824 | Goat Latin | Easy | To Do | To Do | To Do | To Do |
| 825 | Friends Of Appropriate Ages | Medium | To Do | To Do | To Do | To Do |
| 826 | Most Profit Assigning Work | Medium | To Do | To Do | To Do | To Do |
| 827 | Making A Large Island | Hard | To Do | To Do | To Do | To Do |
| 828 | Unique Letter String | Hard | To Do | To Do | To Do | To Do |
| 829 | Consecutive Numbers Sum | Hard | To Do | To Do | To Do | To Do |
| 830 | Positions of Large Groups | Easy | To Do | To Do | To Do | To Do |
| 831 | Masking Personal Information | Medium | To Do | To Do | To Do | To Do |
| 641 | Design Circular Deque | Medium | To Do | To Do | To Do | To Do |
| 622 | Design Circular Queue | Medium | To Do | To Do | To Do | To Do |
| 832 | Flipping an Image | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/832.%20Flipping%20an%20Imag\832. Flipping an Image.cpp) | To Do |
| 833 | Find And Replace in String | Medium | To Do | To Do | To Do | To Do |
| 834 | Sum of Distances in Tree | Hard | To Do | To Do | To Do | To Do |
| 835 | Image Overlap | Medium | To Do | To Do | To Do | To Do |
| 836 | Rectangle Overlap | Easy | To Do | To Do | To Do | To Do |
| 837 | New 21 Game | Medium | To Do | To Do | To Do | To Do |
| 838 | Push Dominoes | Medium | To Do | To Do | To Do | To Do |
| 839 | Similar String Groups | Hard | To Do | To Do | To Do | To Do |
| 840 | Magic Squares In Grid | Easy | To Do | To Do | To Do | To Do |
| 841 | Keys and Rooms | Medium | To Do | To Do | To Do | To Do |
| 842 | Split Array into Fibonacci Sequence | Medium | To Do | To Do | To Do | To Do |
| 843 | Guess the Word | Hard | To Do | To Do | To Do | To Do |
| 844 | Backspace String Compare | Easy | To Do | To Do | To Do | To Do |
| 845 | Longest Mountain in Array | Medium | To Do | To Do | To Do | To Do |
| 846 | Hand of Straights | Medium | To Do | To Do | To Do | To Do |
| 847 | Shortest Path Visiting All Nodes | Hard | To Do | To Do | To Do | To Do |
| 848 | Shifting Letters | Medium | To Do | To Do | To Do | To Do |
| 849 | Maximize Distance to Closest Person | Easy | To Do | To Do | To Do | To Do |
| 850 | Rectangle Area II | Hard | To Do | To Do | To Do | To Do |
| 851 | Loud and Rich | Medium | To Do | To Do | To Do | To Do |
| 852 | Peak Index in a Mountain Array | Easy | To Do | To Do | To Do | To Do |
| 853 | Car Fleet | Medium | To Do | To Do | To Do | To Do |
| 854 | K-Similar Strings | Hard | To Do | To Do | To Do | To Do |
| 855 | Exam Room | Medium | To Do | To Do | To Do | To Do |
| 856 | Score of Parentheses | Medium | To Do | To Do | To Do | To Do |
| 857 | Minimum Cost to Hire K Workers | Hard | To Do | To Do | To Do | To Do |
| 858 | Mirror Reflection | Medium | To Do | To Do | To Do | To Do |
| 859 | Buddy Strings | Easy | To Do | To Do | To Do | To Do |
| 860 | Lemonade Change | Easy | To Do | To Do | To Do | To Do |
| 861 | Score After Flipping Matrix | Medium | To Do | To Do | To Do | To Do |
| 862 | Shortest Subarray with Sum at Least K | Hard | To Do | To Do | To Do | To Do |
| 863 | All Nodes Distance K in Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 710 | Random Pick with Blacklist | Hard | To Do | To Do | To Do | To Do |
| 864 | Shortest Path to Get All Keys | Hard | To Do | To Do | To Do | To Do |
| 865 | Smallest Subtree with all the Deepest Nodes | Medium | To Do | To Do | To Do | To Do |
| 866 | Prime Palindrome | Medium | To Do | To Do | To Do | To Do |
| 867 | Transpose Matrix | Easy | To Do | To Do | To Do | To Do |
| 868 | Binary Gap | Easy | To Do | To Do | To Do | To Do |
| 869 | Reordered Power of 2 | Medium | To Do | To Do | To Do | To Do |
| 870 | Advantage Shuffle | Medium | To Do | To Do | To Do | To Do |
| 871 | Minimum Number of Refueling Stops | Hard | To Do | To Do | To Do | To Do |
| 470 | Implement Rand10() Using Rand7() | Medium | To Do | To Do | To Do | To Do |
| 872 | Leaf-Similar Trees | Easy | To Do | To Do | To Do | To Do |
| 873 | Length of Longest Fibonacci Subsequence | Medium | To Do | To Do | To Do | To Do |
| 874 | Walking Robot Simulation | Easy | To Do | To Do | To Do | To Do |
| 875 | Koko Eating Bananas | Medium | To Do | To Do | To Do | To Do |
| 876 | Middle of the Linked List | Easy | To Do | To Do | To Do | To Do |
| 877 | Stone Game | Medium | To Do | To Do | To Do | To Do |
| 878 | Nth Magical Number | Hard | To Do | To Do | To Do | To Do |
| 879 | Profitable Schemes | Hard | To Do | To Do | To Do | To Do |
| 528 | Random Pick with Weight | Medium | To Do | To Do | To Do | To Do |
| 519 | Random Flip Matrix | Medium | To Do | To Do | To Do | To Do |
| 497 | Random Point in Non-overlapping Rectangles | Medium | To Do | To Do | To Do | To Do |
| 478 | Generate Random Point in a Circle | Medium | To Do | To Do | To Do | To Do |
| 880 | Decoded String at Index | Medium | To Do | To Do | To Do | To Do |
| 881 | Boats to Save People | Medium | To Do | To Do | To Do | To Do |
| 882 | Reachable Nodes In Subdivided Graph | Hard | To Do | To Do | To Do | To Do |
| 883 | Projection Area of 3D Shapes | Easy | To Do | To Do | To Do | To Do |
| 884 | Uncommon Words from Two Sentences | Easy | To Do | To Do | To Do | To Do |
| 885 | Spiral Matrix III | Medium | To Do | To Do | To Do | To Do |
| 886 | Possible Bipartition | Medium | To Do | To Do | To Do | To Do |
| 887 | Super Egg Drop | Hard | To Do | To Do | To Do | To Do |
| 888 | Fair Candy Swap | Easy | To Do | To Do | To Do | To Do |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | To Do | To Do | To Do | To Do |
| 890 | Find and Replace Pattern | Medium | To Do | To Do | To Do | To Do |
| 891 | Sum of Subsequence Widths | Hard | To Do | To Do | To Do | To Do |
| 892 | Surface Area of 3D Shapes | Easy | To Do | To Do | To Do | To Do |
| 893 | Groups of Special-Equivalent Strings | Easy | To Do | To Do | To Do | To Do |
| 894 | All Possible Full Binary Trees | Medium | To Do | To Do | To Do | To Do |
| 895 | Maximum Frequency Stack | Hard | To Do | To Do | To Do | To Do |
| 896 | Monotonic Array | Easy | To Do | To Do | To Do | To Do |
| 897 | Increasing Order Search Tree | Easy | To Do | To Do | To Do | To Do |
| 898 | Bitwise ORs of Subarrays | Medium | To Do | To Do | To Do | To Do |
| 899 | Orderly Queue | Hard | To Do | To Do | To Do | To Do |
| 900 | RLE Iterator | Medium | To Do | To Do | To Do | To Do |
| 901 | Online Stock Span | Medium | To Do | To Do | To Do | To Do |
| 902 | Numbers At Most N Given Digit Set | Hard | To Do | To Do | To Do | To Do |
| 903 | Valid Permutations for DI Sequence | Hard | To Do | To Do | To Do | To Do |
| 904 | Fruit Into Baskets | Medium | To Do | To Do | To Do | To Do |
| 905 | Sort Array By Parity | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/905.%20Sort%20Array%20By%20Parit\905. Sort Array By Parity.cpp) | To Do |
| 906 | Super Palindromes | Hard | To Do | To Do | To Do | To Do |
| 907 | Sum of Subarray Minimums | Medium | To Do | To Do | To Do | To Do |
| 908 | Smallest Range I | Easy | To Do | To Do | To Do | To Do |
| 909 | Snakes and Ladders | Medium | To Do | To Do | To Do | To Do |
| 910 | Smallest Range II | Medium | To Do | To Do | To Do | To Do |
| 911 | Online Election | Medium | To Do | To Do | To Do | To Do |
| 912 | Sort an Array | Medium | To Do | To Do | To Do | To Do |
| 913 | Cat and Mouse | Hard | To Do | To Do | To Do | To Do |
| 914 | X of a Kind in a Deck of Cards | Easy | To Do | To Do | To Do | To Do |
| 915 | Partition Array into Disjoint Intervals | Medium | To Do | To Do | To Do | To Do |
| 916 | Word Subsets | Medium | To Do | To Do | To Do | To Do |
| 917 | Reverse Only Letters | Easy | To Do | To Do | To Do | To Do |
| 918 | Maximum Sum Circular Subarray | Medium | To Do | To Do | To Do | To Do |
| 919 | Complete Binary Tree Inserter | Medium | To Do | To Do | To Do | To Do |
| 920 | Number of Music Playlists | Hard | To Do | To Do | To Do | To Do |
| 921 | Minimum Add to Make Parentheses Valid | Medium | To Do | To Do | To Do | To Do |
| 922 | Sort Array By Parity II | Easy | To Do | To Do | C++ | To Do |
| 923 | 3Sum With Multiplicity | Medium | To Do | To Do | To Do | To Do |
| 924 | Minimize Malware Spread | Hard | To Do | To Do | To Do | To Do |
| 925 | Long Pressed Name | Easy | To Do | To Do | To Do | To Do |
| 926 | Flip String to Monotone Increasing | Medium | To Do | To Do | To Do | To Do |
| 927 | Three Equal Parts | Hard | To Do | To Do | To Do | To Do |
| 928 | Minimize Malware Spread II | Hard | To Do | To Do | To Do | To Do |
| 929 | Unique Email Addresses | Easy | To Do | To Do | To Do | To Do |
| 930 | Binary Subarrays With Sum | Medium | To Do | To Do | To Do | To Do |
| 931 | Minimum Falling Path Sum | Medium | To Do | To Do | To Do | To Do |
| 932 | Beautiful Array | Medium | To Do | To Do | To Do | To Do |
| 933 | Number of Recent Calls | Easy | To Do | To Do | To Do | To Do |
| 934 | Shortest Bridge | Medium | To Do | To Do | To Do | To Do |
| 935 | Knight Dialer | Medium | To Do | To Do | To Do | To Do |
| 936 | Stamping The Sequence | Hard | To Do | To Do | To Do | To Do |
| 937 | Reorder Log Files | Easy | To Do | To Do | To Do | To Do |
| 938 | Range Sum of BST | Easy | To Do | To Do | To Do | To Do |
| 939 | Minimum Area Rectangle | Medium | To Do | To Do | To Do | To Do |
| 940 | Distinct Subsequences II | Hard | To Do | To Do | To Do | To Do |
| 941 | Valid Mountain Array | Easy | To Do | To Do | To Do | To Do |
| 942 | DI String Match | Easy | To Do | To Do | To Do | To Do |
| 943 | Find the Shortest Superstring | Hard | To Do | To Do | To Do | To Do |
| 944 | Delete Columns to Make Sorted | Easy | To Do | To Do | To Do | To Do |
| 945 | Minimum Increment to Make Array Unique | Medium | To Do | To Do | To Do | To Do |
| 946 | Validate Stack Sequences | Medium | To Do | To Do | To Do | To Do |
| 947 | Most Stones Removed with Same Row or Column | Medium | To Do | To Do | To Do | To Do |
| 948 | Bag of Tokens | Medium | To Do | To Do | To Do | To Do |
| 949 | Largest Time for Given Digits | Easy | To Do | To Do | To Do | To Do |
| 950 | Reveal Cards In Increasing Order | Medium | To Do | To Do | To Do | To Do |
| 951 | Flip Equivalent Binary Trees | Medium | To Do | To Do | To Do | To Do |
| 952 | Largest Component Size by Common Factor | Hard | To Do | To Do | To Do | To Do |
| 953 | Verifying an Alien Dictionary | Easy | To Do | To Do | To Do | To Do |
| 954 | Array of Doubled Pairs | Medium | To Do | To Do | To Do | To Do |
| 955 | Delete Columns to Make Sorted II | Medium | To Do | To Do | To Do | To Do |
| 956 | Tallest Billboard | Hard | To Do | To Do | To Do | To Do |
| 957 | Prison Cells After N Days | Medium | To Do | To Do | To Do | To Do |
| 958 | Check Completeness of a Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 959 | Regions Cut By Slashes | Medium | To Do | To Do | To Do | To Do |
| 960 | Delete Columns to Make Sorted III | Hard | To Do | To Do | To Do | To Do |
| 961 | N-Repeated Element in Size 2N Array | Easy | To Do | To Do | To Do | To Do |
| 962 | Maximum Width Ramp | Medium | To Do | To Do | To Do | To Do |
| 963 | Minimum Area Rectangle II | Medium | To Do | To Do | To Do | To Do |
| 964 | Least Operators to Express Number | Hard | To Do | To Do | To Do | To Do |
| 965 | Univalued Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 966 | Vowel Spellchecker | Medium | To Do | To Do | To Do | To Do |
| 967 | Numbers With Same Consecutive Differences | Medium | To Do | To Do | To Do | To Do |
| 968 | Binary Tree Cameras | Hard | To Do | To Do | To Do | To Do |
| 969 | Pancake Sorting | Medium | To Do | To Do | To Do | To Do |
| 970 | Powerful Integers | Easy | To Do | To Do | To Do | To Do |
| 971 | Flip Binary Tree To Match Preorder Traversal | Medium | To Do | To Do | To Do | To Do |
| 972 | Equal Rational Numbers | Hard | To Do | To Do | To Do | To Do |
| 509 | Fibonacci Number | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/509.%20Fibonacci%20Numbe\509. Fibonacci Number.cpp) | To Do |
| 973 | K Closest Points to Origin | Medium | To Do | To Do | To Do | To Do |
| 974 | Subarray Sums Divisible by K | Medium | To Do | To Do | To Do | To Do |
| 975 | Odd Even Jump | Hard | To Do | To Do | To Do | To Do |
| 976 | Largest Perimeter Triangle | Easy | To Do | To Do | To Do | To Do |
| 977 | Squares of a Sorted Array | Easy | To Do | To Do | [C++](https://github.com/luqilinok/Leetcode/blob/master/leetcode-algorithms/977.%20Squares%20of%20a%20Sorted%20Arra\977. Squares of a Sorted Array.cpp) | To Do |
| 978 | Longest Turbulent Subarray | Medium | To Do | To Do | To Do | To Do |
| 979 | Distribute Coins in Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 980 | Unique Paths III | Hard | To Do | To Do | To Do | To Do |
| 981 | Time Based Key-Value Store | Medium | To Do | To Do | To Do | To Do |
| 982 | Triples with Bitwise AND Equal To Zero | Hard | To Do | To Do | To Do | To Do |
| 983 | Minimum Cost For Tickets | Medium | To Do | To Do | To Do | To Do |
| 984 | String Without AAA or BBB | Medium | To Do | To Do | To Do | To Do |
| 985 | Sum of Even Numbers After Queries | Easy | To Do | To Do | To Do | To Do |
| 986 | Interval List Intersections | Medium | To Do | To Do | To Do | To Do |
| 987 | Vertical Order Traversal of a Binary Tree | Medium | To Do | To Do | To Do | To Do |
| 988 | Smallest String Starting From Leaf | Medium | To Do | To Do | To Do | To Do |
| 989 | Add to Array-Form of Integer | Easy | To Do | To Do | To Do | To Do |
| 990 | Satisfiability of Equality Equations | Medium | To Do | To Do | To Do | To Do |
| 991 | Broken Calculator | Medium | To Do | To Do | To Do | To Do |
| 992 | Subarrays with K Different Integers | Hard | To Do | To Do | To Do | To Do |
| 993 | Cousins in Binary Tree | Easy | To Do | To Do | To Do | To Do |
| 994 | Rotting Oranges | Easy | To Do | To Do | To Do | To Do |
| 995 | Minimum Number of K Consecutive Bit Flips | Hard | To Do | To Do | To Do | To Do |
| 996 | Number of Squareful Arrays | Hard | To Do | To Do | To Do | To Do |
| 997 | Find the Town Judge | Easy | To Do | To Do | To Do | To Do |
| 998 | Maximum Binary Tree II | Medium | To Do | To Do | To Do | To Do |
| 999 | Available Captures for Rook | Easy | To Do | To Do | To Do | To Do |
| 1000 | Minimum Cost to Merge Stones | Hard | To Do | To Do | To Do | To Do |
| 1001 | Grid Illumination | Hard | To Do | To Do | To Do | To Do |
| 1002 | Find Common Characters | Easy | To Do | To Do | To Do | To Do |
| 1003 | Check If Word Is Valid After Substitutions | Medium | To Do | To Do | To Do | To Do |
| 1004 | Max Consecutive Ones III | Medium | To Do | To Do | To Do | To Do |
| 1005 | Maximize Sum Of Array After K Negations | Easy | To Do | To Do | To Do | To Do |
| 1006 | Clumsy Factorial | Medium | To Do | To Do | To Do | To Do |
| 1007 | Minimum Domino Rotations For Equal Row | Medium | To Do | To Do | To Do | To Do |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | To Do | To Do | To Do | To Do |
| 1009 | Complement of Base 10 Integer | Easy | To Do | To Do | To Do | To Do |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Easy | To Do | To Do | To Do | To Do |
| 1011 | Capacity To Ship Packages Within D Days | Medium | To Do | To Do | To Do | To Do |
| 1012 | Numbers With Repeated Digits | Hard | To Do | To Do | To Do | To Do |
| 1013 | Partition Array Into Three Parts With Equal Sum | Easy | To Do | To Do | To Do | To Do |
| 1014 | Best Sightseeing Pair | Medium | To Do | To Do | To Do | To Do |
| 1015 | Smallest Integer Divisible by K | Medium | To Do | To Do | To Do | To Do |
| 1016 | Binary String With Substrings Representing 1 To N | Medium | To Do | To Do | To Do | To Do |
| 1017 | Convert to Base -2 | Medium | To Do | To Do | To Do | To Do |
| 1018 | Binary Prefix Divisible By 5 | Easy | To Do | To Do | To Do | To Do |
| 1019 | Next Greater Node In Linked List | Medium | To Do | To Do | To Do | To Do |
| 1020 | Number of Enclaves | Medium | To Do | To Do | To Do | To Do |
| 1021 | Remove Outermost Parentheses | Easy | To Do | To Do | To Do | To Do |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy | To Do | To Do | To Do | To Do |
| 1023 | Camelcase Matching | Medium | To Do | To Do | To Do | To Do |
| 1024 | Video Stitching | Medium | To Do | To Do | To Do | To Do |
| 1025 | Divisor Game | Easy | To Do | To Do | To Do | To Do |
| 1027 | Longest Arithmetic Sequence | Medium | To Do | To Do | To Do | To Do |
| 1026 | Maximum Difference Between Node and Ancestor | Medium | To Do | To Do | To Do | To Do |
| 1028 | Recover a Tree From Preorder Traversal | Hard | To Do | To Do | To Do | To Do |
| 1030 | Matrix Cells in Distance Order | Easy | To Do | To Do | To Do | To Do |
| 1029 | Two City Scheduling | Easy | To Do | To Do | To Do | To Do |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | Medium | To Do | To Do | To Do | To Do |
| 1032 | Stream of Characters | Hard | To Do | To Do | To Do | To Do |
| 1033 | Moving Stones Until Consecutive | Easy | To Do | To Do | To Do | To Do |
| 1034 | Coloring A Border | Medium | To Do | To Do | To Do | To Do |
| 1035 | Uncrossed Lines | Medium | To Do | To Do | To Do | To Do |
| 1036 | Escape a Large Maze | Hard | To Do | To Do | To Do | To Do |
| 1039 | Minimum Score Triangulation of Polygon | Medium | To Do | To Do | To Do | To Do |
| 1040 | Moving Stones Until Consecutive II | Medium | To Do | To Do | To Do | To Do |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium | To Do | To Do | To Do | To Do |
| 1037 | Valid Boomerang | Easy | To Do | To Do | To Do | To Do |