# LeetCode-NOTES **Repository Path**: xiangxiang920/LeetCode-NOTES ## Basic Information - **Project Name**: LeetCode-NOTES - **Description**: LeetCode 算法解答 - **Primary Language**: Unknown - **License**: MIT - **Default Branch**: master - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2021-11-15 - **Last Updated**: 2021-11-15 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README # LeetCode算法解答 此页面不断更新LeetCode-中文算法解答。 [LeetCode-官方网站](https://LeetCode.com/) ## 算法解答 [1.Two-Sum](Algorithms/1.Two-Sum/solution.cpp) [2.Add-Two-Numbers](Algorithms/2.Add-Two-Numbers/solution.cpp) [3.Longest-Substring-Without-Repeating-Characters](Algorithms/3.Longest-Substring-Without-Repeating-Characters/solution.cpp) [4.Median-of-Two-Sorted-Arrays](Algorithms/4.Median-of-Two-Sorted-Arrays/solution.cpp) [5.Longest-Palindromic-Substring](Algorithms/5.Longest-Palindromic-Substring/solution.cpp) [6.ZigZag-Conversion](Algorithms/6.ZigZag-Conversion/solution.cpp) [7.Reverse-Integer](Algorithms/7.Reverse-Integer/solution.cpp) [8.String-to-Integer-(atoi)](Algorithms/8.String-to-Integer-(atoi)/solution.cpp) [9.Palindrome-Number](Algorithms/9.Palindrome-Number/solution.cpp) [10.Regular-Expression-Matching](Algorithms/10.Regular-Expression-Matching/solution.cpp) [11.Container-With-Most-Water](Algorithms/11.Container-With-Most-Water/solution.cpp) [12.Integer-to-Roman](Algorithms/12.Integer-to-Roman/solution.cpp) [13.Roman-to-Integer](Algorithms/13.Roman-to-Integer/solution.cpp) [14.Longest-Common-Prefix](Algorithms/14.Longest-Common-Prefix/solution.cpp) [15.3Sum](Algorithms/15.3Sum/solution.cpp) [16.3Sum-Closest](Algorithms/16.3Sum-Closest/solution.cpp) [17.Letter-Combinations-of-a-Phone-Number](Algorithms/17.Letter-Combinations-of-a-Phone-Number/solution.cpp) [18.4Sum](Algorithms/18.4Sum/solution.cpp) [19.Remove-Nth-Node-From-End-of-List](Algorithms/19.Remove-Nth-Node-From-End-of-List/solution.cpp) [20.Valid-Parentheses](Algorithms/20.Valid-Parentheses/solution.cpp) [21.Merge-Two-Sorted-Lists](Algorithms/21.Merge-Two-Sorted-Lists/solution.cpp) [22.Generate-Parentheses](Algorithms/22.Generate-Parentheses/solution.cpp) [23.Merge-k-Sorted-Lists](Algorithms/23.Merge-k-Sorted-Lists/solution.cpp) [24.Swap-Nodes-in-Pairs](Algorithms/24.Swap-Nodes-in-Pairs/solution.cpp) [25.Reverse-Nodes-in-k-Group](Algorithms/25.Reverse-Nodes-in-k-Group/solution.cpp) [26.Remove-Duplicates-from-Sorted-Array](Algorithms/26.Remove-Duplicates-from-Sorted-Array/solution.cpp) [27.Remove-Element](Algorithms/27.Remove-Element/solution.cpp) [28.Implement-strStr()](Algorithms/28.Implement-strStr()/solution.cpp) [29.Divide-Two-Integers](Algorithms/29.Divide-Two-Integers/solution.cpp) [30.Substring-with-Concatenation-of-All-Words](Algorithms/30.Substring-with-Concatenation-of-All-Words/solution.cpp) [31.Next-Permutation](Algorithms/31.Next-Permutation/solution.cpp) [32.Longest-Valid-Parentheses](Algorithms/32.Longest-Valid-Parentheses/solution.cpp) [33.Search-in-Rotated-Sorted-Array](Algorithms/33.Search-in-Rotated-Sorted-Array/solution.cpp) [34.Find-First-and-Last-Position-of-Element-in-Sorted-Array](Algorithms/34.Find-First-and-Last-Position-of-Element-in-Sorted-Array/solution.cpp) [35.Search-Insert-Position](Algorithms/35.Search-Insert-Position/solution.cpp) [36.Valid-Sudoku](Algorithms/36.Valid-Sudoku/solution.cpp) [37.Sudoku-Solver](Algorithms/37.Sudoku-Solver/solution.cpp) [38.Count-and-Say](Algorithms/38.Count-and-Say/solution.cpp) [39.Combination-Sum](Algorithms/39.Combination-Sum/solution.cpp) [40.Combination-Sum-II](Algorithms/40.Combination-Sum-II/solution.cpp) [41.First-Missing-Positive](Algorithms/41.First-Missing-Positive/solution.cpp) [42.Trapping-Rain-Water](Algorithms/42.Trapping-Rain-Water/solution.cpp) [43.Multiply-Strings](Algorithms/43.Multiply-Strings/solution.cpp) [44.Wildcard-Matching](Algorithms/44.Wildcard-Matching/solution.cpp) [45.Jump-Game-II](Algorithms/45.Jump-Game-II/solution.cpp) [46.Permutations](Algorithms/46.Permutations/solution.cpp) [47.Permutations-II](Algorithms/47.Permutations-II/solution.cpp) [48.Rotate-Image](Algorithms/48.Rotate-Image/solution.cpp) [49.Group-Anagrams](Algorithms/49.Group-Anagrams/solution.cpp) [50.Pow(x,-n)](Algorithms/50.Pow(x,-n)/solution.cpp) [51.N-Queens](Algorithms/51.N-Queens/solution.cpp) [52.N-Queens-II](Algorithms/52.N-Queens-II/solution.cpp) [53.Maximum-Subarray](Algorithms/53.Maximum-Subarray/solution.cpp) [54.Spiral-Matrix](Algorithms/54.Spiral-Matrix/solution.cpp) [55.Jump-Game](Algorithms/55.Jump-Game/solution.cpp) [56.Merge-Intervals](Algorithms/56.Merge-Intervals/solution.cpp) [57.Insert-Interval](Algorithms/57.Insert-Interval/solution.cpp) [58.Length-of-Last-Word](Algorithms/58.Length-of-Last-Word/solution.cpp) [59.Spiral-Matrix-II](Algorithms/59.Spiral-Matrix-II/solution.cpp) [60.Permutation-Sequence](Algorithms/60.Permutation-Sequence/solution.cpp) [61.Rotate-List](Algorithms/61.Rotate-List/solution.cpp) [62.Unique-Paths](Algorithms/62.Unique-Paths/solution.cpp) [63.Unique-Paths-II](Algorithms/63.Unique-Paths-II/solution.cpp) [64.Minimum-Path-Sum](Algorithms/64.Minimum-Path-Sum/solution.cpp) [65.Valid-Number](Algorithms/65.Valid-Number/solution.cpp) [66.Plus-One](Algorithms/66.Plus-One/solution.cpp) [67.Add-Binary](Algorithms/67.Add-Binary/solution.cpp) [68.Text-Justification](Algorithms/68.Text-Justification/solution.cpp) [69.Sqrt(x)](Algorithms/69.Sqrt(x)/solution.cpp) [70.Climbing-Stairs](Algorithms/70.Climbing-Stairs/solution.cpp) [72.Edit-Distance](Algorithms/72.Edit-Distance/solution.cpp) [73.Set-Matrix-Zeroes](Algorithms/73.Set-Matrix-Zeroes/solution.cpp) [74.Search-a-2D-Matrix](Algorithms/74.Search-a-2D-Matrix/solution.cpp) [75.Sort-Colors](Algorithms/75.Sort-Colors/solution.cpp) [76.Minimum-Window-Substring](Algorithms/76.Minimum-Window-Substring/solution.cpp) [77.Combinations](Algorithms/77.Combinations/solution.cpp) [78.Subsets](Algorithms/78.Subsets/solution.cpp) [79.Word-Search](Algorithms/79.Word-Search/solution.cpp) [80.Remove-Duplicates-from-Sorted-Array-II](Algorithms/80.Remove-Duplicates-from-Sorted-Array-II/solution.cpp) [81.Search-in-Rotated-Sorted-Array-II](Algorithms/81.Search-in-Rotated-Sorted-Array-II/solution.cpp) [82.Remove-Duplicates-from-Sorted-List-II](Algorithms/82.Remove-Duplicates-from-Sorted-List-II/solution.cpp) [83.Remove-Duplicates-from-Sorted-List](Algorithms/83.Remove-Duplicates-from-Sorted-List/solution.cpp) [84.Largest-Rectangle-in-Histogram](Algorithms/84.Largest-Rectangle-in-Histogram/solution.cpp) [85.Maximal-Rectangle](Algorithms/85.Maximal-Rectangle/solution.cpp) [86.Partition-List](Algorithms/86.Partition-List/solution.cpp) [87.Scramble-String](Algorithms/87.Scramble-String/solution.cpp) [88.Merge-Sorted-Array](Algorithms/88.Merge-Sorted-Array/solution.cpp) [89.Gray-Code](Algorithms/89.Gray-Code/solution.cpp) [90.Subsets-II](Algorithms/90.Subsets-II/solution.cpp) [91.Decode-Ways](Algorithms/91.Decode-Ways/solution.cpp) [92.Reverse-Linked-List-II](Algorithms/92.Reverse-Linked-List-II/solution.cpp) [93.Restore-IP-Addresses](Algorithms/93.Restore-IP-Addresses/solution.cpp) [94.Binary-Tree-Inorder-Traversal](Algorithms/94.Binary-Tree-Inorder-Traversal/solution.cpp) [95.Unique-Binary-Search-Trees-II](Algorithms/95.Unique-Binary-Search-Trees-II/solution.cpp) [96.Unique-Binary-Search-Trees](Algorithms/96.Unique-Binary-Search-Trees/solution.cpp) [97.Interleaving-String](Algorithms/97.Interleaving-String/solution.cpp) [98.Validate-Binary-Search-Tree](Algorithms/98.Validate-Binary-Search-Tree/solution.cpp) [99.Recover-Binary-Search-Tree](Algorithms/99.Recover-Binary-Search-Tree/solution.cpp) [100.Same-Tree](Algorithms/100.Same-Tree/solution.cpp) [101.Symmetric-Tree](Algorithms/101.Symmetric-Tree/solution.cpp) [102.Binary-Tree-Level-Order-Traversal](Algorithms/102.Binary-Tree-Level-Order-Traversal/solution.cpp) [103.Binary-Tree-Zigzag-Level-Order-Traversal](Algorithms/103.Binary-Tree-Zigzag-Level-Order-Traversal/solution.cpp) [104.Maximum-Depth-of-Binary-Tree](Algorithms/104.Maximum-Depth-of-Binary-Tree/solution.cpp) [105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal](Algorithms/105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/solution.cpp) [106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal](Algorithms/106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/solution.cpp) [107.Binary-Tree-Level-Order-Traversal-II](Algorithms/107.Binary-Tree-Level-Order-Traversal-II/solution.cpp) [108.Convert-Sorted-Array-to-Binary-Search-Tree](Algorithms/108.Convert-Sorted-Array-to-Binary-Search-Tree/solution.cpp) [109.Convert-Sorted-List-to-Binary-Search-Tree](Algorithms/109.Convert-Sorted-List-to-Binary-Search-Tree/solution.cpp) [110.Balanced-Binary-Tree](Algorithms/110.Balanced-Binary-Tree/solution.cpp) [111.Minimum-Depth-of-Binary-Tree](Algorithms/111.Minimum-Depth-of-Binary-Tree/solution.cpp) [112.Path-Sum](Algorithms/112.Path-Sum/solution.cpp) [113.Path-Sum-II](Algorithms/113.Path-Sum-II/solution.cpp) [114.Flatten-Binary-Tree-to-Linked-List](Algorithms/114.Flatten-Binary-Tree-to-Linked-List/solution.cpp) [115.Distinct-Subsequences](Algorithms/115.Distinct-Subsequences/solution.cpp) [116.Populating-Next-Right-Pointers-in-Each-Node](Algorithms/116.Populating-Next-Right-Pointers-in-Each-Node/solution.cpp) [117.Populating-Next-Right-Pointers-in-Each-Node-II](Algorithms/117.Populating-Next-Right-Pointers-in-Each-Node-II/solution.cpp) [118.Pascal's-Triangle](Algorithms/118.Pascal's-Triangle/solution.cpp) [119.Pascal's-Triangle-II](Algorithms/119.Pascal's-Triangle-II/solution.cpp) [120.Triangle](Algorithms/120.Triangle/solution.cpp) [121.Best-Time-to-Buy-and-Sell-Stock](Algorithms/121.Best-Time-to-Buy-and-Sell-Stock/solution.cpp) [122.Best-Time-to-Buy-and-Sell-Stock-II](Algorithms/122.Best-Time-to-Buy-and-Sell-Stock-II/solution.cpp) [123.Best-Time-to-Buy-and-Sell-Stock-III](Algorithms/123.Best-Time-to-Buy-and-Sell-Stock-III/solution.cpp) [124.Binary-Tree-Maximum-Path-Sum](Algorithms/124.Binary-Tree-Maximum-Path-Sum/solution.cpp) [125.Valid-Palindrome](Algorithms/125.Valid-Palindrome/solution.cpp) [126.Word-Ladder-II](Algorithms/126.Word-Ladder-II/solution.cpp) [127.Word-Ladder](Algorithms/127.Word-Ladder/solution.cpp) [128.Longest-Consecutive-Sequence](Algorithms/128.Longest-Consecutive-Sequence/solution.cpp) [129.Sum-Root-to-Leaf-Numbers](Algorithms/129.Sum-Root-to-Leaf-Numbers/solution.cpp) [130.Surrounded-Regions](Algorithms/130.Surrounded-Regions/solution.cpp) [131.Palindrome-Partitioning](Algorithms/131.Palindrome-Partitioning/solution.cpp) [132.Palindrome-Partitioning-II](Algorithms/132.Palindrome-Partitioning-II/solution.cpp) [133.Clone-Graph](Algorithms/133.Clone-Graph/solution.cpp) [134.Gas-Station](Algorithms/134.Gas-Station/solution.cpp) [135.Candy](Algorithms/135.Candy/solution.cpp) [136.Single-Number](Algorithms/136.Single-Number/solution.cpp) [137.Single-Number-II](Algorithms/137.Single-Number-II/solution.cpp) [138.Copy-List-with-Random-Pointer](Algorithms/138.Copy-List-with-Random-Pointer/solution.cpp) [139.Word-Break](Algorithms/139.Word-Break/solution.cpp) [140.Word-Break-II](Algorithms/140.Word-Break-II/solution.cpp) [141.Linked-List-Cycle](Algorithms/141.Linked-List-Cycle/solution.cpp) [142.Linked-List-Cycle-II](Algorithms/142.Linked-List-Cycle-II/solution.cpp) [143.Reorder-List](Algorithms/143.Reorder-List/solution.cpp) [144.Binary-Tree-Preorder-Traversal](Algorithms/144.Binary-Tree-Preorder-Traversal/solution.cpp) [145.Binary-Tree-Postorder-Traversal](Algorithms/145.Binary-Tree-Postorder-Traversal/solution.cpp) [146.LRU-Cache](Algorithms/146.LRU-Cache/solution.cpp) [147.Insertion-Sort-List](Algorithms/147.Insertion-Sort-List/solution.cpp) [148.Sort-List](Algorithms/148.Sort-List/solution.cpp) [149.Max-Points-on-a-Line](Algorithms/149.Max-Points-on-a-Line/solution.cpp) [150.Evaluate-Reverse-Polish-Notation](Algorithms/150.Evaluate-Reverse-Polish-Notation/solution.cpp) [151.Reverse-Words-in-a-String](Algorithms/151.Reverse-Words-in-a-String/solution.cpp) [152.Maximum-Product-Subarray](Algorithms/152.Maximum-Product-Subarray/solution.cpp) [153.Find-Minimum-in-Rotated-Sorted-Array](Algorithms/153.Find-Minimum-in-Rotated-Sorted-Array/solution.cpp) [154.Find-Minimum-in-Rotated-Sorted-Array-II](Algorithms/154.Find-Minimum-in-Rotated-Sorted-Array-II/solution.cpp) [155.Min-Stack](Algorithms/155.Min-Stack/solution.cpp) [160.Intersection-of-Two-Linked-Lists](Algorithms/160.Intersection-of-Two-Linked-Lists/solution.cpp) [162.Find-Peak-Element](Algorithms/162.Find-Peak-Element/solution.cpp) [164.Maximum-Gap](Algorithms/164.Maximum-Gap/solution.cpp) [165.Compare-Version-Numbers](Algorithms/165.Compare-Version-Numbers/solution.cpp) [166.Fraction-to-Recurring-Decimal](Algorithms/166.Fraction-to-Recurring-Decimal/solution.cpp) [167.Two-Sum-II---Input-array-is-sorted](Algorithms/167.Two-Sum-II---Input-array-is-sorted/solution.cpp) [168.Excel-Sheet-Column-Title](Algorithms/168.Excel-Sheet-Column-Title/solution.cpp) [169.Majority-Element](Algorithms/169.Majority-Element/solution.cpp) [171.Excel-Sheet-Column-Number](Algorithms/171.Excel-Sheet-Column-Number/solution.cpp) [172.Factorial-Trailing-Zeroes](Algorithms/172.Factorial-Trailing-Zeroes/solution.cpp) [173.Binary-Search-Tree-Iterator](Algorithms/173.Binary-Search-Tree-Iterator/solution.cpp) [174.Dungeon-Game](Algorithms/174.Dungeon-Game/solution.cpp) [179.Largest-Number](Algorithms/179.Largest-Number/solution.cpp) [187.Repeated-DNA-Sequences](Algorithms/187.Repeated-DNA-Sequences/solution.cpp) [188.Best-Time-to-Buy-and-Sell-Stock-IV](Algorithms/188.Best-Time-to-Buy-and-Sell-Stock-IV/solution.cpp) [189.Rotate-Array](Algorithms/189.Rotate-Array/solution.cpp) [190.Reverse-Bits](Algorithms/190.Reverse-Bits/solution.cpp) [191.Number-of-1-Bits](Algorithms/191.Number-of-1-Bits/solution.cpp) [198.House-Robber](Algorithms/198.House-Robber/solution.cpp) [199.Binary-Tree-Right-Side-View](Algorithms/199.Binary-Tree-Right-Side-View/solution.cpp) [200.Number-of-Islands](Algorithms/200.Number-of-Islands/solution.cpp) [201.Bitwise-AND-of-Numbers-Range](Algorithms/201.Bitwise-AND-of-Numbers-Range/solution.cpp) [202.Happy-Number](Algorithms/202.Happy-Number/solution.cpp) [203.Remove-Linked-List-Elements](Algorithms/203.Remove-Linked-List-Elements/solution.cpp) [204.Count-Primes](Algorithms/204.Count-Primes/solution.cpp) [205.Isomorphic-Strings](Algorithms/205.Isomorphic-Strings/solution.cpp) [206.Reverse-Linked-List](Algorithms/206.Reverse-Linked-List/solution.cpp) [207.Course-Schedule](Algorithms/207.Course-Schedule/solution.cpp) [208.Implement-Trie-(Prefix-Tree)](Algorithms/208.Implement-Trie-(Prefix-Tree)/solution.cpp) [209.Minimum-Size-Subarray-Sum](Algorithms/209.Minimum-Size-Subarray-Sum/solution.cpp) [210.Course-Schedule-II](Algorithms/210.Course-Schedule-II/solution.cpp) [211.Add-and-Search-Word---Data-structure-design](Algorithms/211.Add-and-Search-Word---Data-structure-design/solution.cpp) [213.House-Robber-II](Algorithms/213.House-Robber-II/solution.cpp) [214.Shortest-Palindrome](Algorithms/214.Shortest-Palindrome/solution.cpp) [215.Kth-Largest-Element-in-an-Array](Algorithms/215.Kth-Largest-Element-in-an-Array/solution.cpp) [217.Contains-Duplicate](Algorithms/217.Contains-Duplicate/solution.cpp) [219.Contains-Duplicate-II](Algorithms/219.Contains-Duplicate-II/solution.cpp) [220.Contains-Duplicate-III](Algorithms/220.Contains-Duplicate-III/solution.cpp) [223.Rectangle-Area](Algorithms/223.Rectangle-Area/solution.cpp) [224.Basic-Calculator](Algorithms/224.Basic-Calculator/solution.cpp) [225.Implement-Stack-using-Queues](Algorithms/225.Implement-Stack-using-Queues/solution.cpp) [226.Invert-Binary-Tree](Algorithms/226.Invert-Binary-Tree/solution.cpp) [230.Kth-Smallest-Element-in-a-BST](Algorithms/230.Kth-Smallest-Element-in-a-BST/solution.cpp) [231.Power-of-Two](Algorithms/231.Power-of-Two/solution.cpp) [232.Implement-Queue-using-Stacks](Algorithms/232.Implement-Queue-using-Stacks/solution.cpp) [234.Palindrome-Linked-List](Algorithms/234.Palindrome-Linked-List/solution.cpp) [235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree](Algorithms/235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/solution.cpp) [237.Delete-Node-in-a-Linked-List](Algorithms/237.Delete-Node-in-a-Linked-List/solution.cpp) [238.Product-of-Array-Except-Self](Algorithms/238.Product-of-Array-Except-Self/solution.cpp) [241.Different-Ways-to-Add-Parentheses](Algorithms/241.Different-Ways-to-Add-Parentheses/solution.cpp) [242.Valid-Anagram](Algorithms/242.Valid-Anagram/solution.cpp) [257.Binary-Tree-Paths](Algorithms/257.Binary-Tree-Paths/solution.cpp) [258.Add-Digits](Algorithms/258.Add-Digits/solution.cpp) [260.Single-Number-III](Algorithms/260.Single-Number-III/solution.cpp) [263.Ugly-Number](Algorithms/263.Ugly-Number/solution.cpp) [264.Ugly-Number-II](Algorithms/264.Ugly-Number-II/solution.cpp) [273.Integer-to-English-Words](Algorithms/273.Integer-to-English-Words/solution.cpp) [274.H-Index](Algorithms/274.H-Index/solution.cpp) [278.First-Bad-Version](Algorithms/278.First-Bad-Version/solution.cpp) [283.Move-Zeroes](Algorithms/283.Move-Zeroes/solution.cpp) [287.Find-the-Duplicate-Number](Algorithms/287.Find-the-Duplicate-Number/solution.cpp) [290.Word-Pattern](Algorithms/290.Word-Pattern/solution.cpp) [292.Nim-Game](Algorithms/292.Nim-Game/solution.cpp) [299.Bulls-and-Cows](Algorithms/299.Bulls-and-Cows/solution.cpp) [300.Longest-Increasing-Subsequence](Algorithms/300.Longest-Increasing-Subsequence/solution.cpp) [303.Range-Sum-Query---Immutable](Algorithms/303.Range-Sum-Query---Immutable/solution.cpp) [304.Range-Sum-Query-2D---Immutable](Algorithms/304.Range-Sum-Query-2D---Immutable/solution.cpp) [309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown](Algorithms/309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/solution.cpp) [318.Maximum-Product-of-Word-Lengths](Algorithms/318.Maximum-Product-of-Word-Lengths/solution.cpp) [319.Bulb-Switcher](Algorithms/319.Bulb-Switcher/solution.cpp) [324.Wiggle-Sort-II](Algorithms/324.Wiggle-Sort-II/solution.cpp) [326.Power-of-Three](Algorithms/326.Power-of-Three/solution.cpp) [328.Odd-Even-Linked-List](Algorithms/328.Odd-Even-Linked-List/solution.cpp) [338.Counting-Bits](Algorithms/338.Counting-Bits/solution.cpp) [342.Power-of-Four](Algorithms/342.Power-of-Four/solution.cpp) [343.Integer-Break](Algorithms/343.Integer-Break/solution.cpp) [344.Reverse-String](Algorithms/344.Reverse-String/solution.cpp) [345.Reverse-Vowels-of-a-String](Algorithms/345.Reverse-Vowels-of-a-String/solution.cpp) [347.Top-K-Frequent-Elements](Algorithms/347.Top-K-Frequent-Elements/solution.cpp) [349.Intersection-of-Two-Arrays](Algorithms/349.Intersection-of-Two-Arrays/solution.cpp) [350.Intersection-of-Two-Arrays-II](Algorithms/350.Intersection-of-Two-Arrays-II/solution.cpp) [357.Count-Numbers-with-Unique-Digits](Algorithms/357.Count-Numbers-with-Unique-Digits/solution.cpp) [367.Valid-Perfect-Square](Algorithms/367.Valid-Perfect-Square/solution.cpp) [371.Sum-of-Two-Integers](Algorithms/371.Sum-of-Two-Integers/solution.cpp) [374.Guess-Number-Higher-or-Lower](Algorithms/374.Guess-Number-Higher-or-Lower/solution.cpp) [378.Kth-Smallest-Element-in-a-Sorted-Matrix](Algorithms/378.Kth-Smallest-Element-in-a-Sorted-Matrix/solution.cpp) [382.Linked-List-Random-Node](Algorithms/382.Linked-List-Random-Node/solution.cpp) [383.Ransom-Note](Algorithms/383.Ransom-Note/solution.cpp) [384.Shuffle-an-Array](Algorithms/384.Shuffle-an-Array/solution.cpp) [387.First-Unique-Character-in-a-String](Algorithms/387.First-Unique-Character-in-a-String/solution.cpp) [389.Find-the-Difference](Algorithms/389.Find-the-Difference/solution.cpp) [391.Perfect-Rectangle](Algorithms/391.Perfect-Rectangle/solution.cpp) [392.Is-Subsequence](Algorithms/392.Is-Subsequence/solution.cpp) [394.Decode-String](Algorithms/394.Decode-String/solution.cpp) [396.Rotate-Function](Algorithms/396.Rotate-Function/solution.cpp) [399.Evaluate-Division](Algorithms/399.Evaluate-Division/solution.cpp) [400.Nth-Digit](Algorithms/400.Nth-Digit/solution.cpp) [401.Binary-Watch](Algorithms/401.Binary-Watch/solution.cpp) [404.Sum-of-Left-Leaves](Algorithms/404.Sum-of-Left-Leaves/solution.cpp) [405.Convert-a-Number-to-Hexadecimal](Algorithms/405.Convert-a-Number-to-Hexadecimal/solution.cpp) [406.Queue-Reconstruction-by-Height](Algorithms/406.Queue-Reconstruction-by-Height/solution.cpp) [409.Longest-Palindrome](Algorithms/409.Longest-Palindrome/solution.cpp) [412.Fizz-Buzz](Algorithms/412.Fizz-Buzz/solution.cpp) [413.Arithmetic-Slices](Algorithms/413.Arithmetic-Slices/solution.cpp) [414.Third-Maximum-Number](Algorithms/414.Third-Maximum-Number/solution.cpp) [415.Add-Strings](Algorithms/415.Add-Strings/solution.cpp) [419.Battleships-in-a-Board](Algorithms/419.Battleships-in-a-Board/solution.cpp) [423.Reconstruct-Original-Digits-from-English](Algorithms/423.Reconstruct-Original-Digits-from-English/solution.cpp) [424.Longest-Repeating-Character-Replacement](Algorithms/424.Longest-Repeating-Character-Replacement/solution.cpp) [434.Number-of-Segments-in-a-String](Algorithms/434.Number-of-Segments-in-a-String/solution.cpp) [435.Non-overlapping-Intervals](Algorithms/435.Non-overlapping-Intervals/solution.cpp) [436.Find-Right-Interval](Algorithms/436.Find-Right-Interval/solution.cpp) [437.Path-Sum-III](Algorithms/437.Path-Sum-III/solution.cpp) [438.Find-All-Anagrams-in-a-String](Algorithms/438.Find-All-Anagrams-in-a-String/solution.cpp) [441.Arranging-Coins](Algorithms/441.Arranging-Coins/solution.cpp) [447.Number-of-Boomerangs](Algorithms/447.Number-of-Boomerangs/solution.cpp) [448.Find-All-Numbers-Disappeared-in-an-Array](Algorithms/448.Find-All-Numbers-Disappeared-in-an-Array/solution.cpp) [452.Minimum-Number-of-Arrows-to-Burst-Balloons](Algorithms/452.Minimum-Number-of-Arrows-to-Burst-Balloons/solution.cpp) [453.Minimum-Moves-to-Equal-Array-Elements](Algorithms/453.Minimum-Moves-to-Equal-Array-Elements/solution.cpp) [455.Assign-Cookies](Algorithms/455.Assign-Cookies/solution.cpp) [459.Repeated-Substring-Pattern](Algorithms/459.Repeated-Substring-Pattern/solution.cpp) [461.Hamming-Distance](Algorithms/461.Hamming-Distance/solution.cpp) [462.Minimum-Moves-to-Equal-Array-Elements-II](Algorithms/462.Minimum-Moves-to-Equal-Array-Elements-II/solution.cpp) [463.Island-Perimeter](Algorithms/463.Island-Perimeter/solution.cpp) [471.Simplify-Path](Algorithms/471.Simplify-Path/solution.cpp) [476.Number-Complement](Algorithms/476.Number-Complement/solution.cpp) [485.Max-Consecutive-Ones](Algorithms/485.Max-Consecutive-Ones/solution.cpp) [496.Next-Greater-Element-I](Algorithms/496.Next-Greater-Element-I/solution.cpp) [498.Diagonal-Traverse](Algorithms/498.Diagonal-Traverse/solution.cpp) [503.Next-Greater-Element-II](Algorithms/503.Next-Greater-Element-II/solution.cpp) [506.Relative-Ranks](Algorithms/506.Relative-Ranks/solution.cpp) [523.Continuous-Subarray-Sum](Algorithms/523.Continuous-Subarray-Sum/solution.cpp) [645.Set-Mismatch](Algorithms/645.Set-Mismatch/solution.cpp) [674.Longest-Continuous-Increasing-Subsequence](Algorithms/674.Longest-Continuous-Increasing-Subsequence/solution.cpp) [680.Valid-Palindrome-II](Algorithms/680.Valid-Palindrome-II/solution.cpp) [746.Min-Cost-Climbing-Stairs](Algorithms/746.Min-Cost-Climbing-Stairs/solution.cpp) [762.Prime-Number-of-Set-Bits-in-Binary-Representation](Algorithms/762.Prime-Number-of-Set-Bits-in-Binary-Representation/solution.cpp) [824.Goat-Latin](Algorithms/824.Goat-Latin/solution.cpp) [825.Friends-Of-Appropriate-Ages](Algorithms/825.Friends-Of-Appropriate-Ages/solution.cpp) [826.Most-Profit-Assigning-Work](Algorithms/826.Most-Profit-Assigning-Work/solution.cpp) [897.Increasing-Order-Search-Tree](Algorithms/897.Increasing-Order-Search-Tree/solution.cpp) [906.Super-Palindromes](Algorithms/906.Super-Palindromes/solution.cpp) [914.X-of-a-Kind-in-a-Deck-of-Cards](Algorithms/914.X-of-a-Kind-in-a-Deck-of-Cards/solution.cpp) [915.Partition-Array-into-Disjoint-Intervals](Algorithms/915.Partition-Array-into-Disjoint-Intervals/solution.cpp) [918.Maximum-Sum-Circular-Subarray](Algorithms/918.Maximum-Sum-Circular-Subarray/solution.cpp) [917.Reverse-Only-Letters](Algorithms/917.Reverse-Only-Letters/solution.cpp) [919.Complete-Binary-Tree-Inserter](Algorithms/919.Complete-Binary-Tree-Inserter/solution.cpp) [925.Long-Pressed-Name](Algorithms/925.Long-Pressed-Name/solution.cpp) [926.Flip-String-to-Monotone-Increasing](Algorithms/926.Flip-String-to-Monotone-Increasing/solution.cpp) [929.Unique-Email-Addresses](Algorithms/929.Unique-Email-Addresses/solution.cpp) [930.Binary-Subarrays-With-Sum](Algorithms/930.Binary-Subarrays-With-Sum/solution.cpp) [933.Number-of-Recent-Calls](Algorithms/933.Number-of-Recent-Calls/solution.cpp) [934.Shortest-Bridge](Algorithms/934.Shortest-Bridge/solution.cpp) [937.Reorder-Log-Files](Algorithms/937.Reorder-Log-Files/solution.cpp) [938.Range-Sum-of-BST](Algorithms/938.Range-Sum-of-BST/solution.cpp) [939.Minimum-Area-Rectangle](Algorithms/939.Minimum-Area-Rectangle/solution.cpp) [940.Distinct-Subsequences-II](Algorithms/940.Distinct-Subsequences-II/solution.cpp) [941.Valid-Mountain-Array](Algorithms/941.Valid-Mountain-Array/solution.cpp) [942.DI-String-Match](Algorithms/942.DI-String-Match/solution.cpp) [943.Find-the-Shortest-Superstring](Algorithms/943.Find-the-Shortest-Superstring/solution.cpp) [944.Delete-Columns-to-Make-Sorted](Algorithms/944.Delete-Columns-to-Make-Sorted/solution.cpp) [945.Minimum-Increment-to-Make-Array-Unique](Algorithms/945.Minimum-Increment-to-Make-Array-Unique/solution.cpp) [946.Validate-Stack-Sequences](Algorithms/946.Validate-Stack-Sequences/solution.cpp) [947.Most-Stones-Removed-with-Same-Row-or-Column](Algorithms/947.Most-Stones-Removed-with-Same-Row-or-Column/solution.cpp) [948.Bag-of-Tokens](Algorithms/948.Bag-of-Tokens/solution.cpp) [949.Largest-Time-for-Given-Digits](Algorithms/949.Largest-Time-for-Given-Digits/solution.cpp) [950.Reveal-Cards-In-Increasing-Order](Algorithms/950.Reveal-Cards-In-Increasing-Order/solution.cpp) [951.Flip-Equivalent-Binary-Trees](Algorithms/951.Flip-Equivalent-Binary-Trees/solution.cpp) [952.Largest-Component-Size-by-Common-Factor](Algorithms/952.Largest-Component-Size-by-Common-Factor/solution.cpp) [953.Verifying-an-Alien-Dictionary](Algorithms/953.Verifying-an-Alien-Dictionary/solution.cpp) [954.Array-of-Doubled-Pairs](Algorithms/954.Array-of-Doubled-Pairs/solution.cpp) [955.Delete-Columns-to-Make-Sorted-II](Algorithms/955.Delete-Columns-to-Make-Sorted-II/solution.cpp) [957.Prison-Cells-After-N-Days](Algorithms/957.Prison-Cells-After-N-Days/solution.cpp) [958.Check-Completeness-of-a-Binary-Tree](Algorithms/958.Check-Completeness-of-a-Binary-Tree/solution.cpp) [959.Regions-Cut-By-Slashes](Algorithms/959.Regions-Cut-By-Slashes/solution.cpp) [973.K-Closest-Points-to-Origin](Algorithms/973.K-Closest-Points-to-Origin/solution.cpp) [974.Subarray-Sums-Divisible-by-K](Algorithms/974.Subarray-Sums-Divisible-by-K/solution.cpp) [976.Largest-Perimeter-Triangle](Algorithms/976.Largest-Perimeter-Triangle/solution.cpp)