# LeetCode **Repository Path**: limbercode/LeetCode ## Basic Information - **Project Name**: LeetCode - **Description**: LeetCode Online Judge刷题题解(Java/C++/Python/Ruby/Swift) - **Primary Language**: Unknown - **License**: Not specified - **Default Branch**: master - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2020-02-18 - **Last Updated**: 2020-12-19 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README - 博客地址：https://www.liuchuo.net/ | ID | Title | Difficulty | Java | Python | Ruby | C++ | Swift | | :--: | :----------------------------------------------------------: | :--------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :------------------------------------------: | :--------------------------------------------: | | 001 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/001.%20Two%20Sum/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/001.%20Two%20Sum/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/001.%20Two%20Sum/Solution.rb) | [C++](http://www.liuchuo.net/archives/1006) | no | | 002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/002.%20Add%20Two%20Numbers/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/002.%20Add%20Two%20Numbers/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/002.%20Add%20Two%20Numbers/Solution.rb) | [C++](http://www.liuchuo.net/archives/1004) | no | | 003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/003.%20Longest%20Substring%20Without%20Repeating%20Characters/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/003.%20Longest%20Substring%20Without%20Repeating%20Characters/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1235) | no | | 005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3186) | no | | 006 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/006.%20ZigZag%20Conversion/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/006.%20ZigZag%20Conversion/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1134) | no | | 007 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/007.%20Reverse%20Integer/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/007.%20Reverse%20Integer/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/007.%20Reverse%20Integer/Solution.rb) | [C++](http://www.liuchuo.net/archives/1138) | no | | 008 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/008.%20String%20to%20Integer%20(atoi)/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1152) | no | | 009 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/009.%20Palindrome%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/009.%20Palindrome%20Number/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/009.%20Palindrome%20Number/Solution.rb) | [C++](http://www.liuchuo.net/archives/1025) | no | | 010 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/010.%20Regular%20Expression%20Matching/Solution.java) | no | no | no | no | | 011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/011.%20Container%20With%20Most%20Water/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3074) | no | | 012 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/012.%20Integer%20to%20Roman/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/012.%20Integer%20to%20Roman/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3122) | no | | 013 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/013.%20Roman%20to%20Integer/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/013.%20Roman%20to%20Integer/Solution.py) | no | [C++](http://www.liuchuo.net/archives/963) | no | | 014 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/014.%20Longest%20Common%20Prefix/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/014.%20Longest%20Common%20Prefix/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1069) | no | | 015 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/015.%203Sum/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/015.%203Sum/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/015.%203Sum/Solution.rb) | [C++](http://www.liuchuo.net/archives/3112) | no | | 016 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/016.%203Sum%20Closest/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3114) | no | | 017 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/017.%20Letter%20Combinations%20of%20a%20Phone%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/017.%20Letter%20Combinations%20of%20a%20Phone%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3131) | no | | 018 | [4Sum](https://leetcode.com/problems/4sum/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/018.%204Sum/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3116) | no | | 019 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/019.%20Remove%20Nth%20Node%20From%20End%20of%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/019.%20Remove%20Nth%20Node%20From%20End%20of%20List/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/019.%20Remove%20Nth%20Node%20From%20End%20of%20List/Solution.rb) | [C++](http://www.liuchuo.net/archives/1057) | no | | 020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/020.%20Valid%20Parentheses/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1053) | [Swift](https://www.liuchuo.net/archives/5140) | | 021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/021.%20Merge%20Two%20Sorted%20Lists/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/021.%20Merge%20Two%20Sorted%20Lists/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/021.%20Merge%20Two%20Sorted%20Lists/Solution.rb) | [C++](http://www.liuchuo.net/archives/954) | [Swift](https://www.liuchuo.net/archives/5143) | | 022 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/022.%20Generate%20Parentheses/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/022.%20Generate%20Parentheses/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3228) | no | | 023 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/023.%20Merge%20k%20Sorted%20Lists/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/023.%20Merge%20k%20Sorted%20Lists/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/023.%20Merge%20k%20Sorted%20Lists/Solution.rb) | no | [Swift](https://www.liuchuo.net/archives/5145) | | 024 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/024.%20Swap%20Nodes%20in%20Pairs/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/024.%20Swap%20Nodes%20in%20Pairs/Solution.py) | no | [C++](http://www.liuchuo.net/archives/956) | no | | 025 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/025.%20Reverse%20Nodes%20in%20k-Group/Solution.java) | no | no | no | no | | 026 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/026.%20Remove%20Duplicates%20from%20Sorted%20Array/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/026.%20Remove%20Duplicates%20from%20Sorted%20Array/Solution.py) | no | [C++](http://www.liuchuo.net/archives/961) | no | | 027 | [Remove Element](https://leetcode.com/problems/remove-element/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/027.%20Remove%20Element/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/027.%20Remove%20Element/Solution.py) | no | [C++](http://www.liuchuo.net/archives/948) | no | | 028 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/028.%20Implement%20strStr()/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1084) | no | | 029 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/029.%20Divide%20Two%20Integers/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3140) | no | | 031 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/031.%20Next%20Permutation/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/031.%20Next%20Permutation/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3237) | no | | 032 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/032.%20Longest%20Valid%20Parentheses/Solution.java) | no | no | no | no | | 033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/033.%20Search%20in%20Rotated%20Sorted%20Array/Solution.java) | no | no | [C++](https://www.liuchuo.net/archives/4303) | no | | 034 | [Search for a Range](https://leetcode.com/problems/search-for-a-range/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/034.%20Search%20for%20a%20Range/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/034.%20Search%20for%20a%20Range/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1143) | no | | 035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/035.%20Search%20Insert%20Position/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/035.%20Search%20Insert%20Position/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1034) | [Swift](https://www.liuchuo.net/archives/5147) | | 036 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/036.%20Valid%20Sudoku/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1038) | no | | 037 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/037.%20Sudoku%20Solver/Solution.java) | no | no | no | no | | 038 | [Count and Say](https://leetcode.com/problems/count-and-say/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/038.%20Count%20and%20Say/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1063) | no | | 039 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/039.%20Combination%20Sum/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/039.%20Combination%20Sum/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3261) | no | | 040 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/040.%20Combination%20Sum%20II/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3269) | no | | 041 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/041.%20First%20Missing%20Positive/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/041.%20First%20Missing%20Positive/Solution.py) | no | no | no | | 042 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/042.%20Trapping%20Rain%20Water/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1072) | no | | 043 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/043.%20Multiply%20Strings/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/043.%20Multiply%20Strings/Solution.py) | no | [C++](https://www.liuchuo.net/archives/4305) | no | | 045 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/045.%20Jump%20Game%20II/Solution.java) | no | no | no | no | | 046 | [Permutations](https://leetcode.com/problems/permutations/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/046.%20Permutations/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/046.%20Permutations/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3245) | no | | 047 | [Permutations II](https://leetcode.com/problems/permutations-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/047.%20Permutations%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/047.%20Permutations%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3243) | no | | 048 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/048.%20Rotate%20Image/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/048.%20Rotate%20Image/Solution.py) | no | [C++](http://www.liuchuo.net/archives/995) | no | | 049 | [Group Anagrams](https://leetcode.com/problems/anagrams/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/049.%20Group%20Anagrams/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/049.%20Group%20Anagrams/Solution.py) | no | [C++](https://www.liuchuo.net/archives/4311) | [Swift](https://www.liuchuo.net/archives/5149) | | 050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/050.%20Pow(x,%20n)/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/050.%20Pow(x,%20n)/Solution.py) | no | no | no | | 051 | [N-Queens](https://leetcode.com/problems/n-queens/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/051.%20N-Queens/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/051.%20N-Queens/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1312) | no | | 052 | [N-Queens II](https://leetcode.com/problems/n-queens-ii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/052.%20N-Queens%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/052.%20N-Queens%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1314) | no | | 053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/053.%20Maximum%20Subarray/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/053.%20Maximum%20Subarray/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1203) | no | | 054 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/054.%20Spiral%20Matrix/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/054.%20Spiral%20Matrix/Solution.py) | no | no | no | | 055 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/055.%20Jump%20Game/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/055.%20Jump%20Game/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1229) | no | | 056 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/056.%20Merge%20Intervals/Solution.java) | no | no | [C++](https://www.liuchuo.net/archives/4313) | no | | 057 | [Insert Interval](https://leetcode.com/problems/insert-interval/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/057.%20Insert%20Interval/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/057.%20Insert%20Interval/Solution.py) | no | no | no | | 058 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/058.%20Length%20of%20Last%20Word/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/058.%20Length%20of%20Last%20Word/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1059) | no | | 059 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/059.%20Spiral%20Matrix%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/059.%20Spiral%20Matrix%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3184) | no | | 060 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/060.%20Permutation%20Sequence/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/060.%20Permutation%20Sequence/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3241) | no | | 061 | [Rotate List](https://leetcode.com/problems/rotate-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/061.%20Rotate%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/061.%20Rotate%20List/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3167) | no | | 062 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/062.%20Unique%20Paths/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/062.%20Unique%20Paths/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1021) | [Swift](https://www.liuchuo.net/archives/5154) | | 063 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/063.%20Unique%20Paths%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/063.%20Unique%20Paths%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1199) | no | | 064 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/064.%20Minimum%20Path%20Sum/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/064.%20Minimum%20Path%20Sum/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1201) | no | | 066 | [Plus One](https://leetcode.com/problems/plus-one/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/066.%20Plus%20One/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/959) | no | | 067 | [Add Binary](https://leetcode.com/problems/add-binary/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/067.%20Add%20Binary/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/067.%20Add%20Binary/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1081) | no | | 068 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/068.%20Text%20Justification/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/068.%20Text%20Justification/Solution.py) | no | no | no | | 069 | [Sqrt(x)](https://leetcode.com/problems/sqrtx/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/069.%20Sqrt(x)/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/069.%20Sqrt(x)/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3213) | no | | 070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/070.%20Climbing%20Stairs/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/070.%20Climbing%20Stairs/Solution.py) | no | [C++](http://www.liuchuo.net/archives/941) | [Swift](https://www.liuchuo.net/archives/5156) | | 071 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3169) | no | | 072 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/072.%20Edit%20Distance/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/072.%20Edit%20Distance/Solution.py) | no | no | no | | 073 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/073.%20Set%20Matrix%20Zeroes/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/073.%20Set%20Matrix%20Zeroes/Solution.py) | no | no | no | | 074 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/074.%20Search%20a%202D%20Matrix/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/074.%20Search%20a%202D%20Matrix/Solution.py) | no | [C++](https://www.liuchuo.net/archives/4459) | no | | 075 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/075.%20Sort%20Colors/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/075.%20Sort%20Colors/Solution.py) | no | [C++](http://www.liuchuo.net/archives/993) | [Swift](https://www.liuchuo.net/archives/5163) | | 077 | [Combinations](https://leetcode.com/problems/combinations/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/077.%20Combinations/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/077.%20Combinations/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3259) | no | | 078 | [Subsets](https://leetcode.com/problems/subsets/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/078.%20Subsets/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/078.%20Subsets/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3271) | no | | 079 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/079.%20Word%20Search/Solution.java) | no | no | no | no | | 080 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/997) | no | | 081 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/081.%20Search%20in%20Rotated%20Sorted%20Array%20II/Solution.java) | no | no | no | no | | 082 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/082.%20Remove%20Duplicates%20from%20Sorted%20List%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/082.%20Remove%20Duplicates%20from%20Sorted%20List%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3255) | no | | 083 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/083.%20Remove%20Duplicates%20from%20Sorted%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/083.%20Remove%20Duplicates%20from%20Sorted%20List/Solution.py) | no | [C++](http://www.liuchuo.net/archives/939) | no | | 086 | [Partition List](https://leetcode.com/problems/partition-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/086.%20Partition%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/086.%20Partition%20List/Solution.py) | no | no | no | | 087 | [Scramble String](https://leetcode.com/problems/scramble-string/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/087.%20Scramble%20String/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/087.%20Scramble%20String/Solution.py) | no | no | no | | 088 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/088.%20Merge%20Sorted%20Array/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/088.%20Merge%20Sorted%20Array/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1042) | no | | 089 | [Gray Code](https://leetcode.com/problems/gray-code/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/089.%20Gray%20Code/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/089.%20Gray%20Code/Solution.py) | no | no | no | | 090 | [Subsets II](https://leetcode.com/problems/subsets-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/090.%20Subsets%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/090.%20Subsets%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3275) | no | | 091 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/091.%20Decode%20Ways/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/091.%20Decode%20Ways/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1215) | no | | 092 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/092.%20Reverse%20Linked%20List%20II/Solution.java) | no | no | no | no | | 093 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/093.%20Restore%20IP%20Addresses/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/093.%20Restore%20IP%20Addresses/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3249) | no | | 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/094.%20Binary%20Tree%20Inorder%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/094.%20Binary%20Tree%20Inorder%20Traversal/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/094.%20Binary%20Tree%20Inorder%20Traversal/Solution.rb) | [C++](http://www.liuchuo.net/archives/3068) | [Swift](https://www.liuchuo.net/archives/5165) | | 095 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/095.%20Unique%20Binary%20Search%20Trees%20II/Solution.java) | no | no | no | no | | 096 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/096.%20Unique%20Binary%20Search%20Trees/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/096.%20Unique%20Binary%20Search%20Trees/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1205) | [Swift](https://www.liuchuo.net/archives/5167) | | 097 | [Interleaving String](https://leetcode.com/problems/interleaving-string/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/097.%20Interleaving%20String/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/097.%20Interleaving%20String/Solution.py) | no | no | no | | 098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/098.%20Validate%20Binary%20Search%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/098.%20Validate%20Binary%20Search%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/098.%20Validate%20Binary%20Search%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/3153) | [Swift](https://www.liuchuo.net/archives/5169) | | 099 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | Hard | no | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/099.%20Recover%20Binary%20Search%20Tree/Solution.py) | no | no | no | | 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/100.%20Same%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/100.%20Same%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/100.%20Same%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/924) | [Swift](https://www.liuchuo.net/archives/5171) | | 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/101.%20Symmetric%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/101.%20Symmetric%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/101.%20Symmetric%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/1027) | [Swift](https://www.liuchuo.net/archives/5173) | | 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/102.%20Binary%20Tree%20Level%20Order%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/102.%20Binary%20Tree%20Level%20Order%20Traversal/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1029) | [Swift](https://www.liuchuo.net/archives/5175) | | 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1270) | no | | 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/104.%20Maximum%20Depth%20of%20Binary%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/104.%20Maximum%20Depth%20of%20Binary%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/104.%20Maximum%20Depth%20of%20Binary%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/915) | [Swift](https://www.liuchuo.net/archives/5178) | | 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/Solution.rb) | no | no | | 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/Solution.rb) | no | no | | 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1031) | no | | 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3219) | no | | 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3221) | no | | 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/110.%20Balanced%20Binary%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/110.%20Balanced%20Binary%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/110.%20Balanced%20Binary%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/969) | no | | 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/111.%20Minimum%20Depth%20of%20Binary%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/111.%20Minimum%20Depth%20of%20Binary%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/111.%20Minimum%20Depth%20of%20Binary%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/917) | no | | 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/112.%20Path%20Sum/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/112.%20Path%20Sum/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/112.%20Path%20Sum/Solution.rb) | [C++](http://www.liuchuo.net/archives/1036) | no | | 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/113.%20Path%20Sum%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/113.%20Path%20Sum%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3040) | no | | 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List/Solution.py) | no | no | [Swift](https://www.liuchuo.net/archives/5186) | | 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node/Solution.py) | no | no | no | | 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/Solution.py) | no | no | no | | 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/118.%20Pascal's%20Triangle/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/118.%20Pascal's%20Triangle/Solution.py) | no | [C++](http://www.liuchuo.net/archives/973) | no | | 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/119.%20Pascal's%20Triangle%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/119.%20Pascal's%20Triangle%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1019) | no | | 120 | [Triangle](https://leetcode.com/problems/triangle/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/120.%20Triangle/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/120.%20Triangle/Solution.py) | no | [C++](http://www.liuchuo.net/archives/2969) | no | | 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1011) | [Swift](https://www.liuchuo.net/archives/5188) | | 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1009) | no | | 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/Solution.java) | no | no | no | no | | 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/124.%20Binary%20Tree%20Maximum%20Path%20Sum/Solution.java) | no | no | no | no | | 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/125.%20Valid%20Palindrome/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1136) | no | | 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/127.%20Word%20Ladder/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3148) | no | | 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/128.%20Longest%20Consecutive%20Sequence/Solution.java) | no | no | no | no | | 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/129.%20Sum%20Root%20to%20Leaf%20Numbers/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/129.%20Sum%20Root%20to%20Leaf%20Numbers/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3273) | no | | 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/130.%20Surrounded%20Regions/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3144) | no | | 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/131.%20Palindrome%20Partitioning/Solution.java) | no | no | no | no | | 133 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/133.%20Clone%20Graph/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/133.%20Clone%20Graph/Solution.py) | no | no | no | | 134 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/134.%20Gas%20Station/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/134.%20Gas%20Station/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1224) | no | | 135 | [Candy](https://leetcode.com/problems/candy/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/135.%20Candy/Solution.java) | no | no | no | no | | 136 | [Single Number](https://leetcode.com/problems/single-number/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/136.%20Single%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/136.%20Single%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/977) | [Swift](https://www.liuchuo.net/archives/5190) | | 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/137.%20Single%20Number%20II/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/987) | no | | 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/138.%20Copy%20List%20with%20Random%20Pointer/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/138.%20Copy%20List%20with%20Random%20Pointer/Solution.py) | no | no | no | | 139 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/139.%20Word%20Break/Solution.java) | no | no | no | no | | 140 | [Word Break II](https://leetcode.com/problems/word-break-ii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/140.%20Word%20Break%20II/Solution.java) | no | no | no | no | | 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/141.%20Linked%20List%20Cycle/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/141.%20Linked%20List%20Cycle/Solution.py) | no | [C++](http://www.liuchuo.net/archives/985) | no | | 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/142.%20Linked%20List%20Cycle%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/142.%20Linked%20List%20Cycle%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/999) | no | | 143 | [Reorder List](https://leetcode.com/problems/reorder-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/143.%20Reorder%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/143.%20Reorder%20List/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3180) | no | | 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/144.%20Binary%20Tree%20Preorder%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/144.%20Binary%20Tree%20Preorder%20Traversal/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/144.%20Binary%20Tree%20Preorder%20Traversal/Solution.rb) | [C++](http://www.liuchuo.net/archives/1156) | no | | 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/145.%20Binary%20Tree%20Postorder%20Traversal/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/145.%20Binary%20Tree%20Postorder%20Traversal/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3070) | no | | 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/146.%20LRU%20Cache/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/146.%20LRU%20Cache/Solution.py) | no | no | no | | 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/147.%20Insertion%20Sort%20List/Solution.java) | no | no | no | no | | 148 | [Sort List](https://leetcode.com/problems/sort-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/148.%20Sort%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/148.%20Sort%20List/Solution.py) | no | no | [Swift](https://www.liuchuo.net/archives/5193) | | 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/149.%20Max%20Points%20on%20a%20Line/Solution.java) | no | no | no | no | | 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/150.%20Evaluate%20Reverse%20Polish%20Notation/Solution.java) | no | no | no | no | | 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/151.%20Reverse%20Words%20in%20a%20String/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3027) | no | | 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/152.%20Maximum%20Product%20Subarray/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3176) | [Swift](https://www.liuchuo.net/archives/5195) | | 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3066) | no | | 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/154.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/Solution.java) | no | no | no | no | | 155 | [Min Stack](https://leetcode.com/problems/min-stack/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/155.%20Min%20Stack/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1145) | no | | 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/156.%20Binary%20Tree%20Upside%20Down/Solution.java) | no | no | no | no | | 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/160.%20Intersection%20of%20Two%20Linked%20Lists/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/160.%20Intersection%20of%20Two%20Linked%20Lists/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1040) | no | | 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/161.%20One%20Edit%20Distance/Solution.java) | no | no | no | no | | 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/162.%20Find%20Peak%20Element/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/991) | no | | 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/164.%20Maximum%20Gap/Solution.java) | no | no | no | no | | 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/165.%20Compare%20Version%20Numbers/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/165.%20Compare%20Version%20Numbers/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1150) | no | | 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/166.%20Fraction%20to%20Recurring%20Decimal/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3142) | no | | 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3064) | no | | 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/168.%20Excel%20Sheet%20Column%20Title/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/168.%20Excel%20Sheet%20Column%20Title/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1148) | no | | 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/169.%20Majority%20Element/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/169.%20Majority%20Element/Solution.py) | no | [C++](http://www.liuchuo.net/archives/930) | [Swift](https://www.liuchuo.net/archives/5198) | | 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/) | Easy | no | no | no | no | no | | 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/171.%20Excel%20Sheet%20Column%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/171.%20Excel%20Sheet%20Column%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/928) | no | | 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/172.%20Factorial%20Trailing%20Zeroes/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/172.%20Factorial%20Trailing%20Zeroes/Solution.py) | no | [C++](http://www.liuchuo.net/archives/975) | no | | 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/173.%20Binary%20Search%20Tree%20Iterator/Solution.java) | no | no | no | no | | 179 | [Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/179.%20Largest%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/179.%20Largest%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3129) | no | | 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/) | Medium | no | no | no | no | no | | 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/187.%20Repeated%20DNA%20Sequences/Solution.java) | no | no | no | no | | 189 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/189.%20Rotate%20Array/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/189.%20Rotate%20Array/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1017) | no | | 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/190.%20Reverse%20Bits/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/190.%20Reverse%20Bits/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1055) | no | | 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/191.%20Number%20of%201%20Bits/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/191.%20Number%20of%201%20Bits/Solution.py) | no | [C++](http://www.liuchuo.net/archives/936) | no | | 198 | [House Robber](https://leetcode.com/problems/house-robber/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/198.%20House%20Robber/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/198.%20House%20Robber/Solution.py) | no | [C++](http://www.liuchuo.net/archives/967) | [Swift](https://www.liuchuo.net/archives/5200) | | 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/199.%20Binary%20Tree%20Right%20Side%20View/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/199.%20Binary%20Tree%20Right%20Side%20View/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1268) | no | | 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/200.%20Number%20of%20Islands/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/200.%20Number%20of%20Islands/Solution.py) | no | [C++](https://www.liuchuo.net/archives/4392) | no | | 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/201.%20Bitwise%20AND%20of%20Numbers%20Range/Solution.java) | no | no | no | no | | 202 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/202.%20Happy%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/202.%20Happy%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/946) | no | | 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/203.%20Remove%20Linked%20List%20Elements/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/203.%20Remove%20Linked%20List%20Elements/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1067) | no | | 204 | [Count Primes](https://leetcode.com/problems/count-primes/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/204.%20Count%20Primes/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1015) | no | | 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/205.%20Isomorphic%20Strings/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/205.%20Isomorphic%20Strings/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1048) | no | | 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/206.%20Reverse%20Linked%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/206.%20Reverse%20Linked%20List/Solution.py) | no | [C++](http://www.liuchuo.net/archives/934) | [Swift](https://www.liuchuo.net/archives/5202) | | 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | Medium | no | no | no | no | no | | 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/208.%20Implement%20Trie%20(Prefix%20Tree)/Solution.java) | no | no | no | no | | 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3062) | no | | 212 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/212.%20Word%20Search%20II/Solution.java) | no | no | no | no | | 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/213.%20House%20Robber%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/213.%20House%20Robber%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1207) | no | | 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/215.%20Kth%20Largest%20Element%20in%20an%20Array/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/215.%20Kth%20Largest%20Element%20in%20an%20Array/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3016) | [Swift](https://www.liuchuo.net/archives/5204) | | 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/216.%20Combination%20Sum%20III/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/216.%20Combination%20Sum%20III/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3060) | no | | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/217.%20Contains%20Duplicate/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/217.%20Contains%20Duplicate/Solution.py) | no | [C++](http://www.liuchuo.net/archives/932) | no | | 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/219.%20Contains%20Duplicate%20II/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/219.%20Contains%20Duplicate%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1044) | no | | 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3150) | no | | 221 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/221.%20Maximal%20Square/Solution.java) | no | no | no | no | | 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/222.%20Count%20Complete%20Tree%20Nodes/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/222.%20Count%20Complete%20Tree%20Nodes/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3253) | no | | 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/223.%20Rectangle%20Area/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/223.%20Rectangle%20Area/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1046) | no | | 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/225.%20Implement%20Stack%20using%20Queues/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1076) | no | | 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/226.%20Invert%20Binary%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/226.%20Invert%20Binary%20Tree/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/226.%20Invert%20Binary%20Tree/Solution.rb) | [C++](http://www.liuchuo.net/archives/919) | no | | 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | no | no | no | no | no | | 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/228.%20Summary%20Ranges/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/228.%20Summary%20Ranges/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3058) | no | | 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/229.%20Majority%20Element%20II/Solution.java) | no | no | no | no | | 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/230.%20Kth%20Smallest%20Element%20in%20a%20BST/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/230.%20Kth%20Smallest%20Element%20in%20a%20BST/Solution.py) | [Ruby](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/230.%20Kth%20Smallest%20Element%20in%20a%20BST/Solution.rb) | [C++](http://www.liuchuo.net/archives/3226) | no | | 231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/231.%20Power%20of%20Two/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/231.%20Power%20of%20Two/Solution.py) | no | [C++](http://www.liuchuo.net/archives/950) | no | | 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/232.%20Implement%20Queue%20using%20Stacks/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/971) | no | | 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/234.%20Palindrome%20Linked%20List/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1079) | [Swift](https://www.liuchuo.net/archives/5206) | | 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Solution.py) | no | [C++](http://www.liuchuo.net/archives/965) | no | | 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/Solution.py) | no | no | no | | 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/237.%20Delete%20Node%20in%20a%20Linked%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/237.%20Delete%20Node%20in%20a%20Linked%20List/Solution.py) | no | [C++](http://www.liuchuo.net/archives/921) | no | | 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/238.%20Product%20of%20Array%20Except%20Self/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/238.%20Product%20of%20Array%20Except%20Self/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1013) | [Swift](https://www.liuchuo.net/archives/5208) | | 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/239.%20Sliding%20Window%20Maximum/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/239.%20Sliding%20Window%20Maximum/Solution.py) | no | no | no | | 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/240.%20Search%20a%202D%20Matrix%20II/Solution.java) | no | no | [C++](https://www.liuchuo.net/archives/4461) | no | | 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) | Medium | no | no | no | no | no | | 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/242.%20Valid%20Anagram/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/242.%20Valid%20Anagram/Solution.py) | no | [C++](http://www.liuchuo.net/archives/926) | no | | 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/) | Easy | no | no | no | no | no | | 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/) | Medium | no | no | no | no | no | | 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/) | Medium | no | no | no | no | no | | 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/) | Easy | no | no | no | no | no | | 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/) | Medium | no | no | no | no | no | | 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/) | Hard | no | no | no | no | no | | 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/) | Easy | no | no | no | no | no | | 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/) | Medium | no | no | no | no | no | | 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/) | Medium | no | no | no | no | no | | 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) | Easy | no | no | no | no | no | | 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | no | no | no | no | no | | 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations/) | Medium | no | no | no | no | no | | 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/) | Medium | no | no | no | no | no | | 256 | [Paint House](https://leetcode.com/problems/paint-house/) | Medium | no | no | no | no | no | | 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/257.%20Binary%20Tree%20Paths/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/257.%20Binary%20Tree%20Paths/Solution.py) | no | no | no | | 258 | [Add Digits](https://leetcode.com/problems/add-digits/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/258.%20Add%20Digits/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/258.%20Add%20Digits/Solution.py) | no | [C++](https://www.liuchuo.net/archives/2971) | no | | 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller/) | Medium | no | no | no | no | no | | 260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/260.%20Single%20Number%20III/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/260.%20Single%20Number%20III/Solution.py) | no | [C++](http://www.liuchuo.net/archives/981) | no | | 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) | Medium | no | no | no | no | no | | 263 | [Ugly Number](https://leetcode.com/problems/ugly-number/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/263.%20Ugly%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/263.%20Ugly%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/943) | no | | 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/264.%20Ugly%20Number%20II/Solution.java) | no | no | no | no | | 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii/) | Hard | no | no | no | no | no | | 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/) | Easy | no | no | no | no | no | | 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/) | Medium | no | no | no | no | no | | 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/268.%20Missing%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/268.%20Missing%20Number/Solution.py) | no | [C++](http://www.liuchuo.net/archives/989) | no | | 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | Hard | no | no | no | no | no | | 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/) | Easy | no | no | no | no | no | | 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) | Medium | no | no | no | no | no | | 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/) | Hard | no | no | no | no | no | | 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/273.%20Integer%20to%20English%20Words/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/273.%20Integer%20to%20English%20Words/Solution.py) | no | no | no | | 274 | [H-Index](https://leetcode.com/problems/h-index/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/274.%20H-Index/Solution.java) | no | no | no | no | | 275 | [H-Index II](https://leetcode.com/problems/h-index-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/275.%20H-Index%20II/Solution.java) | no | no | no | no | | 276 | [Paint Fence](https://leetcode.com/problems/paint-fence/) | Easy | no | no | no | no | no | | 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/) | Medium | no | no | no | no | no | | 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/278.%20First%20Bad%20Version/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/278.%20First%20Bad%20Version/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1140) | no | | 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/279.%20Perfect%20Squares/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1213) | no | | 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort/) | Medium | no | no | no | no | no | | 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/) | Medium | no | no | no | no | no | | 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators/) | Hard | no | no | no | no | no | | 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/283.%20Move%20Zeroes/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/283.%20Move%20Zeroes/Solution.py) | no | [C++](http://www.liuchuo.net/archives/2975) | [Swift](https://www.liuchuo.net/archives/5210) | | 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/284.%20Peeking%20Iterator/Solution.java) | no | no | no | no | | 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/) | Medium | no | no | no | no | no | | 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | Medium | no | no | no | no | no | | 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/287.%20Find%20the%20Duplicate%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/287.%20Find%20the%20Duplicate%20Number/Solution.py) | no | no | [Swift](https://www.liuchuo.net/archives/5212) | | 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/) | Easy | no | no | no | no | no | | 289 | [Game of Life](https://leetcode.com/problems/game-of-life/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/289.%20Game%20of%20Life/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/289.%20Game%20of%20Life/Solution.py) | no | no | no | | 290 | [Word Pattern](https://leetcode.com/problems/word-pattern/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/290.%20Word%20Pattern/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/290.%20Word%20Pattern/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1061) | no | | 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii/) | Hard | no | no | no | no | no | | 292 | [Nim Game](https://leetcode.com/problems/nim-game/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/292.%20Nim%20Game/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/292.%20Nim%20Game/Solution.py) | no | [C++](http://www.liuchuo.net/archives/889) | no | | 293 | [Flip Game](https://leetcode.com/problems/flip-game/) | Easy | no | no | no | no | no | | 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii/) | Medium | no | no | no | no | no | | 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/295.%20Find%20Median%20from%20Data%20Stream/Solution.java) | no | no | no | no | | 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point/) | Hard | no | no | no | no | no | | 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/Solution.java) | no | no | no | no | | 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/) | Medium | no | no | no | no | no | | 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/299.%20Bulls%20and%20Cows/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/299.%20Bulls%20and%20Cows/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1051) | no | | 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/300.%20Longest%20Increasing%20Subsequence/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1209) | no | | 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/) | Hard | no | no | no | no | no | | 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/) | Hard | no | no | no | no | no | | 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/303.%20Range%20Sum%20Query%20-%20Immutable/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/303.%20Range%20Sum%20Query%20-%20Immutable/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1132) | no | | 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | Medium | no | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/304.%20Range%20Sum%20Query%202D%20-%20Immutable/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1211) | no | | 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/) | Hard | no | no | no | no | no | | 306 | [Additive Number](https://leetcode.com/problems/additive-number/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/306.%20Additive%20Number/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/306.%20Additive%20Number/Solution.py) | no | no | no | | 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/307.%20Range%20Sum%20Query%20-%20Mutable/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3146) | no | | 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/) | Hard | no | no | no | no | no | | 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/Solution.java) | no | no | no | no | | 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | Medium | no | no | no | no | no | | 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | Medium | no | no | no | no | no | | 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | Hard | no | no | no | no | no | | 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number/) | Medium | no | no | no | no | no | | 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) | Medium | no | no | no | no | no | | 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/315.%20Count%20of%20Smaller%20Numbers%20After%20Self/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/315.%20Count%20of%20Smaller%20Numbers%20After%20Self/Solution.py) | no | no | no | | 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/316.%20Remove%20Duplicate%20Letters/Solution.java) | no | no | no | no | | 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | Hard | no | no | no | no | no | | 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/318.%20Maximum%20Product%20of%20Word%20Lengths/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/318.%20Maximum%20Product%20of%20Word%20Lengths/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3126) | no | | 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/319.%20Bulb%20Switcher/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/319.%20Bulb%20Switcher/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1154) | no | | 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/) | Medium | no | no | no | no | no | | 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number/) | Hard | no | no | no | no | no | | 322 | [Coin Change](https://leetcode.com/problems/coin-change/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/322.%20Coin%20Change/Solution.java) | no | no | [C++](https://www.liuchuo.net/archives/4563) | no | | 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium | no | no | no | no | no | | 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/) | Medium | no | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/324.%20Wiggle%20Sort%20II/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3188) | no | | 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/) | Medium | no | no | no | no | no | | 326 | [Power of Three](https://leetcode.com/problems/power-of-three/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/326.%20Power%20of%20Three/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/326.%20Power%20of%20Three/Solution.py) | no | [C++](http://www.liuchuo.net/archives/952) | no | | 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | Hard | no | no | no | no | no | | 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/328.%20Odd%20Even%20Linked%20List/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/328.%20Odd%20Even%20Linked%20List/Solution.py) | no | [C++](http://www.liuchuo.net/archives/3251) | no | | 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/329.%20Longest%20Increasing%20Path%20in%20a%20Matrix/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/329.%20Longest%20Increasing%20Path%20in%20a%20Matrix/Solution.py) | no | no | no | | 330 | [Patching Array](https://leetcode.com/problems/patching-array/) | Hard | no | no | no | [C++](http://www.liuchuo.net/archives/1222) | no | | 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/331.%20Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/331.%20Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/Solution.py) | no | no | no | | 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | no | no | no | no | no | | 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/) | Medium | no | no | no | no | no | | 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/334.%20Increasing%20Triplet%20Subsequence/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/334.%20Increasing%20Triplet%20Subsequence/Solution.py) | no | no | no | | 335 | [Self Crossing](https://leetcode.com/problems/self-crossing/) | Hard | no | no | no | no | no | | 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | Hard | no | no | no | no | no | | 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/337.%20House%20Robber%20III/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/337.%20House%20Robber%20III/Solution.py) | no | no | no | | 338 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/338.%20Counting%20Bits/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/338.%20Counting%20Bits/Solution.py) | no | [C++](http://www.liuchuo.net/archives/983) | [Swift](https://www.liuchuo.net/archives/5214) | | 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | Easy | no | no | no | no | no | | 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) | Hard | no | no | no | no | no | | 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/341.%20Flatten%20Nested%20List%20Iterator/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/341.%20Flatten%20Nested%20List%20Iterator/Solution.py) | no | no | no | | 342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/342.%20Power%20of%20Four/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/342.%20Power%20of%20Four/Solution.py) | no | no | no | | 343 | [Integer Break](https://leetcode.com/problems/integer-break/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/343.%20Integer%20Break/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/343.%20Integer%20Break/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1126) | no | | 344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/344.%20Reverse%20String/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/344.%20Reverse%20String/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1122) | no | | 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/345.%20Reverse%20Vowels%20of%20a%20String/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/345.%20Reverse%20Vowels%20of%20a%20String/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1124) | no | | 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) | Easy | no | no | no | no | no | | 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/347.%20Top%20K%20Frequent%20Elements/Solution.java) | [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/347.%20Top%20K%20Frequent%20Elements/Solution.py) | no | [C++](http://www.liuchuo.net/archives/1188) | [Swift](https://www.liuchuo.net/archives/5217) | | 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/) | Medium | no | no | no | no | no | | 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/349.%20Intersection%20of%20Two%20Arrays/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1324) | no | | 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/350.%20Intersection%20of%20Two%20Arrays%20II/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3024) | no | | 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) | Medium | no | no | no | no | no | | 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/352.%20Data%20Stream%20as%20Disjoint%20Intervals/Solution.java) | no | no | no | no | | 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | no | no | no | no | no | | 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/354.%20Russian%20Doll%20Envelopes/Solution.java) | no | no | no | no | | 355 | [Design Twitter](https://leetcode.com/problems/design-twitter/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/355.%20Design%20Twitter/Solution.java) | no | no | no | no | | 356 | [Line Reflection](https://leetcode.com/problems/line-reflection/) | Medium | no | no | no | no | no | | 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/357.%20Count%20Numbers%20with%20Unique%20Digits/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3106) | no | | 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/) | Hard | no | no | no | no | no | | 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | no | no | no | no | no | | 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/) | Medium | no | no | no | no | no | | 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy/) | Medium | no | no | no | no | no | | 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | no | no | no | no | no | | 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-sub-matrix-no-larger-than-k/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/363.%20Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/Solution.java) | no | no | no | no | | 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/) | Medium | no | no | no | no | no | | 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/365.%20Water%20and%20Jug%20Problem/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3247) | no | | 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | Medium | no | no | no | no | no | | 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/367.%20Valid%20Perfect%20Square/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3215) | no | | 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/368.%20Largest%20Divisible%20Subset/Solution.java) | no | no | no | no | | 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/) | Medium | no | no | no | no | no | | 370 | [Range Addition](https://leetcode.com/problems/range-addition/) | Medium | no | no | no | no | no | | 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/371.%20Sum%20of%20Two%20Integers/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/1882) | no | | 372 | [Super Pow](https://leetcode.com/problems/super-pow/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/372.%20Super%20Pow/Solution.java) | no | no | no | no | | 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/373.%20Find%20K%20Pairs%20with%20Smallest%20Sums/Solution.java) | no | no | no | no | | 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/374.%20Guess%20Number%20Higher%20or%20Lower/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3036) | no | | 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/375.%20Guess%20Number%20Higher%20or%20Lower%20II/Solution.java) | no | no | no | no | | 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/376.%20Wiggle%20Subsequence/Solution.java) | no | no | no | no | | 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/377.%20Combination%20Sum%20IV/Solution.java) | no | no | [C++](https://www.liuchuo.net/archives/4550) | no | | 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/378.%20Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3022) | no | | 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory/) | Medium | no | no | no | no | no | | 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/380.%20Insert%20Delete%20GetRandom%20O(1)/Solution.java) | no | no | no | no | | 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/381.%20Insert%20Delete%20GetRandom%20O(1)%20-%20Duplicates%20allowed/Solution.java) | no | no | no | no | | 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/382.%20Linked%20List%20Random%20Node/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3094) | no | | 383 | [Ransom Note](https://leetcode.com/problems/ransom-note/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/383.%20Ransom%20Note/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/2270) | no | | 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/384.%20Shuffle%20an%20Array/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3108) | no | | 385 | [Mini Parser](https://leetcode.com/problems/mini-parser/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/385.%20Mini%20Parser/Solution.java) | no | no | no | no | | 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/386.%20Lexicographical%20Numbers/Solution.java) | no | no | no | no | | 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/387.%20First%20Unique%20Character%20in%20a%20String/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/2382) | no | | 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/388.%20Longest%20Absolute%20File%20Path/Solution.java) | no | no | no | no | | 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/389.%20Find%20the%20Difference/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3020) | no | | 390 | [Elimination Game](https://leetcode.com/problems/elimination-game/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/390.%20Elimination%20Game/Solution.java) | no | no | no | no | | 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/391.%20Perfect%20Rectangle/Solution.java) | no | no | no | no | | 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/392.%20Is%20Subsequence/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3110) | no | | 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/393.%20UTF-8%20Validation/Solution.java) | no | no | no | no | | 394 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/394.%20Decode%20String/Solution.java) | no | no | no | [Swift](https://www.liuchuo.net/archives/5219) | | 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/395.%20Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/Solution.java) | no | no | no | no | | 396 | [Rotate Function](https://leetcode.com/problems/rotate-function/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/396.%20Rotate%20Function/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3033) | no | | 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/397.%20Integer%20Replacement/Solution.java) | no | no | no | no | | 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/398.%20Random%20Pick%20Index/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3096) | no | | 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | no | no | no | no | no | | 400 | [Nth Digit](https://leetcode.com/problems/nth-digit/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/400.%20Nth%20Digit/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3046) | no | | 401 | [Binary Watch](https://leetcode.com/problems/binary-watch/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/401.%20Binary%20Watch/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3031) | no | | 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/402.%20Remove%20K%20Digits/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3223) | no | | 403 | [Frog Jump](https://leetcode.com/problems/frog-jump/) | Hard | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/403.%20Frog%20Jump/Solution.java) | no | no | no | no | | 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/404.%20Sum%20of%20Left%20Leaves/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3042) | no | | 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/405.%20Convert%20a%20Number%20to%20Hexadecimal/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3044) | no | | 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/406.%20Queue%20Reconstruction%20by%20Height/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3079) | no | | 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/) | Hard | no | no | no | no | no | | 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/) | Easy | no | no | no | no | no | | 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/409.%20Longest%20Palindrome/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3018) | no | | 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | Hard | no | no | no | no | no | | 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/) | Hard | no | no | no | no | no | | 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3009) | no | | 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3076) | no | | 415 | [Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/415.%20Add%20Strings/Solution.java) | no | no | [C++](http://www.liuchuo.net/archives/3011) | no | | 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/416.%20Partition%20Equal%20Subset%20Sum/Solution.java) | no | no | no | no | | 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | Medium | [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/417.%20Pacific%20Atlantic%20Water%20Flow/Solution.java) | no | no | no | no | | 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/) | Medium | no | no | no | no | no | | 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3081) | no | | 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3120) | no | | 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3002) | no | | 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3038) | [Swift](https://www.liuchuo.net/archives/5221) | | 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2997) | [Swift](https://www.liuchuo.net/archives/5223) | | 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2994) | no | | 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3054) | no | | 443 | [String Compression](https://leetcode.com/problems/string-compression/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4285) | no | | 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3100) | no | | 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2992) | no | | 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2990) | [Swift](https://www.liuchuo.net/archives/5225) | | 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3072) | no | | 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3007) | no | | 454 | [4Sum II](https://leetcode.com/problems/4sum-ii/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3118) | no | | 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3005) | no | | 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2988) | no | | 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2917) | [Swift](https://www.liuchuo.net/archives/5227) | | 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3085) | no | | 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2984) | no | | 464 | [Can I Win](https://leetcode.com/problems/can-i-win/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3155) | no | | 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3165) | no | | 475 | [Heaters](https://leetcode.com/problems/heaters/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2981) | no | | 476 | [Number Complement](https://leetcode.com/problems/number-complement/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2979) | no | | 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/3104) | no | | 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4373) | no | | 481 | [Magical String](https://leetcode.com/problems/magical-string/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3087) | no | | 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3124) | no | | 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/2977) | no | | 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3217) | no | | 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3211) | no | | 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3083) | no | | 494 | [Target Sum](https://leetcode.com/problems/target-sum/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3098) | no | | 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3209) | no | | 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3197) | no | | 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3206) | no | | 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3202) | no | | 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3174) | no | | 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3200) | no | | 504 | [Base 7](https://leetcode.com/problems/base-7/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3267) | no | | 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks/) | Easy | no | no | no | [C++](http://www.liuchuo.net/archives/3195) | no | | 507 | [Perfect Number](https://leetcode.com/problems/perfect-number/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4293) | no | | 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3193) | no | | 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3265) | no | | 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3263) | no | | 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | Medium | no | no | no | [C++](http://www.liuchuo.net/archives/3204) | no | | 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4295) | no | | 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4375) | no | | 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4455) | no | | 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4297) | [Swift](https://www.liuchuo.net/archives/5229) | | 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4347) | no | | 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4349) | [Swift](https://www.liuchuo.net/archives/5231) | | 547 | [Friend Circles](https://leetcode.com/problems/friend-circles/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4463) | no | | 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4351) | no | | 553 | [Optimal Division](https://leetcode.com/problems/optimal-division/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4467) | no | | 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4309) | no | | 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4353) | no | | 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4355) | no | | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4357) | [Swift](https://www.liuchuo.net/archives/5234) | | 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4359) | no | | 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4377) | [Swift](https://www.liuchuo.net/archives/5236) | | 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4379) | no | | 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/description/) | Easy | no | no | no | no | [Swift](https://www.liuchuo.net/archives/5240) | | 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4432) | no | | 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4400) | no | | 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4361) | no | | 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4435) | no | | 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4544) | no | | 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4389) | no | | 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4453) | no | | 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4457) | no | | 657 | [Judge Route Circle](https://leetcode.com/problems/judge-route-circle/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4365) | [Swift](https://www.liuchuo.net/archives/5242) | | 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4300) | no | | 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4402) | no | | 695 | [Max Area of Island]() | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4394) | [Swift](https://www.liuchuo.net/archives/5244) | | 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case/description/) | Easy | no | no | no | no | [Swift](https://www.liuchuo.net/archives/5249) | | 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4369) | no | | 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4398) | no | | 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4371) | no | | 733 | [Flood Fill](https://leetcode.com/problems/flood-fill/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4396) | no | | 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4345) | no | | 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4548) | no | | 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4342) | no | | 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4541) | no | | 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4340) | no | | 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4332) | no | | 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4330) | no | | 763 | [Partition Labels](https://leetcode.com/problems/partition-labels/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4327) | no | | 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4325) | no | | 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii/description/) | Hard | no | no | no | [C++](https://www.liuchuo.net/archives/4317) | no | | 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4315) | no | | 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/description/) | Easy | no | no | no | [C++](https://www.liuchuo.net/archives/4322) | [Swift](https://www.liuchuo.net/archives/5247) | | 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4319) | no | | 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/description/) | Medium | no | no | no | [C++](https://www.liuchuo.net/archives/4439) | no | | 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/description/) | Easy | no | no | no | no | [Swift](https://www.liuchuo.net/archives/5255) | | 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image/description/) | Easy | no | no | no | no | [Swift](https://www.liuchuo.net/archives/5257) |