实例介绍
【实例简介】
leetcode全套解答python版本。包括更新到10月份的的leetcode
【实例截图】
【核心代码】
lc-all-solutions-master
└── lc-all-solutions-master
├── 001.two-sum
│ ├── question.md
│ └── two-sum.py
├── 002.add-two-numbers
│ ├── add-two-numbers.py
│ └── question.md
├── 003.longest-substring-without-repeating-characters
│ ├── longest-substring-without-repeating-characters.py
│ └── question.md
├── 004.median-of-two-sorted-arrays
│ ├── median-of-two-sorted-arrays.py
│ └── question.md
├── 005.longest-palindromic-substring
│ ├── longest-palindromic-substring.py
│ └── question.md
├── 006.zigzag-conversion
│ ├── question.md
│ └── zigzag-conversion.py
├── 007.reverse-integer
│ ├── question.md
│ └── reverse-integer.py
├── 008.string-to-integer-atoi
│ ├── question.md
│ └── string-to-integer-atoi.py
├── 009.palindrome-number
│ ├── palindrome-number.py
│ └── question.md
├── 010.regular-expression-matching
│ ├── question.md
│ └── regular-expression-matching.py
├── 011.container-with-most-water
│ ├── container-with-most-water.py
│ └── question.md
├── 012.integer-to-roman
│ ├── integer-to-roman.py
│ └── question.md
├── 013.roman-to-integer
│ ├── question.md
│ └── roman-to-integer.py
├── 014.longest-common-prefix
│ ├── longest-common-prefix.py
│ └── question.md
├── 015.3sum
│ ├── 3sum.py
│ └── question.md
├── 016.3sum-closest
│ ├── 3sum-closest.py
│ └── question.md
├── 017.letter-combinations-of-a-phone-number
│ ├── letter-combinations-of-a-phone-number.py
│ └── question.md
├── 018.4sum
│ ├── 4sum.py
│ └── question.md
├── 019.remove-nth-node-from-end-of-list
│ ├── question.md
│ └── remove-nth-node-from-end-of-list.py
├── 020.valid-parentheses
│ ├── question.md
│ └── valid-parentheses.py
├── 021.merge-two-sorted-lists
│ ├── merge-two-sorted-lists.py
│ └── question.md
├── 022.generate-parentheses
│ ├── generate-parentheses.py
│ └── question.md
├── 023.merge-k-sorted-lists
│ ├── merge-k-sorted-lists.py
│ └── question.md
├── 024.swap-nodes-in-pairs
│ ├── question.md
│ └── swap-nodes-in-pairs.py
├── 025.reverse-nodes-in-k-group
│ ├── question.md
│ └── reverse-nodes-in-k-group.py
├── 026.remove-duplicates-from-sorted-array
│ ├── question.md
│ └── remove-duplicates-from-sorted-array.py
├── 027.remove-element
│ ├── question.md
│ └── remove-element.py
├── 028.implement-strstr
│ ├── implement-strstr.py
│ └── question.md
├── 029.divide-two-integers
│ ├── divide-two-integers.py
│ └── question.md
├── 030.substring-with-concatenation-of-all-words
│ ├── question.md
│ └── substring-with-concatenation-of-all-words.py
├── 031.next-permutation
│ ├── next-permutation.py
│ └── question.md
├── 032.longest-valid-parentheses
│ ├── longest-valid-parentheses.py
│ └── question.md
├── 033.search-in-rotated-sorted-array
│ ├── question.md
│ └── search-in-rotated-sorted-array.py
├── 034.search-for-a-range
│ ├── question.md
│ └── search-for-a-range.py
├── 035.search-insert-position
│ ├── question.md
│ └── search-insert-position.py
├── 036.valid-sudoku
│ ├── question.md
│ └── valid-sudoku.py
├── 037.sudoku-solver
│ ├── question.md
│ └── sudoku-solver.py
├── 038.count-and-say
│ ├── count-and-say.py
│ └── question.md
├── 039.combination-sum
│ ├── combination-sum.py
│ └── question.md
├── 040.combination-sum-ii
│ ├── combination-sum-ii.py
│ └── question.md
├── 041.first-missing-positive
│ ├── first-missing-positive.py
│ └── question.md
├── 042.trapping-rain-water
│ ├── question.md
│ └── trapping-rain-water.py
├── 043.multiply-strings
│ ├── multiply-strings.py
│ └── question.md
├── 044.wildcard-matching
│ ├── question.md
│ └── wildcard-matching.py
├── 045.jump-game-ii
│ ├── jump-game-ii.py
│ └── question.md
├── 046.permutations
│ ├── permutations.py
│ └── question.md
├── 047.permutations-ii
│ ├── permutations-ii.py
│ └── question.md
├── 048.rotate-image
│ ├── question.md
│ └── rotate-image.py
├── 049.anagrams
│ ├── anagrams.py
│ └── question.md
├── 049.group-anagrams
│ ├── group-anagrams.py
│ └── question.md
├── 050.powx-n
│ ├── powx-n.py
│ └── question.md
├── 051.n-queens
│ ├── n-queens.py
│ └── question.md
├── 052.n-queens-ii
│ ├── n-queens-ii.py
│ └── question.md
├── 053.maximum-subarray
│ ├── maximum-subarray.py
│ └── question.md
├── 054.spiral-matrix
│ ├── question.md
│ └── spiral-matrix.py
├── 055.jump-game
│ ├── jump-game.py
│ └── question.md
├── 056.merge-intervals
│ ├── merge-intervals.py
│ └── question.md
├── 057.insert-interval
│ ├── insert-interval.py
│ └── question.md
├── 058.length-of-last-word
│ ├── length-of-last-word.py
│ └── question.md
├── 059.spiral-matrix-ii
│ ├── question.md
│ └── spiral-matrix-ii.py
├── 060.permutation-sequence
│ ├── permutation-sequence.py
│ └── question.md
├── 061.rotate-list
│ ├── question.md
│ └── rotate-list.py
├── 062.unique-paths
│ ├── question.md
│ └── unique-paths.py
├── 063.unique-paths-ii
│ ├── question.md
│ └── unique-paths-ii.py
├── 064.minimum-path-sum
│ ├── minimum-path-sum.py
│ └── question.md
├── 065.valid-number
│ ├── question.md
│ └── valid-number.py
├── 066.plus-one
│ ├── plus-one.py
│ └── question.md
├── 067.add-binary
│ ├── add-binary.py
│ └── question.md
├── 068.text-justification
│ ├── question.md
│ └── text-justification.py
├── 069.sqrtx
│ ├── question.md
│ └── sqrtx.py
├── 070.climbing-stairs
│ ├── climbing-stairs.py
│ └── question.md
├── 071.simplify-path
│ ├── question.md
│ └── simplify-path.py
├── 072.edit-distance
│ ├── edit-distance.py
│ └── question.md
├── 073.set-matrix-zeroes
│ ├── question.md
│ └── set-matrix-zeroes.py
├── 074.search-a-2d-matrix
│ ├── question.md
│ └── search-a-2d-matrix.py
├── 075.sort-colors
│ ├── question.md
│ └── sort-colors.py
├── 076.minimum-window-substring
│ ├── minimum-window-substring.py
│ └── question.md
├── 077.combinations
│ ├── combinations.py
│ └── question.md
├── 078.subsets
│ ├── question.md
│ └── subsets.py
├── 079.word-search
│ ├── question.md
│ └── word-search.py
├── 080.remove-duplicates-from-sorted-array-ii
│ ├── question.md
│ └── remove-duplicates-from-sorted-array-ii.py
├── 081.search-in-rotated-sorted-array-ii
│ ├── question.md
│ └── search-in-rotated-sorted-array-ii.py
├── 082.remove-duplicates-from-sorted-list-ii
│ ├── question.md
│ └── remove-duplicates-from-sorted-list-ii.py
├── 083.remove-duplicates-from-sorted-list
│ ├── question.md
│ └── remove-duplicates-from-sorted-list.py
├── 084.largest-rectangle-in-histogram
│ ├── largest-rectangle-in-histogram.py
│ └── question.md
├── 085.maximal-rectangle
│ ├── maximal-rectangle.py
│ └── question.md
├── 086.partition-list
│ ├── partition-list.py
│ └── question.md
├── 087.scramble-string
│ ├── question.md
│ └── scramble-string.py
├── 088.merge-sorted-array
│ ├── merge-sorted-array.py
│ └── question.md
├── 089.gray-code
│ ├── gray-code.py
│ └── question.md
├── 090.subsets-ii
│ ├── question.md
│ └── subsets-ii.py
├── 091.decode-ways
│ ├── decode-ways.py
│ └── question.md
├── 092.reverse-linked-list-ii
│ ├── question.md
│ └── reverse-linked-list-ii.py
├── 093.restore-ip-addresses
│ ├── question.md
│ └── restore-ip-addresses.py
├── 094.binary-tree-inorder-traversal
│ ├── binary-tree-inorder-traversal.py
│ └── question.md
├── 095.unique-binary-search-trees-ii
│ ├── question.md
│ └── unique-binary-search-trees-ii.py
├── 096.unique-binary-search-trees
│ ├── question.md
│ └── unique-binary-search-trees.py
├── 097.interleaving-string
│ ├── interleaving-string.py
│ └── question.md
├── 098.validate-binary-search-tree
│ ├── question.md
│ └── validate-binary-search-tree.py
├── 099.recover-binary-search-tree
│ ├── question.md
│ └── recover-binary-search-tree.py
├── 100.same-tree
│ ├── question.md
│ └── same-tree.py
├── 101.symmetric-tree
│ ├── question.md
│ └── symmetric-tree.py
├── 102.binary-tree-level-order-traversal
│ ├── binary-tree-level-order-traversal.py
│ └── question.md
├── 103.binary-tree-zigzag-level-order-traversal
│ ├── binary-tree-zigzag-level-order-traversal.py
│ └── question.md
├── 104.maximum-depth-of-binary-tree
│ ├── maximum-depth-of-binary-tree.py
│ └── question.md
├── 105.construct-binary-tree-from-preorder-and-inorder-traversal
│ ├── construct-binary-tree-from-preorder-and-inorder-traversal.py
│ └── question.md
├── 106.construct-binary-tree-from-inorder-and-postorder-traversal
│ ├── construct-binary-tree-from-inorder-and-postorder-traversal.py
│ └── question.md
├── 107.binary-tree-level-order-traversal-ii
│ ├── binary-tree-level-order-traversal-ii.py
│ └── question.md
├── 108.convert-sorted-array-to-binary-search-tree
│ ├── convert-sorted-array-to-binary-search-tree.py
│ └── question.md
├── 109.convert-sorted-list-to-binary-search-tree
│ ├── convert-sorted-list-to-binary-search-tree.py
│ └── question.md
├── 110.balanced-binary-tree
│ ├── balanced-binary-tree.py
│ └── question.md
├── 111.minimum-depth-of-binary-tree
│ ├── minimum-depth-of-binary-tree.py
│ └── question.md
├── 112.path-sum
│ ├── path-sum.py
│ └── question.md
├── 113.path-sum-ii
│ ├── path-sum-ii.py
│ └── question.md
├── 114.flatten-binary-tree-to-linked-list
│ ├── flatten-binary-tree-to-linked-list.py
│ └── question.md
├── 115.distinct-subsequences
│ ├── distinct-subsequences.py
│ └── question.md
├── 116.populating-next-right-pointers-in-each-node
│ ├── populating-next-right-pointers-in-each-node.py
│ └── question.md
├── 117.populating-next-right-pointers-in-each-node-ii
│ ├── populating-next-right-pointers-in-each-node-ii.py
│ └── question.md
├── 118.pascals-triangle
│ ├── pascals-triangle.py
│ └── question.md
├── 119.pascals-triangle-ii
│ ├── pascals-triangle-ii.py
│ └── question.md
├── 120.triangle
│ ├── question.md
│ └── triangle.py
├── 121.best-time-to-buy-and-sell-stock
│ ├── best-time-to-buy-and-sell-stock.py
│ └── question.md
├── 122.best-time-to-buy-and-sell-stock-ii
│ ├── best-time-to-buy-and-sell-stock-ii.py
│ └── question.md
├── 123.best-time-to-buy-and-sell-stock-iii
│ ├── best-time-to-buy-and-sell-stock-iii.py
│ └── question.md
├── 124.binary-tree-maximum-path-sum
│ ├── binary-tree-maximum-path-sum.py
│ └── question.md
├── 125.valid-palindrome
│ ├── question.md
│ └── valid-palindrome.py
├── 126.word-ladder-ii
│ ├── question.md
│ └── word-ladder-ii.py
├── 127.word-ladder
│ ├── question.md
│ └── word-ladder.py
├── 128.longest-consecutive-sequence
│ ├── longest-consecutive-sequence.py
│ └── question.md
├── 129.sum-root-to-leaf-numbers
│ ├── question.md
│ └── sum-root-to-leaf-numbers.py
├── 130.surrounded-regions
│ ├── question.md
│ └── surrounded-regions.py
├── 131.palindrome-partitioning
│ ├── palindrome-partitioning.py
│ └── question.md
├── 132.palindrome-partitioning-ii
│ ├── palindrome-partitioning-ii.py
│ └── question.md
├── 133.clone-graph
│ ├── clone-graph.py
│ └── question.md
├── 134.gas-station
│ ├── gas-station.py
│ └── question.md
├── 135.candy
│ ├── candy.py
│ └── question.md
├── 136.single-number
│ ├── question.md
│ └── single-number.py
├── 137.single-number-ii
│ ├── question.md
│ └── single-number-ii.py
├── 138.copy-list-with-random-pointer
│ ├── copy-list-with-random-pointer.py
│ └── question.md
├── 139.word-break
│ ├── question.md
│ └── word-break.py
├── 140.word-break-ii
│ ├── question.md
│ └── word-break-ii.py
├── 141.linked-list-cycle
│ ├── linked-list-cycle.py
│ └── question.md
├── 142.linked-list-cycle-ii
│ ├── linked-list-cycle-ii.py
│ └── question.md
├── 143.reorder-list
│ ├── question.md
│ └── reorder-list.py
├── 144.binary-tree-preorder-traversal
│ ├── binary-tree-preorder-traversal.py
│ └── question.md
├── 145.binary-tree-postorder-traversal
│ ├── binary-tree-postorder-traversal.py
│ └── question.md
├── 146.lru-cache
│ ├── lru-cache.py
│ └── question.md
├── 147.insertion-sort-list
│ ├── insertion-sort-list.py
│ └── question.md
├── 148.sort-list
│ ├── question.md
│ └── sort-list.py
├── 149.max-points-on-a-line
│ ├── max-points-on-a-line.py
│ └── question.md
├── 150.evaluate-reverse-polish-notation
│ ├── evaluate-reverse-polish-notation.py
│ └── question.md
├── 151.reverse-words-in-a-string
│ ├── question.md
│ └── reverse-words-in-a-string.py
├── 152.maximum-product-subarray
│ ├── maximum-product-subarray.py
│ └── question.md
├── 153.find-minimum-in-rotated-sorted-array
│ ├── find-minimum-in-rotated-sorted-array.py
│ └── question.md
├── 154.find-minimum-in-rotated-sorted-array-ii
│ ├── find-minimum-in-rotated-sorted-array-ii.py
│ └── question.md
├── 155.min-stack
│ ├── min-stack.py
│ └── question.md
├── 156.binary-tree-upside-down
│ ├── binary-tree-upside-down.py
│ └── question.md
├── 157.read-n-characters-given-read4
│ ├── question.md
│ └── read-n-characters-given-read4.py
├── 158.read-n-characters-given-read4-ii-call-multiple-times
│ ├── question.md
│ └── read-n-characters-given-read4-ii-call-multiple-times.py
├── 159.longest-substring-with-at-most-two-distinct-characters
│ ├── longest-substring-with-at-most-two-distinct-characters.py
│ └── question.md
├── 160.intersection-of-two-linked-lists
│ ├── intersection-of-two-linked-lists.py
│ └── question.md
├── 161.one-edit-distance
│ ├── one-edit-distance.py
│ └── question.md
├── 162.find-peak-element
│ ├── find-peak-element.py
│ └── question.md
├── 163.missing-ranges
│ ├── missing-ranges.py
│ └── question.md
├── 164.maximum-gap
│ ├── maximum-gap.py
│ └── question.md
├── 165.compare-version-numbers
│ ├── compare-version-numbers.py
│ └── question.md
├── 166.fraction-to-recurring-decimal
│ ├── fraction-to-recurring-decimal.py
│ └── question.md
├── 167.two-sum-ii-input-array-is-sorted
│ ├── question.md
│ └── two-sum-ii-input-array-is-sorted.py
├── 168.excel-sheet-column-title
│ ├── excel-sheet-column-title.py
│ └── question.md
├── 169.majority-element
│ ├── majority-element.py
│ └── question.md
├── 170.two-sum-iii-data-structure-design
│ ├── question.md
│ └── two-sum-iii-data-structure-design.py
├── 171.excel-sheet-column-number
│ ├── excel-sheet-column-number.py
│ └── question.md
├── 172.factorial-trailing-zeroes
│ ├── factorial-trailing-zeroes.py
│ └── question.md
├── 173.binary-search-tree-iterator
│ ├── binary-search-tree-iterator.py
│ └── question.md
├── 174.dungeon-game
│ ├── dungeon-game.py
│ └── question.md
├── 179.largest-number
│ ├── largest-number.py
│ └── question.md
├── 186.reverse-words-in-a-string-ii
│ ├── question.md
│ └── reverse-words-in-a-string-ii.py
├── 187.repeated-dna-sequences
│ ├── question.md
│ └── repeated-dna-sequences.py
├── 188.best-time-to-buy-and-sell-stock-iv
│ ├── best-time-to-buy-and-sell-stock-iv.py
│ └── question.md
├── 189.rotate-array
│ ├── question.md
│ └── rotate-array.py
├── 190.reverse-bits
│ ├── question.md
│ └── reverse-bits.py
├── 191.number-of-1-bits
│ ├── number-of-1-bits.py
│ └── question.md
├── 198.house-robber
│ ├── house-robber.py
│ └── question.md
├── 199.binary-tree-right-side-view
│ ├── binary-tree-right-side-view.py
│ └── question.md
├── 200.number-of-islands
│ ├── number-of-islands.py
│ └── question.md
├── 201.bitwise-and-of-numbers-range
│ ├── bitwise-and-of-numbers-range.py
│ └── question.md
├── 202.happy-number
│ ├── happy-number.py
│ └── question.md
├── 203.remove-linked-list-elements
│ ├── question.md
│ └── remove-linked-list-elements.py
├── 204.count-primes
│ ├── count-primes.py
│ └── question.md
├── 205.isomorphic-strings
│ ├── isomorphic-strings.py
│ └── question.md
├── 206.reverse-linked-list
│ ├── question.md
│ └── reverse-linked-list.py
├── 207.course-schedule
│ ├── course-schedule.py
│ └── question.md
├── 208.implement-trie-prefix-tree
│ ├── implement-trie-prefix-tree.py
│ └── question.md
├── 209.minimum-size-subarray-sum
│ ├── minimum-size-subarray-sum.py
│ └── question.md
├── 210.course-schedule-ii
│ ├── course-schedule-ii.py
│ └── question.md
├── 211.add-and-search-word-data-structure-design
│ ├── add-and-search-word-data-structure-design.py
│ └── question.md
├── 212.word-search-ii
│ ├── question.md
│ └── word-search-ii.py
├── 213.house-robber-ii
│ ├── house-robber-ii.py
│ └── question.md
├── 214.shortest-palindrome
│ ├── question.md
│ └── shortest-palindrome.py
├── 215.kth-largest-element-in-an-array
│ ├── kth-largest-element-in-an-array.py
│ └── question.md
├── 216.combination-sum-iii
│ ├── combination-sum-iii.py
│ └── question.md
├── 217.contains-duplicate
│ ├── contains-duplicate.py
│ └── question.md
├── 218.the-skyline-problem
│ ├── question.md
│ └── the-skyline-problem.py
├── 219.contains-duplicate-ii
│ ├── contains-duplicate-ii.py
│ └── question.md
├── 220.contains-duplicate-iii
│ ├── contains-duplicate-iii.py
│ └── question.md
├── 221.maximal-square
│ ├── maximal-square.py
│ └── question.md
├── 222.count-complete-tree-nodes
│ ├── count-complete-tree-nodes.py
│ └── question.md
├── 223.rectangle-area
│ ├── question.md
│ └── rectangle-area.py
├── 224.basic-calculator
│ ├── basic-calculator.py
│ └── question.md
├── 225.implement-stack-using-queues
│ ├── implement-stack-using-queues.py
│ └── question.md
├── 226.invert-binary-tree
│ ├── invert-binary-tree.py
│ └── question.md
├── 227.basic-calculator-ii
│ ├── basic-calculator-ii.py
│ └── question.md
├── 228.summary-ranges
│ ├── question.md
│ └── summary-ranges.py
├── 229.majority-element-ii
│ ├── majority-element-ii.py
│ └── question.md
├── 230.kth-smallest-element-in-a-bst
│ ├── kth-smallest-element-in-a-bst.py
│ └── question.md
├── 231.power-of-two
│ ├── power-of-two.py
│ └── question.md
├── 232.implement-queue-using-stacks
│ ├── implement-queue-using-stacks.py
│ └── question.md
├── 233.number-of-digit-one
│ ├── number-of-digit-one.py
│ └── question.md
├── 234.palindrome-linked-list
│ ├── palindrome-linked-list.py
│ └── question.md
├── 235.lowest-common-ancestor-of-a-binary-search-tree
│ ├── lowest-common-ancestor-of-a-binary-search-tree.py
│ └── question.md
├── 236.lowest-common-ancestor-of-a-binary-tree
│ ├── lowest-common-ancestor-of-a-binary-tree.py
│ └── question.md
├── 237.delete-node-in-a-linked-list
│ ├── delete-node-in-a-linked-list.py
│ └── question.md
├── 238.product-of-array-except-self
│ ├── product-of-array-except-self.py
│ └── question.md
├── 239.sliding-window-maximum
│ ├── question.md
│ └── sliding-window-maximum.py
├── 240.search-a-2d-matrix-ii
│ ├── question.md
│ └── search-a-2d-matrix-ii.py
├── 241.different-ways-to-add-parentheses
│ ├── different-ways-to-add-parentheses.py
│ └── question.md
├── 242.valid-anagram
│ ├── question.md
│ └── valid-anagram.py
├── 243.shortest-word-distance
│ ├── question.md
│ └── shortest-word-distance.py
├── 244.shortest-word-distance-ii
│ ├── question.md
│ └── shortest-word-distance-ii.py
├── 245.shortest-word-distance-iii
│ ├── question.md
│ └── shortest-word-distance-iii.py
├── 246.strobogrammatic-number
│ ├── question.md
│ └── strobogrammatic-number.py
├── 247.strobogrammatic-number-ii
│ ├── question.md
│ └── strobogrammatic-number-ii.py
├── 248.strobogrammatic-number-iii
│ ├── question.md
│ └── strobogrammatic-number-iii.py
├── 249.group-shifted-strings
│ ├── group-shifted-strings.py
│ └── question.md
├── 250.count-univalue-subtrees
│ ├── count-univalue-subtrees.py
│ └── question.md
├── 251.flatten-2d-vector
│ ├── flatten-2d-vector.py
│ └── question.md
├── 252.meeting-rooms
│ ├── meeting-rooms.py
│ └── question.md
├── 253.meeting-rooms-ii
│ ├── meeting-rooms-ii.py
│ └── question.md
├── 254.factor-combinations
│ ├── factor-combinations.py
│ └── question.md
├── 255.verify-preorder-sequence-in-binary-search-tree
│ ├── question.md
│ └── verify-preorder-sequence-in-binary-search-tree.py
├── 256.paint-house
│ ├── paint-house.py
│ └── question.md
├── 257.binary-tree-paths
│ ├── binary-tree-paths.py
│ └── question.md
├── 258.add-digits
│ ├── add-digits.py
│ └── question.md
├── 259.3sum-smaller
│ ├── 3sum-smaller.py
│ └── question.md
├── 260.single-number-iii
│ ├── question.md
│ └── single-number-iii.py
├── 261.graph-valid-tree
│ ├── graph-valid-tree.py
│ └── question.md
├── 263.ugly-number
│ ├── question.md
│ └── ugly-number.py
├── 264.ugly-number-ii
│ ├── question.md
│ └── ugly-number-ii.py
├── 265.paint-house-ii
│ ├── paint-house-ii.py
│ └── question.md
├── 266.palindrome-permutation
│ ├── palindrome-permutation.py
│ └── question.md
├── 267.palindrome-permutation-ii
│ ├── palindrome-permutation-ii.py
│ └── question.md
├── 268.missing-number
│ ├── missing-number.py
│ └── question.md
├── 269.alien-dictionary
│ ├── alien-dictionary.py
│ └── question.md
├── 270.closest-binary-search-tree-value
│ ├── closest-binary-search-tree-value.py
│ └── question.md
├── 271.encode-and-decode-strings
│ ├── encode-and-decode-strings.py
│ └── question.md
├── 272.closest-binary-search-tree-value-ii
│ ├── closest-binary-search-tree-value-ii.py
│ └── question.md
├── 273.integer-to-english-words
│ ├── integer-to-english-words.py
│ └── question.md
├── 274.h-index
│ ├── h-index.py
│ └── question.md
├── 275.h-index-ii
│ ├── h-index-ii.py
│ └── question.md
├── 276.paint-fence
│ ├── paint-fence.py
│ └── question.md
├── 277.find-the-celebrity
│ ├── find-the-celebrity.py
│ └── question.md
├── 278.first-bad-version
│ ├── first-bad-version.py
│ └── question.md
├── 279.perfect-squares
│ ├── perfect-squares.py
│ └── question.md
├── 280.wiggle-sort
│ ├── question.md
│ └── wiggle-sort.py
├── 281.zigzag-iterator
│ ├── question.md
│ └── zigzag-iterator.py
├── 282.expression-add-operators
│ ├── expression-add-operators.py
│ └── question.md
├── 283.move-zeroes
│ ├── move-zeroes.py
│ └── question.md
├── 284.peeking-iterator
│ ├── peeking-iterator.py
│ └── question.md
├── 285.inorder-successor-in-bst
│ ├── inorder-successor-in-bst.py
│ └── question.md
├── 286.walls-and-gates
│ ├── question.md
│ └── walls-and-gates.py
├── 287.find-the-duplicate-number
│ ├── find-the-duplicate-number.py
│ └── question.md
├── 288.unique-word-abbreviation
│ ├── question.md
│ └── unique-word-abbreviation.py
├── 289.game-of-life
│ ├── game-of-life.py
│ └── question.md
├── 290.word-pattern
│ ├── question.md
│ └── word-pattern.py
├── 291.word-pattern-ii
│ ├── question.md
│ └── word-pattern-ii.py
├── 292.nim-game
│ ├── nim-game.py
│ └── question.md
├── 293.flip-game
│ ├── flip-game.py
│ └── question.md
├── 294.flip-game-ii
│ ├── flip-game-ii.py
│ └── question.md
├── 295.find-median-from-data-stream
│ ├── find-median-from-data-stream.py
│ └── question.md
├── 296.best-meeting-point
│ ├── best-meeting-point.py
│ └── question.md
├── 297.serialize-and-deserialize-binary-tree
│ ├── question.md
│ └── serialize-and-deserialize-binary-tree.py
├── 298.binary-tree-longest-consecutive-sequence
│ ├── binary-tree-longest-consecutive-sequence.py
│ └── question.md
├── 299.bulls-and-cows
│ ├── bulls-and-cows.py
│ └── question.md
├── 300.longest-increasing-subsequence
│ ├── longest-increasing-subsequence.py
│ └── question.md
├── 301.remove-invalid-parentheses
│ ├── question.md
│ └── remove-invalid-parentheses.py
├── 302.smallest-rectangle-enclosing-black-pixels
│ ├── question.md
│ └── smallest-rectangle-enclosing-black-pixels.py
├── 303.range-sum-query-immutable
│ ├── question.md
│ └── range-sum-query-immutable.py
├── 304.range-sum-query-2d-immutable
│ ├── question.md
│ └── range-sum-query-2d-immutable.py
├── 305.number-of-islands-ii
│ ├── number-of-islands-ii.py
│ └── question.md
├── 306.additive-number
│ ├── additive-number.py
│ └── question.md
├── 307.range-sum-query-mutable
│ ├── question.md
│ └── range-sum-query-mutable.py
├── 308.range-sum-query-2d-mutable
│ ├── question.md
│ └── range-sum-query-2d-mutable.py
├── 309.best-time-to-buy-and-sell-stock-with-cooldown
│ ├── best-time-to-buy-and-sell-stock-with-cooldown.py
│ └── question.md
├── 310.minimum-height-trees
│ ├── minimum-height-trees.py
│ └── question.md
├── 311.sparse-matrix-multiplication
│ ├── question.md
│ └── sparse-matrix-multiplication.py
├── 312.burst-balloons
│ ├── burst-balloons.py
│ └── question.md
├── 313.super-ugly-number
│ ├── question.md
│ └── super-ugly-number.py
├── 314.binary-tree-vertical-order-traversal
│ ├── binary-tree-vertical-order-traversal.py
│ └── question.md
├── 315.count-of-smaller-numbers-after-self
│ ├── count-of-smaller-numbers-after-self.py
│ └── question.md
├── 316.remove-duplicate-letters
│ ├── question.md
│ └── remove-duplicate-letters.py
├── 317.shortest-distance-from-all-buildings
│ ├── question.md
│ └── shortest-distance-from-all-buildings.py
├── 318.maximum-product-of-word-lengths
│ ├── maximum-product-of-word-lengths.py
│ └── question.md
├── 319.bulb-switcher
│ ├── bulb-switcher.py
│ └── question.md
├── 320.generalized-abbreviation
│ ├── generalized-abbreviation.py
│ └── question.md
├── 321.create-maximum-number
│ ├── create-maximum-number.py
│ └── question.md
├── 322.coin-change
│ ├── coin-change.py
│ └── question.md
├── 323.number-of-connected-components-in-an-undirected-graph
│ ├── number-of-connected-components-in-an-undirected-graph.py
│ └── question.md
├── 324.wiggle-sort-ii
│ ├── question.md
│ └── wiggle-sort-ii.py
├── 325.maximum-size-subarray-sum-equals-k
│ ├── maximum-size-subarray-sum-equals-k.py
│ └── question.md
├── 326.power-of-three
│ ├── power-of-three.py
│ └── question.md
├── 327.count-of-range-sum
│ ├── count-of-range-sum.py
│ └── question.md
├── 328.odd-even-linked-list
│ ├── odd-even-linked-list.py
│ └── question.md
├── 329.longest-increasing-path-in-a-matrix
│ ├── longest-increasing-path-in-a-matrix.py
│ └── question.md
├── 330.patching-array
│ ├── patching-array.py
│ └── question.md
├── 331.verify-preorder-serialization-of-a-binary-tree
│ ├── question.md
│ └── verify-preorder-serialization-of-a-binary-tree.py
├── 332.reconstruct-itinerary
│ ├── question.md
│ └── reconstruct-itinerary.py
├── 333.largest-bst-subtree
│ ├── largest-bst-subtree.py
│ └── question.md
├── 334.increasing-triplet-subsequence
│ ├── increasing-triplet-subsequence.py
│ └── question.md
├── 335.self-crossing
│ ├── question.md
│ └── self-crossing.py
├── 336.palindrome-pairs
│ ├── palindrome-pairs.py
│ └── question.md
├── 337.house-robber-iii
│ ├── house-robber-iii.py
│ └── question.md
├── 338.counting-bits
│ ├── counting-bits.py
│ └── question.md
├── 339.nested-list-weight-sum
│ ├── nested-list-weight-sum.py
│ └── question.md
├── 340.longest-substring-with-at-most-k-distinct-characters
│ ├── longest-substring-with-at-most-k-distinct-characters.py
│ └── question.md
├── 341.flatten-nested-list-iterator
│ ├── flatten-nested-list-iterator.py
│ └── question.md
├── 342.power-of-four
│ ├── power-of-four.py
│ └── question.md
├── 343.integer-break
│ ├── integer-break.py
│ └── question.md
├── 344.reverse-string
│ ├── question.md
│ └── reverse-string.py
├── 345.reverse-vowels-of-a-string
│ ├── question.md
│ └── reverse-vowels-of-a-string.py
├── 346.moving-average-from-data-stream
│ ├── moving-average-from-data-stream.py
│ └── question.md
├── 347.top-k-frequent-elements
│ ├── question.md
│ └── top-k-frequent-elements.py
├── 348.design-tic-tac-toe
│ ├── design-tic-tac-toe.py
│ └── question.md
├── 349.intersection-of-two-arrays
│ ├── intersection-of-two-arrays.py
│ └── question.md
├── 350.intersection-of-two-arrays-ii
│ ├── intersection-of-two-arrays-ii.py
│ └── question.md
├── 351.android-unlock-patterns
│ ├── android-unlock-patterns.py
│ └── question.md
├── 352.data-stream-as-disjoint-intervals
│ ├── data-stream-as-disjoint-intervals.py
│ └── question.md
├── 353.design-snake-game
│ ├── design-snake-game.py
│ └── question.md
├── 354.russian-doll-envelopes
│ ├── question.md
│ └── russian-doll-envelopes.py
├── 355.design-twitter
│ ├── design-twitter.py
│ └── question.md
├── 356.line-reflection
│ ├── line-reflection.py
│ └── question.md
├── 357.count-numbers-with-unique-digits
│ ├── count-numbers-with-unique-digits.py
│ └── question.md
├── 358.rearrange-string-k-distance-apart
│ ├── question.md
│ └── rearrange-string-k-distance-apart.py
├── 359.logger-rate-limiter
│ ├── logger-rate-limiter.py
│ └── question.md
├── 360.sort-transformed-array
│ ├── question.md
│ └── sort-transformed-array.py
├── 361.bomb-enemy
│ ├── bomb-enemy.py
│ └── question.md
├── 362.design-hit-counter
│ ├── design-hit-counter.py
│ └── question.md
├── 363.max-sum-of-rectangle-no-larger-than-k
│ ├── max-sum-of-rectangle-no-larger-than-k.py
│ └── question.md
├── 363.max-sum-of-sub-matrix-no-larger-than-k
│ ├── max-sum-of-sub-matrix-no-larger-than-k.py
│ └── question.md
├── 364.nested-list-weight-sum-ii
│ ├── nested-list-weight-sum-ii.py
│ └── question.md
├── 365.water-and-jug-problem
│ ├── question.md
│ └── water-and-jug-problem.py
├── 366.find-leaves-of-binary-tree
│ ├── find-leaves-of-binary-tree.py
│ └── question.md
├── 367.valid-perfect-square
│ ├── question.md
│ └── valid-perfect-square.py
├── 368.largest-divisible-subset
│ ├── largest-divisible-subset.py
│ └── question.md
├── 369.plus-one-linked-list
│ ├── plus-one-linked-list.py
│ └── question.md
├── 370.range-addition
│ ├── question.md
│ └── range-addition.py
├── 371.sum-of-two-integers
│ ├── question.md
│ └── sum-of-two-integers.py
├── 372.super-pow
│ ├── question.md
│ └── super-pow.py
├── 373.find-k-pairs-with-smallest-sums
│ ├── find-k-pairs-with-smallest-sums.py
│ └── question.md
├── 374.guess-number-higher-or-lower
│ ├── guess-number-higher-or-lower.py
│ └── question.md
├── 375.guess-number-higher-or-lower-ii
│ ├── guess-number-higher-or-lower-ii.py
│ └── question.md
├── 376.wiggle-subsequence
│ ├── question.md
│ └── wiggle-subsequence.py
├── 377.combination-sum-iv
│ ├── combination-sum-iv.py
│ └── question.md
├── 378.kth-smallest-element-in-a-sorted-matrix
│ ├── kth-smallest-element-in-a-sorted-matrix.py
│ └── question.md
├── 379.design-phone-directory
│ ├── design-phone-directory.py
│ └── question.md
├── 380.insert-delete-getrandom-o1
│ ├── insert-delete-getrandom-o1.py
│ └── question.md
├── 381.insert-delete-getrandom-o1-duplicates-allowed
│ ├── insert-delete-getrandom-o1-duplicates-allowed.py
│ └── question.md
├── 382.linked-list-random-node
│ ├── linked-list-random-node.py
│ └── question.md
├── 383.ransom-note
│ ├── question.md
│ └── ransom-note.py
├── 384.shuffle-an-array
│ ├── question.md
│ └── shuffle-an-array.py
├── 385.mini-parser
│ ├── mini-parser.py
│ └── question.md
├── 386.lexicographical-numbers
│ ├── lexicographical-numbers.py
│ └── question.md
├── 387.first-unique-character-in-a-string
│ ├── first-unique-character-in-a-string.py
│ └── question.md
├── 388.longest-absolute-file-path
│ ├── longest-absolute-file-path.py
│ └── question.md
├── 389.find-the-difference
│ ├── find-the-difference.py
│ └── question.md
├── 390.elimination-game
│ ├── elimination-game.py
│ └── question.md
├── 391.perfect-rectangle
│ ├── perfect-rectangle.py
│ └── question.md
├── 392.is-subsequence
│ ├── is-subsequence.py
│ └── question.md
├── 393.utf-8-validation
│ ├── question.md
│ └── utf-8-validation.py
├── 394.decode-string
│ ├── decode-string.py
│ └── question.md
├── 395.longest-substring-with-at-least-k-repeating-characters
│ ├── longest-substring-with-at-least-k-repeating-characters.py
│ └── question.md
├── 396.rotate-function
│ ├── question.md
│ └── rotate-function.py
├── 397.integer-replacement
│ ├── integer-replacement.py
│ └── question.md
├── 398.random-pick-index
│ ├── question.md
│ └── random-pick-index.py
├── 399.evaluate-division
│ ├── evaluate-division.py
│ └── question.md
├── 400.nth-digit
│ ├── nth-digit.py
│ └── question.md
├── 401.binary-watch
│ ├── binary-watch.py
│ └── question.md
├── 402.remove-k-digits
│ ├── question.md
│ └── remove-k-digits.py
├── 403.frog-jump
│ ├── frog-jump.py
│ └── question.md
├── 404.sum-of-left-leaves
│ ├── question.md
│ └── sum-of-left-leaves.py
├── 405.convert-a-number-to-hexadecimal
│ ├── convert-a-number-to-hexadecimal.py
│ └── question.md
├── 406.queue-reconstruction-by-height
│ ├── question.md
│ └── queue-reconstruction-by-height.py
├── 407.trapping-rain-water-ii
│ ├── question.md
│ └── trapping-rain-water-ii.py
├── 408.valid-word-abbreviation
│ ├── question.md
│ └── valid-word-abbreviation.py
├── 409.longest-palindrome
│ ├── longest-palindrome.py
│ └── question.md
├── 410.split-array-largest-sum
│ ├── question.md
│ └── split-array-largest-sum.py
├── 411.minimum-unique-word-abbreviation
│ ├── minimum-unique-word-abbreviation.py
│ └── question.md
├── 412.fizz-buzz
│ ├── fizz-buzz.py
│ └── question.md
├── 413.arithmetic-slices
│ ├── arithmetic-slices.py
│ └── question.md
├── 414.third-maximum-number
│ ├── question.md
│ └── third-maximum-number.py
├── 415.add-strings
│ ├── add-strings.py
│ └── question.md
├── 416.partition-equal-subset-sum
│ ├── partition-equal-subset-sum.py
│ └── question.md
├── 417.pacific-atlantic-water-flow
│ ├── pacific-atlantic-water-flow.py
│ └── question.md
├── 418.sentence-screen-fitting
│ ├── question.md
│ └── sentence-screen-fitting.py
├── 419.battleships-in-a-board
│ ├── battleships-in-a-board.py
│ └── question.md
├── 420.strong-password-checker
│ ├── question.md
│ └── strong-password-checker.py
├── 421.maximum-xor-of-two-numbers-in-an-array
│ ├── maximum-xor-of-two-numbers-in-an-array.py
│ └── question.md
├── 422.valid-word-square
│ ├── question.md
│ └── valid-word-square.py
├── 423.reconstruct-original-digits-from-english
│ ├── question.md
│ └── reconstruct-original-digits-from-english.py
├── 424.longest-repeating-character-replacement
│ ├── longest-repeating-character-replacement.py
│ └── question.md
├── 425.word-squares
│ ├── question.md
│ └── word-squares.py
├── 432.all-oone-data-structure
│ ├── all-oone-data-structure.py
│ └── question.md
├── 434.number-of-segments-in-a-string
│ ├── number-of-segments-in-a-string.py
│ └── question.md
├── 435.non-overlapping-intervals
│ ├── non-overlapping-intervals.py
│ └── question.md
├── 436.find-right-interval
│ ├── find-right-interval.py
│ └── question.md
├── 437.path-sum-iii
│ ├── path-sum-iii.py
│ └── question.md
├── 438.find-all-anagrams-in-a-string
│ ├── find-all-anagrams-in-a-string.py
│ └── question.md
├── 439.ternary-expression-parser
│ ├── question.md
│ └── ternary-expression-parser.py
├── 440.k-th-smallest-in-lexicographical-order
│ ├── k-th-smallest-in-lexicographical-order.py
│ └── question.md
├── 441.arranging-coins
│ ├── arranging-coins.py
│ └── question.md
├── 442.find-all-duplicates-in-an-array
│ ├── find-all-duplicates-in-an-array.py
│ └── question.md
├── 444.sequence-reconstruction
│ ├── question.md
│ └── sequence-reconstruction.py
├── 445.add-two-numbers-ii
│ ├── add-two-numbers-ii.py
│ └── question.md
├── 446.arithmetic-slices-ii-subsequence
│ ├── arithmetic-slices-ii-subsequence.py
│ └── question.md
├── 447.number-of-boomerangs
│ ├── number-of-boomerangs.py
│ └── question.md
├── 448.find-all-numbers-disappeared-in-an-array
│ ├── find-all-numbers-disappeared-in-an-array.py
│ └── question.md
├── 449.serialize-and-deserialize-bst
│ ├── question.md
│ └── serialize-and-deserialize-bst.py
├── 450.delete-node-in-a-bst
│ ├── delete-node-in-a-bst.py
│ └── question.md
├── 451.sort-characters-by-frequency
│ ├── question.md
│ └── sort-characters-by-frequency.py
├── 452.minimum-number-of-arrows-to-burst-balloons
│ ├── minimum-number-of-arrows-to-burst-balloons.py
│ └── question.md
├── 453.minimum-moves-to-equal-array-elements
│ ├── minimum-moves-to-equal-array-elements.py
│ └── question.md
├── 454.4sum-ii
│ ├── 4sum-ii.py
│ └── question.md
├── 455.assign-cookies
│ ├── assign-cookies.py
│ └── question.md
├── 456.132-pattern
│ ├── 132-pattern.py
│ └── question.md
├── 459.repeated-substring-pattern
│ ├── question.md
│ └── repeated-substring-pattern.py
├── 460.lfu-cache
│ ├── lfu-cache.py
│ └── question.md
├── 461.hamming-distance
│ ├── hamming-distance.py
│ └── question.md
├── 462.minimum-moves-to-equal-array-elements-ii
│ ├── minimum-moves-to-equal-array-elements-ii.py
│ └── question.md
├── 463.island-perimeter
│ ├── island-perimeter.py
│ └── question.md
├── 464.can-i-win
│ ├── can-i-win.py
│ └── question.md
├── 465.optimal-account-balancing
│ ├── optimal-account-balancing.py
│ └── question.md
├── 466.count-the-repetitions
│ ├── count-the-repetitions.py
│ └── question.md
├── 467.unique-substrings-in-wraparound-string
│ ├── question.md
│ └── unique-substrings-in-wraparound-string.py
├── 468.validate-ip-address
│ ├── question.md
│ └── validate-ip-address.py
├── 469.convex-polygon
│ ├── convex-polygon.py
│ └── question.md
├── 471.encode-string-with-shortest-length
│ ├── encode-string-with-shortest-length.py
│ └── question.md
├── 472.concatenated-words
│ ├── concatenated-words.py
│ └── question.md
├── 473.matchsticks-to-square
│ ├── matchsticks-to-square.py
│ └── question.md
├── 474.ones-and-zeroes
│ ├── ones-and-zeroes.py
│ └── question.md
├── 475.heaters
│ ├── heaters.py
│ └── question.md
├── 476.number-complement
│ ├── number-complement.py
│ └── question.md
├── 477.total-hamming-distance
│ ├── question.md
│ └── total-hamming-distance.py
├── 480.sliding-window-median
│ ├── question.md
│ └── sliding-window-median.py
├── 481.magical-string
│ ├── magical-string.py
│ └── question.md
├── 482.license-key-formatting
│ ├── license-key-formatting.py
│ └── question.md
├── 483.smallest-good-base
│ ├── question.md
│ └── smallest-good-base.py
├── 484.find-permutation
│ ├── find-permutation.py
│ └── question.md
├── 485.max-consecutive-ones
│ ├── max-consecutive-ones.py
│ └── question.md
├── 486.predict-the-winner
│ ├── predict-the-winner.py
│ └── question.md
├── 487.max-consecutive-ones-ii
│ ├── max-consecutive-ones-ii.py
│ └── question.md
├── 488.zuma-game
│ ├── question.md
│ └── zuma-game.py
├── 490.the-maze
│ ├── question.md
│ └── the-maze.py
├── 491.increasing-subsequences
│ ├── increasing-subsequences.py
│ └── question.md
├── 492.construct-the-rectangle
│ ├── construct-the-rectangle.py
│ └── question.md
├── 493.reverse-pairs
│ ├── question.md
│ └── reverse-pairs.py
├── 494.target-sum
│ ├── question.md
│ └── target-sum.py
├── 495.teemo-attacking
│ ├── question.md
│ └── teemo-attacking.py
├── 496.next-greater-element-i
│ ├── next-greater-element-i.py
│ └── question.md
├── 498.diagonal-traverse
│ ├── diagonal-traverse.py
│ └── question.md
├── 499.the-maze-iii
│ ├── question.md
│ └── the-maze-iii.py
├── 500.keyboard-row
│ ├── keyboard-row.py
│ └── question.md
├── 501.find-mode-in-binary-search-tree
│ ├── find-mode-in-binary-search-tree.py
│ └── question.md
├── 502.ipo
│ ├── ipo.py
│ └── question.md
├── 503.next-greater-element-ii
│ ├── next-greater-element-ii.py
│ └── question.md
├── 504.base-7
│ ├── base-7.py
│ └── question.md
├── 505.the-maze-ii
│ ├── question.md
│ └── the-maze-ii.py
├── 506.relative-ranks
│ ├── question.md
│ └── relative-ranks.py
├── 507.perfect-number
│ ├── perfect-number.py
│ └── question.md
├── 508.most-frequent-subtree-sum
│ ├── most-frequent-subtree-sum.py
│ └── question.md
├── 513.find-bottom-left-tree-value
│ ├── find-bottom-left-tree-value.py
│ └── question.md
├── 514.freedom-trail
│ ├── freedom-trail.py
│ └── question.md
├── 515.find-largest-value-in-each-tree-row
│ ├── find-largest-value-in-each-tree-row.py
│ └── question.md
├── 516.longest-palindromic-subsequence
│ ├── longest-palindromic-subsequence.py
│ └── question.md
├── 517.super-washing-machines
│ ├── question.md
│ └── super-washing-machines.py
├── 520.detect-capital
│ ├── detect-capital.py
│ └── question.md
├── 521.longest-uncommon-subsequence-i
│ ├── longest-uncommon-subsequence-i.py
│ └── question.md
├── 522.longest-uncommon-subsequence-ii
│ ├── longest-uncommon-subsequence-ii.py
│ └── question.md
├── 523.continuous-subarray-sum
│ ├── continuous-subarray-sum.py
│ └── question.md
├── 524.longest-word-in-dictionary-through-deleting
│ ├── longest-word-in-dictionary-through-deleting.py
│ └── question.md
├── 525.contiguous-array
│ ├── contiguous-array.py
│ └── question.md
├── 526.beautiful-arrangement
│ ├── beautiful-arrangement.py
│ └── question.md
├── 527.word-abbreviation
│ ├── question.md
│ └── word-abbreviation.py
├── 529.minesweeper
│ ├── minesweeper.py
│ └── question.md
├── 530.minimum-absolute-difference-in-bst
│ ├── minimum-absolute-difference-in-bst.py
│ └── question.md
├── 531.lonely-pixel-i
│ ├── lonely-pixel-i.py
│ └── question.md
├── 532.k-diff-pairs-in-an-array
│ ├── k-diff-pairs-in-an-array.py
│ └── question.md
├── 533.lonely-pixel-ii
│ ├── lonely-pixel-ii.py
│ └── question.md
├── 535.encode-and-decode-tinyurl
│ ├── encode-and-decode-tinyurl.py
│ └── question.md
├── 536.construct-binary-tree-from-string
│ ├── construct-binary-tree-from-string.py
│ └── question.md
├── 537.complex-number-multiplication
│ ├── complex-number-multiplication.py
│ └── question.md
├── 538.convert-bst-to-greater-tree
│ ├── convert-bst-to-greater-tree.py
│ └── question.md
├── 539.minimum-time-difference
│ ├── minimum-time-difference.py
│ └── question.md
├── 541.reverse-string-ii
│ ├── question.md
│ └── reverse-string-ii.py
├── 542.01-matrix
│ ├── 01-matrix.py
│ └── question.md
├── 543.diameter-of-binary-tree
│ ├── diameter-of-binary-tree.py
│ └── question.md
├── 544.output-contest-matches
│ ├── output-contest-matches.py
│ └── question.md
├── 545.boundary-of-binary-tree
│ ├── boundary-of-binary-tree.py
│ └── question.md
├── 546.remove-boxes
│ ├── question.md
│ └── remove-boxes.py
├── 547.friend-circles
│ ├── friend-circles.py
│ └── question.md
├── 548.split-array-with-equal-sum
│ ├── question.md
│ └── split-array-with-equal-sum.py
├── 549.binary-tree-longest-consecutive-sequence-ii
│ ├── binary-tree-longest-consecutive-sequence-ii.py
│ └── question.md
├── 551.student-attendance-record-i
│ ├── question.md
│ └── student-attendance-record-i.py
├── 552.student-attendance-record-ii
│ ├── question.md
│ └── student-attendance-record-ii.py
├── 553.optimal-division
│ ├── optimal-division.py
│ └── question.md
├── 554.brick-wall
│ ├── brick-wall.py
│ └── question.md
├── 555.split-concatenated-strings
│ ├── question.md
│ └── split-concatenated-strings.py
├── 556.next-greater-element-iii
│ ├── next-greater-element-iii.py
│ └── question.md
├── 557.reverse-words-in-a-string-iii
│ ├── question.md
│ └── reverse-words-in-a-string-iii.py
├── 560.subarray-sum-equals-k
│ ├── question.md
│ └── subarray-sum-equals-k.py
├── 561.array-partition-i
│ ├── array-partition-i.py
│ └── question.md
├── 562.longest-line-of-consecutive-one-in-matrix
│ ├── longest-line-of-consecutive-one-in-matrix.py
│ └── question.md
├── 563.binary-tree-tilt
│ ├── binary-tree-tilt.py
│ └── question.md
├── 564.find-the-closest-palindrome
│ ├── find-the-closest-palindrome.py
│ └── question.md
├── 565.array-nesting
│ ├── array-nesting.py
│ └── question.md
├── 566.reshape-the-matrix
│ ├── question.md
│ └── reshape-the-matrix.py
├── 567.permutation-in-string
│ ├── permutation-in-string.py
│ └── question.md
├── 568.maximum-vacation-days
│ ├── maximum-vacation-days.py
│ └── question.md
├── 572.subtree-of-another-tree
│ ├── question.md
│ └── subtree-of-another-tree.py
├── 573.squirrel-simulation
│ ├── question.md
│ └── squirrel-simulation.py
├── 575.distribute-candies
│ ├── distribute-candies.py
│ └── question.md
├── 576.out-of-boundary-paths
│ ├── out-of-boundary-paths.py
│ └── question.md
├── 581.shortest-unsorted-continuous-subarray
│ ├── question.md
│ └── shortest-unsorted-continuous-subarray.py
├── 582.kill-process
│ ├── kill-process.py
│ └── question.md
├── 583.delete-operation-for-two-strings
│ ├── delete-operation-for-two-strings.py
│ └── question.md
├── 587.erect-the-fence
│ ├── erect-the-fence.py
│ └── question.md
├── 588.design-in-memory-file-system
│ ├── design-in-memory-file-system.py
│ └── question.md
├── 591.tag-validator
│ ├── question.md
│ └── tag-validator.py
├── 592.fraction-addition-and-subtraction
│ ├── fraction-addition-and-subtraction.py
│ └── question.md
├── 593.valid-square
│ ├── question.md
│ └── valid-square.py
├── 594.longest-harmonious-subsequence
│ ├── longest-harmonious-subsequence.py
│ └── question.md
├── 598.range-addition-ii
│ ├── question.md
│ └── range-addition-ii.py
├── 599.minimum-index-sum-of-two-lists
│ ├── minimum-index-sum-of-two-lists.py
│ └── question.md
├── 600.non-negative-integers-without-consecutive-ones
│ ├── non-negative-integers-without-consecutive-ones.py
│ └── question.md
├── 604.design-compressed-string-iterator
│ ├── design-compressed-string-iterator.py
│ └── question.md
├── 605.can-place-flowers
│ ├── can-place-flowers.py
│ └── question.md
├── 606.construct-string-from-binary-tree
│ ├── construct-string-from-binary-tree.py
│ └── question.md
├── 609.find-duplicate-file-in-system
│ ├── find-duplicate-file-in-system.py
│ └── question.md
├── 611.valid-triangle-number
│ ├── question.md
│ └── valid-triangle-number.py
├── 616.add-bold-tag-in-string
│ ├── add-bold-tag-in-string.py
│ └── question.md
├── 617.merge-two-binary-trees
│ ├── merge-two-binary-trees.py
│ └── question.md
├── 621.task-scheduler
│ ├── question.md
│ └── task-scheduler.py
├── 623.add-one-row-to-tree
│ ├── add-one-row-to-tree.py
│ └── question.md
├── 624.maximum-distance-in-arrays
│ ├── maximum-distance-in-arrays.py
│ └── question.md
├── 625.minimum-factorization
│ ├── minimum-factorization.py
│ └── question.md
├── 628.maximum-product-of-three-numbers
│ ├── maximum-product-of-three-numbers.py
│ └── question.md
├── 629.k-inverse-pairs-array
│ ├── k-inverse-pairs-array.py
│ └── question.md
├── 630.course-schedule-iii
│ ├── course-schedule-iii.py
│ └── question.md
├── 631.design-excel-sum-formula
│ ├── design-excel-sum-formula.py
│ └── question.md
├── 632.smallest-range
│ ├── question.md
│ └── smallest-range.py
├── 633.sum-of-square-numbers
│ ├── question.md
│ └── sum-of-square-numbers.py
├── 637.average-of-levels-in-binary-tree
│ ├── average-of-levels-in-binary-tree.py
│ └── question.md
├── 640.solve-the-equation
│ ├── question.md
│ └── solve-the-equation.py
├── 643.maximum-average-subarray-i
│ ├── maximum-average-subarray-i.py
│ └── question.md
├── 644.maximum-average-subarray-ii
│ ├── maximum-average-subarray-ii.py
│ └── question.md
├── 645.set-mismatch
│ ├── question.md
│ └── set-mismatch.py
├── 646.maximum-length-of-pair-chain
│ ├── maximum-length-of-pair-chain.py
│ └── question.md
├── 647.palindromic-substrings
│ ├── palindromic-substrings.py
│ └── question.md
├── 648.replace-words
│ ├── question.md
│ └── replace-words.py
├── 650.2-keys-keyboard
│ ├── 2-keys-keyboard.py
│ └── question.md
├── 652.find-duplicate-subtrees
│ ├── find-duplicate-subtrees.py
│ └── question.md
├── 654.maximum-binary-tree
│ ├── maximum-binary-tree.py
│ └── question.md
├── 655.print-binary-tree
│ ├── print-binary-tree.py
│ └── question.md
├── 657.judge-route-circle
│ ├── judge-route-circle.py
│ └── question.md
├── 658.find-k-closest-elements
│ ├── find-k-closest-elements.py
│ └── question.md
├── 659.split-array-into-consecutive-subsequences
│ ├── question.md
│ └── split-array-into-consecutive-subsequences.py
├── 660.remove-9
│ ├── question.md
│ └── remove-9.py
├── 661.image-smoother
│ ├── image-smoother.py
│ └── question.md
├── 662.maximum-width-of-binary-tree
│ ├── maximum-width-of-binary-tree.py
│ └── question.md
├── 663.equal-tree-partition
│ ├── equal-tree-partition.py
│ └── question.md
├── 665.non-decreasing-array
│ ├── non-decreasing-array.py
│ └── question.md
└── README.md
580 directories, 1159 files
leetcode全套解答python版本。包括更新到10月份的的leetcode
【实例截图】
【核心代码】
lc-all-solutions-master
└── lc-all-solutions-master
├── 001.two-sum
│ ├── question.md
│ └── two-sum.py
├── 002.add-two-numbers
│ ├── add-two-numbers.py
│ └── question.md
├── 003.longest-substring-without-repeating-characters
│ ├── longest-substring-without-repeating-characters.py
│ └── question.md
├── 004.median-of-two-sorted-arrays
│ ├── median-of-two-sorted-arrays.py
│ └── question.md
├── 005.longest-palindromic-substring
│ ├── longest-palindromic-substring.py
│ └── question.md
├── 006.zigzag-conversion
│ ├── question.md
│ └── zigzag-conversion.py
├── 007.reverse-integer
│ ├── question.md
│ └── reverse-integer.py
├── 008.string-to-integer-atoi
│ ├── question.md
│ └── string-to-integer-atoi.py
├── 009.palindrome-number
│ ├── palindrome-number.py
│ └── question.md
├── 010.regular-expression-matching
│ ├── question.md
│ └── regular-expression-matching.py
├── 011.container-with-most-water
│ ├── container-with-most-water.py
│ └── question.md
├── 012.integer-to-roman
│ ├── integer-to-roman.py
│ └── question.md
├── 013.roman-to-integer
│ ├── question.md
│ └── roman-to-integer.py
├── 014.longest-common-prefix
│ ├── longest-common-prefix.py
│ └── question.md
├── 015.3sum
│ ├── 3sum.py
│ └── question.md
├── 016.3sum-closest
│ ├── 3sum-closest.py
│ └── question.md
├── 017.letter-combinations-of-a-phone-number
│ ├── letter-combinations-of-a-phone-number.py
│ └── question.md
├── 018.4sum
│ ├── 4sum.py
│ └── question.md
├── 019.remove-nth-node-from-end-of-list
│ ├── question.md
│ └── remove-nth-node-from-end-of-list.py
├── 020.valid-parentheses
│ ├── question.md
│ └── valid-parentheses.py
├── 021.merge-two-sorted-lists
│ ├── merge-two-sorted-lists.py
│ └── question.md
├── 022.generate-parentheses
│ ├── generate-parentheses.py
│ └── question.md
├── 023.merge-k-sorted-lists
│ ├── merge-k-sorted-lists.py
│ └── question.md
├── 024.swap-nodes-in-pairs
│ ├── question.md
│ └── swap-nodes-in-pairs.py
├── 025.reverse-nodes-in-k-group
│ ├── question.md
│ └── reverse-nodes-in-k-group.py
├── 026.remove-duplicates-from-sorted-array
│ ├── question.md
│ └── remove-duplicates-from-sorted-array.py
├── 027.remove-element
│ ├── question.md
│ └── remove-element.py
├── 028.implement-strstr
│ ├── implement-strstr.py
│ └── question.md
├── 029.divide-two-integers
│ ├── divide-two-integers.py
│ └── question.md
├── 030.substring-with-concatenation-of-all-words
│ ├── question.md
│ └── substring-with-concatenation-of-all-words.py
├── 031.next-permutation
│ ├── next-permutation.py
│ └── question.md
├── 032.longest-valid-parentheses
│ ├── longest-valid-parentheses.py
│ └── question.md
├── 033.search-in-rotated-sorted-array
│ ├── question.md
│ └── search-in-rotated-sorted-array.py
├── 034.search-for-a-range
│ ├── question.md
│ └── search-for-a-range.py
├── 035.search-insert-position
│ ├── question.md
│ └── search-insert-position.py
├── 036.valid-sudoku
│ ├── question.md
│ └── valid-sudoku.py
├── 037.sudoku-solver
│ ├── question.md
│ └── sudoku-solver.py
├── 038.count-and-say
│ ├── count-and-say.py
│ └── question.md
├── 039.combination-sum
│ ├── combination-sum.py
│ └── question.md
├── 040.combination-sum-ii
│ ├── combination-sum-ii.py
│ └── question.md
├── 041.first-missing-positive
│ ├── first-missing-positive.py
│ └── question.md
├── 042.trapping-rain-water
│ ├── question.md
│ └── trapping-rain-water.py
├── 043.multiply-strings
│ ├── multiply-strings.py
│ └── question.md
├── 044.wildcard-matching
│ ├── question.md
│ └── wildcard-matching.py
├── 045.jump-game-ii
│ ├── jump-game-ii.py
│ └── question.md
├── 046.permutations
│ ├── permutations.py
│ └── question.md
├── 047.permutations-ii
│ ├── permutations-ii.py
│ └── question.md
├── 048.rotate-image
│ ├── question.md
│ └── rotate-image.py
├── 049.anagrams
│ ├── anagrams.py
│ └── question.md
├── 049.group-anagrams
│ ├── group-anagrams.py
│ └── question.md
├── 050.powx-n
│ ├── powx-n.py
│ └── question.md
├── 051.n-queens
│ ├── n-queens.py
│ └── question.md
├── 052.n-queens-ii
│ ├── n-queens-ii.py
│ └── question.md
├── 053.maximum-subarray
│ ├── maximum-subarray.py
│ └── question.md
├── 054.spiral-matrix
│ ├── question.md
│ └── spiral-matrix.py
├── 055.jump-game
│ ├── jump-game.py
│ └── question.md
├── 056.merge-intervals
│ ├── merge-intervals.py
│ └── question.md
├── 057.insert-interval
│ ├── insert-interval.py
│ └── question.md
├── 058.length-of-last-word
│ ├── length-of-last-word.py
│ └── question.md
├── 059.spiral-matrix-ii
│ ├── question.md
│ └── spiral-matrix-ii.py
├── 060.permutation-sequence
│ ├── permutation-sequence.py
│ └── question.md
├── 061.rotate-list
│ ├── question.md
│ └── rotate-list.py
├── 062.unique-paths
│ ├── question.md
│ └── unique-paths.py
├── 063.unique-paths-ii
│ ├── question.md
│ └── unique-paths-ii.py
├── 064.minimum-path-sum
│ ├── minimum-path-sum.py
│ └── question.md
├── 065.valid-number
│ ├── question.md
│ └── valid-number.py
├── 066.plus-one
│ ├── plus-one.py
│ └── question.md
├── 067.add-binary
│ ├── add-binary.py
│ └── question.md
├── 068.text-justification
│ ├── question.md
│ └── text-justification.py
├── 069.sqrtx
│ ├── question.md
│ └── sqrtx.py
├── 070.climbing-stairs
│ ├── climbing-stairs.py
│ └── question.md
├── 071.simplify-path
│ ├── question.md
│ └── simplify-path.py
├── 072.edit-distance
│ ├── edit-distance.py
│ └── question.md
├── 073.set-matrix-zeroes
│ ├── question.md
│ └── set-matrix-zeroes.py
├── 074.search-a-2d-matrix
│ ├── question.md
│ └── search-a-2d-matrix.py
├── 075.sort-colors
│ ├── question.md
│ └── sort-colors.py
├── 076.minimum-window-substring
│ ├── minimum-window-substring.py
│ └── question.md
├── 077.combinations
│ ├── combinations.py
│ └── question.md
├── 078.subsets
│ ├── question.md
│ └── subsets.py
├── 079.word-search
│ ├── question.md
│ └── word-search.py
├── 080.remove-duplicates-from-sorted-array-ii
│ ├── question.md
│ └── remove-duplicates-from-sorted-array-ii.py
├── 081.search-in-rotated-sorted-array-ii
│ ├── question.md
│ └── search-in-rotated-sorted-array-ii.py
├── 082.remove-duplicates-from-sorted-list-ii
│ ├── question.md
│ └── remove-duplicates-from-sorted-list-ii.py
├── 083.remove-duplicates-from-sorted-list
│ ├── question.md
│ └── remove-duplicates-from-sorted-list.py
├── 084.largest-rectangle-in-histogram
│ ├── largest-rectangle-in-histogram.py
│ └── question.md
├── 085.maximal-rectangle
│ ├── maximal-rectangle.py
│ └── question.md
├── 086.partition-list
│ ├── partition-list.py
│ └── question.md
├── 087.scramble-string
│ ├── question.md
│ └── scramble-string.py
├── 088.merge-sorted-array
│ ├── merge-sorted-array.py
│ └── question.md
├── 089.gray-code
│ ├── gray-code.py
│ └── question.md
├── 090.subsets-ii
│ ├── question.md
│ └── subsets-ii.py
├── 091.decode-ways
│ ├── decode-ways.py
│ └── question.md
├── 092.reverse-linked-list-ii
│ ├── question.md
│ └── reverse-linked-list-ii.py
├── 093.restore-ip-addresses
│ ├── question.md
│ └── restore-ip-addresses.py
├── 094.binary-tree-inorder-traversal
│ ├── binary-tree-inorder-traversal.py
│ └── question.md
├── 095.unique-binary-search-trees-ii
│ ├── question.md
│ └── unique-binary-search-trees-ii.py
├── 096.unique-binary-search-trees
│ ├── question.md
│ └── unique-binary-search-trees.py
├── 097.interleaving-string
│ ├── interleaving-string.py
│ └── question.md
├── 098.validate-binary-search-tree
│ ├── question.md
│ └── validate-binary-search-tree.py
├── 099.recover-binary-search-tree
│ ├── question.md
│ └── recover-binary-search-tree.py
├── 100.same-tree
│ ├── question.md
│ └── same-tree.py
├── 101.symmetric-tree
│ ├── question.md
│ └── symmetric-tree.py
├── 102.binary-tree-level-order-traversal
│ ├── binary-tree-level-order-traversal.py
│ └── question.md
├── 103.binary-tree-zigzag-level-order-traversal
│ ├── binary-tree-zigzag-level-order-traversal.py
│ └── question.md
├── 104.maximum-depth-of-binary-tree
│ ├── maximum-depth-of-binary-tree.py
│ └── question.md
├── 105.construct-binary-tree-from-preorder-and-inorder-traversal
│ ├── construct-binary-tree-from-preorder-and-inorder-traversal.py
│ └── question.md
├── 106.construct-binary-tree-from-inorder-and-postorder-traversal
│ ├── construct-binary-tree-from-inorder-and-postorder-traversal.py
│ └── question.md
├── 107.binary-tree-level-order-traversal-ii
│ ├── binary-tree-level-order-traversal-ii.py
│ └── question.md
├── 108.convert-sorted-array-to-binary-search-tree
│ ├── convert-sorted-array-to-binary-search-tree.py
│ └── question.md
├── 109.convert-sorted-list-to-binary-search-tree
│ ├── convert-sorted-list-to-binary-search-tree.py
│ └── question.md
├── 110.balanced-binary-tree
│ ├── balanced-binary-tree.py
│ └── question.md
├── 111.minimum-depth-of-binary-tree
│ ├── minimum-depth-of-binary-tree.py
│ └── question.md
├── 112.path-sum
│ ├── path-sum.py
│ └── question.md
├── 113.path-sum-ii
│ ├── path-sum-ii.py
│ └── question.md
├── 114.flatten-binary-tree-to-linked-list
│ ├── flatten-binary-tree-to-linked-list.py
│ └── question.md
├── 115.distinct-subsequences
│ ├── distinct-subsequences.py
│ └── question.md
├── 116.populating-next-right-pointers-in-each-node
│ ├── populating-next-right-pointers-in-each-node.py
│ └── question.md
├── 117.populating-next-right-pointers-in-each-node-ii
│ ├── populating-next-right-pointers-in-each-node-ii.py
│ └── question.md
├── 118.pascals-triangle
│ ├── pascals-triangle.py
│ └── question.md
├── 119.pascals-triangle-ii
│ ├── pascals-triangle-ii.py
│ └── question.md
├── 120.triangle
│ ├── question.md
│ └── triangle.py
├── 121.best-time-to-buy-and-sell-stock
│ ├── best-time-to-buy-and-sell-stock.py
│ └── question.md
├── 122.best-time-to-buy-and-sell-stock-ii
│ ├── best-time-to-buy-and-sell-stock-ii.py
│ └── question.md
├── 123.best-time-to-buy-and-sell-stock-iii
│ ├── best-time-to-buy-and-sell-stock-iii.py
│ └── question.md
├── 124.binary-tree-maximum-path-sum
│ ├── binary-tree-maximum-path-sum.py
│ └── question.md
├── 125.valid-palindrome
│ ├── question.md
│ └── valid-palindrome.py
├── 126.word-ladder-ii
│ ├── question.md
│ └── word-ladder-ii.py
├── 127.word-ladder
│ ├── question.md
│ └── word-ladder.py
├── 128.longest-consecutive-sequence
│ ├── longest-consecutive-sequence.py
│ └── question.md
├── 129.sum-root-to-leaf-numbers
│ ├── question.md
│ └── sum-root-to-leaf-numbers.py
├── 130.surrounded-regions
│ ├── question.md
│ └── surrounded-regions.py
├── 131.palindrome-partitioning
│ ├── palindrome-partitioning.py
│ └── question.md
├── 132.palindrome-partitioning-ii
│ ├── palindrome-partitioning-ii.py
│ └── question.md
├── 133.clone-graph
│ ├── clone-graph.py
│ └── question.md
├── 134.gas-station
│ ├── gas-station.py
│ └── question.md
├── 135.candy
│ ├── candy.py
│ └── question.md
├── 136.single-number
│ ├── question.md
│ └── single-number.py
├── 137.single-number-ii
│ ├── question.md
│ └── single-number-ii.py
├── 138.copy-list-with-random-pointer
│ ├── copy-list-with-random-pointer.py
│ └── question.md
├── 139.word-break
│ ├── question.md
│ └── word-break.py
├── 140.word-break-ii
│ ├── question.md
│ └── word-break-ii.py
├── 141.linked-list-cycle
│ ├── linked-list-cycle.py
│ └── question.md
├── 142.linked-list-cycle-ii
│ ├── linked-list-cycle-ii.py
│ └── question.md
├── 143.reorder-list
│ ├── question.md
│ └── reorder-list.py
├── 144.binary-tree-preorder-traversal
│ ├── binary-tree-preorder-traversal.py
│ └── question.md
├── 145.binary-tree-postorder-traversal
│ ├── binary-tree-postorder-traversal.py
│ └── question.md
├── 146.lru-cache
│ ├── lru-cache.py
│ └── question.md
├── 147.insertion-sort-list
│ ├── insertion-sort-list.py
│ └── question.md
├── 148.sort-list
│ ├── question.md
│ └── sort-list.py
├── 149.max-points-on-a-line
│ ├── max-points-on-a-line.py
│ └── question.md
├── 150.evaluate-reverse-polish-notation
│ ├── evaluate-reverse-polish-notation.py
│ └── question.md
├── 151.reverse-words-in-a-string
│ ├── question.md
│ └── reverse-words-in-a-string.py
├── 152.maximum-product-subarray
│ ├── maximum-product-subarray.py
│ └── question.md
├── 153.find-minimum-in-rotated-sorted-array
│ ├── find-minimum-in-rotated-sorted-array.py
│ └── question.md
├── 154.find-minimum-in-rotated-sorted-array-ii
│ ├── find-minimum-in-rotated-sorted-array-ii.py
│ └── question.md
├── 155.min-stack
│ ├── min-stack.py
│ └── question.md
├── 156.binary-tree-upside-down
│ ├── binary-tree-upside-down.py
│ └── question.md
├── 157.read-n-characters-given-read4
│ ├── question.md
│ └── read-n-characters-given-read4.py
├── 158.read-n-characters-given-read4-ii-call-multiple-times
│ ├── question.md
│ └── read-n-characters-given-read4-ii-call-multiple-times.py
├── 159.longest-substring-with-at-most-two-distinct-characters
│ ├── longest-substring-with-at-most-two-distinct-characters.py
│ └── question.md
├── 160.intersection-of-two-linked-lists
│ ├── intersection-of-two-linked-lists.py
│ └── question.md
├── 161.one-edit-distance
│ ├── one-edit-distance.py
│ └── question.md
├── 162.find-peak-element
│ ├── find-peak-element.py
│ └── question.md
├── 163.missing-ranges
│ ├── missing-ranges.py
│ └── question.md
├── 164.maximum-gap
│ ├── maximum-gap.py
│ └── question.md
├── 165.compare-version-numbers
│ ├── compare-version-numbers.py
│ └── question.md
├── 166.fraction-to-recurring-decimal
│ ├── fraction-to-recurring-decimal.py
│ └── question.md
├── 167.two-sum-ii-input-array-is-sorted
│ ├── question.md
│ └── two-sum-ii-input-array-is-sorted.py
├── 168.excel-sheet-column-title
│ ├── excel-sheet-column-title.py
│ └── question.md
├── 169.majority-element
│ ├── majority-element.py
│ └── question.md
├── 170.two-sum-iii-data-structure-design
│ ├── question.md
│ └── two-sum-iii-data-structure-design.py
├── 171.excel-sheet-column-number
│ ├── excel-sheet-column-number.py
│ └── question.md
├── 172.factorial-trailing-zeroes
│ ├── factorial-trailing-zeroes.py
│ └── question.md
├── 173.binary-search-tree-iterator
│ ├── binary-search-tree-iterator.py
│ └── question.md
├── 174.dungeon-game
│ ├── dungeon-game.py
│ └── question.md
├── 179.largest-number
│ ├── largest-number.py
│ └── question.md
├── 186.reverse-words-in-a-string-ii
│ ├── question.md
│ └── reverse-words-in-a-string-ii.py
├── 187.repeated-dna-sequences
│ ├── question.md
│ └── repeated-dna-sequences.py
├── 188.best-time-to-buy-and-sell-stock-iv
│ ├── best-time-to-buy-and-sell-stock-iv.py
│ └── question.md
├── 189.rotate-array
│ ├── question.md
│ └── rotate-array.py
├── 190.reverse-bits
│ ├── question.md
│ └── reverse-bits.py
├── 191.number-of-1-bits
│ ├── number-of-1-bits.py
│ └── question.md
├── 198.house-robber
│ ├── house-robber.py
│ └── question.md
├── 199.binary-tree-right-side-view
│ ├── binary-tree-right-side-view.py
│ └── question.md
├── 200.number-of-islands
│ ├── number-of-islands.py
│ └── question.md
├── 201.bitwise-and-of-numbers-range
│ ├── bitwise-and-of-numbers-range.py
│ └── question.md
├── 202.happy-number
│ ├── happy-number.py
│ └── question.md
├── 203.remove-linked-list-elements
│ ├── question.md
│ └── remove-linked-list-elements.py
├── 204.count-primes
│ ├── count-primes.py
│ └── question.md
├── 205.isomorphic-strings
│ ├── isomorphic-strings.py
│ └── question.md
├── 206.reverse-linked-list
│ ├── question.md
│ └── reverse-linked-list.py
├── 207.course-schedule
│ ├── course-schedule.py
│ └── question.md
├── 208.implement-trie-prefix-tree
│ ├── implement-trie-prefix-tree.py
│ └── question.md
├── 209.minimum-size-subarray-sum
│ ├── minimum-size-subarray-sum.py
│ └── question.md
├── 210.course-schedule-ii
│ ├── course-schedule-ii.py
│ └── question.md
├── 211.add-and-search-word-data-structure-design
│ ├── add-and-search-word-data-structure-design.py
│ └── question.md
├── 212.word-search-ii
│ ├── question.md
│ └── word-search-ii.py
├── 213.house-robber-ii
│ ├── house-robber-ii.py
│ └── question.md
├── 214.shortest-palindrome
│ ├── question.md
│ └── shortest-palindrome.py
├── 215.kth-largest-element-in-an-array
│ ├── kth-largest-element-in-an-array.py
│ └── question.md
├── 216.combination-sum-iii
│ ├── combination-sum-iii.py
│ └── question.md
├── 217.contains-duplicate
│ ├── contains-duplicate.py
│ └── question.md
├── 218.the-skyline-problem
│ ├── question.md
│ └── the-skyline-problem.py
├── 219.contains-duplicate-ii
│ ├── contains-duplicate-ii.py
│ └── question.md
├── 220.contains-duplicate-iii
│ ├── contains-duplicate-iii.py
│ └── question.md
├── 221.maximal-square
│ ├── maximal-square.py
│ └── question.md
├── 222.count-complete-tree-nodes
│ ├── count-complete-tree-nodes.py
│ └── question.md
├── 223.rectangle-area
│ ├── question.md
│ └── rectangle-area.py
├── 224.basic-calculator
│ ├── basic-calculator.py
│ └── question.md
├── 225.implement-stack-using-queues
│ ├── implement-stack-using-queues.py
│ └── question.md
├── 226.invert-binary-tree
│ ├── invert-binary-tree.py
│ └── question.md
├── 227.basic-calculator-ii
│ ├── basic-calculator-ii.py
│ └── question.md
├── 228.summary-ranges
│ ├── question.md
│ └── summary-ranges.py
├── 229.majority-element-ii
│ ├── majority-element-ii.py
│ └── question.md
├── 230.kth-smallest-element-in-a-bst
│ ├── kth-smallest-element-in-a-bst.py
│ └── question.md
├── 231.power-of-two
│ ├── power-of-two.py
│ └── question.md
├── 232.implement-queue-using-stacks
│ ├── implement-queue-using-stacks.py
│ └── question.md
├── 233.number-of-digit-one
│ ├── number-of-digit-one.py
│ └── question.md
├── 234.palindrome-linked-list
│ ├── palindrome-linked-list.py
│ └── question.md
├── 235.lowest-common-ancestor-of-a-binary-search-tree
│ ├── lowest-common-ancestor-of-a-binary-search-tree.py
│ └── question.md
├── 236.lowest-common-ancestor-of-a-binary-tree
│ ├── lowest-common-ancestor-of-a-binary-tree.py
│ └── question.md
├── 237.delete-node-in-a-linked-list
│ ├── delete-node-in-a-linked-list.py
│ └── question.md
├── 238.product-of-array-except-self
│ ├── product-of-array-except-self.py
│ └── question.md
├── 239.sliding-window-maximum
│ ├── question.md
│ └── sliding-window-maximum.py
├── 240.search-a-2d-matrix-ii
│ ├── question.md
│ └── search-a-2d-matrix-ii.py
├── 241.different-ways-to-add-parentheses
│ ├── different-ways-to-add-parentheses.py
│ └── question.md
├── 242.valid-anagram
│ ├── question.md
│ └── valid-anagram.py
├── 243.shortest-word-distance
│ ├── question.md
│ └── shortest-word-distance.py
├── 244.shortest-word-distance-ii
│ ├── question.md
│ └── shortest-word-distance-ii.py
├── 245.shortest-word-distance-iii
│ ├── question.md
│ └── shortest-word-distance-iii.py
├── 246.strobogrammatic-number
│ ├── question.md
│ └── strobogrammatic-number.py
├── 247.strobogrammatic-number-ii
│ ├── question.md
│ └── strobogrammatic-number-ii.py
├── 248.strobogrammatic-number-iii
│ ├── question.md
│ └── strobogrammatic-number-iii.py
├── 249.group-shifted-strings
│ ├── group-shifted-strings.py
│ └── question.md
├── 250.count-univalue-subtrees
│ ├── count-univalue-subtrees.py
│ └── question.md
├── 251.flatten-2d-vector
│ ├── flatten-2d-vector.py
│ └── question.md
├── 252.meeting-rooms
│ ├── meeting-rooms.py
│ └── question.md
├── 253.meeting-rooms-ii
│ ├── meeting-rooms-ii.py
│ └── question.md
├── 254.factor-combinations
│ ├── factor-combinations.py
│ └── question.md
├── 255.verify-preorder-sequence-in-binary-search-tree
│ ├── question.md
│ └── verify-preorder-sequence-in-binary-search-tree.py
├── 256.paint-house
│ ├── paint-house.py
│ └── question.md
├── 257.binary-tree-paths
│ ├── binary-tree-paths.py
│ └── question.md
├── 258.add-digits
│ ├── add-digits.py
│ └── question.md
├── 259.3sum-smaller
│ ├── 3sum-smaller.py
│ └── question.md
├── 260.single-number-iii
│ ├── question.md
│ └── single-number-iii.py
├── 261.graph-valid-tree
│ ├── graph-valid-tree.py
│ └── question.md
├── 263.ugly-number
│ ├── question.md
│ └── ugly-number.py
├── 264.ugly-number-ii
│ ├── question.md
│ └── ugly-number-ii.py
├── 265.paint-house-ii
│ ├── paint-house-ii.py
│ └── question.md
├── 266.palindrome-permutation
│ ├── palindrome-permutation.py
│ └── question.md
├── 267.palindrome-permutation-ii
│ ├── palindrome-permutation-ii.py
│ └── question.md
├── 268.missing-number
│ ├── missing-number.py
│ └── question.md
├── 269.alien-dictionary
│ ├── alien-dictionary.py
│ └── question.md
├── 270.closest-binary-search-tree-value
│ ├── closest-binary-search-tree-value.py
│ └── question.md
├── 271.encode-and-decode-strings
│ ├── encode-and-decode-strings.py
│ └── question.md
├── 272.closest-binary-search-tree-value-ii
│ ├── closest-binary-search-tree-value-ii.py
│ └── question.md
├── 273.integer-to-english-words
│ ├── integer-to-english-words.py
│ └── question.md
├── 274.h-index
│ ├── h-index.py
│ └── question.md
├── 275.h-index-ii
│ ├── h-index-ii.py
│ └── question.md
├── 276.paint-fence
│ ├── paint-fence.py
│ └── question.md
├── 277.find-the-celebrity
│ ├── find-the-celebrity.py
│ └── question.md
├── 278.first-bad-version
│ ├── first-bad-version.py
│ └── question.md
├── 279.perfect-squares
│ ├── perfect-squares.py
│ └── question.md
├── 280.wiggle-sort
│ ├── question.md
│ └── wiggle-sort.py
├── 281.zigzag-iterator
│ ├── question.md
│ └── zigzag-iterator.py
├── 282.expression-add-operators
│ ├── expression-add-operators.py
│ └── question.md
├── 283.move-zeroes
│ ├── move-zeroes.py
│ └── question.md
├── 284.peeking-iterator
│ ├── peeking-iterator.py
│ └── question.md
├── 285.inorder-successor-in-bst
│ ├── inorder-successor-in-bst.py
│ └── question.md
├── 286.walls-and-gates
│ ├── question.md
│ └── walls-and-gates.py
├── 287.find-the-duplicate-number
│ ├── find-the-duplicate-number.py
│ └── question.md
├── 288.unique-word-abbreviation
│ ├── question.md
│ └── unique-word-abbreviation.py
├── 289.game-of-life
│ ├── game-of-life.py
│ └── question.md
├── 290.word-pattern
│ ├── question.md
│ └── word-pattern.py
├── 291.word-pattern-ii
│ ├── question.md
│ └── word-pattern-ii.py
├── 292.nim-game
│ ├── nim-game.py
│ └── question.md
├── 293.flip-game
│ ├── flip-game.py
│ └── question.md
├── 294.flip-game-ii
│ ├── flip-game-ii.py
│ └── question.md
├── 295.find-median-from-data-stream
│ ├── find-median-from-data-stream.py
│ └── question.md
├── 296.best-meeting-point
│ ├── best-meeting-point.py
│ └── question.md
├── 297.serialize-and-deserialize-binary-tree
│ ├── question.md
│ └── serialize-and-deserialize-binary-tree.py
├── 298.binary-tree-longest-consecutive-sequence
│ ├── binary-tree-longest-consecutive-sequence.py
│ └── question.md
├── 299.bulls-and-cows
│ ├── bulls-and-cows.py
│ └── question.md
├── 300.longest-increasing-subsequence
│ ├── longest-increasing-subsequence.py
│ └── question.md
├── 301.remove-invalid-parentheses
│ ├── question.md
│ └── remove-invalid-parentheses.py
├── 302.smallest-rectangle-enclosing-black-pixels
│ ├── question.md
│ └── smallest-rectangle-enclosing-black-pixels.py
├── 303.range-sum-query-immutable
│ ├── question.md
│ └── range-sum-query-immutable.py
├── 304.range-sum-query-2d-immutable
│ ├── question.md
│ └── range-sum-query-2d-immutable.py
├── 305.number-of-islands-ii
│ ├── number-of-islands-ii.py
│ └── question.md
├── 306.additive-number
│ ├── additive-number.py
│ └── question.md
├── 307.range-sum-query-mutable
│ ├── question.md
│ └── range-sum-query-mutable.py
├── 308.range-sum-query-2d-mutable
│ ├── question.md
│ └── range-sum-query-2d-mutable.py
├── 309.best-time-to-buy-and-sell-stock-with-cooldown
│ ├── best-time-to-buy-and-sell-stock-with-cooldown.py
│ └── question.md
├── 310.minimum-height-trees
│ ├── minimum-height-trees.py
│ └── question.md
├── 311.sparse-matrix-multiplication
│ ├── question.md
│ └── sparse-matrix-multiplication.py
├── 312.burst-balloons
│ ├── burst-balloons.py
│ └── question.md
├── 313.super-ugly-number
│ ├── question.md
│ └── super-ugly-number.py
├── 314.binary-tree-vertical-order-traversal
│ ├── binary-tree-vertical-order-traversal.py
│ └── question.md
├── 315.count-of-smaller-numbers-after-self
│ ├── count-of-smaller-numbers-after-self.py
│ └── question.md
├── 316.remove-duplicate-letters
│ ├── question.md
│ └── remove-duplicate-letters.py
├── 317.shortest-distance-from-all-buildings
│ ├── question.md
│ └── shortest-distance-from-all-buildings.py
├── 318.maximum-product-of-word-lengths
│ ├── maximum-product-of-word-lengths.py
│ └── question.md
├── 319.bulb-switcher
│ ├── bulb-switcher.py
│ └── question.md
├── 320.generalized-abbreviation
│ ├── generalized-abbreviation.py
│ └── question.md
├── 321.create-maximum-number
│ ├── create-maximum-number.py
│ └── question.md
├── 322.coin-change
│ ├── coin-change.py
│ └── question.md
├── 323.number-of-connected-components-in-an-undirected-graph
│ ├── number-of-connected-components-in-an-undirected-graph.py
│ └── question.md
├── 324.wiggle-sort-ii
│ ├── question.md
│ └── wiggle-sort-ii.py
├── 325.maximum-size-subarray-sum-equals-k
│ ├── maximum-size-subarray-sum-equals-k.py
│ └── question.md
├── 326.power-of-three
│ ├── power-of-three.py
│ └── question.md
├── 327.count-of-range-sum
│ ├── count-of-range-sum.py
│ └── question.md
├── 328.odd-even-linked-list
│ ├── odd-even-linked-list.py
│ └── question.md
├── 329.longest-increasing-path-in-a-matrix
│ ├── longest-increasing-path-in-a-matrix.py
│ └── question.md
├── 330.patching-array
│ ├── patching-array.py
│ └── question.md
├── 331.verify-preorder-serialization-of-a-binary-tree
│ ├── question.md
│ └── verify-preorder-serialization-of-a-binary-tree.py
├── 332.reconstruct-itinerary
│ ├── question.md
│ └── reconstruct-itinerary.py
├── 333.largest-bst-subtree
│ ├── largest-bst-subtree.py
│ └── question.md
├── 334.increasing-triplet-subsequence
│ ├── increasing-triplet-subsequence.py
│ └── question.md
├── 335.self-crossing
│ ├── question.md
│ └── self-crossing.py
├── 336.palindrome-pairs
│ ├── palindrome-pairs.py
│ └── question.md
├── 337.house-robber-iii
│ ├── house-robber-iii.py
│ └── question.md
├── 338.counting-bits
│ ├── counting-bits.py
│ └── question.md
├── 339.nested-list-weight-sum
│ ├── nested-list-weight-sum.py
│ └── question.md
├── 340.longest-substring-with-at-most-k-distinct-characters
│ ├── longest-substring-with-at-most-k-distinct-characters.py
│ └── question.md
├── 341.flatten-nested-list-iterator
│ ├── flatten-nested-list-iterator.py
│ └── question.md
├── 342.power-of-four
│ ├── power-of-four.py
│ └── question.md
├── 343.integer-break
│ ├── integer-break.py
│ └── question.md
├── 344.reverse-string
│ ├── question.md
│ └── reverse-string.py
├── 345.reverse-vowels-of-a-string
│ ├── question.md
│ └── reverse-vowels-of-a-string.py
├── 346.moving-average-from-data-stream
│ ├── moving-average-from-data-stream.py
│ └── question.md
├── 347.top-k-frequent-elements
│ ├── question.md
│ └── top-k-frequent-elements.py
├── 348.design-tic-tac-toe
│ ├── design-tic-tac-toe.py
│ └── question.md
├── 349.intersection-of-two-arrays
│ ├── intersection-of-two-arrays.py
│ └── question.md
├── 350.intersection-of-two-arrays-ii
│ ├── intersection-of-two-arrays-ii.py
│ └── question.md
├── 351.android-unlock-patterns
│ ├── android-unlock-patterns.py
│ └── question.md
├── 352.data-stream-as-disjoint-intervals
│ ├── data-stream-as-disjoint-intervals.py
│ └── question.md
├── 353.design-snake-game
│ ├── design-snake-game.py
│ └── question.md
├── 354.russian-doll-envelopes
│ ├── question.md
│ └── russian-doll-envelopes.py
├── 355.design-twitter
│ ├── design-twitter.py
│ └── question.md
├── 356.line-reflection
│ ├── line-reflection.py
│ └── question.md
├── 357.count-numbers-with-unique-digits
│ ├── count-numbers-with-unique-digits.py
│ └── question.md
├── 358.rearrange-string-k-distance-apart
│ ├── question.md
│ └── rearrange-string-k-distance-apart.py
├── 359.logger-rate-limiter
│ ├── logger-rate-limiter.py
│ └── question.md
├── 360.sort-transformed-array
│ ├── question.md
│ └── sort-transformed-array.py
├── 361.bomb-enemy
│ ├── bomb-enemy.py
│ └── question.md
├── 362.design-hit-counter
│ ├── design-hit-counter.py
│ └── question.md
├── 363.max-sum-of-rectangle-no-larger-than-k
│ ├── max-sum-of-rectangle-no-larger-than-k.py
│ └── question.md
├── 363.max-sum-of-sub-matrix-no-larger-than-k
│ ├── max-sum-of-sub-matrix-no-larger-than-k.py
│ └── question.md
├── 364.nested-list-weight-sum-ii
│ ├── nested-list-weight-sum-ii.py
│ └── question.md
├── 365.water-and-jug-problem
│ ├── question.md
│ └── water-and-jug-problem.py
├── 366.find-leaves-of-binary-tree
│ ├── find-leaves-of-binary-tree.py
│ └── question.md
├── 367.valid-perfect-square
│ ├── question.md
│ └── valid-perfect-square.py
├── 368.largest-divisible-subset
│ ├── largest-divisible-subset.py
│ └── question.md
├── 369.plus-one-linked-list
│ ├── plus-one-linked-list.py
│ └── question.md
├── 370.range-addition
│ ├── question.md
│ └── range-addition.py
├── 371.sum-of-two-integers
│ ├── question.md
│ └── sum-of-two-integers.py
├── 372.super-pow
│ ├── question.md
│ └── super-pow.py
├── 373.find-k-pairs-with-smallest-sums
│ ├── find-k-pairs-with-smallest-sums.py
│ └── question.md
├── 374.guess-number-higher-or-lower
│ ├── guess-number-higher-or-lower.py
│ └── question.md
├── 375.guess-number-higher-or-lower-ii
│ ├── guess-number-higher-or-lower-ii.py
│ └── question.md
├── 376.wiggle-subsequence
│ ├── question.md
│ └── wiggle-subsequence.py
├── 377.combination-sum-iv
│ ├── combination-sum-iv.py
│ └── question.md
├── 378.kth-smallest-element-in-a-sorted-matrix
│ ├── kth-smallest-element-in-a-sorted-matrix.py
│ └── question.md
├── 379.design-phone-directory
│ ├── design-phone-directory.py
│ └── question.md
├── 380.insert-delete-getrandom-o1
│ ├── insert-delete-getrandom-o1.py
│ └── question.md
├── 381.insert-delete-getrandom-o1-duplicates-allowed
│ ├── insert-delete-getrandom-o1-duplicates-allowed.py
│ └── question.md
├── 382.linked-list-random-node
│ ├── linked-list-random-node.py
│ └── question.md
├── 383.ransom-note
│ ├── question.md
│ └── ransom-note.py
├── 384.shuffle-an-array
│ ├── question.md
│ └── shuffle-an-array.py
├── 385.mini-parser
│ ├── mini-parser.py
│ └── question.md
├── 386.lexicographical-numbers
│ ├── lexicographical-numbers.py
│ └── question.md
├── 387.first-unique-character-in-a-string
│ ├── first-unique-character-in-a-string.py
│ └── question.md
├── 388.longest-absolute-file-path
│ ├── longest-absolute-file-path.py
│ └── question.md
├── 389.find-the-difference
│ ├── find-the-difference.py
│ └── question.md
├── 390.elimination-game
│ ├── elimination-game.py
│ └── question.md
├── 391.perfect-rectangle
│ ├── perfect-rectangle.py
│ └── question.md
├── 392.is-subsequence
│ ├── is-subsequence.py
│ └── question.md
├── 393.utf-8-validation
│ ├── question.md
│ └── utf-8-validation.py
├── 394.decode-string
│ ├── decode-string.py
│ └── question.md
├── 395.longest-substring-with-at-least-k-repeating-characters
│ ├── longest-substring-with-at-least-k-repeating-characters.py
│ └── question.md
├── 396.rotate-function
│ ├── question.md
│ └── rotate-function.py
├── 397.integer-replacement
│ ├── integer-replacement.py
│ └── question.md
├── 398.random-pick-index
│ ├── question.md
│ └── random-pick-index.py
├── 399.evaluate-division
│ ├── evaluate-division.py
│ └── question.md
├── 400.nth-digit
│ ├── nth-digit.py
│ └── question.md
├── 401.binary-watch
│ ├── binary-watch.py
│ └── question.md
├── 402.remove-k-digits
│ ├── question.md
│ └── remove-k-digits.py
├── 403.frog-jump
│ ├── frog-jump.py
│ └── question.md
├── 404.sum-of-left-leaves
│ ├── question.md
│ └── sum-of-left-leaves.py
├── 405.convert-a-number-to-hexadecimal
│ ├── convert-a-number-to-hexadecimal.py
│ └── question.md
├── 406.queue-reconstruction-by-height
│ ├── question.md
│ └── queue-reconstruction-by-height.py
├── 407.trapping-rain-water-ii
│ ├── question.md
│ └── trapping-rain-water-ii.py
├── 408.valid-word-abbreviation
│ ├── question.md
│ └── valid-word-abbreviation.py
├── 409.longest-palindrome
│ ├── longest-palindrome.py
│ └── question.md
├── 410.split-array-largest-sum
│ ├── question.md
│ └── split-array-largest-sum.py
├── 411.minimum-unique-word-abbreviation
│ ├── minimum-unique-word-abbreviation.py
│ └── question.md
├── 412.fizz-buzz
│ ├── fizz-buzz.py
│ └── question.md
├── 413.arithmetic-slices
│ ├── arithmetic-slices.py
│ └── question.md
├── 414.third-maximum-number
│ ├── question.md
│ └── third-maximum-number.py
├── 415.add-strings
│ ├── add-strings.py
│ └── question.md
├── 416.partition-equal-subset-sum
│ ├── partition-equal-subset-sum.py
│ └── question.md
├── 417.pacific-atlantic-water-flow
│ ├── pacific-atlantic-water-flow.py
│ └── question.md
├── 418.sentence-screen-fitting
│ ├── question.md
│ └── sentence-screen-fitting.py
├── 419.battleships-in-a-board
│ ├── battleships-in-a-board.py
│ └── question.md
├── 420.strong-password-checker
│ ├── question.md
│ └── strong-password-checker.py
├── 421.maximum-xor-of-two-numbers-in-an-array
│ ├── maximum-xor-of-two-numbers-in-an-array.py
│ └── question.md
├── 422.valid-word-square
│ ├── question.md
│ └── valid-word-square.py
├── 423.reconstruct-original-digits-from-english
│ ├── question.md
│ └── reconstruct-original-digits-from-english.py
├── 424.longest-repeating-character-replacement
│ ├── longest-repeating-character-replacement.py
│ └── question.md
├── 425.word-squares
│ ├── question.md
│ └── word-squares.py
├── 432.all-oone-data-structure
│ ├── all-oone-data-structure.py
│ └── question.md
├── 434.number-of-segments-in-a-string
│ ├── number-of-segments-in-a-string.py
│ └── question.md
├── 435.non-overlapping-intervals
│ ├── non-overlapping-intervals.py
│ └── question.md
├── 436.find-right-interval
│ ├── find-right-interval.py
│ └── question.md
├── 437.path-sum-iii
│ ├── path-sum-iii.py
│ └── question.md
├── 438.find-all-anagrams-in-a-string
│ ├── find-all-anagrams-in-a-string.py
│ └── question.md
├── 439.ternary-expression-parser
│ ├── question.md
│ └── ternary-expression-parser.py
├── 440.k-th-smallest-in-lexicographical-order
│ ├── k-th-smallest-in-lexicographical-order.py
│ └── question.md
├── 441.arranging-coins
│ ├── arranging-coins.py
│ └── question.md
├── 442.find-all-duplicates-in-an-array
│ ├── find-all-duplicates-in-an-array.py
│ └── question.md
├── 444.sequence-reconstruction
│ ├── question.md
│ └── sequence-reconstruction.py
├── 445.add-two-numbers-ii
│ ├── add-two-numbers-ii.py
│ └── question.md
├── 446.arithmetic-slices-ii-subsequence
│ ├── arithmetic-slices-ii-subsequence.py
│ └── question.md
├── 447.number-of-boomerangs
│ ├── number-of-boomerangs.py
│ └── question.md
├── 448.find-all-numbers-disappeared-in-an-array
│ ├── find-all-numbers-disappeared-in-an-array.py
│ └── question.md
├── 449.serialize-and-deserialize-bst
│ ├── question.md
│ └── serialize-and-deserialize-bst.py
├── 450.delete-node-in-a-bst
│ ├── delete-node-in-a-bst.py
│ └── question.md
├── 451.sort-characters-by-frequency
│ ├── question.md
│ └── sort-characters-by-frequency.py
├── 452.minimum-number-of-arrows-to-burst-balloons
│ ├── minimum-number-of-arrows-to-burst-balloons.py
│ └── question.md
├── 453.minimum-moves-to-equal-array-elements
│ ├── minimum-moves-to-equal-array-elements.py
│ └── question.md
├── 454.4sum-ii
│ ├── 4sum-ii.py
│ └── question.md
├── 455.assign-cookies
│ ├── assign-cookies.py
│ └── question.md
├── 456.132-pattern
│ ├── 132-pattern.py
│ └── question.md
├── 459.repeated-substring-pattern
│ ├── question.md
│ └── repeated-substring-pattern.py
├── 460.lfu-cache
│ ├── lfu-cache.py
│ └── question.md
├── 461.hamming-distance
│ ├── hamming-distance.py
│ └── question.md
├── 462.minimum-moves-to-equal-array-elements-ii
│ ├── minimum-moves-to-equal-array-elements-ii.py
│ └── question.md
├── 463.island-perimeter
│ ├── island-perimeter.py
│ └── question.md
├── 464.can-i-win
│ ├── can-i-win.py
│ └── question.md
├── 465.optimal-account-balancing
│ ├── optimal-account-balancing.py
│ └── question.md
├── 466.count-the-repetitions
│ ├── count-the-repetitions.py
│ └── question.md
├── 467.unique-substrings-in-wraparound-string
│ ├── question.md
│ └── unique-substrings-in-wraparound-string.py
├── 468.validate-ip-address
│ ├── question.md
│ └── validate-ip-address.py
├── 469.convex-polygon
│ ├── convex-polygon.py
│ └── question.md
├── 471.encode-string-with-shortest-length
│ ├── encode-string-with-shortest-length.py
│ └── question.md
├── 472.concatenated-words
│ ├── concatenated-words.py
│ └── question.md
├── 473.matchsticks-to-square
│ ├── matchsticks-to-square.py
│ └── question.md
├── 474.ones-and-zeroes
│ ├── ones-and-zeroes.py
│ └── question.md
├── 475.heaters
│ ├── heaters.py
│ └── question.md
├── 476.number-complement
│ ├── number-complement.py
│ └── question.md
├── 477.total-hamming-distance
│ ├── question.md
│ └── total-hamming-distance.py
├── 480.sliding-window-median
│ ├── question.md
│ └── sliding-window-median.py
├── 481.magical-string
│ ├── magical-string.py
│ └── question.md
├── 482.license-key-formatting
│ ├── license-key-formatting.py
│ └── question.md
├── 483.smallest-good-base
│ ├── question.md
│ └── smallest-good-base.py
├── 484.find-permutation
│ ├── find-permutation.py
│ └── question.md
├── 485.max-consecutive-ones
│ ├── max-consecutive-ones.py
│ └── question.md
├── 486.predict-the-winner
│ ├── predict-the-winner.py
│ └── question.md
├── 487.max-consecutive-ones-ii
│ ├── max-consecutive-ones-ii.py
│ └── question.md
├── 488.zuma-game
│ ├── question.md
│ └── zuma-game.py
├── 490.the-maze
│ ├── question.md
│ └── the-maze.py
├── 491.increasing-subsequences
│ ├── increasing-subsequences.py
│ └── question.md
├── 492.construct-the-rectangle
│ ├── construct-the-rectangle.py
│ └── question.md
├── 493.reverse-pairs
│ ├── question.md
│ └── reverse-pairs.py
├── 494.target-sum
│ ├── question.md
│ └── target-sum.py
├── 495.teemo-attacking
│ ├── question.md
│ └── teemo-attacking.py
├── 496.next-greater-element-i
│ ├── next-greater-element-i.py
│ └── question.md
├── 498.diagonal-traverse
│ ├── diagonal-traverse.py
│ └── question.md
├── 499.the-maze-iii
│ ├── question.md
│ └── the-maze-iii.py
├── 500.keyboard-row
│ ├── keyboard-row.py
│ └── question.md
├── 501.find-mode-in-binary-search-tree
│ ├── find-mode-in-binary-search-tree.py
│ └── question.md
├── 502.ipo
│ ├── ipo.py
│ └── question.md
├── 503.next-greater-element-ii
│ ├── next-greater-element-ii.py
│ └── question.md
├── 504.base-7
│ ├── base-7.py
│ └── question.md
├── 505.the-maze-ii
│ ├── question.md
│ └── the-maze-ii.py
├── 506.relative-ranks
│ ├── question.md
│ └── relative-ranks.py
├── 507.perfect-number
│ ├── perfect-number.py
│ └── question.md
├── 508.most-frequent-subtree-sum
│ ├── most-frequent-subtree-sum.py
│ └── question.md
├── 513.find-bottom-left-tree-value
│ ├── find-bottom-left-tree-value.py
│ └── question.md
├── 514.freedom-trail
│ ├── freedom-trail.py
│ └── question.md
├── 515.find-largest-value-in-each-tree-row
│ ├── find-largest-value-in-each-tree-row.py
│ └── question.md
├── 516.longest-palindromic-subsequence
│ ├── longest-palindromic-subsequence.py
│ └── question.md
├── 517.super-washing-machines
│ ├── question.md
│ └── super-washing-machines.py
├── 520.detect-capital
│ ├── detect-capital.py
│ └── question.md
├── 521.longest-uncommon-subsequence-i
│ ├── longest-uncommon-subsequence-i.py
│ └── question.md
├── 522.longest-uncommon-subsequence-ii
│ ├── longest-uncommon-subsequence-ii.py
│ └── question.md
├── 523.continuous-subarray-sum
│ ├── continuous-subarray-sum.py
│ └── question.md
├── 524.longest-word-in-dictionary-through-deleting
│ ├── longest-word-in-dictionary-through-deleting.py
│ └── question.md
├── 525.contiguous-array
│ ├── contiguous-array.py
│ └── question.md
├── 526.beautiful-arrangement
│ ├── beautiful-arrangement.py
│ └── question.md
├── 527.word-abbreviation
│ ├── question.md
│ └── word-abbreviation.py
├── 529.minesweeper
│ ├── minesweeper.py
│ └── question.md
├── 530.minimum-absolute-difference-in-bst
│ ├── minimum-absolute-difference-in-bst.py
│ └── question.md
├── 531.lonely-pixel-i
│ ├── lonely-pixel-i.py
│ └── question.md
├── 532.k-diff-pairs-in-an-array
│ ├── k-diff-pairs-in-an-array.py
│ └── question.md
├── 533.lonely-pixel-ii
│ ├── lonely-pixel-ii.py
│ └── question.md
├── 535.encode-and-decode-tinyurl
│ ├── encode-and-decode-tinyurl.py
│ └── question.md
├── 536.construct-binary-tree-from-string
│ ├── construct-binary-tree-from-string.py
│ └── question.md
├── 537.complex-number-multiplication
│ ├── complex-number-multiplication.py
│ └── question.md
├── 538.convert-bst-to-greater-tree
│ ├── convert-bst-to-greater-tree.py
│ └── question.md
├── 539.minimum-time-difference
│ ├── minimum-time-difference.py
│ └── question.md
├── 541.reverse-string-ii
│ ├── question.md
│ └── reverse-string-ii.py
├── 542.01-matrix
│ ├── 01-matrix.py
│ └── question.md
├── 543.diameter-of-binary-tree
│ ├── diameter-of-binary-tree.py
│ └── question.md
├── 544.output-contest-matches
│ ├── output-contest-matches.py
│ └── question.md
├── 545.boundary-of-binary-tree
│ ├── boundary-of-binary-tree.py
│ └── question.md
├── 546.remove-boxes
│ ├── question.md
│ └── remove-boxes.py
├── 547.friend-circles
│ ├── friend-circles.py
│ └── question.md
├── 548.split-array-with-equal-sum
│ ├── question.md
│ └── split-array-with-equal-sum.py
├── 549.binary-tree-longest-consecutive-sequence-ii
│ ├── binary-tree-longest-consecutive-sequence-ii.py
│ └── question.md
├── 551.student-attendance-record-i
│ ├── question.md
│ └── student-attendance-record-i.py
├── 552.student-attendance-record-ii
│ ├── question.md
│ └── student-attendance-record-ii.py
├── 553.optimal-division
│ ├── optimal-division.py
│ └── question.md
├── 554.brick-wall
│ ├── brick-wall.py
│ └── question.md
├── 555.split-concatenated-strings
│ ├── question.md
│ └── split-concatenated-strings.py
├── 556.next-greater-element-iii
│ ├── next-greater-element-iii.py
│ └── question.md
├── 557.reverse-words-in-a-string-iii
│ ├── question.md
│ └── reverse-words-in-a-string-iii.py
├── 560.subarray-sum-equals-k
│ ├── question.md
│ └── subarray-sum-equals-k.py
├── 561.array-partition-i
│ ├── array-partition-i.py
│ └── question.md
├── 562.longest-line-of-consecutive-one-in-matrix
│ ├── longest-line-of-consecutive-one-in-matrix.py
│ └── question.md
├── 563.binary-tree-tilt
│ ├── binary-tree-tilt.py
│ └── question.md
├── 564.find-the-closest-palindrome
│ ├── find-the-closest-palindrome.py
│ └── question.md
├── 565.array-nesting
│ ├── array-nesting.py
│ └── question.md
├── 566.reshape-the-matrix
│ ├── question.md
│ └── reshape-the-matrix.py
├── 567.permutation-in-string
│ ├── permutation-in-string.py
│ └── question.md
├── 568.maximum-vacation-days
│ ├── maximum-vacation-days.py
│ └── question.md
├── 572.subtree-of-another-tree
│ ├── question.md
│ └── subtree-of-another-tree.py
├── 573.squirrel-simulation
│ ├── question.md
│ └── squirrel-simulation.py
├── 575.distribute-candies
│ ├── distribute-candies.py
│ └── question.md
├── 576.out-of-boundary-paths
│ ├── out-of-boundary-paths.py
│ └── question.md
├── 581.shortest-unsorted-continuous-subarray
│ ├── question.md
│ └── shortest-unsorted-continuous-subarray.py
├── 582.kill-process
│ ├── kill-process.py
│ └── question.md
├── 583.delete-operation-for-two-strings
│ ├── delete-operation-for-two-strings.py
│ └── question.md
├── 587.erect-the-fence
│ ├── erect-the-fence.py
│ └── question.md
├── 588.design-in-memory-file-system
│ ├── design-in-memory-file-system.py
│ └── question.md
├── 591.tag-validator
│ ├── question.md
│ └── tag-validator.py
├── 592.fraction-addition-and-subtraction
│ ├── fraction-addition-and-subtraction.py
│ └── question.md
├── 593.valid-square
│ ├── question.md
│ └── valid-square.py
├── 594.longest-harmonious-subsequence
│ ├── longest-harmonious-subsequence.py
│ └── question.md
├── 598.range-addition-ii
│ ├── question.md
│ └── range-addition-ii.py
├── 599.minimum-index-sum-of-two-lists
│ ├── minimum-index-sum-of-two-lists.py
│ └── question.md
├── 600.non-negative-integers-without-consecutive-ones
│ ├── non-negative-integers-without-consecutive-ones.py
│ └── question.md
├── 604.design-compressed-string-iterator
│ ├── design-compressed-string-iterator.py
│ └── question.md
├── 605.can-place-flowers
│ ├── can-place-flowers.py
│ └── question.md
├── 606.construct-string-from-binary-tree
│ ├── construct-string-from-binary-tree.py
│ └── question.md
├── 609.find-duplicate-file-in-system
│ ├── find-duplicate-file-in-system.py
│ └── question.md
├── 611.valid-triangle-number
│ ├── question.md
│ └── valid-triangle-number.py
├── 616.add-bold-tag-in-string
│ ├── add-bold-tag-in-string.py
│ └── question.md
├── 617.merge-two-binary-trees
│ ├── merge-two-binary-trees.py
│ └── question.md
├── 621.task-scheduler
│ ├── question.md
│ └── task-scheduler.py
├── 623.add-one-row-to-tree
│ ├── add-one-row-to-tree.py
│ └── question.md
├── 624.maximum-distance-in-arrays
│ ├── maximum-distance-in-arrays.py
│ └── question.md
├── 625.minimum-factorization
│ ├── minimum-factorization.py
│ └── question.md
├── 628.maximum-product-of-three-numbers
│ ├── maximum-product-of-three-numbers.py
│ └── question.md
├── 629.k-inverse-pairs-array
│ ├── k-inverse-pairs-array.py
│ └── question.md
├── 630.course-schedule-iii
│ ├── course-schedule-iii.py
│ └── question.md
├── 631.design-excel-sum-formula
│ ├── design-excel-sum-formula.py
│ └── question.md
├── 632.smallest-range
│ ├── question.md
│ └── smallest-range.py
├── 633.sum-of-square-numbers
│ ├── question.md
│ └── sum-of-square-numbers.py
├── 637.average-of-levels-in-binary-tree
│ ├── average-of-levels-in-binary-tree.py
│ └── question.md
├── 640.solve-the-equation
│ ├── question.md
│ └── solve-the-equation.py
├── 643.maximum-average-subarray-i
│ ├── maximum-average-subarray-i.py
│ └── question.md
├── 644.maximum-average-subarray-ii
│ ├── maximum-average-subarray-ii.py
│ └── question.md
├── 645.set-mismatch
│ ├── question.md
│ └── set-mismatch.py
├── 646.maximum-length-of-pair-chain
│ ├── maximum-length-of-pair-chain.py
│ └── question.md
├── 647.palindromic-substrings
│ ├── palindromic-substrings.py
│ └── question.md
├── 648.replace-words
│ ├── question.md
│ └── replace-words.py
├── 650.2-keys-keyboard
│ ├── 2-keys-keyboard.py
│ └── question.md
├── 652.find-duplicate-subtrees
│ ├── find-duplicate-subtrees.py
│ └── question.md
├── 654.maximum-binary-tree
│ ├── maximum-binary-tree.py
│ └── question.md
├── 655.print-binary-tree
│ ├── print-binary-tree.py
│ └── question.md
├── 657.judge-route-circle
│ ├── judge-route-circle.py
│ └── question.md
├── 658.find-k-closest-elements
│ ├── find-k-closest-elements.py
│ └── question.md
├── 659.split-array-into-consecutive-subsequences
│ ├── question.md
│ └── split-array-into-consecutive-subsequences.py
├── 660.remove-9
│ ├── question.md
│ └── remove-9.py
├── 661.image-smoother
│ ├── image-smoother.py
│ └── question.md
├── 662.maximum-width-of-binary-tree
│ ├── maximum-width-of-binary-tree.py
│ └── question.md
├── 663.equal-tree-partition
│ ├── equal-tree-partition.py
│ └── question.md
├── 665.non-decreasing-array
│ ├── non-decreasing-array.py
│ └── question.md
└── README.md
580 directories, 1159 files
标签：
好例子网口号：伸出你的我的手 — 分享！
小贴士
感谢您为本站写下的评论，您的评论对其它用户来说具有重要的参考价值，所以请认真填写。
- 类似“顶”、“沙发”之类没有营养的文字，对勤劳贡献的楼主来说是令人沮丧的反馈信息。
- 相信您也不想看到一排文字/表情墙，所以请不要反馈意义不大的重复字符，也请尽量不要纯表情的回复。
- 提问之前请再仔细看一遍楼主的说明，或许是您遗漏了。
- 请勿到处挖坑绊人、招贴广告。既占空间让人厌烦，又没人会搭理，于人于己都无利。
关于好例子网
本站旨在为广大IT学习爱好者提供一个非营利性互相学习交流分享平台。本站所有资源都可以被免费获取学习研究。本站资源来自网友分享，对搜索内容的合法性不具有预见性、识别性、控制性，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，平台无法对用户传输的作品、信息、内容的权属或合法性、安全性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论平台是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二与二十三条之规定，若资源存在侵权或相关问题请联系本站客服人员，点此联系我们。关于更多版权及免责申明参见 版权及免责申明
网友评论
我要评论