Showing preview only (6,891K chars total). Download the full file or copy to clipboard to get everything.
Repository: halfrost/LeetCode-Go
Branch: master
Commit: d78a9e0927a3
Files: 3479
Total size: 5.8 MB
Directory structure:
gitextract_4lwz87pg/
├── .github/
│ ├── FUNDING.yml
│ └── workflows/
│ └── deploy.yml
├── .gitignore
├── .travis.yml
├── .vscode/
│ ├── launch.json
│ └── settings.json
├── LICENSE
├── README.md
├── README_old.md
├── ctl/
│ ├── README.md
│ ├── command.go
│ ├── config.go
│ ├── error.go
│ ├── label.go
│ ├── main.go
│ ├── meta/
│ │ ├── Array
│ │ ├── Backtracking
│ │ ├── Binary_Indexed_Tree
│ │ ├── Binary_Search
│ │ ├── Bit_Manipulation
│ │ ├── Breadth_First_Search
│ │ ├── Depth_First_Search
│ │ ├── Dynamic_Programming
│ │ ├── Hash_Table
│ │ ├── Linked_List
│ │ ├── Math
│ │ ├── PDFPreface
│ │ ├── Segment_Tree
│ │ ├── Sliding_Window
│ │ ├── Sorting
│ │ ├── Stack
│ │ ├── String
│ │ ├── Tree
│ │ ├── Two_Pointers
│ │ ├── Union_Find
│ │ └── meta
│ ├── models/
│ │ ├── go.mod
│ │ ├── go.sum
│ │ ├── lcproblems.go
│ │ ├── mdrow.go
│ │ ├── tagproblem.go
│ │ └── user.go
│ ├── pdf.go
│ ├── rangking.go
│ ├── refresh.go
│ ├── render.go
│ ├── request.go
│ ├── statistic.go
│ ├── template/
│ │ ├── Array.md
│ │ ├── Backtracking.md
│ │ ├── Binary_Indexed_Tree.md
│ │ ├── Binary_Search.md
│ │ ├── Bit_Manipulation.md
│ │ ├── Breadth_First_Search.md
│ │ ├── Depth_First_Search.md
│ │ ├── Dynamic_Programming.md
│ │ ├── Hash_Table.md
│ │ ├── Linked_List.md
│ │ ├── Math.md
│ │ ├── Segment_Tree.md
│ │ ├── Sliding_Window.md
│ │ ├── Sorting.md
│ │ ├── Stack.md
│ │ ├── String.md
│ │ ├── Tree.md
│ │ ├── Two_Pointers.md
│ │ ├── Union_Find.md
│ │ ├── collapseSection.md
│ │ ├── menu.md
│ │ └── template.markdown
│ ├── template_render.go
│ ├── util/
│ │ ├── go.mod
│ │ └── util.go
│ └── version.go
├── go.mod
├── go.sum
├── gotest.sh
├── leetcode/
│ ├── 0001.Two-Sum/
│ │ ├── 1. Two Sum.go
│ │ ├── 1. Two Sum_test.go
│ │ └── README.md
│ ├── 0002.Add-Two-Numbers/
│ │ ├── 2. Add Two Numbers.go
│ │ ├── 2. Add Two Numbers_test.go
│ │ └── README.md
│ ├── 0003.Longest-Substring-Without-Repeating-Characters/
│ │ ├── 3. Longest Substring Without Repeating Characters.go
│ │ ├── 3. Longest Substring Without Repeating Characters_test.go
│ │ └── README.md
│ ├── 0004.Median-of-Two-Sorted-Arrays/
│ │ ├── 4. Median of Two Sorted Arrays.go
│ │ ├── 4. Median of Two Sorted Arrays_test.go
│ │ └── README.md
│ ├── 0005.Longest-Palindromic-Substring/
│ │ ├── 5. Longest Palindromic Substring.go
│ │ ├── 5. Longest Palindromic Substring_test.go
│ │ └── README.md
│ ├── 0006.ZigZag-Conversion/
│ │ ├── 6. ZigZag Conversion.go
│ │ ├── 6. ZigZag Conversion_test.go
│ │ └── README.md
│ ├── 0007.Reverse-Integer/
│ │ ├── 7. Reverse Integer.go
│ │ ├── 7. Reverse Integer_test.go
│ │ └── README.md
│ ├── 0008.String-to-Integer-atoi/
│ │ ├── 8. String to Integer atoi.go
│ │ ├── 8. String to Integer atoi_test.go
│ │ └── README.md
│ ├── 0009.Palindrome-Number/
│ │ ├── 9. Palindrome Number.go
│ │ ├── 9. Palindrome Number_test.go
│ │ └── README.md
│ ├── 0011.Container-With-Most-Water/
│ │ ├── 11. Container With Most Water.go
│ │ ├── 11. Container With Most Water_test.go
│ │ └── README.md
│ ├── 0012.Integer-to-Roman/
│ │ ├── 12. Integer to Roman.go
│ │ ├── 12. Integer to Roman_test.go
│ │ └── README.md
│ ├── 0013.Roman-to-Integer/
│ │ ├── 13. Roman to Integer.go
│ │ ├── 13. Roman to Integer_test.go
│ │ └── README.md
│ ├── 0014.Longest-Common-Prefix/
│ │ ├── 14.Longest Common Prefix.go
│ │ ├── 14.Longest Common Prefix_test.go
│ │ └── README.md
│ ├── 0015.3Sum/
│ │ ├── 15. 3Sum.go
│ │ ├── 15. 3Sum_test.go
│ │ └── README.md
│ ├── 0016.3Sum-Closest/
│ │ ├── 16. 3Sum Closest.go
│ │ ├── 16. 3Sum Closest_test.go
│ │ └── README.md
│ ├── 0017.Letter-Combinations-of-a-Phone-Number/
│ │ ├── 17. Letter Combinations of a Phone Number.go
│ │ ├── 17. Letter Combinations of a Phone Number_test.go
│ │ └── README.md
│ ├── 0018.4Sum/
│ │ ├── 18. 4Sum.go
│ │ ├── 18. 4Sum_test.go
│ │ └── README.md
│ ├── 0019.Remove-Nth-Node-From-End-of-List/
│ │ ├── 19. Remove Nth Node From End of List.go
│ │ ├── 19. Remove Nth Node From End of List_test.go
│ │ └── README.md
│ ├── 0020.Valid-Parentheses/
│ │ ├── 20. Valid Parentheses.go
│ │ ├── 20. Valid Parentheses_test.go
│ │ └── README.md
│ ├── 0021.Merge-Two-Sorted-Lists/
│ │ ├── 21. Merge Two Sorted Lists.go
│ │ ├── 21. Merge Two Sorted Lists_test.go
│ │ └── README.md
│ ├── 0022.Generate-Parentheses/
│ │ ├── 22. Generate Parentheses.go
│ │ ├── 22. Generate Parentheses_test.go
│ │ └── README.md
│ ├── 0023.Merge-k-Sorted-Lists/
│ │ ├── 23. Merge k Sorted Lists.go
│ │ ├── 23. Merge k Sorted Lists_test.go
│ │ └── README.md
│ ├── 0024.Swap-Nodes-in-Pairs/
│ │ ├── 24. Swap Nodes in Pairs.go
│ │ ├── 24. Swap Nodes in Pairs_test.go
│ │ └── README.md
│ ├── 0025.Reverse-Nodes-in-k-Group/
│ │ ├── 25. Reverse Nodes in k Group.go
│ │ ├── 25. Reverse Nodes in k Group_test.go
│ │ └── README.md
│ ├── 0026.Remove-Duplicates-from-Sorted-Array/
│ │ ├── 26. Remove Duplicates from Sorted Array.go
│ │ ├── 26. Remove Duplicates from Sorted Array_test.go
│ │ └── README.md
│ ├── 0027.Remove-Element/
│ │ ├── 27. Remove Element.go
│ │ ├── 27. Remove Element_test.go
│ │ └── README.md
│ ├── 0028.Find-the-Index-of-the-First-Occurrence-in-a-String/
│ │ ├── 28. Find the Index of the First Occurrence in a String.go
│ │ ├── 28. Find the Index of the First Occurrence in a String_test.go
│ │ └── README.md
│ ├── 0029.Divide-Two-Integers/
│ │ ├── 29. Divide Two Integers.go
│ │ ├── 29. Divide Two Integers_test.go
│ │ └── README.md
│ ├── 0030.Substring-with-Concatenation-of-All-Words/
│ │ ├── 30. Substring with Concatenation of All Words.go
│ │ ├── 30. Substring with Concatenation of All Words_test.go
│ │ └── README.md
│ ├── 0031.Next-Permutation/
│ │ ├── 31. Next Permutation.go
│ │ ├── 31. Next Permutation_test.go
│ │ └── README.md
│ ├── 0032.Longest-Valid-Parentheses/
│ │ ├── 32. Longest Valid Parentheses.go
│ │ ├── 32. Longest Valid Parentheses_test.go
│ │ └── README.md
│ ├── 0033.Search-in-Rotated-Sorted-Array/
│ │ ├── 33. Search in Rotated Sorted Array.go
│ │ ├── 33. Search in Rotated Sorted Array_test.go
│ │ └── README.md
│ ├── 0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/
│ │ ├── 34. Find First and Last Position of Element in Sorted Array.go
│ │ ├── 34. Find First and Last Position of Element in Sorted Array_test.go
│ │ └── README.md
│ ├── 0035.Search-Insert-Position/
│ │ ├── 35. Search Insert Position.go
│ │ ├── 35. Search Insert Position_test.go
│ │ └── README.md
│ ├── 0036.Valid-Sudoku/
│ │ ├── 36. Valid Sudoku.go
│ │ ├── 36. Valid Sudoku_test.go
│ │ └── README.md
│ ├── 0037.Sudoku-Solver/
│ │ ├── 37. Sudoku Solver.go
│ │ ├── 37. Sudoku Solver_test.go
│ │ └── README.md
│ ├── 0039.Combination-Sum/
│ │ ├── 39. Combination Sum.go
│ │ ├── 39. Combination Sum_test.go
│ │ └── README.md
│ ├── 0040.Combination-Sum-II/
│ │ ├── 40. Combination Sum II.go
│ │ ├── 40. Combination Sum II_test.go
│ │ └── README.md
│ ├── 0041.First-Missing-Positive/
│ │ ├── 41. First Missing Positive.go
│ │ ├── 41. First Missing Positive_test.go
│ │ └── README.md
│ ├── 0042.Trapping-Rain-Water/
│ │ ├── 42. Trapping Rain Water.go
│ │ ├── 42. Trapping Rain Water_test.go
│ │ └── README.md
│ ├── 0043.Multiply-Strings/
│ │ ├── 43. Multiply Strings.go
│ │ ├── 43. Multiply Strings_test.go
│ │ └── README.md
│ ├── 0045.Jump-Game-II/
│ │ ├── 45. Jump Game II.go
│ │ ├── 45. Jump Game II_test.go
│ │ └── README.md
│ ├── 0046.Permutations/
│ │ ├── 46. Permutations.go
│ │ ├── 46. Permutations_test.go
│ │ └── README.md
│ ├── 0047.Permutations-II/
│ │ ├── 47. Permutations II.go
│ │ ├── 47. Permutations II_test.go
│ │ └── README.md
│ ├── 0048.Rotate-Image/
│ │ ├── 48. Rotate Image.go
│ │ ├── 48. Rotate Image_test.go
│ │ └── README.md
│ ├── 0049.Group-Anagrams/
│ │ ├── 49. Group Anagrams.go
│ │ ├── 49. Group Anagrams_test.go
│ │ └── README.md
│ ├── 0050.Powx-n/
│ │ ├── 50. Pow(x, n).go
│ │ ├── 50. Pow(x, n)_test.go
│ │ └── README.md
│ ├── 0051.N-Queens/
│ │ ├── 51. N-Queens.go
│ │ ├── 51. N-Queens_test.go
│ │ └── README.md
│ ├── 0052.N-Queens-II/
│ │ ├── 52. N-Queens II.go
│ │ ├── 52. N-Queens II_test.go
│ │ └── README.md
│ ├── 0053.Maximum-Subarray/
│ │ ├── 53. Maximum Subarray.go
│ │ ├── 53. Maximum Subarray_test.go
│ │ └── README.md
│ ├── 0054.Spiral-Matrix/
│ │ ├── 54. Spiral Matrix.go
│ │ ├── 54. Spiral Matrix_test.go
│ │ └── README.md
│ ├── 0055.Jump-Game/
│ │ ├── 55. Jump Game.go
│ │ ├── 55. Jump Game_test.go
│ │ └── README.md
│ ├── 0056.Merge-Intervals/
│ │ ├── 56. Merge Intervals.go
│ │ ├── 56. Merge Intervals_test.go
│ │ └── README.md
│ ├── 0057.Insert-Interval/
│ │ ├── 57. Insert Interval.go
│ │ ├── 57. Insert Interval_test.go
│ │ └── README.md
│ ├── 0058.Length-of-Last-Word/
│ │ ├── 58.Length of Last Word.go
│ │ ├── 58.Length of Last Word_test.go
│ │ └── README.md
│ ├── 0059.Spiral-Matrix-II/
│ │ ├── 59. Spiral Matrix II.go
│ │ ├── 59. Spiral Matrix II_test.go
│ │ └── README.md
│ ├── 0060.Permutation-Sequence/
│ │ ├── 60. Permutation Sequence.go
│ │ ├── 60. Permutation Sequence_test.go
│ │ └── README.md
│ ├── 0061.Rotate-List/
│ │ ├── 61. Rotate List.go
│ │ ├── 61. Rotate List_test.go
│ │ └── README.md
│ ├── 0062.Unique-Paths/
│ │ ├── 62. Unique Paths.go
│ │ ├── 62. Unique Paths_test.go
│ │ └── README.md
│ ├── 0063.Unique-Paths-II/
│ │ ├── 63. Unique Paths II.go
│ │ ├── 63. Unique Paths II_test.go
│ │ └── README.md
│ ├── 0064.Minimum-Path-Sum/
│ │ ├── 64. Minimum Path Sum.go
│ │ ├── 64. Minimum Path Sum_test.go
│ │ └── README.md
│ ├── 0065.Valid-Number/
│ │ ├── 65. Valid Number.go
│ │ ├── 65. Valid Number_test.go
│ │ └── README.md
│ ├── 0066.Plus-One/
│ │ ├── 66. Plus One.go
│ │ ├── 66. Plus One_test.go
│ │ └── README.md
│ ├── 0067.Add-Binary/
│ │ ├── 67. Add Binary.go
│ │ ├── 67. Add Binary_test.go
│ │ └── README.md
│ ├── 0069.Sqrtx/
│ │ ├── 69. Sqrt(x).go
│ │ ├── 69. Sqrt(x)_test.go
│ │ └── README.md
│ ├── 0070.Climbing-Stairs/
│ │ ├── 70. Climbing Stairs.go
│ │ ├── 70. Climbing Stairs_test.go
│ │ └── README.md
│ ├── 0071.Simplify-Path/
│ │ ├── 71. Simplify Path.go
│ │ ├── 71. Simplify Path_test.go
│ │ └── README.md
│ ├── 0073.Set-Matrix-Zeroes/
│ │ ├── 73. Set Matrix Zeroes.go
│ │ ├── 73. Set Matrix Zeroes_test.go
│ │ └── README.md
│ ├── 0074.Search-a-2D-Matrix/
│ │ ├── 74. Search a 2D Matrix.go
│ │ ├── 74. Search a 2D Matrix_test.go
│ │ └── README.md
│ ├── 0075.Sort-Colors/
│ │ ├── 75. Sort Colors.go
│ │ ├── 75. Sort Colors_test.go
│ │ └── README.md
│ ├── 0076.Minimum-Window-Substring/
│ │ ├── 76. Minimum Window Substring.go
│ │ ├── 76. Minimum Window Substring_test.go
│ │ └── README.md
│ ├── 0077.Combinations/
│ │ ├── 77. Combinations.go
│ │ ├── 77. Combinations_test.go
│ │ └── README.md
│ ├── 0078.Subsets/
│ │ ├── 78. Subsets.go
│ │ ├── 78. Subsets_test.go
│ │ └── README.md
│ ├── 0079.Word-Search/
│ │ ├── 79. Word Search.go
│ │ ├── 79. Word Search_test.go
│ │ └── README.md
│ ├── 0080.Remove-Duplicates-from-Sorted-Array-II/
│ │ ├── 80. Remove Duplicates from Sorted Array II.go
│ │ ├── 80. Remove Duplicates from Sorted Array II_test.go
│ │ └── README.md
│ ├── 0081.Search-in-Rotated-Sorted-Array-II/
│ │ ├── 81. Search in Rotated Sorted Array II.go
│ │ ├── 81. Search in Rotated Sorted Array II_test.go
│ │ └── README.md
│ ├── 0082.Remove-Duplicates-from-Sorted-List-II/
│ │ ├── 82. Remove Duplicates from Sorted List II.go
│ │ ├── 82. Remove Duplicates from Sorted List II_test.go
│ │ └── README.md
│ ├── 0083.Remove-Duplicates-from-Sorted-List/
│ │ ├── 83. Remove Duplicates from Sorted List.go
│ │ ├── 83. Remove Duplicates from Sorted List_test.go
│ │ └── README.md
│ ├── 0084.Largest-Rectangle-in-Histogram/
│ │ ├── 84. Largest Rectangle in Histogram.go
│ │ ├── 84. Largest Rectangle in Histogram_test.go
│ │ └── README.md
│ ├── 0086.Partition-List/
│ │ ├── 86. Partition List.go
│ │ ├── 86. Partition List_test.go
│ │ └── README.md
│ ├── 0088.Merge-Sorted-Array/
│ │ ├── 88. Merge Sorted Array.go
│ │ ├── 88. Merge Sorted Array_test.go
│ │ └── README.md
│ ├── 0089.Gray-Code/
│ │ ├── 89. Gray Code.go
│ │ ├── 89. Gray Code_test.go
│ │ └── README.md
│ ├── 0090.Subsets-II/
│ │ ├── 90. Subsets II.go
│ │ ├── 90. Subsets II_test.go
│ │ └── README.md
│ ├── 0091.Decode-Ways/
│ │ ├── 91. Decode Ways.go
│ │ ├── 91. Decode Ways_test.go
│ │ └── README.md
│ ├── 0092.Reverse-Linked-List-II/
│ │ ├── 92. Reverse Linked List II.go
│ │ ├── 92. Reverse Linked List II_test.go
│ │ └── README.md
│ ├── 0093.Restore-IP-Addresses/
│ │ ├── 93. Restore IP Addresses.go
│ │ ├── 93. Restore IP Addresses_test.go
│ │ └── README.md
│ ├── 0094.Binary-Tree-Inorder-Traversal/
│ │ ├── 94. Binary Tree Inorder Traversal.go
│ │ ├── 94. Binary Tree Inorder Traversal_test.go
│ │ └── README.md
│ ├── 0095.Unique-Binary-Search-Trees-II/
│ │ ├── 95. Unique Binary Search Trees II.go
│ │ ├── 95. Unique Binary Search Trees II_test.go
│ │ └── README.md
│ ├── 0096.Unique-Binary-Search-Trees/
│ │ ├── 96. Unique Binary Search Trees.go
│ │ ├── 96. Unique Binary Search Trees_test.go
│ │ └── README.md
│ ├── 0097.Interleaving-String/
│ │ ├── 97. Interleaving String.go
│ │ ├── 97. Interleaving String_test.go
│ │ └── README.md
│ ├── 0098.Validate-Binary-Search-Tree/
│ │ ├── 98. Validate Binary Search Tree.go
│ │ ├── 98. Validate Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0099.Recover-Binary-Search-Tree/
│ │ ├── 99. Recover Binary Search Tree.go
│ │ ├── 99. Recover Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0100.Same-Tree/
│ │ ├── 100. Same Tree.go
│ │ ├── 100. Same Tree_test.go
│ │ └── README.md
│ ├── 0101.Symmetric-Tree/
│ │ ├── 101. Symmetric Tree.go
│ │ ├── 101. Symmetric Tree_test.go
│ │ └── README.md
│ ├── 0102.Binary-Tree-Level-Order-Traversal/
│ │ ├── 102. Binary Tree Level Order Traversal.go
│ │ ├── 102. Binary Tree Level Order Traversal_test.go
│ │ └── README.md
│ ├── 0103.Binary-Tree-Zigzag-Level-Order-Traversal/
│ │ ├── 103. Binary Tree Zigzag Level Order Traversal.go
│ │ ├── 103. Binary Tree Zigzag Level Order Traversal_test.go
│ │ └── README.md
│ ├── 0104.Maximum-Depth-of-Binary-Tree/
│ │ ├── 104. Maximum Depth of Binary Tree.go
│ │ ├── 104. Maximum Depth of Binary Tree_test.go
│ │ └── README.md
│ ├── 0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/
│ │ ├── 105. Construct Binary Tree from Preorder and Inorder Traversal.go
│ │ ├── 105. Construct Binary Tree from Preorder and Inorder Traversal_test.go
│ │ └── README.md
│ ├── 0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/
│ │ ├── 106. Construct Binary Tree from Inorder and Postorder Traversal.go
│ │ ├── 106. Construct Binary Tree from Inorder and Postorder Traversal_test.go
│ │ └── README.md
│ ├── 0107.Binary-Tree-Level-Order-Traversal-II/
│ │ ├── 107. Binary Tree Level Order Traversal II.go
│ │ ├── 107. Binary Tree Level Order Traversal II_test.go
│ │ └── README.md
│ ├── 0108.Convert-Sorted-Array-to-Binary-Search-Tree/
│ │ ├── 108. Convert Sorted Array to Binary Search Tree.go
│ │ ├── 108. Convert Sorted Array to Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0109.Convert-Sorted-List-to-Binary-Search-Tree/
│ │ ├── 109. Convert Sorted List to Binary Search Tree.go
│ │ ├── 109. Convert Sorted List to Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0110.Balanced-Binary-Tree/
│ │ ├── 110. Balanced Binary Tree.go
│ │ ├── 110. Balanced Binary Tree_test.go
│ │ └── README.md
│ ├── 0111.Minimum-Depth-of-Binary-Tree/
│ │ ├── 111. Minimum Depth of Binary Tree.go
│ │ ├── 111. Minimum Depth of Binary Tree_test.go
│ │ └── README.md
│ ├── 0112.Path-Sum/
│ │ ├── 112. Path Sum.go
│ │ ├── 112. Path Sum_test.go
│ │ └── README.md
│ ├── 0113.Path-Sum-II/
│ │ ├── 113. Path Sum II.go
│ │ ├── 113. Path Sum II_test.go
│ │ └── README.md
│ ├── 0114.Flatten-Binary-Tree-to-Linked-List/
│ │ ├── 114. Flatten Binary Tree to Linked List.go
│ │ ├── 114. Flatten Binary Tree to Linked List_test.go
│ │ └── README.md
│ ├── 0115.Distinct-Subsequences/
│ │ ├── 115. Distinct Subsequences.go
│ │ ├── 115. Distinct Subsequences_test.go
│ │ └── README.md
│ ├── 0116.Populating-Next-Right-Pointers-in-Each-Node/
│ │ ├── 116.Populating Next Right Pointers in Each Node.go
│ │ ├── 116.Populating Next Right Pointers in Each Node_test.go
│ │ └── README.md
│ ├── 0118.Pascals-Triangle/
│ │ ├── 118. Pascals Triangle.go
│ │ ├── 118. Pascals Triangle_test.go
│ │ └── README.md
│ ├── 0119.Pascals-Triangle-II/
│ │ ├── 119. Pascals Triangle II.go
│ │ ├── 119. Pascals Triangle II_test.go
│ │ └── README.md
│ ├── 0120.Triangle/
│ │ ├── 120. Triangle.go
│ │ ├── 120. Triangle_test.go
│ │ └── README.md
│ ├── 0121.Best-Time-to-Buy-and-Sell-Stock/
│ │ ├── 121. Best Time to Buy and Sell Stock.go
│ │ ├── 121. Best Time to Buy and Sell Stock_test.go
│ │ └── README.md
│ ├── 0122.Best-Time-to-Buy-and-Sell-Stock-II/
│ │ ├── 122. Best Time to Buy and Sell Stock II.go
│ │ ├── 122. Best Time to Buy and Sell Stock II_test.go
│ │ └── README.md
│ ├── 0124.Binary-Tree-Maximum-Path-Sum/
│ │ ├── 124. Binary Tree Maximum Path Sum.go
│ │ ├── 124. Binary Tree Maximum Path Sum_test.go
│ │ └── README.md
│ ├── 0125.Valid-Palindrome/
│ │ ├── 125. Valid Palindrome.go
│ │ ├── 125. Valid Palindrome_test.go
│ │ └── README.md
│ ├── 0126.Word-Ladder-II/
│ │ ├── 126. Word Ladder II.go
│ │ ├── 126. Word Ladder II_test.go
│ │ └── README.md
│ ├── 0127.Word-Ladder/
│ │ ├── 127. Word Ladder.go
│ │ ├── 127. Word Ladder_test.go
│ │ └── README.md
│ ├── 0128.Longest-Consecutive-Sequence/
│ │ ├── 128. Longest Consecutive Sequence.go
│ │ ├── 128. Longest Consecutive Sequence_test.go
│ │ └── README.md
│ ├── 0129.Sum-Root-to-Leaf-Numbers/
│ │ ├── 129. Sum Root to Leaf Numbers.go
│ │ ├── 129. Sum Root to Leaf Numbers_test.go
│ │ └── README.md
│ ├── 0130.Surrounded-Regions/
│ │ ├── 130. Surrounded Regions.go
│ │ ├── 130. Surrounded Regions_test.go
│ │ └── README.md
│ ├── 0131.Palindrome-Partitioning/
│ │ ├── 131. Palindrome Partitioning.go
│ │ ├── 131. Palindrome Partitioning_test.go
│ │ └── README.md
│ ├── 0134.Gas-Station/
│ │ ├── Gas.go
│ │ ├── Gas_test.go
│ │ └── README.md
│ ├── 0135.Candy/
│ │ ├── 135. Candy.go
│ │ ├── 135. Candy_test.go
│ │ └── README.md
│ ├── 0136.Single-Number/
│ │ ├── 136. Single Number.go
│ │ ├── 136. Single Number_test.go
│ │ └── README.md
│ ├── 0137.Single-Number-II/
│ │ ├── 137. Single Number II.go
│ │ ├── 137. Single Number II_test.go
│ │ └── README.md
│ ├── 0138.Copy-List-With-Random-Pointer/
│ │ ├── 138. Copy List With Random Pointer.go
│ │ ├── 138. Copy List With Random Pointer_test.go
│ │ └── README.md
│ ├── 0141.Linked-List-Cycle/
│ │ ├── 141. Linked List Cycle.go
│ │ ├── 141. Linked List Cycle_test.go
│ │ └── README.md
│ ├── 0142.Linked-List-Cycle-II/
│ │ ├── 142. Linked List Cycle II.go
│ │ ├── 142. Linked List Cycle II_test.go
│ │ └── README.md
│ ├── 0143.Reorder-List/
│ │ ├── 143. Reorder List.go
│ │ ├── 143. Reorder List_test.go
│ │ └── README.md
│ ├── 0144.Binary-Tree-Preorder-Traversal/
│ │ ├── 144. Binary Tree Preorder Traversal.go
│ │ ├── 144. Binary Tree Preorder Traversal_test.go
│ │ └── README.md
│ ├── 0145.Binary-Tree-Postorder-Traversal/
│ │ ├── 145. Binary Tree Postorder Traversal.go
│ │ ├── 145. Binary Tree Postorder Traversal_test.go
│ │ └── README.md
│ ├── 0146.LRU-Cache/
│ │ ├── 146. LRU Cache.go
│ │ ├── 146. LRU Cache_test.go
│ │ └── README.md
│ ├── 0147.Insertion-Sort-List/
│ │ ├── 147. Insertion Sort List.go
│ │ ├── 147. Insertion Sort List_test.go
│ │ └── README.md
│ ├── 0148.Sort-List/
│ │ ├── 148. Sort List.go
│ │ ├── 148. Sort List_test.go
│ │ └── README.md
│ ├── 0150.Evaluate-Reverse-Polish-Notation/
│ │ ├── 150. Evaluate Reverse Polish Notation.go
│ │ ├── 150. Evaluate Reverse Polish Notation_test.go
│ │ └── README.md
│ ├── 0151.Reverse-Words-in-a-String/
│ │ ├── 151. Reverse Words in a String.go
│ │ ├── 151. Reverse Words in a String_test.go
│ │ └── README.md
│ ├── 0152.Maximum-Product-Subarray/
│ │ ├── 152. Maximum Product Subarray.go
│ │ ├── 152. Maximum Product Subarray_test.go
│ │ └── README.md
│ ├── 0153.Find-Minimum-in-Rotated-Sorted-Array/
│ │ ├── 153. Find Minimum in Rotated Sorted Array.go
│ │ ├── 153. Find Minimum in Rotated Sorted Array_test.go
│ │ └── README.md
│ ├── 0154.Find-Minimum-in-Rotated-Sorted-Array-II/
│ │ ├── 154. Find Minimum in Rotated Sorted Array II.go
│ │ ├── 154. Find Minimum in Rotated Sorted Array II_test.go
│ │ └── README.md
│ ├── 0155.Min-Stack/
│ │ ├── 155. Min Stack.go
│ │ ├── 155. Min Stack_test.go
│ │ └── README.md
│ ├── 0160.Intersection-of-Two-Linked-Lists/
│ │ ├── 160. Intersection of Two Linked Lists.go
│ │ ├── 160. Intersection of Two Linked Lists_test.go
│ │ └── README.md
│ ├── 0162.Find-Peak-Element/
│ │ ├── 162. Find Peak Element.go
│ │ ├── 162. Find Peak Element_test.go
│ │ └── README.md
│ ├── 0164.Maximum-Gap/
│ │ ├── 164. Maximum Gap.go
│ │ ├── 164. Maximum Gap_test.go
│ │ └── README.md
│ ├── 0167.Two-Sum-II-Input-array-is-sorted/
│ │ ├── 167. Two Sum II - Input array is sorted.go
│ │ ├── 167. Two Sum II - Input array is sorted_test.go
│ │ └── README.md
│ ├── 0168.Excel-Sheet-Column-Title/
│ │ ├── 168. Excel Sheet Column Title.go
│ │ ├── 168. Excel Sheet Column Title_test.go
│ │ └── README.md
│ ├── 0169.Majority-Element/
│ │ ├── 169. Majority Element.go
│ │ ├── 169. Majority Element_test.go
│ │ └── README.md
│ ├── 0171.Excel-Sheet-Column-Number/
│ │ ├── 171. Excel Sheet Column Number.go
│ │ ├── 171. Excel Sheet Column Number_test.go
│ │ └── README.md
│ ├── 0172.Factorial-Trailing-Zeroes/
│ │ ├── 172. Factorial Trailing Zeroes.go
│ │ ├── 172. Factorial Trailing Zeroes_test.go
│ │ └── README.md
│ ├── 0173.Binary-Search-Tree-Iterator/
│ │ ├── 173. Binary Search Tree Iterator.go
│ │ ├── 173. Binary Search Tree Iterator_test.go
│ │ └── README.md
│ ├── 0174.Dungeon-Game/
│ │ ├── 174. Dungeon Game.go
│ │ ├── 174. Dungeon Game_test.go
│ │ └── README.md
│ ├── 0179.Largest-Number/
│ │ ├── 179. Largest Number.go
│ │ ├── 179. Largest Number_test.go
│ │ └── README.md
│ ├── 0187.Repeated-DNA-Sequences/
│ │ ├── 187. Repeated DNA Sequences.go
│ │ ├── 187. Repeated DNA Sequences_test.go
│ │ └── README.md
│ ├── 0189.Rotate-Array/
│ │ ├── 189. Rotate Array.go
│ │ ├── 189. Rotate Array_test.go
│ │ └── README.md
│ ├── 0190.Reverse-Bits/
│ │ ├── 190. Reverse Bits.go
│ │ ├── 190. Reverse Bits_test.go
│ │ └── README.md
│ ├── 0191.Number-of-1-Bits/
│ │ ├── 191. Number of 1 Bits.go
│ │ ├── 191. Number of 1 Bits_test.go
│ │ └── README.md
│ ├── 0198.House-Robber/
│ │ ├── 198. House Robber.go
│ │ ├── 198. House Robber_test.go
│ │ └── README.md
│ ├── 0199.Binary-Tree-Right-Side-View/
│ │ ├── 199. Binary Tree Right Side View.go
│ │ ├── 199. Binary Tree Right Side View_test.go
│ │ └── README.md
│ ├── 0200.Number-of-Islands/
│ │ ├── 200. Number of Islands.go
│ │ ├── 200. Number of Islands_test.go
│ │ └── README.md
│ ├── 0201.Bitwise-AND-of-Numbers-Range/
│ │ ├── 201. Bitwise AND of Numbers Range.go
│ │ ├── 201. Bitwise AND of Numbers Range_test.go
│ │ └── README.md
│ ├── 0202.Happy-Number/
│ │ ├── 202. Happy Number.go
│ │ ├── 202. Happy Number_test.go
│ │ └── README.md
│ ├── 0203.Remove-Linked-List-Elements/
│ │ ├── 203. Remove Linked List Elements.go
│ │ ├── 203. Remove Linked List Elements_test.go
│ │ └── README.md
│ ├── 0204.Count-Primes/
│ │ ├── 204. Count Primes.go
│ │ ├── 204. Count Primes_test.go
│ │ └── README.md
│ ├── 0205.Isomorphic-Strings/
│ │ ├── 205. Isomorphic Strings.go
│ │ ├── 205. Isomorphic Strings_test.go
│ │ └── README.md
│ ├── 0206.Reverse-Linked-List/
│ │ ├── 206. Reverse Linked List.go
│ │ ├── 206. Reverse Linked List_test.go
│ │ └── README.md
│ ├── 0207.Course-Schedule/
│ │ ├── 207. Course Schedule.go
│ │ ├── 207. Course Schedule_test.go
│ │ └── README.md
│ ├── 0208.Implement-Trie-Prefix-Tree/
│ │ ├── 208. Implement Trie (Prefix Tree).go
│ │ ├── 208. Implement Trie (Prefix Tree)_test.go
│ │ └── README.md
│ ├── 0209.Minimum-Size-Subarray-Sum/
│ │ ├── 209. Minimum Size Subarray Sum.go
│ │ ├── 209. Minimum Size Subarray Sum_test.go
│ │ └── README.md
│ ├── 0210.Course-Schedule-II/
│ │ ├── 210. Course Schedule II.go
│ │ ├── 210. Course Schedule II_test.go
│ │ └── README.md
│ ├── 0211.Design-Add-and-Search-Words-Data-Structure/
│ │ ├── 211. Design Add and Search Words Data Structure.go
│ │ ├── 211. Design Add and Search Words Data Structure_test.go
│ │ └── README.md
│ ├── 0212.Word-Search-II/
│ │ ├── 212. Word Search II.go
│ │ ├── 212. Word Search II_test.go
│ │ └── README.md
│ ├── 0213.House-Robber-II/
│ │ ├── 213. House Robber II.go
│ │ ├── 213. House Robber II_test.go
│ │ └── README.md
│ ├── 0215.Kth-Largest-Element-in-an-Array/
│ │ ├── 215. Kth Largest Element in an Array.go
│ │ ├── 215. Kth Largest Element in an Array_test.go
│ │ └── README.md
│ ├── 0216.Combination-Sum-III/
│ │ ├── 216. Combination Sum III.go
│ │ ├── 216. Combination Sum III_test.go
│ │ └── README.md
│ ├── 0217.Contains-Duplicate/
│ │ ├── 217. Contains Duplicate.go
│ │ ├── 217. Contains Duplicate_test.go
│ │ └── README.md
│ ├── 0218.The-Skyline-Problem/
│ │ ├── 218. The Skyline Problem.go
│ │ ├── 218. The Skyline Problem_test.go
│ │ └── README.md
│ ├── 0219.Contains-Duplicate-II/
│ │ ├── 219. Contains Duplicate II.go
│ │ ├── 219. Contains Duplicate II_test.go
│ │ └── README.md
│ ├── 0220.Contains-Duplicate-III/
│ │ ├── 220. Contains Duplicate III.go
│ │ ├── 220. Contains Duplicate III_test.go
│ │ └── README.md
│ ├── 0222.Count-Complete-Tree-Nodes/
│ │ ├── 222. Count Complete Tree Nodes.go
│ │ ├── 222. Count Complete Tree Nodes_test.go
│ │ └── README.md
│ ├── 0223.Rectangle-Area/
│ │ ├── 223. Rectangle Area.go
│ │ ├── 223. Rectangle Area_test.go
│ │ └── README.md
│ ├── 0224.Basic-Calculator/
│ │ ├── 224. Basic Calculator.go
│ │ ├── 224. Basic Calculator_test.go
│ │ └── README.md
│ ├── 0225.Implement-Stack-using-Queues/
│ │ ├── 225. Implement Stack using Queues.go
│ │ ├── 225. Implement Stack using Queues_test.go
│ │ └── README.md
│ ├── 0226.Invert-Binary-Tree/
│ │ ├── 226. Invert Binary Tree.go
│ │ ├── 226. Invert Binary Tree_test.go
│ │ └── README.md
│ ├── 0227.Basic-Calculator-II/
│ │ ├── 227. Basic Calculator II.go
│ │ ├── 227. Basic Calculator II_test.go
│ │ └── README.md
│ ├── 0228.Summary-Ranges/
│ │ ├── 228. Summary Ranges.go
│ │ ├── 228. Summary Ranges_test.go
│ │ └── README.md
│ ├── 0229.Majority-Element-II/
│ │ ├── 229. Majority Element II.go
│ │ ├── 229. Majority Element II_test.go
│ │ └── README.md
│ ├── 0230.Kth-Smallest-Element-in-a-BST/
│ │ ├── 230. Kth Smallest Element in a BST.go
│ │ ├── 230. Kth Smallest Element in a BST_test.go
│ │ └── README.md
│ ├── 0231.Power-of-Two/
│ │ ├── 231. Power of Two.go
│ │ ├── 231. Power of Two_test.go
│ │ └── README.md
│ ├── 0232.Implement-Queue-using-Stacks/
│ │ ├── 232. Implement Queue using Stacks.go
│ │ ├── 232. Implement Queue using Stacks_test.go
│ │ └── README.md
│ ├── 0234.Palindrome-Linked-List/
│ │ ├── 234. Palindrome Linked List.go
│ │ ├── 234. Palindrome Linked List_test.go
│ │ └── README.md
│ ├── 0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/
│ │ ├── 235. Lowest Common Ancestor of a Binary Search Tree.go
│ │ ├── 235. Lowest Common Ancestor of a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0236.Lowest-Common-Ancestor-of-a-Binary-Tree/
│ │ ├── 236. Lowest Common Ancestor of a Binary Tree.go
│ │ ├── 236. Lowest Common Ancestor of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0237.Delete-Node-in-a-Linked-List/
│ │ ├── 237. Delete Node in a Linked List.go
│ │ ├── 237. Delete Node in a Linked List_test.go
│ │ └── README.md
│ ├── 0239.Sliding-Window-Maximum/
│ │ ├── 239. Sliding Window Maximum.go
│ │ ├── 239. Sliding Window Maximum_test.go
│ │ └── README.md
│ ├── 0240.Search-a-2D-Matrix-II/
│ │ ├── 240. Search a 2D Matrix II.go
│ │ ├── 240. Search a 2D Matrix II_test.go
│ │ └── README.md
│ ├── 0242.Valid-Anagram/
│ │ ├── 242. Valid Anagram.go
│ │ ├── 242. Valid Anagram_test.go
│ │ └── README.md
│ ├── 0257.Binary-Tree-Paths/
│ │ ├── 257. Binary Tree Paths.go
│ │ ├── 257. Binary Tree Paths_test.go
│ │ └── README.md
│ ├── 0258.Add-Digits/
│ │ ├── 258. Add Digits.go
│ │ ├── 258. Add Digits_test.go
│ │ └── README.md
│ ├── 0260.Single-Number-III/
│ │ ├── 260. Single Number III.go
│ │ ├── 260. Single Number III_test.go
│ │ └── README.md
│ ├── 0263.Ugly-Number/
│ │ ├── 263. Ugly Number.go
│ │ ├── 263. Ugly Number_test.go
│ │ └── README.md
│ ├── 0264.Ugly-Number-II/
│ │ ├── 264. Ugly Number II.go
│ │ ├── 264. Ugly Number II_test.go
│ │ └── README.md
│ ├── 0268.Missing-Number/
│ │ ├── 268. Missing Number.go
│ │ ├── 268. Missing Number_test.go
│ │ └── README.md
│ ├── 0274.H-Index/
│ │ ├── 274. H-Index.go
│ │ ├── 274. H-Index_test.go
│ │ └── README.md
│ ├── 0275.H-Index-II/
│ │ ├── 275. H-Index II.go
│ │ ├── 275. H-Index II_test.go
│ │ └── README.md
│ ├── 0278.First-Bad-Version/
│ │ ├── 278. First Bad Version.go
│ │ ├── 278. First Bad Version_test.go
│ │ └── README.md
│ ├── 0279.Perfect-Squares/
│ │ ├── 279. Perfect Squares.go
│ │ ├── 279. Perfect Squares_test.go
│ │ └── README.md
│ ├── 0283.Move-Zeroes/
│ │ ├── 283. Move Zeroes.go
│ │ ├── 283. Move Zeroes_test.go
│ │ └── README.md
│ ├── 0284.Peeking-Iterator/
│ │ ├── 284. Peeking Iterator.go
│ │ ├── 284. Peeking Iterator_test.go
│ │ └── README.md
│ ├── 0287.Find-the-Duplicate-Number/
│ │ ├── 287. Find the Duplicate Number.go
│ │ ├── 287. Find the Duplicate Number_test.go
│ │ └── README.md
│ ├── 0290.Word-Pattern/
│ │ ├── 290. Word Pattern.go
│ │ ├── 290. Word Pattern_test.go
│ │ └── README.md
│ ├── 0297.Serialize-and-Deserialize-Binary-Tree/
│ │ ├── 297.Serialize and Deserialize Binary Tree.go
│ │ ├── 297.Serialize and Deserialize Binary Tree_test.go
│ │ └── README.md
│ ├── 0299.Bulls-and-Cows/
│ │ ├── 299.Bulls and Cows.go
│ │ ├── 299.Bulls and Cows_test.go
│ │ └── README.md
│ ├── 0300.Longest-Increasing-Subsequence/
│ │ ├── 300. Longest Increasing Subsequence.go
│ │ ├── 300. Longest Increasing Subsequence_test.go
│ │ └── README.md
│ ├── 0301.Remove-Invalid-Parentheses/
│ │ ├── 301.Remove Invalid Parentheses.go
│ │ ├── 301.Remove Invalid Parentheses_test.go
│ │ └── README.md
│ ├── 0303.Range-Sum-Query-Immutable/
│ │ ├── 303. Range Sum Query - Immutable.go
│ │ ├── 303. Range Sum Query - Immutable_test.go
│ │ └── README.md
│ ├── 0304.Range-Sum-Query-2D-Immutable/
│ │ ├── 304. Range Sum Query 2D - Immutable.go
│ │ ├── 304. Range Sum Query 2D - Immutable_test.go
│ │ └── README.md
│ ├── 0306.Additive-Number/
│ │ ├── 306. Additive Number.go
│ │ ├── 306. Additive Number_test.go
│ │ └── README.md
│ ├── 0307.Range-Sum-Query-Mutable/
│ │ ├── 307. Range Sum Query - Mutable.go
│ │ ├── 307. Range Sum Query - Mutable_test.go
│ │ └── README.md
│ ├── 0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/
│ │ ├── 309. Best Time to Buy and Sell Stock with Cooldown.go
│ │ ├── 309. Best Time to Buy and Sell Stock with Cooldown_test.go
│ │ └── README.md
│ ├── 0315.Count-of-Smaller-Numbers-After-Self/
│ │ ├── 315. Count of Smaller Numbers After Self.go
│ │ ├── 315. Count of Smaller Numbers After Self_test.go
│ │ └── README.md
│ ├── 0318.Maximum-Product-of-Word-Lengths/
│ │ ├── 318. Maximum Product of Word Lengths.go
│ │ ├── 318. Maximum Product of Word Lengths_test.go
│ │ └── README.md
│ ├── 0319.Bulb-Switcher/
│ │ ├── 319.Bulb Switcher.go
│ │ ├── 319.Bulb Switcher_test.go
│ │ └── README.md
│ ├── 0322.Coin-Change/
│ │ ├── 322. Coin Change.go
│ │ ├── 322. Coin Change_test.go
│ │ └── README.md
│ ├── 0324.Wiggle-Sort-II/
│ │ ├── 324. Wiggle Sort II.go
│ │ ├── 324. Wiggle Sort II_test.go
│ │ └── README.md
│ ├── 0326.Power-of-Three/
│ │ ├── 326. Power of Three.go
│ │ ├── 326. Power of Three_test.go
│ │ └── README.md
│ ├── 0327.Count-of-Range-Sum/
│ │ ├── 327. Count of Range Sum.go
│ │ ├── 327. Count of Range Sum_test.go
│ │ └── README.md
│ ├── 0328.Odd-Even-Linked-List/
│ │ ├── 328. Odd Even Linked List.go
│ │ ├── 328. Odd Even Linked List_test.go
│ │ └── README.md
│ ├── 0329.Longest-Increasing-Path-in-a-Matrix/
│ │ ├── 329. Longest Increasing Path in a Matrix.go
│ │ ├── 329. Longest Increasing Path in a Matrix_test.go
│ │ └── README.md
│ ├── 0331.Verify-Preorder-Serialization-of-a-Binary-Tree/
│ │ ├── 331. Verify Preorder Serialization of a Binary Tree.go
│ │ ├── 331. Verify Preorder Serialization of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0337.House-Robber-III/
│ │ ├── 337. House Robber III.go
│ │ ├── 337. House Robber III_test.go
│ │ └── README.md
│ ├── 0338.Counting-Bits/
│ │ ├── 338. Counting Bits.go
│ │ ├── 338. Counting Bits_test.go
│ │ └── README.md
│ ├── 0341.Flatten-Nested-List-Iterator/
│ │ ├── 341. Flatten Nested List Iterator.go
│ │ ├── 341. Flatten Nested List Iterator_test.go
│ │ └── README.md
│ ├── 0342.Power-of-Four/
│ │ ├── 342. Power of Four.go
│ │ ├── 342. Power of Four_test.go
│ │ └── README.md
│ ├── 0343.Integer-Break/
│ │ ├── 343. Integer Break.go
│ │ ├── 343. Integer Break_test.go
│ │ └── README.md
│ ├── 0344.Reverse-String/
│ │ ├── 344. Reverse String.go
│ │ ├── 344. Reverse String_test.go
│ │ └── README.md
│ ├── 0345.Reverse-Vowels-of-a-String/
│ │ ├── 345. Reverse Vowels of a String.go
│ │ ├── 345. Reverse Vowels of a String_test.go
│ │ └── README.md
│ ├── 0347.Top-K-Frequent-Elements/
│ │ ├── 347. Top K Frequent Elements.go
│ │ ├── 347. Top K Frequent Elements_test.go
│ │ └── README.md
│ ├── 0349.Intersection-of-Two-Arrays/
│ │ ├── 349. Intersection of Two Arrays.go
│ │ ├── 349. Intersection of Two Arrays_test.go
│ │ └── README.md
│ ├── 0350.Intersection-of-Two-Arrays-II/
│ │ ├── 350. Intersection of Two Arrays II.go
│ │ ├── 350. Intersection of Two Arrays II_test.go
│ │ └── README.md
│ ├── 0352.Data-Stream-as-Disjoint-Intervals/
│ │ ├── 352.Data Stream as Disjoint Intervals.go
│ │ ├── 352.Data Stream as Disjoint Intervals_test.go
│ │ └── README.md
│ ├── 0354.Russian-Doll-Envelopes/
│ │ ├── 354. Russian Doll Envelopes.go
│ │ ├── 354. Russian Doll Envelopes_test.go
│ │ └── README.md
│ ├── 0357.Count-Numbers-with-Unique-Digits/
│ │ ├── 357. Count Numbers with Unique Digits.go
│ │ ├── 357. Count Numbers with Unique Digits_test.go
│ │ └── README.md
│ ├── 0367.Valid-Perfect-Square/
│ │ ├── 367. Valid Perfect Square.go
│ │ ├── 367. Valid Perfect Square_test.go
│ │ └── README.md
│ ├── 0368.Largest-Divisible-Subset/
│ │ ├── 368. Largest Divisible Subset.go
│ │ ├── 368. Largest Divisible Subset_test.go
│ │ └── README.md
│ ├── 0371.Sum-of-Two-Integers/
│ │ ├── 371. Sum of Two Integers.go
│ │ ├── 371. Sum of Two Integers_test.go
│ │ └── README.md
│ ├── 0372.Super-Pow/
│ │ ├── 372. Super Pow.go
│ │ ├── 372. Super Pow_test.go
│ │ └── README.md
│ ├── 0373.Find-K-Pairs-with-Smallest-Sums/
│ │ ├── 373. Find K Pairs with Smallest Sums.go
│ │ ├── 373. Find K Pairs with Smallest Sums_test.go
│ │ └── README.md
│ ├── 0374.Guess-Number-Higher-or-Lower/
│ │ ├── 374. Guess Number Higher or Lower.go
│ │ ├── 374. Guess Number Higher or Lower_test.go
│ │ └── README.md
│ ├── 0376.Wiggle-Subsequence/
│ │ ├── 376. Wiggle Subsequence.go
│ │ ├── 376. Wiggle Subsequence_test.go
│ │ └── README.md
│ ├── 0377.Combination-Sum-IV/
│ │ ├── 377. Combination Sum IV.go
│ │ ├── 377. Combination Sum IV_test.go
│ │ └── README.md
│ ├── 0378.Kth-Smallest-Element-in-a-Sorted-Matrix/
│ │ ├── 378. Kth Smallest Element in a Sorted Matrix.go
│ │ ├── 378. Kth Smallest Element in a Sorted Matrix_test.go
│ │ └── README.md
│ ├── 0382.Linked-List-Random-Node/
│ │ ├── 382. Linked List Random Node.go
│ │ ├── 382. Linked List Random Node_test.go
│ │ └── README.md
│ ├── 0383.Ransom-Note/
│ │ ├── 383.Ransom Note.go
│ │ ├── 383.Ransom Note_test.go
│ │ └── README.md
│ ├── 0384.Shuffle-an-Array/
│ │ ├── 384.Shuffle an Array.go
│ │ ├── 384.Shuffle an Array_test.go
│ │ └── README.md
│ ├── 0385.Mini-Parser/
│ │ ├── 385. Mini Parser.go
│ │ ├── 385. Mini Parser_test.go
│ │ └── README.md
│ ├── 0386.Lexicographical-Numbers/
│ │ ├── 386. Lexicographical Numbers.go
│ │ ├── 386. Lexicographical Numbers_test.go
│ │ └── README.md
│ ├── 0387.First-Unique-Character-in-a-String/
│ │ ├── 387. First Unique Character in a String.go
│ │ ├── 387. First Unique Character in a String_test.go
│ │ └── README.md
│ ├── 0389.Find-the-Difference/
│ │ ├── 389. Find the Difference.go
│ │ ├── 389. Find the Difference_test.go
│ │ └── README.md
│ ├── 0390.Elimination-Game/
│ │ ├── 390. Elimination Game.go
│ │ ├── 390. Elimination Game_test.go
│ │ └── README.md
│ ├── 0391.Perfect-Rectangle/
│ │ ├── 391.Perfect Rectangle.go
│ │ ├── 391.Perfect Rectangle_test.go
│ │ └── README.md
│ ├── 0392.Is-Subsequence/
│ │ ├── 392. Is Subsequence.go
│ │ ├── 392. Is Subsequence_test.go
│ │ └── README.md
│ ├── 0393.UTF-8-Validation/
│ │ ├── 393. UTF-8 Validation.go
│ │ ├── 393. UTF-8 Validation_test.go
│ │ └── README.md
│ ├── 0394.Decode-String/
│ │ ├── 394. Decode String.go
│ │ ├── 394. Decode String_test.go
│ │ └── README.md
│ ├── 0395.Longest-Substring-with-At-Least-K-Repeating-Characters/
│ │ ├── 395. Longest Substring with At Least K Repeating Characters.go
│ │ ├── 395. Longest Substring with At Least K Repeating Characters_test.go
│ │ └── README.md
│ ├── 0396.Rotate-Function/
│ │ ├── 396. Rotate Function.go
│ │ ├── 396. Rotate Function_test.go
│ │ └── README.md
│ ├── 0397.Integer-Replacement/
│ │ ├── 397. Integer Replacement.go
│ │ ├── 397. Integer Replacement_test.go
│ │ └── README.md
│ ├── 0399.Evaluate-Division/
│ │ ├── 399. Evaluate Division.go
│ │ ├── 399. Evaluate Division_test.go
│ │ └── README.md
│ ├── 0400.Nth-Digit/
│ │ ├── 400.Nth Digit.go
│ │ ├── 400.Nth Digit_test.go
│ │ └── README.md
│ ├── 0401.Binary-Watch/
│ │ ├── 401. Binary Watch.go
│ │ ├── 401. Binary Watch_test.go
│ │ └── README.md
│ ├── 0402.Remove-K-Digits/
│ │ ├── 402. Remove K Digits.go
│ │ ├── 402. Remove K Digits_test.go
│ │ └── README.md
│ ├── 0404.Sum-of-Left-Leaves/
│ │ ├── 404. Sum of Left Leaves.go
│ │ ├── 404. Sum of Left Leaves_test.go
│ │ └── README.md
│ ├── 0405.Convert-a-Number-to-Hexadecimal/
│ │ ├── 405. Convert a Number to Hexadecimal.go
│ │ ├── 405. Convert a Number to Hexadecimal_test.go
│ │ └── README.md
│ ├── 0409.Longest-Palindrome/
│ │ ├── 409. Longest Palindrome.go
│ │ ├── 409. Longest Palindrome_test.go
│ │ └── README.md
│ ├── 0410.Split-Array-Largest-Sum/
│ │ ├── 410. Split Array Largest Sum.go
│ │ ├── 410. Split Array Largest Sum_test.go
│ │ └── README.md
│ ├── 0412.Fizz-Buzz/
│ │ ├── 412. Fizz Buzz.go
│ │ ├── 412. Fizz Buzz_test.go
│ │ └── README.md
│ ├── 0413.Arithmetic-Slices/
│ │ ├── 413. Arithmetic Slices.go
│ │ ├── 413. Arithmetic Slices_test.go
│ │ └── README.md
│ ├── 0414.Third-Maximum-Number/
│ │ ├── 414. Third Maximum Number.go
│ │ ├── 414. Third Maximum Number_test.go
│ │ └── README.md
│ ├── 0416.Partition-Equal-Subset-Sum/
│ │ ├── 416. Partition Equal Subset Sum.go
│ │ ├── 416. Partition Equal Subset Sum_test.go
│ │ └── README.md
│ ├── 0417.Pacific-Atlantic-Water-Flow/
│ │ ├── 417. Pacific Atlantic Water Flow.go
│ │ ├── 417. Pacific Atlantic Water Flow_test.go
│ │ └── README.md
│ ├── 0419.Battleships-in-a-Board/
│ │ ├── 419. Battleships in a Board.go
│ │ ├── 419. Battleships in a Board_test.go
│ │ └── README.md
│ ├── 0421.Maximum-XOR-of-Two-Numbers-in-an-Array/
│ │ ├── 421. Maximum XOR of Two Numbers in an Array.go
│ │ ├── 421. Maximum XOR of Two Numbers in an Array_test.go
│ │ └── README.md
│ ├── 0423.Reconstruct-Original-Digits-from-English/
│ │ ├── 423. Reconstruct Original Digits from English.go
│ │ ├── 423. Reconstruct Original Digits from English_test.go
│ │ └── README.md
│ ├── 0424.Longest-Repeating-Character-Replacement/
│ │ ├── 424. Longest Repeating Character Replacement.go
│ │ ├── 424. Longest Repeating Character Replacement_test.go
│ │ └── README.md
│ ├── 0429.N-ary-Tree-Level-Order-Traversal/
│ │ ├── 429. N-ary Tree Level Order Traversal.go
│ │ ├── 429. N-ary Tree Level Order Traversal_test.go
│ │ └── README.md
│ ├── 0433.Minimum-Genetic-Mutation/
│ │ ├── 433. Minimum Genetic Mutation.go
│ │ ├── 433. Minimum Genetic Mutation_test.go
│ │ └── README.md
│ ├── 0434.Number-of-Segments-in-a-String/
│ │ ├── 434.Number of Segments in a String.go
│ │ ├── 434.Number of Segments in a String_test.go
│ │ └── README.md
│ ├── 0435.Non-overlapping-Intervals/
│ │ ├── 435. Non-overlapping Intervals.go
│ │ ├── 435. Non-overlapping Intervals_test.go
│ │ └── README.md
│ ├── 0436.Find-Right-Interval/
│ │ ├── 436. Find Right Interval.go
│ │ ├── 436. Find Right Interval_test.go
│ │ └── README.md
│ ├── 0437.Path-Sum-III/
│ │ ├── 437. Path Sum III.go
│ │ ├── 437. Path Sum III_test.go
│ │ └── README.md
│ ├── 0438.Find-All-Anagrams-in-a-String/
│ │ ├── 438. Find All Anagrams in a String.go
│ │ ├── 438. Find All Anagrams in a String_test.go
│ │ └── README.md
│ ├── 0441.Arranging-Coins/
│ │ ├── 441. Arranging Coins.go
│ │ ├── 441. Arranging Coins_test.go
│ │ └── README.md
│ ├── 0445.Add-Two-Numbers-II/
│ │ ├── 445. Add Two Numbers II.go
│ │ ├── 445. Add Two Numbers II_test.go
│ │ └── README.md
│ ├── 0447.Number-of-Boomerangs/
│ │ ├── 447. Number of Boomerangs.go
│ │ ├── 447. Number of Boomerangs_test.go
│ │ └── README.md
│ ├── 0448.Find-All-Numbers-Disappeared-in-an-Array/
│ │ ├── 448. Find All Numbers Disappeared in an Array.go
│ │ ├── 448. Find All Numbers Disappeared in an Array_test.go
│ │ └── README.md
│ ├── 0451.Sort-Characters-By-Frequency/
│ │ ├── 451. Sort Characters By Frequency.go
│ │ ├── 451. Sort Characters By Frequency_test.go
│ │ └── README.md
│ ├── 0453.Minimum-Moves-to-Equal-Array-Elements/
│ │ ├── 453. Minimum Moves to Equal Array Elements.go
│ │ ├── 453. Minimum Moves to Equal Array Elements_test.go
│ │ └── README.md
│ ├── 0454.4Sum-II/
│ │ ├── 454. 4Sum II.go
│ │ ├── 454. 4Sum II_test.go
│ │ └── README.md
│ ├── 0455.Assign-Cookies/
│ │ ├── 455. Assign Cookies.go
│ │ ├── 455. Assign Cookies_test.go
│ │ └── README.md
│ ├── 0456.132-Pattern/
│ │ ├── 456. 132 Pattern.go
│ │ ├── 456. 132 Pattern_test.go
│ │ └── README.md
│ ├── 0457.Circular-Array-Loop/
│ │ ├── 457. Circular Array Loop.go
│ │ ├── 457. Circular Array Loop_test.go
│ │ └── README.md
│ ├── 0458.Poor-Pigs/
│ │ ├── 458.Poor Pigs.go
│ │ ├── 458.Poor Pigs_test.go
│ │ └── README.md
│ ├── 0460.LFU-Cache/
│ │ ├── 460. LFU Cache.go
│ │ ├── 460. LFU Cache_test.go
│ │ └── README.md
│ ├── 0461.Hamming-Distance/
│ │ ├── 461. Hamming Distance.go
│ │ ├── 461. Hamming Distance_test.go
│ │ └── README.md
│ ├── 0462.Minimum-Moves-to-Equal-Array-Elements-II/
│ │ ├── 462. Minimum Moves to Equal Array Elements II.go
│ │ ├── 462. Minimum Moves to Equal Array Elements II_test.go
│ │ └── README.md
│ ├── 0463.Island-Perimeter/
│ │ ├── 463. Island Perimeter.go
│ │ ├── 463. Island Perimeter_test.go
│ │ └── README.md
│ ├── 0470.Implement-Rand10-Using-Rand7/
│ │ ├── 470. Implement Rand10() Using Rand7().go
│ │ ├── 470. Implement Rand10() Using Rand7()_test.go
│ │ └── README.md
│ ├── 0473.Matchsticks-to-Square/
│ │ ├── 473. Matchsticks to Square.go
│ │ ├── 473. Matchsticks to Square_test.go
│ │ └── README.md
│ ├── 0474.Ones-and-Zeroes/
│ │ ├── 474. Ones and Zeroes.go
│ │ ├── 474. Ones and Zeroes_test.go
│ │ └── README.md
│ ├── 0475.Heaters/
│ │ ├── 475. Heaters.go
│ │ ├── 475. Heaters_test.go
│ │ └── README.md
│ ├── 0476.Number-Complement/
│ │ ├── 476. Number Complement.go
│ │ ├── 476. Number Complement_test.go
│ │ └── README.md
│ ├── 0477.Total-Hamming-Distance/
│ │ ├── 477. Total Hamming Distance.go
│ │ ├── 477. Total Hamming Distance_test.go
│ │ └── README.md
│ ├── 0478.Generate-Random-Point-in-a-Circle/
│ │ ├── 478. Generate Random Point in a Circle.go
│ │ ├── 478. Generate Random Point in a Circle_test.go
│ │ └── README.md
│ ├── 0480.Sliding-Window-Median/
│ │ ├── 480. Sliding Window Median.go
│ │ ├── 480. Sliding Window Median_test.go
│ │ └── README.md
│ ├── 0483.Smallest-Good-Base/
│ │ ├── 483. Smallest Good Base.go
│ │ ├── 483. Smallest Good Base_test.go
│ │ └── README.md
│ ├── 0485.Max-Consecutive-Ones/
│ │ ├── 485. Max Consecutive Ones.go
│ │ ├── 485. Max Consecutive Ones_test.go
│ │ └── README.md
│ ├── 0488.Zuma-Game/
│ │ ├── 488.Zuma Game.go
│ │ ├── 488.Zuma Game_test.go
│ │ └── README.md
│ ├── 0491.Non-decreasing-Subsequences/
│ │ ├── 491. Non-decreasing Subsequences.go
│ │ ├── 491. Non-decreasing Subsequences_test.go
│ │ └── README.md
│ ├── 0492.Construct-the-Rectangle/
│ │ ├── 492.Construct the Rectangle.go
│ │ ├── 492.Construct the Rectangle_test.go
│ │ └── README.md
│ ├── 0493.Reverse-Pairs/
│ │ ├── 493. Reverse Pairs.go
│ │ ├── 493. Reverse Pairs_test.go
│ │ └── README.md
│ ├── 0494.Target-Sum/
│ │ ├── 494. Target Sum.go
│ │ ├── 494. Target Sum_test.go
│ │ └── README.md
│ ├── 0495.Teemo-Attacking/
│ │ ├── 495.Teemo Attacking.go
│ │ ├── 495.Teemo Attacking_test.go
│ │ └── README.md
│ ├── 0496.Next-Greater-Element-I/
│ │ ├── 496. Next Greater Element I.go
│ │ ├── 496. Next Greater Element I_test.go
│ │ └── README.md
│ ├── 0497.Random-Point-in-Non-overlapping-Rectangles/
│ │ ├── 497. Random Point in Non-overlapping Rectangles.go
│ │ ├── 497. Random Point in Non-overlapping Rectangles_test.go
│ │ └── README.md
│ ├── 0498.Diagonal-Traverse/
│ │ ├── 498. Diagonal Traverse.go
│ │ ├── 498. Diagonal Traverse_test.go
│ │ └── README.md
│ ├── 0500.Keyboard-Row/
│ │ ├── 500. Keyboard Row.go
│ │ ├── 500. Keyboard Row_test.go
│ │ └── README.md
│ ├── 0503.Next-Greater-Element-II/
│ │ ├── 503. Next Greater Element II.go
│ │ ├── 503. Next Greater Element II_test.go
│ │ └── README.md
│ ├── 0504.Base-7/
│ │ ├── 504.Base 7.go
│ │ ├── 504.Base 7_test.go
│ │ └── README.md
│ ├── 0506.Relative-Ranks/
│ │ ├── 506.Relative Ranks.go
│ │ ├── 506.Relative Ranks_test.go
│ │ └── README.md
│ ├── 0507.Perfect-Number/
│ │ ├── 507. Perfect Number.go
│ │ ├── 507. Perfect Number_test.go
│ │ └── README.md
│ ├── 0508.Most-Frequent-Subtree-Sum/
│ │ ├── 508. Most Frequent Subtree Sum.go
│ │ ├── 508. Most Frequent Subtree Sum_test.go
│ │ └── README.md
│ ├── 0509.Fibonacci-Number/
│ │ ├── 509. Fibonacci Number.go
│ │ ├── 509. Fibonacci Number_test.go
│ │ └── README.md
│ ├── 0513.Find-Bottom-Left-Tree-Value/
│ │ ├── 513. Find Bottom Left Tree Value.go
│ │ ├── 513. Find Bottom Left Tree Value_test.go
│ │ └── README.md
│ ├── 0515.Find-Largest-Value-in-Each-Tree-Row/
│ │ ├── 515. Find Largest Value in Each Tree Row.go
│ │ ├── 515. Find Largest Value in Each Tree Row_test.go
│ │ └── README.md
│ ├── 0518.Coin-Change-II/
│ │ ├── 518. Coin Change II.go
│ │ ├── 518. Coin Change II_test.go
│ │ └── README.md
│ ├── 0519.Random-Flip-Matrix/
│ │ ├── 519.Random Flip Matrix.go
│ │ ├── 519.Random Flip Matrix_test.go
│ │ └── README.md
│ ├── 0520.Detect-Capital/
│ │ ├── 520.Detect Capital.go
│ │ ├── 520.Detect Capital_test.go
│ │ └── README.md
│ ├── 0523.Continuous-Subarray-Sum/
│ │ ├── 523. Continuous Subarray Sum.go
│ │ ├── 523. Continuous Subarray Sum_test.go
│ │ └── README.md
│ ├── 0524.Longest-Word-in-Dictionary-through-Deleting/
│ │ ├── 524. Longest Word in Dictionary through Deleting.go
│ │ ├── 524. Longest Word in Dictionary through Deleting_test.go
│ │ └── README.md
│ ├── 0525.Contiguous-Array/
│ │ ├── 525. Contiguous Array.go
│ │ ├── 525. Contiguous Array_test.go
│ │ └── README.md
│ ├── 0526.Beautiful-Arrangement/
│ │ ├── 526. Beautiful Arrangement.go
│ │ ├── 526. Beautiful Arrangement_test.go
│ │ └── README.md
│ ├── 0528.Random-Pick-with-Weight/
│ │ ├── 528. Random Pick with Weight.go
│ │ ├── 528. Random Pick with Weight_test.go
│ │ └── README.md
│ ├── 0529.Minesweeper/
│ │ ├── 529. Minesweeper.go
│ │ ├── 529. Minesweeper_test.go
│ │ └── README.md
│ ├── 0530.Minimum-Absolute-Difference-in-BST/
│ │ ├── 530. Minimum Absolute Difference in BST.go
│ │ ├── 530. Minimum Absolute Difference in BST_test.go
│ │ └── README.md
│ ├── 0532.K-diff-Pairs-in-an-Array/
│ │ ├── 532. K-diff Pairs in an Array.go
│ │ ├── 532. K-diff Pairs in an Array_test.go
│ │ └── README.md
│ ├── 0535.Encode-and-Decode-TinyURL/
│ │ ├── 535. Encode and Decode TinyURL.go
│ │ ├── 535. Encode and Decode TinyURL_test.go
│ │ └── README.md
│ ├── 0537.Complex-Number-Multiplication/
│ │ ├── 537. Complex Number Multiplication.go
│ │ ├── 537. Complex Number Multiplication_test.go
│ │ └── README.md
│ ├── 0538.Convert-BST-to-Greater-Tree/
│ │ ├── 538. Convert BST to Greater Tree.go
│ │ ├── 538. Convert BST to Greater Tree_test.go
│ │ └── README.md
│ ├── 0540.Single-Element-in-a-Sorted-Array/
│ │ ├── 540.Single Element in a Sorted Array.go
│ │ ├── 540.Single Element in a Sorted Array_test.go
│ │ └── README.md
│ ├── 0541.Reverse-String-II/
│ │ ├── 541. Reverse String II.go
│ │ ├── 541. Reverse String II_test.go
│ │ └── README.md
│ ├── 0542.01-Matrix/
│ │ ├── 542. 01 Matrix.go
│ │ ├── 542. 01 Matrix_test.go
│ │ └── README.md
│ ├── 0543.Diameter-of-Binary-Tree/
│ │ ├── 543. Diameter of Binary Tree.go
│ │ ├── 543. Diameter of Binary Tree_test.go
│ │ └── README.md
│ ├── 0547.Number-of-Provinces/
│ │ ├── 547. Number of Provinces.go
│ │ ├── 547. Number of Provinces_test.go
│ │ └── README.md
│ ├── 0551.Student-Attendance-Record-I/
│ │ ├── 551.Student Attendance Record I.go
│ │ ├── 551.Student Attendance Record I_test.go
│ │ └── README.md
│ ├── 0554.Brick-Wall/
│ │ ├── 554. Brick Wall.go
│ │ ├── 554. Brick Wall_test.go
│ │ └── README.md
│ ├── 0557.Reverse-Words-in-a-String-III/
│ │ ├── 557. Reverse Words in a String III.go
│ │ ├── 557. Reverse Words in a String III_test.go
│ │ └── README.md
│ ├── 0559.Maximum-Depth-of-N-ary-Tree/
│ │ ├── 559.Maximum Depth of N-ary Tree.go
│ │ ├── 559.Maximum Depth of N-ary Tree_test.go
│ │ └── README.md
│ ├── 0560.Subarray-Sum-Equals-K/
│ │ ├── 560. Subarray Sum Equals K.go
│ │ ├── 560. Subarray Sum Equals K_test.go
│ │ └── README.md
│ ├── 0561.Array-Partition/
│ │ ├── 561. Array Partition.go
│ │ ├── 561. Array Partition_test.go
│ │ └── README.md
│ ├── 0563.Binary-Tree-Tilt/
│ │ ├── 563. Binary Tree Tilt.go
│ │ ├── 563. Binary Tree Tilt_test.go
│ │ └── README.md
│ ├── 0566.Reshape-the-Matrix/
│ │ ├── 566. Reshape the Matrix.go
│ │ ├── 566. Reshape the Matrix_test.go
│ │ └── README.md
│ ├── 0567.Permutation-in-String/
│ │ ├── 567. Permutation in String.go
│ │ ├── 567. Permutation in String_test.go
│ │ └── README.md
│ ├── 0572.Subtree-of-Another-Tree/
│ │ ├── 572. Subtree of Another Tree.go
│ │ ├── 572. Subtree of Another Tree_test.go
│ │ └── README.md
│ ├── 0575.Distribute-Candies/
│ │ ├── 575. Distribute Candies.go
│ │ ├── 575. Distribute Candies_test.go
│ │ └── README.md
│ ├── 0576.Out-of-Boundary-Paths/
│ │ ├── 576. Out of Boundary Paths.go
│ │ ├── 576. Out of Boundary Paths_test.go
│ │ └── README.md
│ ├── 0581.Shortest-Unsorted-Continuous-Subarray/
│ │ ├── 581. Shortest Unsorted Continuous Subarray.go
│ │ ├── 581. Shortest Unsorted Continuous Subarray_test.go
│ │ └── README.md
│ ├── 0583.Delete-Operation-for-Two-Strings/
│ │ ├── 583. Delete Operation for Two Strings.go
│ │ ├── 583. Delete Operation for Two Strings_test.go
│ │ └── README.md
│ ├── 0589.N-ary-Tree-Preorder-Traversal/
│ │ ├── 589. N-ary Tree Preorder Traversal.go
│ │ ├── 589. N-ary Tree Preorder Traversal_test.go
│ │ └── README.md
│ ├── 0594.Longest-Harmonious-Subsequence/
│ │ ├── 594. Longest Harmonious Subsequence.go
│ │ ├── 594. Longest Harmonious Subsequence_test.go
│ │ └── README.md
│ ├── 0598.Range-Addition-II/
│ │ ├── 598. Range Addition II.go
│ │ ├── 598. Range Addition II_test.go
│ │ └── README.md
│ ├── 0599.Minimum-Index-Sum-of-Two-Lists/
│ │ ├── 599. Minimum Index Sum of Two Lists.go
│ │ ├── 599. Minimum Index Sum of Two Lists_test.go
│ │ └── README.md
│ ├── 0605.Can-Place-Flowers/
│ │ ├── 605. Can Place Flowers.go
│ │ ├── 605. Can Place Flowers_test.go
│ │ └── README.md
│ ├── 0609.Find-Duplicate-File-in-System/
│ │ ├── 609. Find Duplicate File in System.go
│ │ ├── 609. Find Duplicate File in System_test.go
│ │ └── README.md
│ ├── 0611.Valid-Triangle-Number/
│ │ ├── 611. Valid Triangle Number.go
│ │ ├── 611. Valid Triangle Number_test.go
│ │ └── README.md
│ ├── 0617.Merge-Two-Binary-Trees/
│ │ ├── 617. Merge Two Binary Trees.go
│ │ ├── 617. Merge Two Binary Trees_test.go
│ │ └── README.md
│ ├── 0622.Design-Circular-Queue/
│ │ ├── 622. Design Circular Queue.go
│ │ ├── 622. Design Circular Queue_test.go
│ │ └── README.md
│ ├── 0623.Add-One-Row-to-Tree/
│ │ ├── 623. Add One Row to Tree.go
│ │ ├── 623. Add One Row to Tree_test.go
│ │ └── README.md
│ ├── 0628.Maximum-Product-of-Three-Numbers/
│ │ ├── 628. Maximum Product of Three Numbers.go
│ │ ├── 628. Maximum Product of Three Numbers_test.go
│ │ └── README.md
│ ├── 0630.Course-Schedule-III/
│ │ ├── 630. Course Schedule III.go
│ │ ├── 630. Course Schedule III_test.go
│ │ └── README.md
│ ├── 0632.Smallest-Range-Covering-Elements-from-K-Lists/
│ │ ├── 632. Smallest Range Covering Elements from K Lists.go
│ │ ├── 632. Smallest Range Covering Elements from K Lists_test.go
│ │ └── README.md
│ ├── 0633.Sum-of-Square-Numbers/
│ │ ├── 633. Sum of Square Numbers.go
│ │ ├── 633. Sum of Square Numbers_test.go
│ │ └── README.md
│ ├── 0636.Exclusive-Time-of-Functions/
│ │ ├── 636. Exclusive Time of Functions.go
│ │ ├── 636. Exclusive Time of Functions_test.go
│ │ └── README.md
│ ├── 0637.Average-of-Levels-in-Binary-Tree/
│ │ ├── 637. Average of Levels in Binary Tree.go
│ │ ├── 637. Average of Levels in Binary Tree_test.go
│ │ └── README.md
│ ├── 0638.Shopping-Offers/
│ │ ├── 638. Shopping Offers.go
│ │ ├── 638. Shopping Offers_test.go
│ │ └── README.md
│ ├── 0643.Maximum-Average-Subarray-I/
│ │ ├── 643. Maximum Average Subarray I.go
│ │ ├── 643. Maximum Average Subarray I_test.go
│ │ └── README.md
│ ├── 0645.Set-Mismatch/
│ │ ├── 645. Set Mismatch.go
│ │ ├── 645. Set Mismatch_test.go
│ │ └── README.md
│ ├── 0647.Palindromic-Substrings/
│ │ ├── 647. Palindromic Substrings.go
│ │ ├── 647. Palindromic Substrings_test.go
│ │ └── README.md
│ ├── 0648.Replace-Words/
│ │ ├── 648. Replace Words.go
│ │ ├── 648. Replace Words_test.go
│ │ └── README.md
│ ├── 0653.Two-Sum-IV-Input-is-a-BST/
│ │ ├── 653. Two Sum IV - Input is a BST.go
│ │ ├── 653. Two Sum IV - Input is a BST_test.go
│ │ └── README.md
│ ├── 0658.Find-K-Closest-Elements/
│ │ ├── 658. Find K Closest Elements.go
│ │ ├── 658. Find K Closest Elements_test.go
│ │ └── README.md
│ ├── 0661.Image-Smoother/
│ │ ├── 661. Image Smoother.go
│ │ ├── 661. Image Smoother_test.go
│ │ └── README.md
│ ├── 0662.Maximum-Width-of-Binary-Tree/
│ │ ├── 662. Maximum Width of Binary Tree.go
│ │ ├── 662. Maximum Width of Binary Tree_test.go
│ │ └── README.md
│ ├── 0665.Non-decreasing-Array/
│ │ ├── 665. Non-decreasing Array.go
│ │ ├── 665. Non-decreasing Array_test.go
│ │ └── README.md
│ ├── 0667.Beautiful-Arrangement-II/
│ │ ├── 667. Beautiful Arrangement II.go
│ │ ├── 667. Beautiful Arrangement II_test.go
│ │ └── README.md
│ ├── 0668.Kth-Smallest-Number-in-Multiplication-Table/
│ │ ├── 668. Kth Smallest Number in Multiplication Table.go
│ │ ├── 668. Kth Smallest Number in Multiplication Table_test.go
│ │ └── README.md
│ ├── 0669.Trim-a-Binary-Search-Tree/
│ │ ├── 669. Trim a Binary Search Tree.go
│ │ ├── 669. Trim a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0674.Longest-Continuous-Increasing-Subsequence/
│ │ ├── 674. Longest Continuous Increasing Subsequence.go
│ │ ├── 674. Longest Continuous Increasing Subsequence_test.go
│ │ └── README.md
│ ├── 0676.Implement-Magic-Dictionary/
│ │ ├── 676. Implement Magic Dictionary.go
│ │ ├── 676. Implement Magic Dictionary_test.go
│ │ └── README.md
│ ├── 0677.Map-Sum-Pairs/
│ │ ├── 677. Map Sum Pairs.go
│ │ ├── 677. Map Sum Pairs_test.go
│ │ └── README.md
│ ├── 0682.Baseball-Game/
│ │ ├── 682. Baseball Game.go
│ │ ├── 682. Baseball Game_test.go
│ │ └── README.md
│ ├── 0684.Redundant-Connection/
│ │ ├── 684. Redundant Connection.go
│ │ ├── 684. Redundant Connection_test.go
│ │ └── README.md
│ ├── 0685.Redundant-Connection-II/
│ │ ├── 685. Redundant Connection II.go
│ │ ├── 685. Redundant Connection II_test.go
│ │ └── README.md
│ ├── 0690.Employee-Importance/
│ │ ├── 690. Employee Importance.go
│ │ ├── 690. Employee Importance_test.go
│ │ └── README.md
│ ├── 0692.Top-K-Frequent-Words/
│ │ ├── 692. Top K Frequent Words.go
│ │ ├── 692. Top K Frequent Words_test.go
│ │ └── README.md
│ ├── 0693.Binary-Number-with-Alternating-Bits/
│ │ ├── 693. Binary Number with Alternating Bits.go
│ │ ├── 693. Binary Number with Alternating Bits_test.go
│ │ └── README.md
│ ├── 0695.Max-Area-of-Island/
│ │ ├── 695. Max Area of Island.go
│ │ ├── 695. Max Area of Island_test.go
│ │ └── README.md
│ ├── 0696.Count-Binary-Substrings/
│ │ ├── 696. Count Binary Substrings.go
│ │ ├── 696. Count Binary Substrings_test.go
│ │ └── README.md
│ ├── 0697.Degree-of-an-Array/
│ │ ├── 697. Degree of an Array.go
│ │ ├── 697. Degree of an Array_test.go
│ │ └── README.md
│ ├── 0699.Falling-Squares/
│ │ ├── 699. Falling Squares.go
│ │ ├── 699. Falling Squares_test.go
│ │ └── README.md
│ ├── 0700.Search-in-a-Binary-Search-Tree/
│ │ ├── 700.Search in a Binary Search Tree.go
│ │ ├── 700.Search in a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0701.Insert-into-a-Binary-Search-Tree/
│ │ ├── 701. Insert into a Binary Search Tree.go
│ │ ├── 701. Insert into a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0703.Kth-Largest-Element-in-a-Stream/
│ │ ├── 703. Kth Largest Element in a Stream.go
│ │ ├── 703. Kth Largest Element in a Stream_test.go
│ │ └── README.md
│ ├── 0704.Binary-Search/
│ │ ├── 704. Binary Search.go
│ │ ├── 704. Binary Search_test.go
│ │ └── README.md
│ ├── 0705.Design-HashSet/
│ │ ├── 705. Design HashSet.go
│ │ ├── 705. Design HashSet_test.go
│ │ └── README.md
│ ├── 0706.Design-HashMap/
│ │ ├── 706. Design HashMap.go
│ │ ├── 706. Design HashMap_test.go
│ │ └── README.md
│ ├── 0707.Design-Linked-List/
│ │ ├── 707. Design Linked List.go
│ │ ├── 707. Design Linked List_test.go
│ │ └── README.md
│ ├── 0709.To-Lower-Case/
│ │ ├── 709. To Lower Case.go
│ │ ├── 709. To Lower Case_test.go
│ │ └── README.md
│ ├── 0710.Random-Pick-with-Blacklist/
│ │ ├── 710. Random Pick with Blacklist.go
│ │ ├── 710. Random Pick with Blacklist_test.go
│ │ └── README.md
│ ├── 0713.Subarray-Product-Less-Than-K/
│ │ ├── 713. Subarray Product Less Than K.go
│ │ ├── 713. Subarray Product Less Than K_test.go
│ │ └── README.md
│ ├── 0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/
│ │ ├── 714. Best Time to Buy and Sell Stock with Transaction Fee.go
│ │ ├── 714. Best Time to Buy and Sell Stock with Transaction Fee_test.go
│ │ └── README.md
│ ├── 0715.Range-Module/
│ │ ├── 715. Range Module.go
│ │ ├── 715. Range Module_test.go
│ │ └── README.md
│ ├── 0717.1-bit-and-2-bit-Characters/
│ │ ├── 717. 1-bit and 2-bit Characters.go
│ │ ├── 717. 1-bit and 2-bit Characters_test.go
│ │ └── README.md
│ ├── 0718.Maximum-Length-of-Repeated-Subarray/
│ │ ├── 718. Maximum Length of Repeated Subarray.go
│ │ ├── 718. Maximum Length of Repeated Subarray_test.go
│ │ └── README.md
│ ├── 0719.Find-K-th-Smallest-Pair-Distance/
│ │ ├── 719. Find K-th Smallest Pair Distance.go
│ │ ├── 719. Find K-th Smallest Pair Distance_test.go
│ │ └── README.md
│ ├── 0720.Longest-Word-in-Dictionary/
│ │ ├── 720. Longest Word in Dictionary.go
│ │ ├── 720. Longest Word in Dictionary_test.go
│ │ └── README.md
│ ├── 0721.Accounts-Merge/
│ │ ├── 721. Accounts Merge.go
│ │ ├── 721. Accounts Merge_test.go
│ │ └── README.md
│ ├── 0724.Find-Pivot-Index/
│ │ ├── 724. Find Pivot Index.go
│ │ ├── 724. Find Pivot Index_test.go
│ │ └── README.md
│ ├── 0725.Split-Linked-List-in-Parts/
│ │ ├── 725. Split Linked List in Parts.go
│ │ ├── 725. Split Linked List in Parts_test.go
│ │ └── README.md
│ ├── 0726.Number-of-Atoms/
│ │ ├── 726. Number of Atoms.go
│ │ ├── 726. Number of Atoms_test.go
│ │ └── README.md
│ ├── 0728.Self-Dividing-Numbers/
│ │ ├── 728.Self Dividing Numbers.go
│ │ ├── 728.Self Dividing Numbers_test.go
│ │ └── README.md
│ ├── 0729.My-Calendar-I/
│ │ ├── 729. My Calendar I.go
│ │ ├── 729. My Calendar I_test.go
│ │ └── README.md
│ ├── 0732.My-Calendar-III/
│ │ ├── 732. My Calendar III.go
│ │ ├── 732. My Calendar III_test.go
│ │ └── README.md
│ ├── 0733.Flood-Fill/
│ │ ├── 733. Flood Fill.go
│ │ ├── 733. Flood Fill_test.go
│ │ └── README.md
│ ├── 0735.Asteroid-Collision/
│ │ ├── 735. Asteroid Collision.go
│ │ ├── 735. Asteroid Collision_test.go
│ │ └── README.md
│ ├── 0739.Daily-Temperatures/
│ │ ├── 739. Daily Temperatures.go
│ │ ├── 739. Daily Temperatures_test.go
│ │ └── README.md
│ ├── 0744.Find-Smallest-Letter-Greater-Than-Target/
│ │ ├── 744. Find Smallest Letter Greater Than Target.go
│ │ ├── 744. Find Smallest Letter Greater Than Target_test.go
│ │ └── README.md
│ ├── 0745.Prefix-and-Suffix-Search/
│ │ ├── 745. Prefix and Suffix Search.go
│ │ ├── 745. Prefix and Suffix Search_test.go
│ │ └── README.md
│ ├── 0746.Min-Cost-Climbing-Stairs/
│ │ ├── 746. Min Cost Climbing Stairs.go
│ │ ├── 746. Min Cost Climbing Stairs_test.go
│ │ └── README.md
│ ├── 0747.Largest-Number-At-Least-Twice-of-Others/
│ │ ├── 747. Largest Number At Least Twice of Others.go
│ │ ├── 747. Largest Number At Least Twice of Others_test.go
│ │ └── README.md
│ ├── 0748.Shortest-Completing-Word/
│ │ ├── 748. Shortest Completing Word.go
│ │ ├── 748. Shortest Completing Word_test.go
│ │ └── README.md
│ ├── 0752.Open-the-Lock/
│ │ ├── 752. Open the Lock.go
│ │ ├── 752. Open the Lock_test.go
│ │ └── README.md
│ ├── 0753.Cracking-the-Safe/
│ │ ├── 753. Cracking the Safe.go
│ │ ├── 753. Cracking the Safe_test.go
│ │ └── README.md
│ ├── 0756.Pyramid-Transition-Matrix/
│ │ ├── 756. Pyramid Transition Matrix.go
│ │ ├── 756. Pyramid Transition Matrix_test.go
│ │ └── README.md
│ ├── 0762.Prime-Number-of-Set-Bits-in-Binary-Representation/
│ │ ├── 762. Prime Number of Set Bits in Binary Representation.go
│ │ ├── 762. Prime Number of Set Bits in Binary Representation_test.go
│ │ └── README.md
│ ├── 0763.Partition-Labels/
│ │ ├── 763. Partition Labels.go
│ │ ├── 763. Partition Labels_test.go
│ │ └── README.md
│ ├── 0765.Couples-Holding-Hands/
│ │ ├── 765. Couples Holding Hands.go
│ │ ├── 765. Couples Holding Hands_test.go
│ │ └── README.md
│ ├── 0766.Toeplitz-Matrix/
│ │ ├── 766. Toeplitz Matrix.go
│ │ ├── 766. Toeplitz Matrix_test.go
│ │ └── README.md
│ ├── 0767.Reorganize-String/
│ │ ├── 767. Reorganize String.go
│ │ ├── 767. Reorganize String_test.go
│ │ └── README.md
│ ├── 0771.Jewels-and-Stones/
│ │ ├── 771. Jewels and Stones.go
│ │ ├── 771. Jewels and Stones_test.go
│ │ └── README.md
│ ├── 0775.Global-and-Local-Inversions/
│ │ ├── 775. Global and Local Inversions.go
│ │ ├── 775. Global and Local Inversions_test.go
│ │ └── README.md
│ ├── 0778.Swim-in-Rising-Water/
│ │ ├── 778. Swim in Rising Water.go
│ │ ├── 778. Swim in Rising Water_test.go
│ │ └── README.md
│ ├── 0781.Rabbits-in-Forest/
│ │ ├── 781. Rabbits in Forest.go
│ │ ├── 781. Rabbits in Forest_test.go
│ │ └── README.md
│ ├── 0783.Minimum-Distance-Between-BST-Nodes/
│ │ ├── 783. Minimum Distance Between BST Nodes.go
│ │ ├── 783. Minimum Distance Between BST Nodes_test.go
│ │ └── README.md
│ ├── 0784.Letter-Case-Permutation/
│ │ ├── 784. Letter Case Permutation.go
│ │ ├── 784. Letter Case Permutation_test.go
│ │ └── README.md
│ ├── 0785.Is-Graph-Bipartite/
│ │ ├── 785. Is Graph Bipartite.go
│ │ ├── 785. Is Graph Bipartite_test.go
│ │ └── README.md
│ ├── 0786.K-th-Smallest-Prime-Fraction/
│ │ ├── 786. K-th Smallest Prime Fraction.go
│ │ ├── 786. K-th Smallest Prime Fraction_test.go
│ │ └── README.md
│ ├── 0791.Custom-Sort-String/
│ │ ├── 791. Custom Sort String.go
│ │ ├── 791. Custom Sort String_test.go
│ │ └── README.md
│ ├── 0792.Number-of-Matching-Subsequences/
│ │ ├── 792. Number of Matching Subsequences.go
│ │ ├── 792. Number of Matching Subsequences_test.go
│ │ └── README.md
│ ├── 0793.Preimage-Size-of-Factorial-Zeroes-Function/
│ │ ├── 793. Preimage Size of Factorial Zeroes Function.go
│ │ ├── 793. Preimage Size of Factorial Zeroes Function_test.go
│ │ └── README.md
│ ├── 0794.Valid-Tic-Tac-Toe-State/
│ │ ├── 794.Valid Tic-Tac-Toe State.go
│ │ ├── 794.Valid Tic-Tac-Toe State_test.go
│ │ └── README.md
│ ├── 0795.Number-of-Subarrays-with-Bounded-Maximum/
│ │ ├── 795. Number of Subarrays with Bounded Maximum.go
│ │ ├── 795. Number of Subarrays with Bounded Maximum_test.go
│ │ └── README.md
│ ├── 0802.Find-Eventual-Safe-States/
│ │ ├── 802. Find Eventual Safe States.go
│ │ ├── 802. Find Eventual Safe States_test.go
│ │ └── README.md
│ ├── 0803.Bricks-Falling-When-Hit/
│ │ ├── 803. Bricks Falling When Hit.go
│ │ ├── 803. Bricks Falling When Hit_test.go
│ │ └── README.md
│ ├── 0807.Max-Increase-to-Keep-City-Skyline/
│ │ ├── 807.Max Increase to Keep City Skyline.go
│ │ ├── 807.Max Increase to Keep City Skyline_test.go
│ │ └── README.md
│ ├── 0810.Chalkboard-XOR-Game/
│ │ ├── 810. Chalkboard XOR Game.go
│ │ ├── 810. Chalkboard XOR Game_test.go
│ │ └── README.md
│ ├── 0811.Subdomain-Visit-Count/
│ │ ├── 811. Subdomain Visit Count.go
│ │ ├── 811. Subdomain Visit Count_test.go
│ │ └── README.md
│ ├── 0812.Largest-Triangle-Area/
│ │ ├── 812. Largest Triangle Area.go
│ │ ├── 812. Largest Triangle Area_test.go
│ │ └── README.md
│ ├── 0815.Bus-Routes/
│ │ ├── 815. Bus Routes.go
│ │ ├── 815. Bus Routes_test.go
│ │ └── README.md
│ ├── 0816.Ambiguous-Coordinates/
│ │ ├── 816. Ambiguous Coordinates.go
│ │ ├── 816. Ambiguous Coordinates_test.go
│ │ └── README.md
│ ├── 0817.Linked-List-Components/
│ │ ├── 817. Linked List Components.go
│ │ ├── 817. Linked List Components_test.go
│ │ └── README.md
│ ├── 0819.Most-Common-Word/
│ │ ├── 819. Most Common Word.go
│ │ ├── 819. Most Common Word_test.go
│ │ └── README.md
│ ├── 0820.Short-Encoding-of-Words/
│ │ ├── 820. Short Encoding of Words.go
│ │ ├── 820. Short Encoding of Words_test.go
│ │ └── README.md
│ ├── 0821.Shortest-Distance-to-a-Character/
│ │ ├── 821. Shortest Distance to a Character.go
│ │ ├── 821. Shortest Distance to a Character_test.go
│ │ └── README.md
│ ├── 0823.Binary-Trees-With-Factors/
│ │ ├── 823. Binary Trees With Factors.go
│ │ ├── 823. Binary Trees With Factors_test.go
│ │ └── README.md
│ ├── 0825.Friends-Of-Appropriate-Ages/
│ │ ├── 825. Friends Of Appropriate Ages.go
│ │ ├── 825. Friends Of Appropriate Ages_test.go
│ │ └── README.md
│ ├── 0826.Most-Profit-Assigning-Work/
│ │ ├── 826. Most Profit Assigning Work.go
│ │ ├── 826. Most Profit Assigning Work_test.go
│ │ └── README.md
│ ├── 0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/
│ │ ├── 828. Count Unique Characters of All Substrings of a Given String.go
│ │ ├── 828. Count Unique Characters of All Substrings of a Given String_test.go
│ │ └── README.md
│ ├── 0830.Positions-of-Large-Groups/
│ │ ├── 830. Positions of Large Groups.go
│ │ ├── 830. Positions of Large Groups_test.go
│ │ └── README.md
│ ├── 0832.Flipping-an-Image/
│ │ ├── 832. Flipping an Image.go
│ │ ├── 832. Flipping an Image_test.go
│ │ └── README.md
│ ├── 0834.Sum-of-Distances-in-Tree/
│ │ ├── 834. Sum of Distances in Tree.go
│ │ ├── 834. Sum of Distances in Tree_test.go
│ │ └── README.md
│ ├── 0836.Rectangle-Overlap/
│ │ ├── 836. Rectangle Overlap.go
│ │ ├── 836. Rectangle Overlap_test.go
│ │ └── README.md
│ ├── 0838.Push-Dominoes/
│ │ ├── 838. Push Dominoes.go
│ │ ├── 838. Push Dominoes_test.go
│ │ └── README.md
│ ├── 0839.Similar-String-Groups/
│ │ ├── 839. Similar String Groups.go
│ │ ├── 839. Similar String Groups_test.go
│ │ └── README.md
│ ├── 0841.Keys-and-Rooms/
│ │ ├── 841. Keys and Rooms.go
│ │ ├── 841. Keys and Rooms_test.go
│ │ └── README.md
│ ├── 0842.Split-Array-into-Fibonacci-Sequence/
│ │ ├── 842. Split Array into Fibonacci Sequence.go
│ │ ├── 842. Split Array into Fibonacci Sequence_test.go
│ │ └── README.md
│ ├── 0844.Backspace-String-Compare/
│ │ ├── 844. Backspace String Compare.go
│ │ ├── 844. Backspace String Compare_test.go
│ │ └── README.md
│ ├── 0845.Longest-Mountain-in-Array/
│ │ ├── 845. Longest Mountain in Array.go
│ │ ├── 845. Longest Mountain in Array_test.go
│ │ └── README.md
│ ├── 0846.Hand-of-Straights/
│ │ ├── 846.Hand of Straights.go
│ │ ├── 846.Hand of Straights_test.go
│ │ └── README.md
│ ├── 0850.Rectangle-Area-II/
│ │ ├── 850. Rectangle Area II.go
│ │ ├── 850. Rectangle Area II_test.go
│ │ └── README.md
│ ├── 0851.Loud-and-Rich/
│ │ ├── 851. Loud and Rich.go
│ │ ├── 851. Loud and Rich_test.go
│ │ └── README.md
│ ├── 0852.Peak-Index-in-a-Mountain-Array/
│ │ ├── 852. Peak Index in a Mountain Array.go
│ │ ├── 852. Peak Index in a Mountain Array_test.go
│ │ └── README.md
│ ├── 0853.Car-Fleet/
│ │ ├── 853. Car Fleet.go
│ │ ├── 853. Car Fleet_test.go
│ │ └── README.md
│ ├── 0856.Score-of-Parentheses/
│ │ ├── 856. Score of Parentheses.go
│ │ ├── 856. Score of Parentheses_test.go
│ │ └── README.md
│ ├── 0859.Buddy-Strings/
│ │ ├── 859.Buddy Strings.go
│ │ ├── 859.Buddy Strings_test.go
│ │ └── README.md
│ ├── 0862.Shortest-Subarray-with-Sum-at-Least-K/
│ │ ├── 862. Shortest Subarray with Sum at Least K.go
│ │ ├── 862. Shortest Subarray with Sum at Least K_test.go
│ │ └── README.md
│ ├── 0863.All-Nodes-Distance-K-in-Binary-Tree/
│ │ ├── 863. All Nodes Distance K in Binary Tree.go
│ │ ├── 863. All Nodes Distance K in Binary Tree_test.go
│ │ └── README.md
│ ├── 0864.Shortest-Path-to-Get-All-Keys/
│ │ ├── 864. Shortest Path to Get All Keys.go
│ │ ├── 864. Shortest Path to Get All Keys_test.go
│ │ └── README.md
│ ├── 0867.Transpose-Matrix/
│ │ ├── 867. Transpose Matrix.go
│ │ ├── 867. Transpose Matrix_test.go
│ │ └── README.md
│ ├── 0869.Reordered-Power-of-2/
│ │ ├── 869. Reordered Power of 2.go
│ │ ├── 869. Reordered Power of 2_test.go
│ │ └── README.md
│ ├── 0870.Advantage-Shuffle/
│ │ ├── 870. Advantage Shuffle.go
│ │ ├── 870. Advantage Shuffle_test.go
│ │ └── README.md
│ ├── 0872.Leaf-Similar-Trees/
│ │ ├── 872. Leaf-Similar Trees.go
│ │ ├── 872. Leaf-Similar Trees_test.go
│ │ └── README.md
│ ├── 0874.Walking-Robot-Simulation/
│ │ ├── 874. Walking Robot Simulation.go
│ │ ├── 874. Walking Robot Simulation_test.go
│ │ └── README.md
│ ├── 0875.Koko-Eating-Bananas/
│ │ ├── 875. Koko Eating Bananas.go
│ │ ├── 875. Koko Eating Bananas_test.go
│ │ └── README.md
│ ├── 0876.Middle-of-the-Linked-List/
│ │ ├── 876. Middle of the Linked List.go
│ │ ├── 876. Middle of the Linked List_test.go
│ │ └── README.md
│ ├── 0877.Stone-Game/
│ │ ├── 877. Stone Game.go
│ │ ├── 877. Stone Game_test.go
│ │ └── README.md
│ ├── 0878.Nth-Magical-Number/
│ │ ├── 878. Nth Magical Number.go
│ │ ├── 878. Nth Magical Number_test.go
│ │ └── README.md
│ ├── 0880.Decoded-String-at-Index/
│ │ ├── 880. Decoded String at Index.go
│ │ ├── 880. Decoded String at Index_test.go
│ │ └── README.md
│ ├── 0881.Boats-to-Save-People/
│ │ ├── 881. Boats to Save People.go
│ │ ├── 881. Boats to Save People_test.go
│ │ └── README.md
│ ├── 0884.Uncommon-Words-from-Two-Sentences/
│ │ ├── 884. Uncommon Words from Two Sentences.go
│ │ ├── 884. Uncommon Words from Two Sentences_test.go
│ │ └── README.md
│ ├── 0885.Spiral-Matrix-III/
│ │ ├── 885. Spiral Matrix III.go
│ │ ├── 885. Spiral Matrix III_test.go
│ │ └── README.md
│ ├── 0887.Super-Egg-Drop/
│ │ ├── 887. Super Egg Drop.go
│ │ ├── 887. Super Egg Drop_test.go
│ │ └── README.md
│ ├── 0888.Fair-Candy-Swap/
│ │ ├── 888. Fair Candy Swap.go
│ │ ├── 888. Fair Candy Swap_test.go
│ │ └── README.md
│ ├── 0890.Find-and-Replace-Pattern/
│ │ ├── 890. Find and Replace Pattern.go
│ │ ├── 890. Find and Replace Pattern_test.go
│ │ └── README.md
│ ├── 0891.Sum-of-Subsequence-Widths/
│ │ ├── 891. Sum of Subsequence Widths.go
│ │ ├── 891. Sum of Subsequence Widths_test.go
│ │ └── README.md
│ ├── 0892.Surface-Area-of-3D-Shapes/
│ │ ├── 892. Surface Area of 3D Shapes.go
│ │ ├── 892. Surface Area of 3D Shapes_test.go
│ │ └── README.md
│ ├── 0895.Maximum-Frequency-Stack/
│ │ ├── 895. Maximum Frequency Stack.go
│ │ ├── 895. Maximum Frequency Stack_test.go
│ │ └── README.md
│ ├── 0896.Monotonic-Array/
│ │ ├── 896. Monotonic Array.go
│ │ ├── 896. Monotonic Array_test.go
│ │ └── README.md
│ ├── 0897.Increasing-Order-Search-Tree/
│ │ ├── 897. Increasing Order Search Tree.go
│ │ ├── 897. Increasing Order Search Tree_test.go
│ │ └── README.md
│ ├── 0898.Bitwise-ORs-of-Subarrays/
│ │ ├── 898. Bitwise ORs of Subarrays.go
│ │ ├── 898. Bitwise ORs of Subarrays_test.go
│ │ └── README.md
│ ├── 0901.Online-Stock-Span/
│ │ ├── 901. Online Stock Span.go
│ │ ├── 901. Online Stock Span_test.go
│ │ └── README.md
│ ├── 0904.Fruit-Into-Baskets/
│ │ ├── 904. Fruit Into Baskets.go
│ │ ├── 904. Fruit Into Baskets_test.go
│ │ └── README.md
│ ├── 0907.Sum-of-Subarray-Minimums/
│ │ ├── 907. Sum of Subarray Minimums.go
│ │ ├── 907. Sum of Subarray Minimums_test.go
│ │ └── README.md
│ ├── 0909.Snakes-and-Ladders/
│ │ ├── 909. Snakes and Ladders.go
│ │ ├── 909. Snakes and Ladders_test.go
│ │ └── README.md
│ ├── 0910.Smallest-Range-II/
│ │ ├── 910.Smallest Range II.go
│ │ ├── 910.Smallest Range II_test.go
│ │ └── README.md
│ ├── 0911.Online-Election/
│ │ ├── 911. Online Election.go
│ │ ├── 911. Online Election_test.go
│ │ └── README.md
│ ├── 0914.X-of-a-Kind-in-a-Deck-of-Cards/
│ │ ├── 914. X of a Kind in a Deck of Cards.go
│ │ ├── 914. X of a Kind in a Deck of Cards_test.go
│ │ └── README.md
│ ├── 0916.Word-Subsets/
│ │ ├── 916. Word Subsets.go
│ │ ├── 916. Word Subsets_test.go
│ │ └── README.md
│ ├── 0918.Maximum-Sum-Circular-Subarray/
│ │ ├── 918. Maximum Sum Circular Subarray.go
│ │ ├── 918. Maximum Sum Circular Subarray_test.go
│ │ └── README.md
│ ├── 0920.Number-of-Music-Playlists/
│ │ ├── 920. Number of Music Playlists.go
│ │ ├── 920. Number of Music Playlists_test.go
│ │ └── README.md
│ ├── 0921.Minimum-Add-to-Make-Parentheses-Valid/
│ │ ├── 921. Minimum Add to Make Parentheses Valid.go
│ │ ├── 921. Minimum Add to Make Parentheses Valid_test.go
│ │ └── README.md
│ ├── 0922.Sort-Array-By-Parity-II/
│ │ ├── 922. Sort Array By Parity II.go
│ │ ├── 922. Sort Array By Parity II_test.go
│ │ └── README.md
│ ├── 0923.3Sum-With-Multiplicity/
│ │ ├── 923. 3Sum With Multiplicity.go
│ │ ├── 923. 3Sum With Multiplicity_test.go
│ │ └── README.md
│ ├── 0924.Minimize-Malware-Spread/
│ │ ├── 924. Minimize Malware Spread.go
│ │ ├── 924. Minimize Malware Spread_test.go
│ │ └── README.md
│ ├── 0925.Long-Pressed-Name/
│ │ ├── 925. Long Pressed Name.go
│ │ ├── 925. Long Pressed Name_test.go
│ │ └── README.md
│ ├── 0927.Three-Equal-Parts/
│ │ ├── 927. Three Equal Parts.go
│ │ ├── 927. Three Equal Parts_test.go
│ │ └── README.md
│ ├── 0928.Minimize-Malware-Spread-II/
│ │ ├── 928. Minimize Malware Spread II.go
│ │ ├── 928. Minimize Malware Spread II_test.go
│ │ └── README.md
│ ├── 0930.Binary-Subarrays-With-Sum/
│ │ ├── 930. Binary Subarrays With Sum.go
│ │ ├── 930. Binary Subarrays With Sum_test.go
│ │ └── README.md
│ ├── 0933.Number-of-Recent-Calls/
│ │ ├── 933. Number of Recent Calls.go
│ │ ├── 933. Number of Recent Calls_test.go
│ │ └── README.md
│ ├── 0938.Range-Sum-of-BST/
│ │ ├── 938. Range Sum of BST.go
│ │ ├── 938. Range Sum of BST_test.go
│ │ └── README.md
│ ├── 0942.DI-String-Match/
│ │ ├── 942. DI String Match.go
│ │ ├── 942. DI String Match_test.go
│ │ └── README.md
│ ├── 0946.Validate-Stack-Sequences/
│ │ ├── 946. Validate Stack Sequences.go
│ │ ├── 946. Validate Stack Sequences_test.go
│ │ └── README.md
│ ├── 0947.Most-Stones-Removed-with-Same-Row-or-Column/
│ │ ├── 947. Most Stones Removed with Same Row or Column.go
│ │ ├── 947. Most Stones Removed with Same Row or Column_test.go
│ │ └── README.md
│ ├── 0949.Largest-Time-for-Given-Digits/
│ │ ├── 949. Largest Time for Given Digits.go
│ │ ├── 949. Largest Time for Given Digits_test.go
│ │ └── README.md
│ ├── 0952.Largest-Component-Size-by-Common-Factor/
│ │ ├── 952. Largest Component Size by Common Factor.go
│ │ ├── 952. Largest Component Size by Common Factor_test.go
│ │ └── README.md
│ ├── 0953.Verifying-an-Alien-Dictionary/
│ │ ├── 953. Verifying an Alien Dictionary.go
│ │ ├── 953. Verifying an Alien Dictionary_test.go
│ │ └── README.md
│ ├── 0958.Check-Completeness-of-a-Binary-Tree/
│ │ ├── 0958.Check Completeness of a Binary Tree.go
│ │ ├── 0958.Check Completeness of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0959.Regions-Cut-By-Slashes/
│ │ ├── 959. Regions Cut By Slashes.go
│ │ ├── 959. Regions Cut By Slashes_test.go
│ │ └── README.md
│ ├── 0961.N-Repeated-Element-in-Size-2N-Array/
│ │ ├── 961. N-Repeated Element in Size 2N Array.go
│ │ ├── 961. N-Repeated Element in Size 2N Array_test.go
│ │ └── README.md
│ ├── 0966.Vowel-Spellchecker/
│ │ ├── 966. Vowel Spellchecker.go
│ │ ├── 966. Vowel Spellchecker_test.go
│ │ └── README.md
│ ├── 0968.Binary-Tree-Cameras/
│ │ ├── 968. Binary Tree Cameras.go
│ │ ├── 968. Binary Tree Cameras_test.go
│ │ └── README.md
│ ├── 0969.Pancake-Sorting/
│ │ ├── 969. Pancake Sorting.go
│ │ ├── 969. Pancake Sorting_test.go
│ │ └── README.md
│ ├── 0970.Powerful-Integers/
│ │ ├── 970. Powerful Integers.go
│ │ ├── 970. Powerful Integers_test.go
│ │ └── README.md
│ ├── 0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/
│ │ ├── 971. Flip Binary Tree To Match Preorder Traversal.go
│ │ ├── 971. Flip Binary Tree To Match Preorder Traversal_test.go
│ │ └── README.md
│ ├── 0973.K-Closest-Points-to-Origin/
│ │ ├── 973. K Closest Points to Origin.go
│ │ ├── 973. K Closest Points to Origin_test.go
│ │ └── README.md
│ ├── 0976.Largest-Perimeter-Triangle/
│ │ ├── 976. Largest Perimeter Triangle.go
│ │ ├── 976. Largest Perimeter Triangle_test.go
│ │ └── README.md
│ ├── 0977.Squares-of-a-Sorted-Array/
│ │ ├── 977. Squares of a Sorted Array.go
│ │ ├── 977. Squares of a Sorted Array_test.go
│ │ └── README.md
│ ├── 0978.Longest-Turbulent-Subarray/
│ │ ├── 978. Longest Turbulent Subarray.go
│ │ ├── 978. Longest Turbulent Subarray_test.go
│ │ └── README.md
│ ├── 0979.Distribute-Coins-in-Binary-Tree/
│ │ ├── 979. Distribute Coins in Binary Tree.go
│ │ ├── 979. Distribute Coins in Binary Tree_test.go
│ │ └── README.md
│ ├── 0980.Unique-Paths-III/
│ │ ├── 980. Unique Paths III.go
│ │ ├── 980. Unique Paths III_test.go
│ │ └── README.md
│ ├── 0981.Time-Based-Key-Value-Store/
│ │ ├── 981. Time Based Key-Value Store.go
│ │ ├── 981. Time Based Key-Value Store_test.go
│ │ └── README.md
│ ├── 0984.String-Without-AAA-or-BBB/
│ │ ├── 984. String Without AAA or BBB.go
│ │ ├── 984. String Without AAA or BBB_test.go
│ │ └── README.md
│ ├── 0985.Sum-of-Even-Numbers-After-Queries/
│ │ ├── 985. Sum of Even Numbers After Queries.go
│ │ ├── 985. Sum of Even Numbers After Queries_test.go
│ │ └── README.md
│ ├── 0986.Interval-List-Intersections/
│ │ ├── 986. Interval List Intersections.go
│ │ ├── 986. Interval List Intersections_test.go
│ │ └── README.md
│ ├── 0987.Vertical-Order-Traversal-of-a-Binary-Tree/
│ │ ├── 987. Vertical Order Traversal of a Binary Tree.go
│ │ ├── 987. Vertical Order Traversal of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0989.Add-to-Array-Form-of-Integer/
│ │ ├── 989. Add to Array-Form of Integer.go
│ │ ├── 989. Add to Array-Form of Integer_test.go
│ │ └── README.md
│ ├── 0990.Satisfiability-of-Equality-Equations/
│ │ ├── 990. Satisfiability of Equality Equations.go
│ │ ├── 990. Satisfiability of Equality Equations_test.go
│ │ └── README.md
│ ├── 0991.Broken-Calculator/
│ │ ├── 991. Broken Calculator.go
│ │ ├── 991. Broken Calculator_test.go
│ │ └── README.md
│ ├── 0992.Subarrays-with-K-Different-Integers/
│ │ ├── 992. Subarrays with K Different Integers.go
│ │ ├── 992. Subarrays with K Different Integers_test.go
│ │ └── README.md
│ ├── 0993.Cousins-in-Binary-Tree/
│ │ ├── 993. Cousins in Binary Tree.go
│ │ ├── 993. Cousins in Binary Tree_test.go
│ │ └── README.md
│ ├── 0995.Minimum-Number-of-K-Consecutive-Bit-Flips/
│ │ ├── 995. Minimum Number of K Consecutive Bit Flips.go
│ │ ├── 995. Minimum Number of K Consecutive Bit Flips_test.go
│ │ └── README.md
│ ├── 0996.Number-of-Squareful-Arrays/
│ │ ├── 996. Number of Squareful Arrays.go
│ │ ├── 996. Number of Squareful Arrays_test.go
│ │ └── README.md
│ ├── 0997.Find-the-Town-Judge/
│ │ ├── 997.Find the Town Judge.go
│ │ ├── 997.Find the Town Judge_test.go
│ │ └── README.md
│ ├── 0999.Available-Captures-for-Rook/
│ │ ├── 999. Available Captures for Rook.go
│ │ ├── 999. Available Captures for Rook_test.go
│ │ └── README.md
│ ├── 1002.Find-Common-Characters/
│ │ ├── 1002. Find Common Characters.go
│ │ ├── 1002. Find Common Characters_test.go
│ │ └── README.md
│ ├── 1003.Check-If-Word-Is-Valid-After-Substitutions/
│ │ ├── 1003. Check If Word Is Valid After Substitutions.go
│ │ ├── 1003. Check If Word Is Valid After Substitutions_test.go
│ │ └── README.md
│ ├── 1004.Max-Consecutive-Ones-III/
│ │ ├── 1004. Max Consecutive Ones III.go
│ │ ├── 1004. Max Consecutive Ones III_test.go
│ │ └── README.md
│ ├── 1005.Maximize-Sum-Of-Array-After-K-Negations/
│ │ ├── 1005. Maximize Sum Of Array After K Negations.go
│ │ ├── 1005. Maximize Sum Of Array After K Negations_test.go
│ │ └── README.md
│ ├── 1006.Clumsy-Factorial/
│ │ ├── 1006. Clumsy Factorial.go
│ │ ├── 1006. Clumsy Factorial_test.go
│ │ └── README.md
│ ├── 1009.Complement-of-Base-10-Integer/
│ │ ├── 1009. Complement of Base 10 Integer.go
│ │ ├── 1009. Complement of Base 10 Integer_test.go
│ │ └── README.md
│ ├── 1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/
│ │ ├── 1010. Pairs of Songs With Total Durations Divisible by 60.go
│ │ ├── 1010. Pairs of Songs With Total Durations Divisible by 60_test.go
│ │ └── README.md
│ ├── 1011.Capacity-To-Ship-Packages-Within-D-Days/
│ │ ├── 1011. Capacity To Ship Packages Within D Days.go
│ │ ├── 1011. Capacity To Ship Packages Within D Days_test.go
│ │ └── README.md
│ ├── 1017.Convert-to-Base-2/
│ │ ├── 1017. Convert to Base -2.go
│ │ ├── 1017. Convert to Base -2_test.go
│ │ └── README.md
│ ├── 1018.Binary-Prefix-Divisible-By-5/
│ │ ├── 1018. Binary Prefix Divisible By 5.go
│ │ ├── 1018. Binary Prefix Divisible By 5_test.go
│ │ └── README.md
│ ├── 1019.Next-Greater-Node-In-Linked-List/
│ │ ├── 1019. Next Greater Node In Linked List.go
│ │ ├── 1019. Next Greater Node In Linked List_test.go
│ │ └── README.md
│ ├── 1020.Number-of-Enclaves/
│ │ ├── 1020. Number of Enclaves.go
│ │ ├── 1020. Number of Enclaves_test.go
│ │ └── README.md
│ ├── 1021.Remove-Outermost-Parentheses/
│ │ ├── 1021. Remove Outermost Parentheses.go
│ │ ├── 1021. Remove Outermost Parentheses_test.go
│ │ └── README.md
│ ├── 1022.Sum-of-Root-To-Leaf-Binary-Numbers/
│ │ ├── 1022. Sum of Root To Leaf Binary Numbers.go
│ │ ├── 1022. Sum of Root To Leaf Binary Numbers_test.go
│ │ └── README.md
│ ├── 1025.Divisor-Game/
│ │ ├── 1025. Divisor Game.go
│ │ ├── 1025. Divisor Game_test.go
│ │ └── README.md
│ ├── 1026.Maximum-Difference-Between-Node-and-Ancestor/
│ │ ├── 1026. Maximum Difference Between Node and Ancestor.go
│ │ ├── 1026. Maximum Difference Between Node and Ancestor_test.go
│ │ └── README.md
│ ├── 1028.Recover-a-Tree-From-Preorder-Traversal/
│ │ ├── 1028. Recover a Tree From Preorder Traversal.go
│ │ ├── 1028. Recover a Tree From Preorder Traversal_test.go
│ │ └── README.md
│ ├── 1030.Matrix-Cells-in-Distance-Order/
│ │ ├── 1030. Matrix Cells in Distance Order.go
│ │ ├── 1030. Matrix Cells in Distance Order_test.go
│ │ └── README.md
│ ├── 1034.Coloring-A-Border/
│ │ ├── 1034.Coloring A Border.go
│ │ ├── 1034.Coloring A Border_test.go
│ │ └── README.md
│ ├── 1037.Valid-Boomerang/
│ │ ├── 1037. Valid Boomerang.go
│ │ ├── 1037. Valid Boomerang_test.go
│ │ └── README.md
│ ├── 1038.Binary-Search-Tree-to-Greater-Sum-Tree/
│ │ ├── 1038. Binary Search Tree to Greater Sum Tree.go
│ │ ├── 1038. Binary Search Tree to Greater Sum Tree_test.go
│ │ └── README.md
│ ├── 1040.Moving-Stones-Until-Consecutive-II/
│ │ ├── 1040. Moving Stones Until Consecutive II.go
│ │ ├── 1040. Moving Stones Until Consecutive II_test.go
│ │ └── README.md
│ ├── 1047.Remove-All-Adjacent-Duplicates-In-String/
│ │ ├── 1047. Remove All Adjacent Duplicates In String.go
│ │ ├── 1047. Remove All Adjacent Duplicates In String_test.go
│ │ └── README.md
│ ├── 1048.Longest-String-Chain/
│ │ ├── 1048. Longest String Chain.go
│ │ ├── 1048. Longest String Chain_test.go
│ │ └── README.md
│ ├── 1049.Last-Stone-Weight-II/
│ │ ├── 1049. Last Stone Weight II.go
│ │ ├── 1049. Last Stone Weight II_test.go
│ │ └── README.md
│ ├── 1051.Height-Checker/
│ │ ├── 1051. Height Checker.go
│ │ ├── 1051. Height Checker_test.go
│ │ └── README.md
│ ├── 1052.Grumpy-Bookstore-Owner/
│ │ ├── 1052. Grumpy Bookstore Owner.go
│ │ ├── 1052. Grumpy Bookstore Owner_test.go
│ │ └── README.md
│ ├── 1054.Distant-Barcodes/
│ │ ├── 1054. Distant Barcodes.go
│ │ ├── 1054. Distant Barcodes_test.go
│ │ └── README.md
│ ├── 1073.Adding-Two-Negabinary-Numbers/
│ │ ├── 1073. Adding Two Negabinary Numbers.go
│ │ ├── 1073. Adding Two Negabinary Numbers_test.go
│ │ └── README.md
│ ├── 1074.Number-of-Submatrices-That-Sum-to-Target/
│ │ ├── 1074. Number of Submatrices That Sum to Target.go
│ │ ├── 1074. Number of Submatrices That Sum to Target_test.go
│ │ └── README.md
│ ├── 1078.Occurrences-After-Bigram/
│ │ ├── 1078. Occurrences After Bigram.go
│ │ ├── 1078. Occurrences After Bigram_test.go
│ │ └── README.md
│ ├── 1079.Letter-Tile-Possibilities/
│ │ ├── 1079. Letter Tile Possibilities.go
│ │ ├── 1079. Letter Tile Possibilities_test.go
│ │ └── README.md
│ ├── 1089.Duplicate-Zeros/
│ │ ├── 1089. Duplicate Zeros.go
│ │ ├── 1089. Duplicate Zeros_test.go
│ │ └── README.md
│ ├── 1091.Shortest-Path-in-Binary-Matrix/
│ │ ├── 1091. Shortest Path in Binary Matrix.go
│ │ ├── 1091. Shortest Path in Binary Matrix_test.go
│ │ └── README.md
│ ├── 1093.Statistics-from-a-Large-Sample/
│ │ ├── 1093. Statistics from a Large Sample.go
│ │ ├── 1093. Statistics from a Large Sample_test.go
│ │ └── README.md
│ ├── 1104.Path-In-Zigzag-Labelled-Binary-Tree/
│ │ ├── 1104.Path In Zigzag Labelled Binary Tree.go
│ │ ├── 1104.Path In Zigzag Labelled Binary Tree_test.go
│ │ └── README.md
│ ├── 1105.Filling-Bookcase-Shelves/
│ │ ├── 1105. Filling Bookcase Shelves.go
│ │ ├── 1105. Filling Bookcase Shelves_test.go
│ │ └── README.md
│ ├── 1108.Defanging-an-IP-Address/
│ │ ├── 1108. Defanging an IP Address.go
│ │ ├── 1108. Defanging an IP Address_test.go
│ │ └── README.md
│ ├── 1110.Delete-Nodes-And-Return-Forest/
│ │ ├── 1110. Delete Nodes And Return Forest.go
│ │ ├── 1110. Delete Nodes And Return Forest_test.go
│ │ └── README.md
│ ├── 1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/
│ │ ├── 1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go
│ │ ├── 1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go
│ │ └── README.md
│ ├── 1122.Relative-Sort-Array/
│ │ ├── 1122. Relative Sort Array.go
│ │ ├── 1122. Relative Sort Array_test.go
│ │ └── README.md
│ ├── 1123.Lowest-Common-Ancestor-of-Deepest-Leaves/
│ │ ├── 1123. Lowest Common Ancestor of Deepest Leaves.go
│ │ ├── 1123. Lowest Common Ancestor of Deepest Leaves_test.go
│ │ └── README.md
│ ├── 1128.Number-of-Equivalent-Domino-Pairs/
│ │ ├── 1128. Number of Equivalent Domino Pairs.go
│ │ ├── 1128. Number of Equivalent Domino Pairs_test.go
│ │ └── README.md
│ ├── 1137.N-th-Tribonacci-Number/
│ │ ├── 1137. N-th Tribonacci Number.go
│ │ ├── 1137. N-th Tribonacci Number_test.go
│ │ └── README.md
│ ├── 1143.Longest-Common-Subsequence/
│ │ ├── 1143. Longest Common Subsequence.go
│ │ ├── 1143. Longest Common Subsequence_test.go
│ │ └── README.md
│ ├── 1145.Binary-Tree-Coloring-Game/
│ │ ├── 1145. Binary Tree Coloring Game.go
│ │ ├── 1145. Binary Tree Coloring Game_test.go
│ │ └── README.md
│ ├── 1154.Day-of-the-Year/
│ │ ├── 1154. Day of the Year.go
│ │ ├── 1154. Day of the Year_test.go
│ │ └── README.md
│ ├── 1157.Online-Majority-Element-In-Subarray/
│ │ ├── 1157. Online Majority Element In Subarray.go
│ │ ├── 1157. Online Majority Element In Subarray_test.go
│ │ └── README.md
│ ├── 1160.Find-Words-That-Can-Be-Formed-by-Characters/
│ │ ├── 1160. Find Words That Can Be Formed by Characters.go
│ │ ├── 1160. Find Words That Can Be Formed by Characters_test.go
│ │ └── README.md
│ ├── 1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/
│ │ ├── 1170. Compare Strings by Frequency of the Smallest Character.go
│ │ ├── 1170. Compare Strings by Frequency of the Smallest Character_test.go
│ │ └── README.md
│ ├── 1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/
│ │ ├── 1171. Remove Zero Sum Consecutive Nodes from Linked List.go
│ │ ├── 1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go
│ │ └── README.md
│ ├── 1175.Prime-Arrangements/
│ │ ├── 1175. Prime Arrangements.go
│ │ ├── 1175. Prime Arrangements_test.go
│ │ └── README.md
│ ├── 1178.Number-of-Valid-Words-for-Each-Puzzle/
│ │ ├── 1178. Number of Valid Words for Each Puzzle.go
│ │ ├── 1178. Number of Valid Words for Each Puzzle_test.go
│ │ └── README.md
│ ├── 1184.Distance-Between-Bus-Stops/
│ │ ├── 1184. Distance Between Bus Stops.go
│ │ ├── 1184. Distance Between Bus Stops_test.go
│ │ └── README.md
│ ├── 1185.Day-of-the-Week/
│ │ ├── 1185. Day of the Week.go
│ │ ├── 1185. Day of the Week_test.go
│ │ └── README.md
│ ├── 1189.Maximum-Number-of-Balloons/
│ │ ├── 1189. Maximum Number of Balloons.go
│ │ ├── 1189. Maximum Number of Balloons_test.go
│ │ └── README.md
│ ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/
│ │ ├── 1190. Reverse Substrings Between Each Pair of Parentheses.go
│ │ ├── 1190. Reverse Substrings Between Each Pair of Parentheses_test.go
│ │ └── README.md
│ ├── 1200.Minimum-Absolute-Difference/
│ │ ├── 1200. Minimum Absolute Difference.go
│ │ ├── 1200. Minimum Absolute Difference_test.go
│ │ └── README.md
│ ├── 1201.Ugly-Number-III/
│ │ ├── 1201. Ugly Number III.go
│ │ ├── 1201. Ugly Number III_test.go
│ │ └── README.md
│ ├── 1202.Smallest-String-With-Swaps/
│ │ ├── 1202. Smallest String With Swaps.go
│ │ ├── 1202. Smallest String With Swaps_test.go
│ │ └── README.md
│ ├── 1203.Sort-Items-by-Groups-Respecting-Dependencies/
│ │ ├── 1203. Sort Items by Groups Respecting Dependencies.go
│ │ ├── 1203. Sort Items by Groups Respecting Dependencies_test.go
│ │ └── README.md
│ ├── 1207.Unique-Number-of-Occurrences/
│ │ ├── 1207. Unique Number of Occurrences.go
│ │ ├── 1207. Unique Number of Occurrences_test.go
│ │ └── README.md
│ ├── 1208.Get-Equal-Substrings-Within-Budget/
│ │ ├── 1208. Get Equal Substrings Within Budget.go
│ │ ├── 1208. Get Equal Substrings Within Budget_test.go
│ │ └── README.md
│ ├── 1209.Remove-All-Adjacent-Duplicates-in-String-II/
│ │ ├── 1209. Remove All Adjacent Duplicates in String II.go
│ │ ├── 1209. Remove All Adjacent Duplicates in String II_test.go
│ │ └── README.md
│ ├── 1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/
│ │ ├── 1217. Minimum Cost to Move Chips to The Same Position.go
│ │ ├── 1217. Minimum Cost to Move Chips to The Same Position_test.go
│ │ └── README.md
│ ├── 1221.Split-a-String-in-Balanced-Strings/
│ │ ├── 1221. Split a String in Balanced Strings.go
│ │ ├── 1221. Split a String in Balanced Strings_test.go
│ │ └── README.md
│ ├── 1232.Check-If-It-Is-a-Straight-Line/
│ │ ├── 1232. Check If It Is a Straight Line.go
│ │ ├── 1232. Check If It Is a Straight Line_test.go
│ │ └── README.md
│ ├── 1234.Replace-the-Substring-for-Balanced-String/
│ │ ├── 1234. Replace the Substring for Balanced String.go
│ │ ├── 1234. Replace the Substring for Balanced String_test.go
│ │ └── README.md
│ ├── 1235.Maximum-Profit-in-Job-Scheduling/
│ │ ├── 1235. Maximum Profit in Job Scheduling.go
│ │ ├── 1235. Maximum Profit in Job Scheduling_test.go
│ │ └── README.md
│ ├── 1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/
│ │ ├── 1239. Maximum Length of a Concatenated String with Unique Characters.go
│ │ ├── 1239. Maximum Length of a Concatenated String with Unique Characters_test.go
│ │ └── README.md
│ ├── 1249.Minimum-Remove-to-Make-Valid-Parentheses/
│ │ ├── 1249. Minimum Remove to Make Valid Parentheses.go
│ │ ├── 1249. Minimum Remove to Make Valid Parentheses_test.go
│ │ └── README.md
│ ├── 1252.Cells-with-Odd-Values-in-a-Matrix/
│ │ ├── 1252. Cells with Odd Values in a Matrix.go
│ │ ├── 1252. Cells with Odd Values in a Matrix_test.go
│ │ └── README.md
│ ├── 1254.Number-of-Closed-Islands/
│ │ ├── 1254. Number of Closed Islands.go
│ │ ├── 1254. Number of Closed Islands_test.go
│ │ └── README.md
│ ├── 1260.Shift-2D-Grid/
│ │ ├── 1260. Shift 2D Grid.go
│ │ ├── 1260. Shift 2D Grid_test.go
│ │ └── README.md
│ ├── 1266.Minimum-Time-Visiting-All-Points/
│ │ ├── 1266. Minimum Time Visiting All Points.go
│ │ ├── 1266. Minimum Time Visiting All Points_test.go
│ │ └── README.md
│ ├── 1268.Search-Suggestions-System/
│ │ ├── 1268. Search Suggestions System.go
│ │ ├── 1268. Search Suggestions System_test.go
│ │ └── README.md
│ ├── 1275.Find-Winner-on-a-Tic-Tac-Toe-Game/
│ │ ├── 1275. Find Winner on a Tic Tac Toe Game.go
│ │ ├── 1275. Find Winner on a Tic Tac Toe Game_test.go
│ │ └── README.md
│ ├── 1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/
│ │ ├── 1281. Subtract the Product and Sum of Digits of an Integer.go
│ │ ├── 1281. Subtract the Product and Sum of Digits of an Integer_test.go
│ │ └── README.md
│ ├── 1283.Find-the-Smallest-Divisor-Given-a-Threshold/
│ │ ├── 1283. Find the Smallest Divisor Given a Threshold.go
│ │ ├── 1283. Find the Smallest Divisor Given a Threshold_test.go
│ │ └── README.md
│ ├── 1287.Element-Appearing-More-Than-In-Sorted-Array/
│ │ ├── 1287. Element Appearing More Than 25% In Sorted Array.go
│ │ ├── 1287. Element Appearing More Than 25% In Sorted Array_test.go
│ │ └── README.md
│ ├── 1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/
│ │ ├── 1290. Convert Binary Number in a Linked List to Integer.go
│ │ ├── 1290. Convert Binary Number in a Linked List to Integer_test.go
│ │ └── README.md
│ ├── 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/
│ │ ├── 1293. Shortest Path in a Grid with Obstacles Elimination.go
│ │ ├── 1293. Shortest Path in a Grid with Obstacles Elimination_test.go
│ │ └── README.md
│ ├── 1295.Find-Numbers-with-Even-Number-of-Digits/
│ │ ├── 1295. Find Numbers with Even Number of Digits.go
│ │ ├── 1295. Find Numbers with Even Number of Digits_test.go
│ │ └── README.md
│ ├── 1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/
│ │ ├── 1296.Divide Array in Sets of K Consecutive Numbers.go
│ │ ├── 1296.Divide Array in Sets of K Consecutive Numbers_test.go
│ │ └── README.md
│ ├── 1299.Replace-Elements-with-Greatest-Element-on-Right-Side/
│ │ ├── 1299. Replace Elements with Greatest Element on Right Side.go
│ │ ├── 1299. Replace Elements with Greatest Element on Right Side_test.go
│ │ └── README.md
│ ├── 1300.Sum-of-Mutated-Array-Closest-to-Target/
│ │ ├── 1300. Sum of Mutated Array Closest to Target.go
│ │ ├── 1300. Sum of Mutated Array Closest to Target_test.go
│ │ └── README.md
│ ├── 1302.Deepest-Leaves-Sum/
│ │ ├── 1302. Deepest Leaves Sum.go
│ │ ├── 1302. Deepest Leaves Sum_test.go
│ │ └── README.md
│ ├── 1304.Find-N-Unique-Integers-Sum-up-to-Zero/
│ │ ├── 1304. Find N Unique Integers Sum up to Zero.go
│ │ ├── 1304. Find N Unique Integers Sum up to Zero_test.go
│ │ └── README.md
│ ├── 1305.All-Elements-in-Two-Binary-Search-Trees/
│ │ ├── 1305. All Elements in Two Binary Search Trees.go
│ │ ├── 1305. All Elements in Two Binary Search Trees_test.go
│ │ └── README.md
│ ├── 1306.Jump-Game-III/
│ │ ├── 1306. Jump Game III.go
│ │ ├── 1306. Jump Game III_test.go
│ │ └── README.md
│ ├── 1310.XOR-Queries-of-a-Subarray/
│ │ ├── 1310. XOR Queries of a Subarray.go
│ │ ├── 1310. XOR Queries of a Subarray_test.go
│ │ └── README.md
│ ├── 1313.Decompress-Run-Length-Encoded-List/
│ │ ├── 1313. Decompress Run-Length Encoded List.go
│ │ ├── 1313. Decompress Run-Length Encoded List_test.go
│ │ └── README.md
│ ├── 1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/
│ │ ├── 1317. Convert Integer to the Sum of Two No-Zero Integers.go
│ │ ├── 1317. Convert Integer to the Sum of Two No-Zero Integers_test.go
│ │ └── README.md
│ ├── 1319.Number-of-Operations-to-Make-Network-Connected/
│ │ ├── 1319. Number of Operations to Make Network Connected.go
│ │ ├── 1319. Number of Operations to Make Network Connected_test.go
│ │ └── README.md
│ ├── 1329.Sort-the-Matrix-Diagonally/
│ │ ├── 1329. Sort the Matrix Diagonally.go
│ │ ├── 1329. Sort the Matrix Diagonally_test.go
│ │ └── README.md
│ ├── 1332.Remove-Palindromic-Subsequences/
│ │ ├── 1332. Remove Palindromic Subsequences.go
│ │ ├── 1332. Remove Palindromic Subsequences_test.go
│ │ └── README.md
│ ├── 1337.The-K-Weakest-Rows-in-a-Matrix/
│ │ ├── 1337. The K Weakest Rows in a Matrix.go
│ │ ├── 1337. The K Weakest Rows in a Matrix_test.go
│ │ └── README.md
│ ├── 1353.Maximum-Number-of-Events-That-Can-Be-Attended/
│ │ ├── 1353. Maximum Number of Events That Can Be Attended.go
│ │ ├── 1353. Maximum Number of Events That Can Be Attended_test.go
│ │ └── README.md
│ ├── 1380.Lucky-Numbers-in-a-Matrix/
│ │ ├── 1380. Lucky Numbers in a Matrix.go
│ │ ├── 1380. Lucky Numbers in a Matrix_test.go
│ │ └── README.md
│ ├── 1383.Maximum-Performance-of-a-Team/
│ │ ├── 1383. Maximum Performance of a Team.go
│ │ ├── 1383. Maximum Performance of a Team_test.go
│ │ └── README.md
│ ├── 1385.Find-the-Distance-Value-Between-Two-Arrays/
│ │ ├── 1385. Find the Distance Value Between Two Arrays.go
│ │ ├── 1385. Find the Distance Value Between Two Arrays_test.go
│ │ └── README.md
│ ├── 1389.Create-Target-Array-in-the-Given-Order/
│ │ ├── 1389. Create Target Array in the Given Order.go
│ │ ├── 1389. Create Target Array in the Given Order_test.go
│ │ └── README.md
│ ├── 1396.Design-Underground-System/
│ │ ├── 1396. Design Underground System.go
│ │ ├── 1396. Design Underground System_test.go
│ │ └── README.md
│ ├── 1423.Maximum-Points-You-Can-Obtain-from-Cards/
│ │ ├── 1423. Maximum Points You Can Obtain from Cards.go
│ │ ├── 1423. Maximum Points You Can Obtain from Cards_test.go
│ │ └── README.md
│ ├── 1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/
│ │ ├── 1437. Check If All 1s Are at Least Length K Places Away.go
│ │ ├── 1437. Check If All 1s Are at Least Length K Places Away_test.go
│ │ └── README.md
│ ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/
│ │ ├── 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.go
│ │ ├── 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit_test.go
│ │ └── README.md
│ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/
│ │ ├── 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.go
│ │ ├── 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows_test.go
│ │ └── README.md
│ ├── 1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/
│ │ ├── 1442. Count Triplets That Can Form Two Arrays of Equal XOR.go
│ │ ├── 1442. Count Triplets That Can Form Two Arrays of Equal XOR_test.go
│ │ └── README.md
│ ├── 1446.Consecutive-Characters/
│ │ ├── 1446.Consecutive Characters.go
│ │ ├── 1446.Consecutive Characters_test.go
│ │ └── README.md
│ ├── 1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/
│ │ ├── 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.go
│ │ ├── 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence_test.go
│ │ └── README.md
│ ├── 1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/
│ │ ├── 1461. Check If a String Contains All Binary Codes of Size K.go
│ │ ├── 1461. Check If a String Contains All Binary Codes of Size K_test.go
│ │ └── README.md
│ ├── 1463.Cherry-Pickup-II/
│ │ ├── 1463. Cherry Pickup II.go
│ │ ├── 1463. Cherry Pickup II_test.go
│ │ └── README.md
│ ├── 1464.Maximum-Product-of-Two-Elements-in-an-Array/
│ │ ├── 1464. Maximum Product of Two Elements in an Array.go
│ │ ├── 1464. Maximum Product of Two Elements in an Array_test.go
│ │ └── README.md
│ ├── 1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/
│ │ ├── 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.go
│ │ ├── 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts_test.go
│ │ └── README.md
│ ├── 1470.Shuffle-the-Array/
│ │ ├── 1470. Shuffle the Array.go
│ │ ├── 1470. Shuffle the Array_test.go
│ │ └── README.md
│ ├── 1480.Running-Sum-of-1d-Array/
│ │ ├── 1480. Running Sum of 1d Array.go
│ │ ├── 1480. Running Sum of 1d Array_test.go
│ │ └── README.md
│ ├── 1482.Minimum-Number-of-Days-to-Make-m-Bouquets/
│ │ ├── 1482. Minimum Number of Days to Make m Bouquets.go
│ │ ├── 1482. Minimum Number of Days to Make m Bouquets_test.go
│ │ └── README.md
│ ├── 1486.XOR-Operation-in-an-Array/
│ │ ├── 1486. XOR Operation in an Array.go
│ │ ├── 1486. XOR Operation in an Array_test.go
│ │ └── README.md
│ ├── 1512.Number-of-Good-Pairs/
│ │ ├── 1512. Number of Good Pairs.go
│ │ ├── 1512. Number of Good Pairs_test.go
│ │ └── README.md
│ ├── 1518.Water-Bottles/
│ │ ├── 1518.Water Bottles.go
│ │ ├── 1518.Water Bottles_test.go
│ │ └── README.md
│ ├── 1539.Kth-Missing-Positive-Number/
│ │ ├── 1539. Kth Missing Positive Number.go
│ │ ├── 1539. Kth Missing Positive Number_test.go
│ │ └── README.md
│ ├── 1551.Minimum-Operations-to-Make-Array-Equal/
│ │ ├── 1551. Minimum Operations to Make Array Equal.go
│ │ ├── 1551. Minimum Operations to Make Array Equal_test.go
│ │ └── README.md
│ ├── 1572.Matrix-Diagonal-Sum/
│ │ ├── 1572.Matrix Diagonal Sum.go
│ │ ├── 1572.Matrix Diagonal Sum_test.go
│ │ └── README.md
│ ├── 1573.Number-of-Ways-to-Split-a-String/
│ │ ├── 1573. Number of Ways to Split a String.go
│ │ ├── 1573. Number of Ways to Split a String_test.go
│ │ └── README.md
│ ├── 1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/
│ │ ├── 1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.go
│ │ ├── 1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters_test.go
│ │ └── README.md
│ ├── 1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/
│ │ ├── 1579. Remove Max Number of Edges to Keep Graph Fully Traversable.go
│ │ ├── 1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go
│ │ └── README.md
│ ├── 1600.Throne-Inheritance/
│ │ ├── 1600. Throne Inheritance.go
│ │ ├── 1600. Throne Inheritance_test.go
│ │ └── README.md
│ ├── 1603.Design-Parking-System/
│ │ ├── 1603. Design Parking System.go
│ │ ├── 1603. Design Parking System_test.go
│ │ └── README.md
│ ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/
│ │ ├── 1608. Special Array With X Elements Greater Than or Equal X.go
│ │ ├── 1608. Special Array With X Elements Greater Than or Equal X_test.go
│ │ └── README.md
│ ├── 1609.Even-Odd-Tree/
│ │ ├── 1609.Even Odd Tree.go
│ │ ├── 1609.Even Odd Tree_test.go
│ │ └── README.md
│ ├── 1614.Maximum-Nesting-Depth-of-the-Parentheses/
│ │ ├── 1614. Maximum Nesting Depth of the Parentheses.go
│ │ ├── 1614. Maximum Nesting Depth of the Parentheses_test.go
│ │ └── README.md
│ ├── 1619.Mean-of-Array-After-Removing-Some-Elements/
│ │ ├── 1619. Mean of Array After Removing Some Elements.go
│ │ ├── 1619. Mean of Array After Removing Some Elements_test.go
│ │ └── README.md
│ ├── 1624.Largest-Substring-Between-Two-Equal-Characters/
│ │ ├── 1624. Largest Substring Between Two Equal Characters.go
│ │ ├── 1624. Largest Substring Between Two Equal Characters_test.go
│ │ └── README.md
│ ├── 1629.Slowest-Key/
│ │ ├── 1629. Slowest Key.go
│ │ ├── 1629. Slowest Key_test.go
│ │ └── README.md
│ ├── 1631.Path-With-Minimum-Effort/
│ │ ├── 1631. Path With Minimum Effort.go
│ │ ├── 1631. Path With Minimum Effort_test.go
│ │ └── README.md
│ ├── 1636.Sort-Array-by-Increasing-Frequency/
│ │ ├── 1636. Sort Array by Increasing Frequency.go
│ │ ├── 1636. Sort Array by Increasing Frequency_test.go
│ │ └── README.md
│ ├── 1640.Check-Array-Formation-Through-Concatenation/
│ │ ├── 1640. Check Array Formation Through Concatenation.go
│ │ ├── 1640. Check Array Formation Through Concatenation_test.go
│ │ └── README.md
│ ├── 1641.Count-Sorted-Vowel-Strings/
│ │ ├── 1641. Count Sorted Vowel Strings.go
│ │ ├── 1641. Count Sorted Vowel Strings_test.go
│ │ └── README.md
│ ├── 1642.Furthest-Building-You-Can-Reach/
│ │ ├── 1642. Furthest Building You Can Reach.go
│ │ ├── 1642. Furthest Building You Can Reach_test.go
│ │ └── README.md
│ ├── 1646.Get-Maximum-in-Generated-Array/
│ │ ├── 1646. Get Maximum in Generated Array.go
│ │ ├── 1646. Get Maximum in Generated Array_test.go
│ │ └── README.md
│ ├── 1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/
│ │ ├── 1647. Minimum Deletions to Make Character Frequencies Unique.go
│ │ ├── 1647. Minimum Deletions to Make Character Frequencies Unique_test.go
│ │ └── README.md
│ ├── 1648.Sell-Diminishing-Valued-Colored-Balls/
│ │ ├── 1648. Sell Diminishing-Valued Colored Balls.go
│ │ ├── 1648. Sell Diminishing-Valued Colored Balls_test.go
│ │ └── README.md
│ ├── 1649.Create-Sorted-Array-through-Instructions/
│ │ ├── 1649. Create Sorted Array through Instructions.go
│ │ ├── 1649. Create Sorted Array through Instructions_test.go
│ │ └── README.md
│ ├── 1652.Defuse-the-Bomb/
│ │ ├── 1652. Defuse the Bomb.go
│ │ ├── 1652. Defuse the Bomb_test.go
│ │ └── README.md
│ ├── 1653.Minimum-Deletions-to-Make-String-Balanced/
│ │ ├── 1653. Minimum Deletions to Make String Balanced.go
│ │ ├── 1653. Minimum Deletions to Make String Balanced_test.go
│ │ └── README.md
│ ├── 1654.Minimum-Jumps-to-Reach-Home/
│ │ ├── 1654. Minimum Jumps to Reach Home.go
│ │ ├── 1654. Minimum Jumps to Reach Home_test.go
│ │ └── README.md
│ ├── 1655.Distribute-Repeating-Integers/
│ │ ├── 1655. Distribute Repeating Integers.go
│ │ ├── 1655. Distribute Repeating Integers_test.go
│ │ └── README.md
│ ├── 1656.Design-an-Ordered-Stream/
│ │ ├── 1656. Design an Ordered Stream.go
│ │ ├── 1656. Design an Ordered Stream_test.go
│ │ └── README.md
│ ├── 1657.Determine-if-Two-Strings-Are-Close/
│ │ ├── 1657. Determine if Two Strings Are Close.go
│ │ ├── 1657. Determine if Two Strings Are Close_test.go
│ │ └── README.md
│ ├── 1658.Minimum-Operations-to-Reduce-X-to-Zero/
│ │ ├── 1658. Minimum Operations to Reduce X to Zero.go
│ │ ├── 1658. Minimum Operations to Reduce X to Zero_test.go
│ │ └── README.md
│ ├── 1659.Maximize-Grid-Happiness/
│ │ ├── 1659. Maximize Grid Happiness.go
│ │ ├── 1659. Maximize Grid Happiness_test.go
│ │ └── README.md
│ ├── 1662.Check-If-Two-String-Arrays-are-Equivalent/
│ │ ├── 1662. Check If Two String Arrays are Equivalent.go
│ │ ├── 1662. Check If Two String Arrays are Equivalent_test.go
│ │ └── README.md
│ ├── 1663.Smallest-String-With-A-Given-Numeric-Value/
│ │ ├── 1663. Smallest String With A Given Numeric Value.go
│ │ ├── 1663. Smallest String With A Given Numeric Value_test.go
│ │ └── README.md
│ ├── 1664.Ways-to-Make-a-Fair-Array/
│ │ ├── 1664. Ways to Make a Fair Array.go
│ │ ├── 1664. Ways to Make a Fair Array_test.go
│ │ └── README.md
│ ├── 1665.Minimum-Initial-Energy-to-Finish-Tasks/
│ │ ├── 1665. Minimum Initial Energy to Finish Tasks.go
│ │ ├── 1665. Minimum Initial Energy to Finish Tasks_test.go
│ │ └── README.md
│ ├── 1668.Maximum-Repeating-Substring/
│ │ ├── 1668. Maximum Repeating Substring.go
│ │ ├── 1668. Maximum Repeating Substring_test.go
│ │ └── README.md
│ ├── 1669.Merge-In-Between-Linked-Lists/
│ │ ├── 1669. Merge In Between Linked Lists.go
│ │ ├── 1669. Merge In Between Linked Lists_test.go
│ │ └── README.md
│ ├── 1670.Design-Front-Middle-Back-Queue/
│ │ ├── 1670. Design Front Middle Back Queue.go
│ │ ├── 1670. Design Front Middle Back Queue_test.go
│ │ └── README.md
│ ├── 1672.Richest-Customer-Wealth/
│ │ ├── 1672. Richest Customer Wealth.go
│ │ ├── 1672. Richest Customer Wealth_test.go
│ │ └── README.md
│ ├── 1673.Find-the-Most-Competitive-Subsequence/
│ │ ├── 1673. Find the Most Competitive Subsequence.go
│ │ ├── 1673. Find the Most Competitive Subsequence_test.go
│ │ └── README.md
│ ├── 1674.Minimum-Moves-to-Make-Array-Complementary/
│ │ ├── 1674. Minimum Moves to Make Array Complementary.go
│ │ ├── 1674. Minimum Moves to Make Array Complementary_test.go
│ │ └── README.md
│ ├── 1675.Minimize-Deviation-in-Array/
│ │ ├── 1675. Minimize Deviation in Array.go
│ │ ├── 1675. Minimize Deviation in Array_test.go
│ │ └── README.md
│ ├── 1678.Goal-Parser-Interpretation/
│ │ ├── 1678. Goal Parser Interpretation.go
│ │ ├── 1678. Goal Parser Interpretation_test.go
│ │ └── README.md
│ ├── 1679.Max-Number-of-K-Sum-Pairs/
│ │ ├── 1679. Max Number of K-Sum Pairs.go
│ │ ├── 1679. Max Number of K-Sum Pairs_test.go
│ │ └── README.md
│ ├── 1680.Concatenation-of-Consecutive-Binary-Numbers/
│ │ ├── 1680. Concatenation of Consecutive Binary Numbers.go
│ │ ├── 1680. Concatenation of Consecutive Binary Numbers_test.go
│ │ └── README.md
│ ├── 1681.Minimum-Incompatibility/
│ │ ├── 1681. Minimum Incompatibility.go
│ │ ├── 1681. Minimum Incompatibility_test.go
│ │ └── README.md
│ ├── 1684.Count-the-Number-of-Consistent-Strings/
│ │ ├── 1684. Count the Number of Consistent Strings.go
│ │ ├── 1684. Count the Number of Consistent Strings_test.go
│ │ └── README.md
│ ├── 1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/
│ │ ├── 1685. Sum of Absolute Differences in a Sorted Array.go
│ │ ├── 1685. Sum of Absolute Differences in a Sorted Array_test.go
│ │ └── README.md
│ ├── 1688.Count-of-Matches-in-Tournament/
│ │ ├── 1688. Count of Matches in Tournament.go
│ │ ├── 1688. Count of Matches in Tournament_test.go
│ │ └── README.md
│ ├── 1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/
│ │ ├── 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.go
│ │ ├── 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers_test.go
│ │ └── README.md
│ ├── 1690.Stone-Game-VII/
│ │ ├── 1690. Stone Game VII.go
│ │ ├── 1690. Stone Game VII_test.go
│ │ └── README.md
│ ├── 1691.Maximum-Height-by-Stacking-Cuboids/
│ │ ├── 1691. Maximum Height by Stacking Cuboids.go
│ │ ├── 1691. Maximum Height by Stacking Cuboids_test.go
│ │ └── README.md
│ ├── 1694.Reformat-Phone-Number/
│ │ ├── 1694. Reformat Phone Number.go
│ │ ├── 1694. Reformat Phone Number_test.go
│ │ └── README.md
│ ├── 1695.Maximum-Erasure-Value/
│ │ ├── 1695. Maximum Erasure Value.go
│ │ ├── 1695. Maximum Erasure Value_test.go
│ │ └── README.md
│ ├── 1696.Jump-Game-VI/
│ │ ├── 1696. Jump Game VI.go
│ │ ├── 1696. Jump Game VI_test.go
│ │ └── README.md
│ ├── 1700.Number-of-Students-Unable-to-Eat-Lunch/
│ │ ├── 1700. Number of Students Unable to Eat Lunch.go
│ │ ├── 1700. Number of Students Unable to Eat Lunch_test.go
│ │ └── README.md
│ ├── 1704.Determine-if-String-Halves-Are-Alike/
│ │ ├── 1704. Determine if String Halves Are Alike.go
│ │ ├── 1704. Determine if String Halves Are Alike_test.go
│ │ └── README.md
│ ├── 1705.Maximum-Number-of-Eaten-Apples/
│ │ ├── 1705.Maximum Number of Eaten Apples.go
│ │ ├── 1705.Maximum Number of Eaten Apples_test.go
│ │ └── README.md
│ ├── 1710.Maximum-Units-on-a-Truck/
│ │ ├── 1710. Maximum Units on a Truck.go
│ │ ├── 1710. Maximum Units on a Truck_test.go
│ │ └── README.md
│ ├── 1716.Calculate-Money-in-Leetcode-Bank/
│ │ ├── 1716. Calculate Money in Leetcode Bank.go
│ │ ├── 1716. Calculate Money in Leetcode Bank_test.go
│ │ └── README.md
│ ├── 1720.Decode-XORed-Array/
│ │ ├── 1720. Decode XORed Array.go
│ │ ├── 1720. Decode XORed Array_test.go
│ │ └── README.md
│ ├── 1721.Swapping-Nodes-in-a-Linked-List/
│ │ ├── 1721. Swapping Nodes in a Linked List.go
│ │ ├── 1721. Swapping Nodes in a Linked List_test.go
│ │ └── README.md
│ ├── 1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/
│ │ ├── 1725. Number Of Rectangles That Can Form The Largest Square.go
│ │ ├── 1725. Number Of Rectangles That Can Form The Largest Square_test.go
│ │ └── README.md
│ ├── 1732.Find-the-Highest-Altitude/
│ │ ├── 1732. Find the Highest Altitude.go
│ │ ├── 1732. Find the Highest Altitude_test.go
│ │ └── README.md
│ ├── 1734.Decode-XORed-Permutation/
│ │ ├── 1734. Decode XORed Permutation.go
│ │ ├── 1734. Decode XORed Permutation_test.go
│ │ └── README.md
│ ├── 1736.Latest-Time-by-Replacing-Hidden-Digits/
│ │ ├── 1736. Latest Time by Replacing Hidden Digits.go
│ │ ├── 1736. Latest Time by Replacing Hidden Digits_test.go
│ │ └── README.md
│ ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value/
│ │ ├── 1738. Find Kth Largest XOR Coordinate Value.go
│ │ ├── 1738. Find Kth Largest XOR Coordinate Value_test.go
│ │ └── README.md
│ ├── 1742.Maximum-Number-of-Balls-in-a-Box/
│ │ ├── 1742. Maximum Number of Balls in a Box.go
│ │ ├── 1742. Maximum Number of Balls in a Box_test.go
│ │ └── README.md
│ ├── 1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/
│ │ ├── 1744. Can You Eat Your Favorite Candy on Your Favorite Day.go
│ │ ├── 1744. Can You Eat Your Favorite Candy on Your Favorite Day_test.go
│ │ └── README.md
│ ├── 1748.Sum-of-Unique-Elements/
│ │ ├── 1748. Sum of Unique Elements.go
│ │ ├── 1748. Sum of Unique Elements_test.go
│ │ └── README.md
│ ├── 1752.Check-if-Array-Is-Sorted-and-Rotated/
│ │ ├── 1752. Check if Array Is Sorted and Rotated.go
│ │ ├── 1752. Check if Array Is Sorted and Rotated_test.go
│ │ └── README.md
│ ├── 1758.Minimum-Changes-To-Make-Alternating-Binary-String/
│ │ ├── 1758. Minimum Changes To Make Alternating Binary String.go
│ │ ├── 1758. Minimum Changes To Make Alternating Binary String_test.go
│ │ └── README.md
│ ├── 1763.Longest-Nice-Substring/
│ │ ├── 1763. Longest Nice Substring.go
│ │ ├── 1763. Longest Nice Substring_test.go
│ │ └── README.md
│ ├── 1791.Find-Center-of-Star-Graph/
│ │ ├── 1791.Find Center of Star Graph.go
│ │ ├── 1791.Find Center of Star Graph_test.go
│ │ └── README.md
│ ├── 1816.Truncate-Sentence/
│ │ ├── 1816.Truncate Sentence.go
│ │ ├── 1816.Truncate Sentence_test.go
│ │ └── README.md
│ ├── 1818.Minimum-Absolute-Sum-Difference/
│ │ ├── 1818. Minimum Absolute Sum Difference.go
│ │ ├── 1818. Minimum Absolute Sum Difference_test.go
│ │ └── README.md
│ ├── 1846.Maximum-Element-After-Decreasing-and-Rearranging/
│ │ ├── 1846. Maximum Element After Decreasing and Rearranging.go
│ │ ├── 1846. Maximum Element After Decreasing and Rearranging_test.go
│ │ └── README.md
│ ├── 1877.Minimize-Maximum-Pair-Sum-in-Array/
│ │ ├── 1877. Minimize Maximum Pair Sum in Array.go
│ │ ├── 1877. Minimize Maximum Pair Sum in Array_test.go
│ │ └── README.md
│ ├── 1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/
│ │ ├── 1984.Minimum Difference Between Highest and Lowest of K Scores.go
│ │ ├── 1984.Minimum Difference Between Highest and Lowest of K Scores_test.go
│ │ └── README.md
│ ├── 2021.Brightest-Position-on-Street/
│ │ ├── 2021. Brightest Position on Street.go
│ │ ├── 2021. Brightest Position on Street_test.go
│ │ └── README.md
│ ├── 2022.Convert-1D-Array-Into-2D-Array/
│ │ ├── 2022. Convert 1D Array Into 2D Array.go
│ │ ├── 2022. Convert 1D Array Into 2D Array_test.go
│ │ └── README.md
│ ├── 2037.Minimum-Number-of-Moves-to-Seat-Everyone/
│ │ ├── 2037.Minimum Number of Moves to Seat Everyone.go
│ │ ├── 2037.Minimum Number of Moves to Seat Everyone_test.go
│ │ └── README.md
│ ├── 2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/
│ │ ├── 2038.Remove Colored Pieces if Both Neighbors are the Same Color.go
│ │ ├── 2038.Remove Colored Pieces if Both Neighbors are the Same Color_test.go
│ │ └── README.md
│ ├── 2043.Simple-Bank-System/
│ │ ├── 2043.Simple Bank System.go
│ │ ├── 2043.Simple Bank System_test.go
│ │ └── README.md
│ ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/
│ │ ├── 2096. Step-By-Step Directions From a Binary Tree Node to Another.go
│ │ ├── 2096. Step-By-Step Directions From a Binary Tree Node to Another_test.go
│ │ └── README.md
│ ├── 2164.Sort-Even-and-Odd-Indices-Independently/
│ │ ├── 2164. Sort Even and Odd Indices Independently.go
│ │ ├── 2164. Sort Even and Odd Indices Independently_test.go
│ │ └── README.md
│ ├── 2165.Smallest-Value-of-the-Rearranged-Number/
│ │ ├── 2165. Smallest Value of the Rearranged Number.go
│ │ ├── 2165. Smallest Value of the Rearranged Number_test.go
│ │ └── README.md
│ ├── 2166.Design-Bitset/
│ │ ├── 2166. Design Bitset.go
│ │ ├── 2166. Design Bitset_test.go
│ │ └── README.md
│ ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/
│ │ ├── 2167. Minimum Time to Remove All Cars Containing Illegal Goods.go
│ │ ├── 2167. Minimum Time to Remove All Cars Containing Illegal Goods_test.go
│ │ └── README.md
│ ├── 2169.Count-Operations-to-Obtain-Zero/
│ │ ├── 2169. Count Operations to Obtain Zero.go
│ │ ├── 2169. Count Operations to Obtain Zero_test.go
│ │ └── README.md
│ ├── 2170.Minimum-Operations-to-Make-the-Array-Alternating/
│ │ ├── 2170. Minimum Operations to Make the Array Alternating.go
│ │ ├── 2170. Minimum Operations to Make the Array Alternating_test.go
│ │ └── README.md
│ ├── 2171.Removing-Minimum-Number-of-Magic-Beans/
│ │ ├── 2171. Removing Minimum Number of Magic Beans.go
│ │ ├── 2171. Removing Minimum Number of Magic Beans_test.go
│ │ └── README.md
│ ├── 2180.Count-Integers-With-Even-Digit-Sum/
│ │ ├── 2180. Count Integers With Even Digit Sum.go
│ │ ├── 2180. Count Integers With Even Digit Sum_test.go
│ │ └── README.md
│ ├── 2181.Merge-Nodes-in-Between-Zeros/
│ │ ├── 2181. Merge Nodes in Between Zeros.go
│ │ ├── 2181. Merge Nodes in Between Zeros_test.go
│ │ └── README.md
│ ├── 2182.Construct-String-With-Repeat-Limit/
│ │ ├── 2182. Construct String With Repeat Limit.go
│ │ ├── 2182. Construct String With Repeat Limit_test.go
│ │ └── README.md
│ ├── 2183.Count-Array-Pairs-Divisible-by-K/
│ │ ├── 2183. Count Array Pairs Divisible by K.go
│ │ ├── 2183. Count Array Pairs Divisible by K_test.go
│ │ └── README.md
│ ├── 9990085.Maximal-Rectangle/
│ │ ├── 85. Maximal Rectangle.go
│ │ └── 85. Maximal Rectangle_test.go
│ ├── 9990132.Palindrome-Partitioning-II/
│ │ ├── 132. Palindrome Partitioning II.go
│ │ └── 132. Palindrome Partitioning II_test.go
│ ├── 9990316.Remove-Duplicate-Letters/
│ │ ├── 316. Remove Duplicate Letters.go
│ │ └── 316. Remove Duplicate Letters_test.go
│ ├── 9990352.Data-Stream-as-Disjoint-Intervals/
│ │ ├── 352. Data Stream as Disjoint Intervals.go
│ │ └── 352. Data Stream as Disjoint Intervals_test.go
│ ├── 9990363.Max-Sum-of-Rectangle-No-Larger-Than-K/
│ │ ├── 363. Max Sum of Rectangle No Larger Than K.go
│ │ └── 363. Max Sum of Rectangle No Larger Than K_test.go
│ ├── 9990975.Odd-Even-Jump/
│ │ ├── 975. Odd Even Jump.go
│ │ └── 975. Odd Even Jump_test.go
│ ├── 9991044.Longest-Duplicate-Substring/
│ │ ├── 1044. Longest Duplicate Substring.go
│ │ └── 1044. Longest Duplicate Substring_test.go
│ └── 9991292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/
│ ├── 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold.go
│ └── 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold_test.go
├── note/
│ ├── grokking_algorithms.md
│ └── time_complexity.md
├── structures/
│ ├── Heap.go
│ ├── Heap_test.go
│ ├── Interval.go
│ ├── Interval_test.go
│ ├── ListNode.go
│ ├── ListNode_test.go
│ ├── NestedInteger.go
│ ├── NestedInterger_test.go
│ ├── Point.go
│ ├── Point_test.go
│ ├── PriorityQueue.go
│ ├── PriorityQueue_test.go
│ ├── Queue.go
│ ├── Queue_test.go
│ ├── Stack.go
│ ├── Stack_test.go
│ ├── TreeNode.go
│ ├── TreeNode_test.go
│ ├── go.mod
│ └── go.sum
├── template/
│ ├── BIT.go
│ ├── BIT_test.go
│ ├── CLRUCache.go
│ ├── CLRUCache_test.go
│ ├── LFUCache.go
│ ├── LRUCache.go
│ ├── SegmentTree.go
│ ├── UnionFind.go
│ ├── bucket.go
│ ├── go.mod
│ └── go.sum
└── website/
├── archetypes/
│ └── default.md
├── content/
│ ├── ChapterFour/
│ │ ├── 0001~0099/
│ │ │ ├── 0001.Two-Sum.md
│ │ │ ├── 0002.Add-Two-Numbers.md
│ │ │ ├── 0003.Longest-Substring-Without-Repeating-Characters.md
│ │ │ ├── 0004.Median-of-Two-Sorted-Arrays.md
│ │ │ ├── 0005.Longest-Palindromic-Substring.md
│ │ │ ├── 0006.ZigZag-Conversion.md
│ │ │ ├── 0007.Reverse-Integer.md
│ │ │ ├── 0008.String-to-Integer-atoi.md
│ │ │ ├── 0009.Palindrome-Number.md
│ │ │ ├── 0011.Container-With-Most-Water.md
│ │ │ ├── 0012.Integer-to-Roman.md
│ │ │ ├── 0013.Roman-to-Integer.md
│ │ │ ├── 0014.Longest-Common-Prefix.md
│ │ │ ├── 0015.3Sum.md
│ │ │ ├── 0016.3Sum-Closest.md
│ │ │ ├── 0017.Letter-Combinations-of-a-Phone-Number.md
│ │ │ ├── 0018.4Sum.md
│ │ │ ├── 0019.Remove-Nth-Node-From-End-of-List.md
│ │ │ ├── 0020.Valid-Parentheses.md
│ │ │ ├── 0021.Merge-Two-Sorted-Lists.md
│ │ │ ├── 0022.Generate-Parentheses.md
│ │ │ ├── 0023.Merge-k-Sorted-Lists.md
│ │ │ ├── 0024.Swap-Nodes-in-Pairs.md
│ │ │ ├── 0025.Reverse-Nodes-in-k-Group.md
│ │ │ ├── 0026.Remove-Duplicates-from-Sorted-Array.md
│ │ │ ├── 0027.Remove-Element.md
│ │ │ ├── 0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
│ │ │ ├── 0029.Divide-Two-Integers.md
│ │ │ ├── 0030.Substring-with-Concatenation-of-All-Words.md
│ │ │ ├── 0031.Next-Permutation.md
│ │ │ ├── 0032.Longest-Valid-Parentheses.md
│ │ │ ├── 0033.Search-in-Rotated-Sorted-Array.md
│ │ │ ├── 0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
│ │ │ ├── 0035.Search-Insert-Position.md
│ │ │ ├── 0036.Valid-Sudoku.md
│ │ │ ├── 0037.Sudoku-Solver.md
│ │ │ ├── 0039.Combination-Sum.md
│ │ │ ├── 0040.Combination-Sum-II.md
│ │ │ ├── 0041.First-Missing-Positive.md
│ │ │ ├── 0042.Trapping-Rain-Water.md
│ │ │ ├── 0043.Multiply-Strings.md
│ │ │ ├── 0045.Jump-Game-II.md
│ │ │ ├── 0046.Permutations.md
│ │ │ ├── 0047.Permutations-II.md
│ │ │ ├── 0048.Rotate-Image.md
│ │ │ ├── 0049.Group-Anagrams.md
│ │ │ ├── 0050.Powx-n.md
│ │ │ ├── 0051.N-Queens.md
│ │ │ ├── 0052.N-Queens-II.md
│ │ │ ├── 0053.Maximum-Subarray.md
│ │ │ ├── 0054.Spiral-Matrix.md
│ │ │ ├── 0055.Jump-Game.md
│ │ │ ├── 0056.Merge-Intervals.md
│ │ │ ├── 0057.Insert-Interval.md
│ │ │ ├── 0058.Length-of-Last-Word.md
│ │ │ ├── 0059.Spiral-Matrix-II.md
│ │ │ ├── 0060.Permutation-Sequence.md
│ │ │ ├── 0061.Rotate-List.md
│ │ │ ├── 0062.Unique-Paths.md
│ │ │ ├── 0063.Unique-Paths-II.md
│ │ │ ├── 0064.Minimum-Path-Sum.md
│ │ │ ├── 0065.Valid-Number.md
│ │ │ ├── 0066.Plus-One.md
│ │ │ ├── 0067.Add-Binary.md
│ │ │ ├── 0069.Sqrtx.md
│ │ │ ├── 0070.Climbing-Stairs.md
│ │ │ ├── 0071.Simplify-Path.md
│ │ │ ├── 0073.Set-Matrix-Zeroes.md
│ │ │ ├── 0074.Search-a-2D-Matrix.md
│ │ │ ├── 0075.Sort-Colors.md
│ │ │ ├── 0076.Minimum-Window-Substring.md
│ │ │ ├── 0077.Combinations.md
│ │ │ ├── 0078.Subsets.md
│ │ │ ├── 0079.Word-Search.md
│ │ │ ├── 0080.Remove-Duplicates-from-Sorted-Array-II.md
│ │ │ ├── 0081.Search-in-Rotated-Sorted-Array-II.md
│ │ │ ├── 0082.Remove-Duplicates-from-Sorted-List-II.md
│ │ │ ├── 0083.Remove-Duplicates-from-Sorted-List.md
│ │ │ ├── 0084.Largest-Rectangle-in-Histogram.md
│ │ │ ├── 0086.Partition-List.md
│ │ │ ├── 0088.Merge-Sorted-Array.md
│ │ │ ├── 0089.Gray-Code.md
│ │ │ ├── 0090.Subsets-II.md
│ │ │ ├── 0091.Decode-Ways.md
│ │ │ ├── 0092.Reverse-Linked-List-II.md
│ │ │ ├── 0093.Restore-IP-Addresses.md
│ │ │ ├── 0094.Binary-Tree-Inorder-Traversal.md
│ │ │ ├── 0095.Unique-Binary-Search-Trees-II.md
│ │ │ ├── 0096.Unique-Binary-Search-Trees.md
│ │ │ ├── 0097.Interleaving-String.md
│ │ │ ├── 0098.Validate-Binary-Search-Tree.md
│ │ │ ├── 0099.Recover-Binary-Search-Tree.md
│ │ │ └── _index.md
│ │ ├── 0100~0199/
│ │ │ ├── 0100.Same-Tree.md
│ │ │ ├── 0101.Symmetric-Tree.md
│ │ │ ├── 0102.Binary-Tree-Level-Order-Traversal.md
│ │ │ ├── 0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
│ │ │ ├── 0104.Maximum-Depth-of-Binary-Tree.md
│ │ │ ├── 0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
│ │ │ ├── 0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
│ │ │ ├── 0107.Binary-Tree-Level-Order-Traversal-II.md
│ │ │ ├── 0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
│ │ │ ├── 0109.Convert-Sorted-List-to-Binary-Search-Tree.md
│ │ │ ├── 0110.Balanced-Binary-Tree.md
│ │ │ ├── 0111.Minimum-Depth-of-Binary-Tree.md
│ │ │ ├── 0112.Path-Sum.md
│ │ │ ├── 0113.Path-Sum-II.md
│ │ │ ├── 0114.Flatten-Binary-Tree-to-Linked-List.md
│ │ │ ├── 0115.Distinct-Subsequences.md
│ │ │ ├── 0116.Populating-Next-Right-Pointers-in-Each-Node.md
│ │ │ ├── 0118.Pascals-Triangle.md
│ │ │ ├── 0119.Pascals-Triangle-II.md
│ │ │ ├── 0120.Triangle.md
│ │ │ ├── 0121.Best-Time-to-Buy-and-Sell-Stock.md
│ │ │ ├── 0122.Best-Time-to-Buy-and-Sell-Stock-II.md
│ │ │ ├── 0124.Binary-Tree-Maximum-Path-Sum.md
│ │ │ ├── 0125.Valid-Palindrome.md
│ │ │ ├── 0126.Word-Ladder-II.md
│ │ │ ├── 0127.Word-Ladder.md
│ │ │ ├── 0128.Longest-Consecutive-Sequence.md
│ │ │ ├── 0129.Sum-Root-to-Leaf-Numbers.md
│ │ │ ├── 0130.Surrounded-Regions.md
│ │ │ ├── 0131.Palindrome-Partitioning.md
│ │ │ ├── 0135.Candy.md
│ │ │ ├── 0136.Single-Number.md
│ │ │ ├── 0137.Single-Number-II.md
│ │ │ ├── 0138.Copy-List-With-Random-Pointer.md
│ │ │ ├── 0141.Linked-List-Cycle.md
│ │ │ ├── 0142.Linked-List-Cycle-II.md
│ │ │ ├── 0143.Reorder-List.md
│ │ │ ├── 0144.Binary-Tree-Preorder-Traversal.md
│ │ │ ├── 0145.Binary-Tree-Postorder-Traversal.md
│ │ │ ├── 0146.LRU-Cache.md
│ │ │ ├── 0147.Insertion-Sort-List.md
│ │ │ ├── 0148.Sort-List.md
│ │ │ ├── 0150.Evaluate-Reverse-Polish-Notation.md
│ │ │ ├── 0151.Reverse-Words-in-a-String.md
│ │ │ ├── 0152.Maximum-Product-Subarray.md
│ │ │ ├── 0153.Find-Minimum-in-Rotated-Sorted-Array.md
│ │ │ ├── 0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
│ │ │ ├── 0155.Min-Stack.md
│ │ │ ├── 0160.Intersection-of-Two-Linked-Lists.md
│ │ │ ├── 0162.Find-Peak-Element.md
│ │ │ ├── 0164.Maximum-Gap.md
│ │ │ ├── 0167.Two-Sum-II-Input-array-is-sorted.md
│ │ │ ├── 0168.Excel-Sheet-Column-Title.md
│ │ │ ├── 0169.Majority-Element.md
│ │ │ ├── 0171.Excel-Sheet-Column-Number.md
│ │ │ ├── 0172.Factorial-Trailing-Zeroes.md
│ │ │ ├── 0173.Binary-Search-Tree-Iterator.md
│ │ │ ├── 0174.Dungeon-Game.md
│ │ │ ├── 0179.Largest-Number.md
│ │ │ ├── 0187.Repeated-DNA-Sequences.md
│ │ │ ├── 0189.Rotate-Array.md
│ │ │ ├── 0190.Reverse-Bits.md
│ │ │ ├── 0191.Number-of-1-Bits.md
│ │ │ ├── 0198.House-Robber.md
│ │ │ ├── 0199.Binary-Tree-Right-Side-View.md
│ │ │ └── _index.md
│ │ ├── 0200~0299/
│ │ │ ├── 0200.Number-of-Islands.md
│ │ │ ├── 0201.Bitwise-AND-of-Numbers-Range.md
│ │ │ ├── 0202.Happy-Number.md
│ │ │ ├── 0203.Remove-Linked-List-Elements.md
│ │ │ ├── 0204.Count-Primes.md
│ │ │ ├── 0205.Isomorphic-Strings.md
│ │ │ ├── 0206.Reverse-Linked-List.md
│ │ │ ├── 0207.Course-Schedule.md
│ │ │ ├── 0208.Implement-Trie-Prefix-Tree.md
│ │ │ ├── 0209.Minimum-Size-Subarray-Sum.md
│ │ │ ├── 0210.Course-Schedule-II.md
│ │ │ ├── 0211.Design-Add-and-Search-Words-Data-Structure.md
│ │ │ ├── 0212.Word-Search-II.md
│ │ │ ├── 0213.House-Robber-II.md
│ │ │ ├── 0215.Kth-Largest-Element-in-an-Array.md
│ │ │ ├── 0216.Combination-Sum-III.md
│ │ │ ├── 0217.Contains-Duplicate.md
│ │ │ ├── 0218.The-Skyline-Problem.md
│ │ │ ├── 0219.Contains-Duplicate-II.md
│ │ │ ├── 0220.Contains-Duplicate-III.md
│ │ │ ├── 0222.Count-Complete-Tree-Nodes.md
│ │ │ ├── 0223.Rectangle-Area.md
│ │ │ ├── 0224.Basic-Calculator.md
│ │ │ ├── 0225.Implement-Stack-using-Queues.md
│ │ │ ├── 0226.Invert-Binary-Tree.md
│ │ │ ├── 0227.Basic-Calculator-II.md
│ │ │ ├── 0228.Summary-Ranges.md
│ │ │ ├── 0229.Majority-Element-II.md
│ │ │ ├── 0230.Kth-Smallest-Element-in-a-BST.md
│ │ │ ├── 0231.Power-of-Two.md
│ │ │ ├── 0232.Implement-Queue-using-Stacks.md
│ │ │ ├── 0234.Palindrome-Linked-List.md
│ │ │ ├── 0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
│ │ │ ├── 0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
│ │ │ ├── 0237.Delete-Node-in-a-Linked-List.md
│ │ │ ├── 0239.Sliding-Window-Maximum.md
│ │ │ ├── 0240.Search-a-2D-Matrix-II.md
│ │ │ ├── 0242.Valid-Anagram.md
│ │ │ ├── 0257.Binary-Tree-Paths.md
│ │ │ ├── 0258.Add-Digits.md
│ │ │ ├── 0260.Single-Number-III.md
│ │ │ ├── 0263.Ugly-Number.md
│ │ │ ├── 0264.Ugly-Number-II.md
│ │ │ ├── 0268.Missing-Number.md
│ │ │ ├── 0274.H-Index.md
│ │ │ ├── 0275.H-Index-II.md
│ │ │ ├── 0278.First-Bad-Version.md
│ │ │ ├── 0279.Perfect-Squares.md
│ │ │ ├── 0283.Move-Zeroes.md
│ │ │ ├── 0284.Peeking-Iterator.md
│ │ │ ├── 0287.Find-the-Duplicate-Number.md
│ │ │ ├── 0290.Word-Pattern.md
│ │ │ ├── 0297.Serialize-and-Deserialize-Binary-Tree.md
│ │ │ ├── 0299.Bulls-and-Cows.md
│ │ │ └── _index.md
│ │ ├── 0300~0399/
│ │ │ ├── 0300.Longest-Increasing-Subsequence.md
│ │ │ ├── 0301.Remove-Invalid-Parentheses.md
│ │ │ ├── 0303.Range-Sum-Query-Immutable.md
│ │ │ ├── 0304.Range-Sum-Query-2D-Immutable.md
│ │ │ ├── 0306.Additive-Number.md
│ │ │ ├── 0307.Range-Sum-Query-Mutable.md
│ │ │ ├── 0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
│ │ │ ├── 0315.Count-of-Smaller-Numbers-After-Self.md
│ │ │ ├── 0318.Maximum-Product-of-Word-Lengths.md
│ │ │ ├── 0319.Bulb-Switcher.md
│ │ │ ├── 0322.Coin-Change.md
│ │ │ ├── 0324.Wiggle-Sort-II.md
│ │ │ ├── 0326.Power-of-Three.md
│ │ │ ├── 0327.Count-of-Range-Sum.md
│ │ │ ├── 0328.Odd-Even-Linked-List.md
│ │ │ ├── 0329.Longest-Increasing-Path-in-a-Matrix.md
│ │ │ ├── 0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
│ │ │ ├── 0337.House-Robber-III.md
│ │ │ ├── 0338.Counting-Bits.md
│ │ │ ├── 0341.Flatten-Nested-List-Iterator.md
│ │ │ ├── 0342.Power-of-Four.md
│ │ │ ├── 0343.Integer-Break.md
│ │ │ ├── 0344.Reverse-String.md
│ │ │ ├── 0345.Reverse-Vowels-of-a-String.md
│ │ │ ├── 0347.Top-K-Frequent-Elements.md
│ │ │ ├── 0349.Intersection-of-Two-Arrays.md
│ │ │ ├── 0350.Intersection-of-Two-Arrays-II.md
│ │ │ ├── 0352.Data-Stream-as-Disjoint-Intervals.md
│ │ │ ├── 0354.Russian-Doll-Envelopes.md
│ │ │ ├── 0357.Count-Numbers-with-Unique-Digits.md
│ │ │ ├── 0367.Valid-Perfect-Square.md
│ │ │ ├── 0368.Largest-Divisible-Subset.md
│ │ │ ├── 0371.Sum-of-Two-Integers.md
│ │ │ ├── 0372.Super-Pow.md
│ │ │ ├── 0373.Find-K-Pairs-with-Smallest-Sums.md
│ │ │ ├── 0374.Guess-Number-Higher-or-Lower.md
│ │ │ ├── 0376.Wiggle-Subsequence.md
│ │ │ ├── 0377.Combination-Sum-IV.md
│ │ │ ├── 0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
│ │ │ ├── 0382.Linked-List-Random-Node.md
│ │ │ ├── 0383.Ransom-Note.md
│ │ │ ├── 0384.Shuffle-an-Array.md
│ │ │ ├── 0385.Mini-Parser.md
│ │ │ ├── 0386.Lexicographical-Numbers.md
│ │ │ ├── 0387.First-Unique-Character-in-a-String.md
│ │ │ ├── 0389.Find-the-Difference.md
│ │ │ ├── 0390.Elimination-Game.md
│ │ │ ├── 0391.Perfect-Rectangle.md
│ │ │ ├── 0392.Is-Subsequence.md
│ │ │ ├── 0393.UTF-8-Validation.md
│ │ │ ├── 0394.Decode-String.md
│ │ │ ├── 0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
│ │ │ ├── 0396.Rotate-Function.md
│ │ │ ├── 0397.Integer-Replacement.md
│ │ │ ├── 0399.Evaluate-Division.md
│ │ │ └── _index.md
│ │ ├── 0400~0499/
│ │ │ ├── 0400.Nth-Digit.md
│ │ │ ├── 0401.Binary-Watch.md
│ │ │ ├── 0402.Remove-K-Digits.md
│ │ │ ├── 0404.Sum-of-Left-Leaves.md
│ │ │ ├── 0405.Convert-a-Number-to-Hexadecimal.md
│ │ │ ├── 0409.Longest-Palindrome.md
│ │ │ ├── 0410.Split-Array-Largest-Sum.md
│ │ │ ├── 0412.Fizz-Buzz.md
│ │ │ ├── 0413.Arithmetic-Slices.md
│ │ │ ├── 0414.Third-Maximum-Number.md
│ │ │ ├── 0416.Partition-Equal-Subset-Sum.md
│ │ │ ├── 0417.Pacific-Atlantic-Water-Flow.md
│ │ │ ├── 0419.Battleships-in-a-Board.md
│ │ │ ├── 0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
│ │ │ ├── 0423.Reconstruct-Original-Digits-from-English.md
│ │ │ ├── 0424.Longest-Repeating-Character-Replacement.md
│ │ │ ├── 0429.N-ary-Tree-Level-Order-Traversal.md
│ │ │ ├── 0433.Minimum-Genetic-Mutation.md
│ │ │ ├── 0434.Number-of-Segments-in-a-String.md
│ │ │ ├── 0435.Non-overlapping-Intervals.md
│ │ │ ├── 0436.Find-Right-Interval.md
│ │ │ ├── 0437.Path-Sum-III.md
│ │ │ ├── 0438.Find-All-Anagrams-in-a-String.md
│ │ │ ├── 0441.Arranging-Coins.md
│ │ │ ├── 0445.Add-Two-Numbers-II.md
│ │ │ ├── 0447.Number-of-Boomerangs.md
│ │ │ ├── 0448.Find-All-Numbers-Disappeared-in-an-Array.md
│ │ │ ├── 0451.Sort-Characters-By-Frequency.md
│ │ │ ├── 0453.Minimum-Moves-to-Equal-Array-Elements.md
│ │ │ ├── 0454.4Sum-II.md
│ │ │ ├── 0455.Assign-Cookies.md
│ │ │ ├── 0456.132-Pattern.md
│ │ │ ├── 0457.Circular-Array-Loop.md
│ │ │ ├── 0458.Poor-Pigs.md
│ │ │ ├── 0460.LFU-Cache.md
│ │ │ ├── 0461.Hamming-Distance.md
│ │ │ ├── 0462.Minimum-Moves-to-Equal-Array-Elements-II.md
│ │ │ ├── 0463.Island-Perimeter.md
│ │ │ ├── 0470.Implement-Rand10-Using-Rand7.md
│ │ │ ├── 0473.Matchsticks-to-Square.md
│ │ │ ├── 0474.Ones-and-Zeroes.md
│ │ │ ├── 0475.Heaters.md
│ │ │ ├── 0476.Number-Complement.md
│ │ │ ├── 0477.Total-Hamming-Distance.md
│ │ │ ├── 0478.Generate-Random-Point-in-a-Circle.md
│ │ │ ├── 0480.Sliding-Window-Median.md
│ │ │ ├── 0483.Smallest-Good-Base.md
│ │ │ ├── 0485.Max-Consecutive-Ones.md
│ │ │ ├── 0488.Zuma-Game.md
│ │ │ ├── 0491.Non-decreasing-Subsequences.md
│ │ │ ├── 0492.Construct-the-Rectangle.md
│ │ │ ├── 0493.Reverse-Pairs.md
│ │ │ ├── 0494.Target-Sum.md
│ │ │ ├── 0495.Teemo-Attacking.md
│ │ │ ├── 0496.Next-Greater-Element-I.md
│ │ │ ├── 0497.Random-Point-in-Non-overlapping-Rectangles.md
│ │ │ ├── 0498.Diagonal-Traverse.md
│ │ │ └── _index.md
│ │ ├── 0500~0599/
│ │ │ ├── 0500.Keyboard-Row.md
│ │ │ ├── 0503.Next-Greater-Element-II.md
│ │ │ ├── 0504.Base-7.md
│ │ │ ├── 0506.Relative-Ranks.md
│ │ │ ├── 0507.Perfect-Number.md
│ │ │ ├── 0508.Most-Frequent-Subtree-Sum.md
│ │ │ ├── 0509.Fibonacci-Number.md
│ │ │ ├── 0513.Find-Bottom-Left-Tree-Value.md
│ │ │ ├── 0515.Find-Largest-Value-in-Each-Tree-Row.md
│ │ │ ├── 0518.Coin-Change-II.md
│ │ │ ├── 0519.Random-Flip-Matrix.md
│ │ │ ├── 0520.Detect-Capital.md
│ │ │ ├── 0523.Continuous-Subarray-Sum.md
│ │ │ ├── 0524.Longest-Word-in-Dictionary-through-Deleting.md
│ │ │ ├── 0525.Contiguous-Array.md
│ │ │ ├── 0526.Beautiful-Arrangement.md
│ │ │ ├── 0528.Random-Pick-with-Weight.md
│ │ │ ├── 0529.Minesweeper.md
│ │ │ ├── 0530.Minimum-Absolute-Difference-in-BST.md
│ │ │ ├── 0532.K-diff-Pairs-in-an-Array.md
│ │ │ ├── 0535.Encode-and-Decode-TinyURL.md
│ │ │ ├── 0537.Complex-Number-Multiplication.md
│ │ │ ├── 0538.Convert-BST-to-Greater-Tree.md
│ │ │ ├── 0540.Single-Element-in-a-Sorted-Array.md
│ │ │ ├── 0541.Reverse-String-II.md
│ │ │ ├── 0542.01-Matrix.md
│ │ │ ├── 0543.Diameter-of-Binary-Tree.md
│ │ │ ├── 0547.Number-of-Provinces.md
│ │ │ ├── 0551.Student-Attendance-Record-I.md
│ │ │ ├── 0554.Brick-Wall.md
│ │ │ ├── 0557.Reverse-Words-in-a-String-III.md
│ │ │ ├── 0559.Maximum-Depth-of-N-ary-Tree.md
│ │ │ ├── 0560.Subarray-Sum-Equals-K.md
│ │ │ ├── 0561.Array-Partition.md
│ │ │ ├── 0563.Binary-Tree-Tilt.md
│ │ │ ├── 0566.Reshape-the-Matrix.md
│ │ │ ├── 0567.Permutation-in-String.md
│ │ │ ├── 0572.Subtree-of-Another-Tree.md
│ │ │ ├── 0575.Distribute-Candies.md
│ │ │ ├── 0576.Out-of-Boundary-Paths.md
│ │ │ ├── 0581.Shortest-Unsorted-Continuous-Subarray.md
│ │ │ ├── 0583.Delete-Operation-for-Two-Strings.md
│ │ │ ├── 0589.N-ary-Tree-Preorder-Traversal.md
│ │ │ ├── 0594.Longest-Harmonious-Subsequence.md
│ │ │ ├── 0598.Range-Addition-II.md
│ │ │ ├── 0599.Minimum-Index-Sum-of-Two-Lists.md
│ │ │ └── _index.md
│ │ ├── 0600~0699/
│ │ │ ├── 0605.Can-Place-Flowers.md
│ │ │ ├── 0609.Find-Duplicate-File-in-System.md
│ │ │ ├── 0611.Valid-Triangle-Number.md
│ │ │ ├── 0617.Merge-Two-Binary-Trees.md
│ │ │ ├── 0622.Design-Circular-Queue.md
│ │ │ ├── 0623.Add-One-Row-to-Tree.md
│ │ │ ├── 0628.Maximum-Product-of-Three-Numbers.md
│ │ │ ├── 0630.Course-Schedule-III.md
│ │ │ ├── 0632.Smallest-Range-Covering-Elements-from-K-Lists.md
│ │ │ ├── 0633.Sum-of-Square-Numbers.md
│ │ │ ├── 0636.Exclusive-Time-of-Functions.md
│ │ │ ├── 0637.Average-of-Levels-in-Binary-Tree.md
│ │ │ ├── 0638.Shopping-Offers.md
│ │ │ ├── 0643.Maximum-Average-Subarray-I.md
│ │ │ ├── 0645.Set-Mismatch.md
│ │ │ ├── 0647.Palindromic-Substrings.md
│ │ │ ├── 0648.Replace-Words.md
│ │ │ ├── 0653.Two-Sum-IV-Input-is-a-BST.md
│ │ │ ├── 0658.Find-K-Closest-Elements.md
│ │ │ ├── 0661.Image-Smoother.md
│ │ │ ├── 0662.Maximum-Width-of-Binary-Tree.md
│ │ │ ├── 0665.Non-decreasing-Array.md
│ │ │ ├── 0667.Beautiful-Arrangement-II.md
│ │ │ ├── 0668.Kth-Smallest-Number-in-Multiplication-Table.md
│ │ │ ├── 0669.Trim-a-Binary-Search-Tree.md
│ │ │ ├── 0674.Longest-Continuous-Increasing-Subsequence.md
│ │ │ ├── 0676.Implement-Magic-Dictionary.md
│ │ │ ├── 0677.Map-Sum-Pairs.md
│ │ │ ├── 0682.Baseball-Game.md
│ │ │ ├── 0684.Redundant-Connection.md
│ │ │ ├── 0685.Redundant-Connection-II.md
│ │ │ ├── 0690.Employee-Importance.md
│ │ │ ├── 0692.Top-K-Frequent-Words.md
│ │ │ ├── 0693.Binary-Number-with-Alternating-Bits.md
│ │ │ ├── 0695.Max-Area-of-Island.md
│ │ │ ├── 0696.Count-Binary-Substrings.md
│ │ │ ├── 0697.Degree-of-an-Array.md
│ │ │ ├── 0699.Falling-Squares.md
│ │ │ └── _index.md
│ │ ├── 0700~0799/
│ │ │ ├── 0700.Search-in-a-Binary-Search-Tree.md
│ │ │ ├── 0701.Insert-into-a-Binary-Search-Tree.md
│ │ │ ├── 0703.Kth-Largest-Element-in-a-Stream.md
│ │ │ ├── 0704.Binary-Search.md
│ │ │ ├── 0705.Design-HashSet.md
│ │ │ ├── 0706.Design-HashMap.md
│ │ │ ├── 0707.Design-Linked-List.md
│ │ │ ├── 0709.To-Lower-Case.md
│ │ │ ├── 0710.Random-Pick-with-Blacklist.md
│ │ │ ├── 0713.Subarray-Product-Less-Than-K.md
│ │ │ ├── 0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
│ │ │ ├── 0715.Range-Module.md
│ │ │ ├── 0717.1-bit-and-2-bit-Characters.md
│ │ │ ├── 0718.Maximum-Length-of-Repeated-Subarray.md
│ │ │ ├── 0719.Find-K-th-Smallest-Pair-Distance.md
│ │ │ ├── 0720.Longest-Word-in-Dictionary.md
│ │ │ ├── 0721.Accounts-Merge.md
│ │ │ ├── 0724.Find-Pivot-Index.md
│ │ │ ├── 0725.Split-Linked-List-in-Parts.md
│ │ │ ├── 0726.Number-of-Atoms.md
│ │ │ ├── 0728.Self-Dividing-Numbers.md
│ │ │ ├── 0729.My-Calendar-I.md
│ │ │ ├── 0732.My-Calendar-III.md
│ │ │ ├── 0733.Flood-Fill.md
│ │ │ ├── 0735.Asteroid-Collision.md
│ │ │ ├── 0739.Daily-Temperatures.md
│ │ │ ├── 0744.Find-Smallest-Letter-Greater-Than-Target.md
│ │ │ ├── 0745.Prefix-and-Suffix-Search.md
│ │ │ ├── 0746.Min-Cost-Climbing-Stairs.md
│ │ │ ├── 0747.Largest-Number-At-Least-Twice-of-Others.md
│ │ │ ├── 0748.Shortest-Completing-Word.md
│ │ │ ├── 0752.Open-the-Lock.md
│ │ │ ├── 0753.Cracking-the-Safe.md
│ │ │ ├── 0756.Pyramid-Transition-Matrix.md
│ │ │ ├── 0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
│ │ │ ├── 0763.Partition-Labels.md
│ │ │ ├── 0765.Couples-Holding-Hands.md
│ │ │ ├── 0766.Toeplitz-Matrix.md
│ │ │ ├── 0767.Reorganize-String.md
│ │ │ ├── 0771.Jewels-and-Stones.md
│ │ │ ├── 0775.Global-and-Local-Inversions.md
│ │ │ ├── 0778.Swim-in-Rising-Water.md
│ │ │ ├── 0781.Rabbits-in-Forest.md
│ │ │ ├── 0783.Minimum-Distance-Between-BST-Nodes.md
│ │ │ ├── 0784.Letter-Case-Permutation.md
│ │ │ ├── 0785.Is-Graph-Bipartite.md
│ │ │ ├── 0786.K-th-Smallest-Prime-Fraction.md
│ │ │ ├── 0791.Custom-Sort-String.md
│ │ │ ├── 0792.Number-of-Matching-Subsequences.md
│ │ │ ├── 0793.Preimage-Size-of-Factorial-Zeroes-Function.md
│ │ │ ├── 0794.Valid-Tic-Tac-Toe-State.md
│ │ │ ├── 0795.Number-of-Subarrays-with-Bounded-Maximum.md
│ │ │ └── _index.md
│ │ ├── 0800~0899/
│ │ │ ├── 0802.Find-Eventual-Safe-States.md
│ │ │ ├── 0803.Bricks-Falling-When-Hit.md
│ │ │ ├── 0807.Max-Increase-to-Keep-City-Skyline.md
│ │ │ ├── 0810.Chalkboard-XOR-Game.md
│ │ │ ├── 0811.Subdomain-Visit-Count.md
│ │ │ ├── 0812.Largest-Triangle-Area.md
│ │ │ ├── 0815.Bus-Routes.md
│ │ │ ├── 0816.Ambiguous-Coordinates.md
│ │ │ ├── 0817.Linked-List-Components.md
│ │ │ ├── 0819.Most-Common-Word.md
│ │ │ ├── 0820.Short-Encoding-of-Words.md
│ │ │ ├── 0821.Shortest-Distance-to-a-Character.md
│ │ │ ├── 0823.Binary-Trees-With-Factors.md
│ │ │ ├── 0825.Friends-Of-Appropriate-Ages.md
│ │ │ ├── 0826.Most-Profit-Assigning-Work.md
│ │ │ ├── 0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
│ │ │ ├── 0830.Positions-of-Large-Groups.md
│ │ │ ├── 0832.Flipping-an-Image.md
│ │ │ ├── 0834.Sum-of-Distances-in-Tree.md
│ │ │ ├── 0836.Rectangle-Overlap.md
│ │ │ ├── 0838.Push-Dominoes.md
│ │ │ ├── 0839.Similar-String-Groups.md
│ │ │ ├── 0841.Keys-and-Rooms.md
│ │ │ ├── 0842.Split-Array-into-Fibonacci-Sequence.md
│ │ │ ├── 0844.Backspace-String-Compare.md
│ │ │ ├── 0845.Longest-Mountain-in-Array.md
│ │ │ ├── 0846.Hand-of-Straights.md
│ │ │ ├── 0850.Rectangle-Area-II.md
│ │ │ ├── 0851.Loud-and-Rich.md
│ │ │ ├── 0852.Peak-Index-in-a-Mountain-Array.md
│ │ │ ├── 0853.Car-Fleet.md
│ │ │ ├── 0856.Score-of-Parentheses.md
│ │ │ ├── 0859.Buddy-Strings.md
│ │ │ ├── 0862.Shortest-Subarray-with-Sum-at-Least-K.md
│ │ │ ├── 0863.All-Nodes-Distance-K-in-Binary-Tree.md
│ │ │ ├── 0864.Shortest-Path-to-Get-All-Keys.md
│ │ │ ├── 0867.Transpose-Matrix.md
│ │ │ ├── 0869.Reordered-Power-of-2.md
│ │ │ ├── 0870.Advantage-Shuffle.md
│ │ │ ├── 0872.Leaf-Similar-Trees.md
│ │ │ ├── 0874.Walking-Robot-Simulation.md
│ │ │ ├── 0875.Koko-Eating-Bananas.md
│ │ │ ├── 0876.Middle-of-the-Linked-List.md
│ │ │ ├── 0877.Stone-Game.md
│ │ │ ├── 0878.Nth-Magical-Number.md
│ │ │ ├── 0880.Decoded-String-at-Index.md
│ │ │ ├── 0881.Boats-to-Save-People.md
│ │ │ ├── 0884.Uncommon-Words-from-Two-Sentences.md
│ │ │ ├── 0885.Spiral-Matrix-III.md
│ │ │ ├── 0887.Super-Egg-Drop.md
│ │ │ ├── 0888.Fair-Candy-Swap.md
│ │ │ ├── 0890.Find-and-Replace-Pattern.md
│ │ │ ├── 0891.Sum-of-Subsequence-Widths.md
│ │ │ ├── 0892.Surface-Area-of-3D-Shapes.md
│ │ │ ├── 0895.Maximum-Frequency-Stack.md
│ │ │ ├── 0896.Monotonic-Array.md
│ │ │ ├── 0897.Increasing-Order-Search-Tree.md
│ │ │ ├── 0898.Bitwise-ORs-of-Subarrays.md
│ │ │ └── _index.md
│ │ ├── 0900~0999/
│ │ │ ├── 0901.Online-Stock-Span.md
│ │ │ ├── 0904.Fruit-Into-Baskets.md
│ │ │ ├── 0907.Sum-of-Subarray-Minimums.md
│ │ │ ├── 0909.Snakes-and-Ladders.md
│ │ │ ├── 0910.Smallest-Range-II.md
│ │ │ ├── 0911.Online-Election.md
│ │ │ ├── 0914.X-of-a-Kind-in-a-Deck-of-Cards.md
│ │ │ ├── 0916.Word-Subsets.md
│ │ │ ├── 0918.Maximum-Sum-Circular-Subarray.md
│ │ │ ├── 0920.Number-of-Music-Playlists.md
│ │ │ ├── 0921.Minimum-Add-to-Make-Parentheses-Valid.md
│ │ │ ├── 0922.Sort-Array-By-Parity-II.md
│ │ │ ├── 0923.3Sum-With-Multiplicity.md
│ │ │ ├── 0924.Minimize-Malware-Spread.md
│ │ │ ├── 0925.Long-Pressed-Name.md
│ │ │ ├── 0927.Three-Equal-Parts.md
│ │ │ ├── 0928.Minimize-Malware-Spread-II.md
│ │ │ ├── 0930.Binary-Subarrays-With-Sum.md
│ │ │ ├── 0933.Number-of-Recent-Calls.md
│ │ │ ├── 0938.Range-Sum-of-BST.md
│ │ │ ├── 0942.DI-String-Match.md
│ │ │ ├── 0946.Validate-Stack-Sequences.md
│ │ │ ├── 0947.Most-Stones-Removed-with-Same-Row-or-Column.md
│ │ │ ├── 0949.Largest-Time-for-Given-Digits.md
│ │ │ ├── 0952.Largest-Component-Size-by-Common-Factor.md
│ │ │ ├── 0953.Verifying-an-Alien-Dictionary.md
│ │ │ ├── 0958.Check-Completeness-of-a-Binary-Tree.md
│ │ │ ├── 0959.Regions-Cut-By-Slashes.md
│ │ │ ├── 0961.N-Repeated-Element-in-Size-2N-Array.md
│ │ │ ├── 0966.Vowel-Spellchecker.md
│ │ │ ├── 0968.Binary-Tree-Cameras.md
│ │ │ ├── 0969.Pancake-Sorting.md
│ │ │ ├── 0970.Powerful-Integers.md
│ │ │ ├── 0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
│ │ │ ├── 0973.K-Closest-Points-to-Origin.md
│ │ │ ├── 0976.Largest-Perimeter-Triangle.md
│ │ │ ├── 0977.Squares-of-a-Sorted-Array.md
│ │ │ ├── 0978.Longest-Turbulent-Subarray.md
│ │ │ ├── 0979.Distribute-Coins-in-Binary-Tree.md
│ │ │ ├── 0980.Unique-Paths-III.md
│ │ │ ├── 0981.Time-Based-Key-Value-Store.md
│ │ │ ├── 0984.String-Without-AAA-or-BBB.md
│ │ │ ├── 0985.Sum-of-Even-Numbers-After-Queries.md
│ │ │ ├── 0986.Interval-List-Intersections.md
│ │ │ ├── 0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
│ │ │ ├── 0989.Add-to-Array-Form-of-Integer.md
│ │ │ ├── 0990.Satisfiability-of-Equality-Equations.md
│ │ │ ├── 0991.Broken-Calculator.md
│ │ │ ├── 0992.Subarrays-with-K-Different-Integers.md
│ │ │ ├── 0993.Cousins-in-Binary-Tree.md
│ │ │ ├── 0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
│ │ │ ├── 0996.Number-of-Squareful-Arrays.md
│ │ │ ├── 0997.Find-the-Town-Judge.md
│ │ │ ├── 0999.Available-Captures-for-Rook.md
│ │ │ └── _index.md
│ │ ├── 1000~1099/
│ │ │ ├── 1002.Find-Common-Characters.md
│ │ │ ├── 1003.Check-If-Word-Is-Valid-After-Substitutions.md
│ │ │ ├── 1004.Max-Consecutive-Ones-III.md
│ │ │ ├── 1005.Maximize-Sum-Of-Array-After-K-Negations.md
│ │ │ ├── 1006.Clumsy-Factorial.md
│ │ │ ├── 1009.Complement-of-Base-10-Integer.md
│ │ │ ├── 1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
│ │ │ ├── 1011.Capacity-To-Ship-Packages-Within-D-Days.md
│ │ │ ├── 1017.Convert-to-Base-2.md
│ │ │ ├── 1018.Binary-Prefix-Divisible-By-5.md
│ │ │ ├── 1019.Next-Greater-Node-In-Linked-List.md
│ │ │ ├── 1020.Number-of-Enclaves.md
│ │ │ ├── 1021.Remove-Outermost-Parentheses.md
│ │ │ ├── 1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
│ │ │ ├── 1025.Divisor-Game.md
│ │ │ ├── 1026.Maximum-Difference-Between-Node-and-Ancestor.md
│ │ │ ├── 1028.Recover-a-Tree-From-Preorder-Traversal.md
│ │ │ ├── 1030.Matrix-Cells-in-Distance-Order.md
│ │ │ ├── 1034.Coloring-A-Border.md
│ │ │ ├── 1037.Valid-Boomerang.md
│ │ │ ├── 1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
│ │ │ ├── 1040.Moving-Stones-Until-Consecutive-II.md
│ │ │ ├── 1047.Remove-All-Adjacent-Duplicates-In-String.md
│ │ │ ├── 1048.Longest-String-Chain.md
│ │ │ ├── 1049.Last-Stone-Weight-II.md
│ │ │ ├── 1051.Height-Checker.md
│ │ │ ├── 1052.Grumpy-Bookstore-Owner.md
│ │ │ ├── 1054.Distant-Barcodes.md
│ │ │ ├── 1073.Adding-Two-Negabinary-Numbers.md
│ │ │ ├── 1074.Number-of-Submatrices-That-Sum-to-Target.md
│ │ │ ├── 1078.Occurrences-After-Bigram.md
│ │ │ ├── 1079.Letter-Tile-Possibilities.md
│ │ │ ├── 1089.Duplicate-Zeros.md
│ │ │ ├── 1091.Shortest-Path-in-Binary-Matrix.md
│ │ │ ├── 1093.Statistics-from-a-Large-Sample.md
│ │ │ └── _index.md
│ │ ├── 1100~1199/
│ │ │ ├── 1104.Path-In-Zigzag-Labelled-Binary-Tree.md
│ │ │ ├── 1105.Filling-Bookcase-Shelves.md
│ │ │ ├── 1108.Defanging-an-IP-Address.md
│ │ │ ├── 1110.Delete-Nodes-And-Return-Forest.md
│ │ │ ├── 1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
│ │ │ ├── 1122.Relative-Sort-Array.md
│ │ │ ├── 1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
│ │ │ ├── 1128.Number-of-Equivalent-Domino-Pairs.md
│ │ │ ├── 1137.N-th-Tribonacci-Number.md
│ │ │ ├── 1143.Longest-Common-Subsequence.md
│ │ │ ├── 1145.Binary-Tree-Coloring-Game.md
│ │ │ ├── 1154.Day-of-the-Year.md
│ │ │ ├── 1157.Online-Majority-Element-In-Subarray.md
│ │ │ ├── 1160.Find-Words-That-Can-Be-Formed-by-Characters.md
│ │ │ ├── 1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
│ │ │ ├── 1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
│ │ │ ├── 1175.Prime-Arrangements.md
│ │ │ ├── 1178.Number-of-Valid-Words-for-Each-Puzzle.md
│ │ │ ├── 1184.Distance-Between-Bus-Stops.md
│ │ │ ├── 1185.Day-of-the-Week.md
│ │ │ ├── 1189.Maximum-Number-of-Balloons.md
│ │ │ ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
│ │ │ └── _index.md
│ │ ├── 1200~1299/
│ │ │ ├── 1200.Minimum-Absolute-Difference.md
│ │ │ ├── 1201.Ugly-Number-III.md
│ │ │ ├── 1202.Smallest-String-With-Swaps.md
│ │ │ ├── 1203.Sort-Items-by-Groups-Respecting-Dependencies.md
│ │ │ ├── 1207.Unique-Number-of-Occurrences.md
│ │ │ ├── 1208.Get-Equal-Substrings-Within-Budget.md
│ │ │ ├── 1209.Remove-All-Adjacent-Duplicates-in-String-II.md
│ │ │ ├── 1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
│ │ │ ├── 1221.Split-a-String-in-Balanced-Strings.md
│ │ │ ├── 1232.Check-If-It-Is-a-Straight-Line.md
│ │ │ ├── 1234.Replace-the-Substring-for-Balanced-String.md
│ │ │ ├── 1235.Maximum-Profit-in-Job-Scheduling.md
│ │ │ ├── 1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
│ │ │ ├── 1249.Minimum-Remove-to-Make-Valid-Parentheses.md
│ │ │ ├── 1252.Cells-with-Odd-Values-in-a-Matrix.md
│ │ │ ├── 1254.Number-of-Closed-Islands.md
│ │ │ ├── 1260.Shift-2D-Grid.md
│ │ │ ├── 1266.Minimum-Time-Visiting-All-Points.md
│ │ │ ├── 1268.Search-Suggestions-System.md
│ │ │ ├── 1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
│ │ │ ├── 1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
│ │ │ ├── 1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
│ │ │ ├── 1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
│ │ │ ├── 1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
│ │ │ ├── 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
│ │ │ ├── 1295.Find-Numbers-with-Even-Number-of-Digits.md
│ │ │ ├── 1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
│ │ │ ├── 1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
│ │ │ └── _index.md
│ │ ├── 1300~1399/
│ │ │ ├── 1300.Sum-of-Mutated-Array-Closest-to-Target.md
│ │ │ ├── 1302.Deepest-Leaves-Sum.md
│ │ │ ├── 1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
│ │ │ ├── 1305.All-Elements-in-Two-Binary-Search-Trees.md
│ │ │ ├── 1306.Jump-Game-III.md
│ │ │ ├── 1310.XOR-Queries-of-a-Subarray.md
│ │ │ ├── 1313.Decompress-Run-Length-Encoded-List.md
│ │ │ ├── 1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
│ │ │ ├── 1319.Number-of-Operations-to-Make-Network-Connected.md
│ │ │ ├── 1329.Sort-the-Matrix-Diagonally.md
│ │ │ ├── 1332.Remove-Palindromic-Subsequences.md
│ │ │ ├── 1337.The-K-Weakest-Rows-in-a-Matrix.md
│ │ │ ├── 1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
│ │ │ ├── 1380.Lucky-Numbers-in-a-Matrix.md
│ │ │ ├── 1383.Maximum-Performance-of-a-Team.md
│ │ │ ├── 1385.Find-the-Distance-Value-Between-Two-Arrays.md
│ │ │ ├── 1389.Create-Target-Array-in-the-Given-Order.md
│ │ │ ├── 1396.Design-Underground-System.md
│ │ │ └── _index.md
│ │ ├── 1400~1499/
│ │ │ ├── 1423.Maximum-Points-You-Can-Obtain-from-Cards.md
│ │ │ ├── 1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
│ │ │ ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
│ │ │ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
│ │ │ ├── 1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
│ │ │ ├── 1446.Consecutive-Characters.md
│ │ │ ├── 1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
│ │ │ ├── 1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
│ │ │ ├── 1463.Cherry-Pickup-II.md
│ │ │ ├── 1464.Maximum-Product-of-Two-Elements-in-an-Array.md
│ │ │ ├── 1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
│ │ │ ├── 1470.Shuffle-the-Array.md
│ │ │ ├── 1480.Running-Sum-of-1d-Array.md
│ │ │ ├── 1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
│ │ │ ├── 1486.XOR-Operation-in-an-Array.md
│ │ │ └── _index.md
│ │ ├── 1500~1599/
│ │ │ ├── 1512.Number-of-Good-Pairs.md
│ │ │ ├── 1518.Water-Bottles.md
│ │ │ ├── 1539.Kth-Missing-Positive-Number.md
│ │ │ ├── 1551.Minimum-Operations-to-Make-Array-Equal.md
│ │ │ ├── 1572.Matrix-Diagonal-Sum.md
│ │ │ ├── 1573.Number-of-Ways-to-Split-a-String.md
│ │ │ ├── 1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
│ │ │ ├── 1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
│ │ │ └── _index.md
│ │ ├── 1600~1699/
│ │ │ ├── 1600.Throne-Inheritance.md
│ │ │ ├── 1603.Design-Parking-System.md
│ │ │ ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
│ │ │ ├── 1609.Even-Odd-Tree.md
│ │ │ ├── 1614.Maximum-Nesting-Depth-of-the-Parentheses.md
│ │ │ ├── 1619.Mean-of-Array-After-Removing-Some-Elements.md
│ │ │ ├── 1624.Largest-Substring-Between-Two-Equal-Characters.md
│ │ │ ├── 1629.Slowest-Key.md
│ │ │ ├── 1631.Path-With-Minimum-Effort.md
│ │ │ ├── 1636.Sort-Array-by-Increasing-Frequency.md
│ │ │ ├── 1640.Check-Array-Formation-Through-Concatenation.md
│ │ │ ├── 1641.Count-Sorted-Vowel-Strings.md
│ │ │ ├── 1642.Furthest-Building-You-Can-Reach.md
│ │ │ ├── 1646.Get-Maximum-in-Generated-Array.md
│ │ │ ├── 1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
│ │ │ ├── 1648.Sell-Diminishing-Valued-Colored-Balls.md
│ │ │ ├── 1649.Create-Sorted-Array-through-Instructions.md
│ │ │ ├── 1652.Defuse-the-Bomb.md
│ │ │ ├── 1653.Minimum-Deletions-to-Make-String-Balanced.md
│ │ │ ├── 1654.Minimum-Jumps-to-Reach-Home.md
│ │ │ ├── 1655.Distribute-Repeating-Integers.md
│ │ │ ├── 1656.Design-an-Ordered-Stream.md
│ │ │ ├── 1657.Determine-if-Two-Strings-Are-Close.md
│ │ │ ├── 1658.Minimum-Operations-to-Reduce-X-to-Zero.md
│ │ │ ├── 1659.Maximize-Grid-Happiness.md
│ │ │ ├── 1662.Check-If-Two-String-Arrays-are-Equivalent.md
│ │ │ ├── 1663.Smallest-String-With-A-Given-Numeric-Value.md
│ │ │ ├── 1664.Ways-to-Make-a-Fair-Array.md
│ │ │ ├── 1665.Minimum-Initial-Energy-to-Finish-Tasks.md
│ │ │ ├── 1668.Maximum-Repeating-Substring.md
│ │ │ ├── 1669.Merge-In-Between-Linked-Lists.md
│ │ │ ├── 1670.Design-Front-Middle-Back-Queue.md
│ │ │ ├── 1672.Richest-Customer-Wealth.md
│ │ │ ├── 1673.Find-the-Most-Competitive-Subsequence.md
│ │ │ ├── 1674.Minimum-Moves-to-Make-Array-Complementary.md
│ │ │ ├── 1675.Minimize-Deviation-in-Array.md
│ │ │ ├── 1678.Goal-Parser-Interpretation.md
│ │ │ ├── 1679.Max-Number-of-K-Sum-Pairs.md
│ │ │ ├── 1680.Concatenation-of-Consecutive-Binary-Numbers.md
│ │ │ ├── 1681.Minimum-Incompatibility.md
│ │ │ ├── 1684.Count-the-Number-of-Consistent-Strings.md
│ │ │ ├── 1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
│ │ │ ├── 1688.Count-of-Matches-in-Tournament.md
│ │ │ ├── 1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
│ │ │ ├── 1690.Stone-Game-VII.md
│ │ │ ├── 1691.Maximum-Height-by-Stacking-Cuboids.md
│ │ │ ├── 1694.Reformat-Phone-Number.md
│ │ │ ├── 1695.Maximum-Erasure-Value.md
│ │ │ ├── 1696.Jump-Game-VI.md
│ │ │ └── _index.md
│ │ ├── 1700~1799/
│ │ │ ├── 1700.Number-of-Students-Unable-to-Eat-Lunch.md
│ │ │ ├── 1704.Determine-if-String-Halves-Are-Alike.md
│ │ │ ├── 1705.Maximum-Number-of-Eaten-Apples.md
│ │ │ ├── 1710.Maximum-Units-on-a-Truck.md
│ │ │ ├── 1716.Calculate-Money-in-Leetcode-Bank.md
│ │ │ ├── 1720.Decode-XORed-Array.md
│ │ │ ├── 1721.Swapping-Nodes-in-a-Linked-List.md
│ │ │ ├── 1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
│ │ │ ├── 1732.Find-the-Highest-Altitude.md
│ │ │ ├── 1734.Decode-XORed-Permutation.md
│ │ │ ├── 1736.Latest-Time-by-Replacing-Hidden-Digits.md
│ │ │ ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value.md
│ │ │ ├── 1742.Maximum-Number-of-Balls-in-a-Box.md
│ │ │ ├── 1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
│ │ │ ├── 1748.Sum-of-Unique-Elements.md
│ │ │ ├── 1752.Check-if-Array-Is-Sorted-and-Rotated.md
│ │ │ ├── 1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
│ │ │ ├── 1763.Longest-Nice-Substring.md
│ │ │ ├── 1791.Find-Center-of-Star-Graph.md
│ │ │ └── _index.md
│ │ ├── 1800~1899/
│ │ │ ├── 1816.Truncate-Sentence.md
│ │ │ ├── 1818.Minimum-Absolute-Sum-Difference.md
│ │ │ ├── 1846.Maximum-Element-After-Decreasing-and-Rearranging.md
│ │ │ ├── 1877.Minimize-Maximum-Pair-Sum-in-Array.md
│ │ │ └── _index.md
│ │ ├── 1900~1999/
│ │ │ ├── 1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
│ │ │ └── _index.md
│ │ ├── 2000~2099/
│ │ │ ├── 2021.Brightest-Position-on-Street.md
│ │ │ ├── 2022.Convert-1D-Array-Into-2D-Array.md
│ │ │ ├── 2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
│ │ │ ├── 2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
│ │ │ ├── 2043.Simple-Bank-System.md
│ │ │ ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
│ │ │ └── _index.md
│ │ ├── 2100~2199/
│ │ │ ├── 2164.Sort-Even-and-Odd-Indices-Independently.md
│ │ │ ├── 2165.Smallest-Value-of-the-Rearranged-Number.md
│ │ │ ├── 2166.Design-Bitset.md
│ │ │ ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
│ │ │ ├── 2169.Count-Operations-to-Obtain-Zero.md
│ │ │ ├── 2170.Minimum-Operations-to-Make-the-Array-Alternating.md
│ │ │ ├── 2171.Removing-Minimum-Number-of-Magic-Beans.md
│ │ │ ├── 2180.Count-Integers-With-Even-Digit-Sum.md
│ │ │ ├── 2181.Merge-Nodes-in-Between-Zeros.md
│ │ │ ├── 2182.Construct-String-With-Repeat-Limit.md
│ │ │ ├── 2183.Count-Array-Pairs-Divisible-by-K.md
│ │ │ └── _index.md
│ │ ├── 2200~2299/
│ │ │ └── _index.md
│ │ ├── _index.md
│ │ └── pytool/
│ │ ├── AddTOC.py
│ │ ├── CutContent.py
│ │ ├── GenerateIndex.py
│ │ ├── GenerateOne.py
│ │ ├── GetFile.py
│ │ └── WordCount.py
│ ├── ChapterOne/
│ │ ├── Algorithm.md
│ │ ├── Data_Structure.md
│ │ ├── Time_Complexity.md
│ │ └── _index.md
│ ├── ChapterThree/
│ │ ├── Binary_Indexed_Tree.md
│ │ ├── LFUCache.md
│ │ ├── LRUCache.md
│ │ ├── Segment_Tree.md
│ │ ├── UnionFind.md
│ │ └── _index.md
│ ├── ChapterTwo/
│ │ ├── Array.md
│ │ ├── Backtracking.md
│ │ ├── Binary_Indexed_Tree.md
│ │ ├── Binary_Search.md
│ │ ├── Bit_Manipulation.md
│ │ ├── Breadth_First_Search.md
│ │ ├── Depth_First_Search.md
│ │ ├── Dynamic_Programming.md
│ │ ├── Hash_Table.md
│ │ ├── Linked_List.md
│ │ ├── Math.md
│ │ ├── Segment_Tree.md
│ │ ├── Sliding_Window.md
│ │ ├── Sorting.md
│ │ ├── Stack.md
│ │ ├── String.md
│ │ ├── Tree.md
│ │ ├── Two_Pointers.md
│ │ ├── Union_Find.md
│ │ └── _index.md
│ └── _index.md
├── resources/
│ └── _gen/
│ └── assets/
│ └── scss/
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.content
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.json
│ └── leetcode/
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.content
│ └── book.scss_50fc8c04e12a2f59027287995557ceff.json
├── static/
│ ├── prism.css
│ └── prism.js
└── themes/
└── book/
├── .github/
│ └── workflows/
│ └── main.yml
├── .gitignore
├── LICENSE
├── README.md
├── archetypes/
│ ├── docs.md
│ └── posts.md
├── assets/
│ ├── _custom.scss
│ ├── _defaults.scss
│ ├── _fonts.scss
│ ├── _main.scss
│ ├── _markdown.scss
│ ├── _print.scss
│ ├── _shortcodes.scss
│ ├── _utils.scss
│ ├── _variables.scss
│ ├── book.scss
│ ├── manifest.json
│ ├── menu-reset.js
│ ├── mermaid.json
│ ├── normalize.css
│ ├── plugins/
│ │ ├── _dark.scss
│ │ ├── _numbered.scss
│ │ └── _scrollbars.scss
│ ├── search-data.js
│ ├── search.js
│ ├── serviceworker-v1.js
│ ├── sw-register.js
│ ├── sw.js
│ └── themes/
│ ├── _auto.scss
│ ├── _dark.scss
│ └── _light.scss
├── exampleSite/
│ ├── assets/
│ │ ├── _custom.scss
│ │ └── _variables.scss
│ ├── config.yaml
│ ├── content/
│ │ ├── _index.md
│ │ ├── docs/
│ │ │ ├── example/
│ │ │ │ ├── _index.md
│ │ │ │ ├── collapsed/
│ │ │ │ │ ├── 3rd-level/
│ │ │ │ │ │ ├── 4th-level.md
│ │ │ │ │ │ └── _index.md
│ │ │ │ │ └── _index.md
│ │ │ │ ├── hidden.md
│ │ │ │ └── table-of-contents/
│ │ │ │ ├── _index.md
│ │ │ │ ├── with-toc.md
│ │ │ │ └── without-toc.md
│ │ │ └── shortcodes/
│ │ │ ├── _index.md
│ │ │ ├── buttons.md
│ │ │ ├── columns.md
│ │ │ ├── details.md
│ │ │ ├── expand.md
│ │ │ ├── hints.md
│ │ │ ├── katex.md
│ │ │ ├── mermaid.md
│ │ │ ├── section/
│ │ │ │ ├── _index.md
│ │ │ │ ├── page1.md
│ │ │ │ └── page2.md
│ │ │ └── tabs.md
│ │ ├── menu/
│ │ │ └── index.md
│ │ └── posts/
│ │ ├── _index.md
│ │ ├── creating-a-new-theme.md
│ │ ├── goisforlovers.md
│ │ ├── hugoisforlovers.md
│ │ └── migrate-from-jekyll.md
│ ├── content.bn/
│ │ └── _index.md
│ ├── content.ru/
│ │ └── _index.md
│ ├── content.zh/
│ │ └── _index.md
│ └── resources/
│ └── _gen/
│ └── assets/
│ └── scss/
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.content
│ └── book.scss_50fc8c04e12a2f59027287995557ceff.json
├── i18n/
│ ├── bn.yaml
│ ├── cn.yaml
│ ├── cs.yaml
│ ├── de.yaml
│ ├── en.yaml
│ ├── es.yaml
│ ├── fr.yaml
│ ├── ja.yaml
│ ├── jp.yaml
│ ├── ko.yaml
│ ├── nb.yaml
│ ├── pt.yaml
│ ├── ru.yaml
│ ├── sv.yaml
│ ├── tr.yaml
│ ├── uk.yaml
│ ├── zh-TW.yaml
│ └── zh.yaml
├── layouts/
│ ├── 404.html
│ ├── _default/
│ │ ├── _markup/
│ │ │ ├── render-heading.html
│ │ │ ├── render-image.html
│ │ │ └── render-link.html
│ │ ├── baseof.html
│ │ ├── list.html
│ │ └── single.html
│ ├── partials/
│ │ └── docs/
│ │ ├── brand.html
│ │ ├── comments.html
│ │ ├── date.html
│ │ ├── footer.html
│ │ ├── gitalk.html
│ │ ├── header.html
│ │ ├── html-head.html
│ │ ├── inject/
│ │ │ ├── body.html
│ │ │ ├── content-after.html
│ │ │ ├── content-before.html
│ │ │ ├── footer.html
│ │ │ ├── head.html
│ │ │ ├── menu-after.html
│ │ │ ├── menu-before.html
│ │ │ ├── toc-after.html
│ │ │ └── toc-before.html
│ │ ├── languages.html
│ │ ├── menu-bundle.html
│ │ ├── menu-filetree.html
│ │ ├── menu-hugo.html
│ │ ├── menu.html
│ │ ├── post-meta.html
│ │ ├── search.html
│ │ ├── taxonomy.html
│ │ ├── title.html
│ │ └── toc.html
│ ├── posts/
│ │ ├── list.html
│ │ └── single.html
│ ├── shortcodes/
│ │ ├── button.html
│ │ ├── columns.html
│ │ ├── details.html
│ │ ├── expand.html
│ │ ├── hint.html
│ │ ├── katex.html
│ │ ├── mermaid.html
│ │ ├── section.html
│ │ ├── tab.html
│ │ └── tabs.html
│ └── taxonomy/
│ ├── list.html
│ └── taxonomy.html
└── static/
├── js/
│ └── sw-toolbox.js
├── prism.css
└── prism.js
================================================
FILE CONTENTS
================================================
================================================
FILE: .github/FUNDING.yml
================================================
# These are supported funding model platforms
github: [halfrost]
patreon: # Replace with a single Patreon username
open_collective: # Replace with a single Open Collective username
ko_fi: # Replace with a single Ko-fi username
tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel
community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
liberapay: # Replace with a single Liberapay username
issuehunt: # Replace with a single IssueHunt username
otechie: # Replace with a single Otechie username
lfx_crowdfunding: # Replace with a single LFX Crowdfunding project-name e.g., cloud-foundry
custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']
================================================
FILE: .github/workflows/deploy.yml
================================================
name: Deploy《LeetCode-Cookbook》
on:
push:
branches:
- master # 只在master上push触发部署
- add_hugo
paths-ignore: # 下列文件的变更不触发部署，可以自行添加
- README.md
- LICENSE
jobs:
deploy:
runs-on: ubuntu-latest # 使用ubuntu系统镜像运行自动化脚本
steps: # 自动化步骤
- uses: actions/checkout@v2 # 第一步，下载代码仓库
- name: Setup Hugo # 第二步，安装 hugo
uses: peaceiris/actions-hugo@v2
with:
hugo-version: '0.74.3'
- name: Build # 第三步，编译 hugo
run: |
cd ./website
hugo -D --minify
- name: Deploy to Server # 第四步，rsync推文件
uses: appleboy/ssh-action@v0.1.3 # 使用别人包装好的步骤镜像
with:
host: ${{ secrets.SSH_HOST }}
username: ${{ secrets.SSH_USERNAME }}
key: ${{ secrets.DEPLOY_KEY }}
port: ${{ secrets.SERVER_PORT }}
script: |
rsync -avz --delete --exclude='*.pyc' ./website/public/ ${{ secrets.SSH_USERNAME }}@${{ secrets.SSH_HOST }}:${{ secrets.SERVER_DESTINATION }}
================================================
FILE: .gitignore
================================================
*.toml
.idea
================================================
FILE: .travis.yml
================================================
language: go
go:
- master
# whitelist
branches:
only:
- master
script:
- go get -t -v ./...
- go vet ./...
- bash ./gotest.sh
after_success:
- bash <(curl -s https://codecov.io/bash)
================================================
FILE: .vscode/launch.json
================================================
{
// 使用 IntelliSense 了解相关属性。
// 悬停以查看现有属性的描述。
// 欲了解更多信息，请访问: https://go.microsoft.com/fwlink/?linkid=830387
"version": "0.2.0",
"configurations": [
{
"name": "Launch",
"type": "go",
"request": "launch",
"mode": "auto",
"program": "${fileDirname}",
"env": {},
"args": []
}
]
}
================================================
FILE: .vscode/settings.json
================================================
{
"go.formatTool": "gofmt",
"go.formatFlags": [
"-s"
],
"go.autocompleteUnimportedPackages": true,
"[go]": {
"editor.insertSpaces": false,
"editor.formatOnSave": true,
"editor.codeActionsOnSave": {
"source.organizeImports": true
}
}
}
================================================
FILE: LICENSE
================================================
MIT License
Copyright (c) 2017 halfrost
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
================================================
FILE: README.md
================================================
# LeetCode in Go
[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. and it always help to sharp our algorithm Skills. Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. This repo shows my solutions in Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!
<p align='center'>
<img src='./logo.png'>
</p>
<p align='center'>
<a href="https://github.com/halfrost/leetcode-go/releases/" rel="nofollow"><img alt="GitHub All Releases" src="https://img.shields.io/github/downloads/halfrost/LeetCode-Go/total?label=PDF%20downloads"></a>
<img src="https://img.shields.io/badge/Total%20Word%20Count-738884-success">
<a href="https://github.com/halfrost/leetcode-go/actions" rel="nofollow"><img src="https://github.com/halfrost/leetcode-go/workflows/Deploy%20leetcode-cookbook/badge.svg?branch=master"></a>
<a href="https://travis-ci.org/github/halfrost/LeetCode-Go" rel="nofollow"><img src="https://travis-ci.org/halfrost/LeetCode-Go.svg?branch=master"></a>
<a href="https://goreportcard.com/report/github.com/halfrost/LeetCode-Go" rel="nofollow"><img src="https://goreportcard.com/badge/github.com/halfrost/LeetCode-Go"></a>
<img src="https://img.shields.io/badge/runtime%20beats-100%25-success">
<a href="https://codecov.io/gh/halfrost/LeetCode-Go"><img src="https://codecov.io/gh/halfrost/LeetCode-Go/branch/master/graph/badge.svg" /></a>
<!--<img alt="GitHub go.mod Go version" src="https://img.shields.io/github/go-mod/go-version/halfrost/LeetCode-Go?color=26C2F0">-->
<img alt="Support Go version" src="https://img.shields.io/badge/Go-v1.15-26C2F0">
<img src="https://visitor-badge.laobi.icu/badge?page_id=halfrost.LeetCode-Go">
</p>
<p align='center'>
<a href="https://github.com/halfrost/leetcode-go/blob/master/LICENSE"><img alt="GitHub" src="https://img.shields.io/github/license/halfrost/LeetCode-Go?label=License"></a>
<img src="https://img.shields.io/badge/License-CC-000000.svg">
<a href="https://leetcode.com/halfrost/"><img src="https://img.shields.io/badge/@halfrost-8751-yellow.svg">
<img src="https://img.shields.io/badge/language-Golang-26C2F0.svg">
<a href="https://halfrost.com"><img src="https://img.shields.io/badge/Blog-Halfrost--Field-80d4f9.svg?style=flat"></a>
<a href="http://weibo.com/halfrost"><img src="https://img.shields.io/badge/weibo-@halfrost-f974ce.svg?style=flat&colorA=f4292e"></a>
<a href="https://twitter.com/halffrost"><img src="https://img.shields.io/badge/twitter-@halffrost-F8E81C.svg?style=flat&colorA=009df2"></a>
<a href="https://www.zhihu.com/people/halfrost/activities"><img src="https://img.shields.io/badge/%E7%9F%A5%E4%B9%8E-@halfrost-fd6f32.svg?style=flat&colorA=0083ea"></a>
<img src="https://img.shields.io/badge/made%20with-=1-blue.svg">
<a href="https://github.com/halfrost/LeetCode-Go/pulls"><img src="https://img.shields.io/badge/PR-Welcome-brightgreen.svg"></a>
</p>
支持 Progressive Web Apps 和 Dark Mode 的题解电子书《LeetCode Cookbook》 <a href="https://books.halfrost.com/leetcode/" rel="nofollow">Online Reading</a>
<p align='center'>
<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_Safari_0.png"></a>
<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_Chrome_PWA.png"></a>
</p>
离线版本的电子书《LeetCode Cookbook》PDF <a href="https://github.com/halfrost/LeetCode-Go/releases/" rel="nofollow">Download here</a>
<p align='center'>
<a href="https://github.com/halfrost/LeetCode-Go/releases/"><img src="https://img.halfrost.com/Leetcode/Cookbook.png"></a>
</p>
通过 iOS / Android 浏览器安装 PWA 版《LeetCode Cookbook》至设备桌面随时学习
<p align='center'>
<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad.png"></a>
<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad_example1__.png"></a>
<a href="https://books.halfrost.com/leetcode/"><img src="https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad_example2__.png"></a>
</p>
## Data Structures
> 标识了 ✅ 的专题是完成所有题目了的，没有标识的是还没有做完所有题目的
<a href="https://books.halfrost.com/leetcode/"><img src="./website/static/logo.png" alt="logo" height="550" align="right" /></a>
* [Array](#array)
* [String](#string)
* [✅ Two Pointers](#two-pointers)
* [✅ Linked List](#linked-list)
* [✅ Stack](#stack)
* [Tree](#tree)
* [Dynamic programming](#dynamic-programming)
* [✅ Backtracking](#backtracking)
* [Depth First Search](#depth-first-search)
* [Breadth First Search](#breadth-first-search)
* [Binary Search](#binary-search)
* [Math](#math)
* [Hash Table](#hash-table)
* [✅ Sort](#sort)
* [✅ Bit Manipulation](#bit-manipulation)
* [✅ Union Find](#union-find)
* [✅ Sliding Window](#sliding-window)
* [✅ Segment Tree](#segment-tree)
* [✅ Binary Indexed Tree](#binary-indexed-tree)
<br>
<br>
| 数据结构 | 变种 | 相关题目 | 讲解文章 |
|:-------:|:-------|:------|:------|
|顺序线性表：向量||||
|单链表|1. 双向链表<br>2. 静态链表<br>3. 对称矩阵<br>4. 稀疏矩阵|||
|哈希表|1. 散列函数<br>2. 解决碰撞/填充因子<br>|||
|栈和队列|1. 广义栈<br>2. 双端队列<br>|||
|队列|1. 链表实现<br>2. 循环数组实现<br>3. 双端队列|||
|字符串|1. KMP算法<br>2. 有限状态自动机<br>3. 模式匹配有限状态自动机<br>4. BM 模式匹配算法<br>5. BM-KMP 算法<br>6. BF 算法|||
|树|1. 二叉树<br>2. 并查集<br>3. Huffman 树|||
|数组实现的堆|1. 极大堆和极小堆<br>2. 极大极小堆<br>3. 双端堆<br>4. d 叉堆|||
|树实现的堆|1. 左堆<br>2. 扁堆<br>3. 二项式堆<br>4. 斐波那契堆<br>5. 配对堆|||
|查找|1. 哈希表<br>2. 跳跃表<br>3. 排序二叉树<br>4. AVL 树<br>5. B 树 / B+ 树 / B* 树<br>6. AA 树<br>7. 红黑树<br>8. 排序二叉堆<br>9. Splay 树<br>10. 双链树<br>11. Trie 树<br>12. R 树|||
|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|
## Algorithm
| 算法 | 具体类型 | 相关题目 | 讲解文章 |
|:-------:|:-------|:------|:------|
|排序算法|1. 冒泡排序<br>2. 插入排序<br>3. 选择排序<br>4. 希尔 Shell 排序<br>5. 快速排序<br>6. 归并排序<br>7. 堆排序<br>8. 线性排序算法<br>9. 自省排序<br>10. 间接排序<br>11. 计数排序<br>12. 基数排序<br>13. 桶排序<br>14. 外部排序 - k 路归并败者树<br>15. 外部排序 - 最佳归并树|||
|递归与分治||1. 二分搜索/查找<br>2. 大整数的乘法<br>3. Strassen 矩阵乘法<br>4. 棋盘覆盖<br>5. 合并排序<br>6. 快速排序<br>7. 线性时间选择<br>8. 最接近点对问题<br>9. 循环赛日程表<br>||
|动态规划||1. 矩阵连乘问题<br>2. 最长公共子序列<br>3. 最大子段和<br>4. 凸多边形最优三角剖分<br>5. 多边形游戏<br>6. 图像压缩<br>7. 电路布线<br>8. 流水作业调度<br>9. 0-1 背包问题/背包九讲<br>10. 最优二叉搜索树<br>11. 动态规划加速原理<br>12. 树型 DP<br>||
|贪心||1. 活动安排问题<br>2. 最优装载<br>3. 哈夫曼编码<br>4. 单源最短路径<br>5. 最小生成树<br>6. 多机调度问题<br>||
|回溯法||1. 装载问题<br>2. 批处理作业调度<br>3. 符号三角形问题<br>4. n 后问题<br>5. 0-1 背包问题<br>6. 最大团问题<br>7. 图的 m 着色问题<br>8. 旅行售货员问题<br>9. 圆排列问题<br>10. 电路板排列问题<br>11. 连续邮资问题<br>||
|搜索|1. 枚举<br>2. DFS<br>3. BFS<br>4. 启发式搜索<br>|||
|随机化|1. 随机数<br>2. 数值随机化算法<br>3. Sherwood 舍伍德算法<br>4. Las Vegas 拉斯维加斯算法<br>5. Monte Carlo 蒙特卡罗算法<br>|1. 计算 π 值<br>2. 计算定积分<br>3. 解非线性方程组<br>4. 线性时间选择算法<br>5. 跳跃表<br>6. n 后问题<br>7. 整数因子分解<br>8. 主元素问题<br>9. 素数测试<br>||
|图论|1. 遍历 DFS / BFS<br>2. AOV / AOE 网络<br>3. Kruskal 算法(最小生成树)<br>4. Prim 算法(最小生成树)<br>5. Boruvka 算法(最小生成树)<br>6. Dijkstra 算法(单源最短路径)<br>7. Bellman-Ford 算法(单源最短路径)<br>8. SPFA 算法(单源最短路径)<br>9. Floyd 算法(多源最短路径)<br>10. Johnson 算法(多源最短路径)<br>11. Fleury 算法(欧拉回路)<br>12. Ford-Fulkerson 算法(最大网络流增广路)<br>13. Edmonds-Karp 算法(最大网络流)<br>14. Dinic 算法(最大网络流)<br>15. 一般预流推进算法<br>16. 最高标号预流推进 HLPP 算法<br>17. Primal-Dual 原始对偶算法(最小费用流)18. Kosaraju 算法(有向图强连通分量)<br>19. Tarjan 算法(有向图强连通分量)<br>20. Gabow 算法(有向图强连通分量)<br>21. 匈牙利算法(二分图匹配)<br>22. Hopcroft－Karp 算法(二分图匹配)<br>23. kuhn munkras 算法(二分图最佳匹配)<br>24. Edmonds’ Blossom-Contraction 算法(一般图匹配)<br>|1. 图遍历<br>2. 有向图和无向图的强弱连通性<br>3. 割点/割边<br>3. AOV 网络和拓扑排序<br>4. AOE 网络和关键路径<br>5. 最小代价生成树/次小生成树<br>6. 最短路径问题/第 K 短路问题<br>7. 最大网络流问题<br>8. 最小费用流问题<br>9. 图着色问题<br>10. 差分约束系统<br>11. 欧拉回路<br>12. 中国邮递员问题<br>13. 汉密尔顿回路<br>14. 最佳边割集/最佳点割集/最小边割集/最小点割集/最小路径覆盖/最小点集覆盖 <br>15. 边覆盖集<br>16. 二分图完美匹配和最大匹配问题<br>17. 仙人掌图<br>18. 弦图<br>19. 稳定婚姻问题<br>20. 最大团问题<br>||
|数论||1. 最大公约数<br> 2. 最小公倍数<br>3. 分解质因数<br>4. 素数判定<br>5. 进制转换<br>6. 高精度计算<br>7. 整除问题<br>8. 同余问题<br>9. 欧拉函数<br>10. 扩展欧几里得<br>11. 置换群<br>12. 母函数<br>13. 离散变换<br>14. 康托展开<br>15. 矩阵<br>16. 向量<br>17. 线性方程组<br>18. 线性规划<br> ||
|几何||1. 凸包 - Gift wrapping<br>2. 凸包 - Graham scan<br>3. 线段问题<br> 4. 多边形和多面体相关问题<br>||
|NP 完全|1. 计算模型<br>2. P 类与 NP 类问题<br>3. NP 完全问题<br>4. NP 完全问题的近似算法<br>|1. 随机存取机 RAM<br>2. 随机存取存储程序机 RASP<br>3. 图灵机<br>4. 非确定性图灵机<br>5. P 类与 NP 类语言<br>6. 多项式时间验证<br>7. 多项式时间变换<br>8. Cook定理<br>9. 合取范式的可满足性问题 CNF-SAT<br>10. 3 元合取范式的可满足性问题 3-SAT<br>11. 团问题 CLIQUE<br>12. 顶点覆盖问题 VERTEX-COVER<br>13. 子集和问题 SUBSET-SUM<br>14. 哈密顿回路问题 HAM-CYCLE<br>15. 旅行售货员问题 TSP<br>16. 顶点覆盖问题的近似算法<br>17. 旅行售货员问题近似算法<br>18. 具有三角不等式性质的旅行售货员问题<br>19. 一般的旅行售货员问题<br>20. 集合覆盖问题的近似算法<br>21. 子集和问题的近似算法<br>22. 子集和问题的指数时间算法<br>23. 子集和问题的多项式时间近似格式<br>||
|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|
## LeetCode Problems
## 一. 个人数据
| | Easy | Medium | Hard | Total |
|:--------:|:--------:|:--------:|:--------:|:--------:|
|Optimizing|31|78|43|152|
|Accepted|**287**|**484**|**142**|**913**|
|Total|600|1305|539|2444|
|Perfection Rate|89.2%|83.9%|69.7%|83.4%|
|Completion Rate|47.8%|37.1%|26.3%|37.4%|
|------------|----------------------------|----------------------------|----------------------------|----------------------------|
## 二. 目录
以下已经收录了 787 道题的题解，还有 11 道题在尝试优化到 beats 100%
| No. | Title | Solution | Acceptance | Difficulty | Frequency |
|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|49.1%|Easy||
|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|39.7%|Medium||
|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|33.8%|Medium||
|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|35.1%|Hard||
|0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|32.4%|Medium||
|0006|Zigzag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.Zigzag-Conversion)|43.0%|Medium||
|0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|27.2%|Medium||
|0008|String to Integer (atoi)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0008.String-to-Integer-atoi)|16.6%|Medium||
|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|52.8%|Easy||
|0010|Regular Expression Matching||28.3%|Hard||
|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|54.3%|Medium||
|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|60.5%|Medium||
|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|58.2%|Easy||
|0014|Longest Common Prefix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0014.Longest-Common-Prefix)|40.7%|Easy||
|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|32.2%|Medium||
|0016|3Sum Closest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)|46.2%|Medium||
|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|55.5%|Medium||
|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|36.5%|Medium||
|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|39.9%|Medium||
|0020|Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)|40.7%|Easy||
|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|61.8%|Easy||
|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|71.7%|Medium||
|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|48.3%|Hard||
|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|60.3%|Medium||
|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|53.4%|Hard||
|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|50.3%|Easy||
|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|52.0%|Easy||
|0028|Find the Index of the First Occurrence in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String)|37.4%|Medium||
|0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|17.4%|Medium||
|0030|Substring with Concatenation of All Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)|30.9%|Hard||
|0031|Next Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0031.Next-Permutation)|37.1%|Medium||
|0032|Longest Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0032.Longest-Valid-Parentheses)|32.7%|Hard||
|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|38.6%|Medium||
|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|41.5%|Medium||
|0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.0%|Easy||
|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|56.7%|Medium||
|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|56.6%|Hard||
|0038|Count and Say||51.1%|Medium||
|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|67.5%|Medium||
|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|53.3%|Medium||
|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|36.5%|Hard||
|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|58.7%|Hard||
|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|38.7%|Medium||
|0044|Wildcard Matching||26.8%|Hard||
|0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|38.5%|Medium||
|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|74.6%|Medium||
|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|56.6%|Medium||
|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|69.8%|Medium||
|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|65.9%|Medium||
|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)|32.8%|Medium||
|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|62.8%|Hard||
|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|70.8%|Hard||
|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|50.0%|Medium||
|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|43.6%|Medium||
|0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|38.4%|Medium||
|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|45.9%|Medium||
|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|37.9%|Medium||
|0058|Length of Last Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0058.Length-of-Last-Word)|40.3%|Easy||
|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|66.5%|Medium||
|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|43.7%|Hard||
|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|35.7%|Medium||
|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|62.2%|Medium||
|0063|Unique Paths II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)|39.1%|Medium||
|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|60.6%|Medium||
|0065|Valid Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0065.Valid-Number)|18.6%|Hard||
|0066|Plus One|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One)|43.3%|Easy||
|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|51.3%|Easy||
|0068|Text Justification||36.6%|Hard||
|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)|37.0%|Easy||
|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|51.7%|Easy||
|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|39.2%|Medium||
|0072|Edit Distance||52.6%|Hard||
|0073|Set Matrix Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0073.Set-Matrix-Zeroes)|49.9%|Medium||
|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|46.7%|Medium||
|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|57.1%|Medium||
|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|40.0%|Hard||
|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|66.0%|Medium||
|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|73.7%|Medium||
|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|39.8%|Medium||
|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|51.5%|Medium||
|0081|Search in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II)|35.7%|Medium||
|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|45.4%|Medium||
|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|49.8%|Easy||
|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|42.1%|Hard||
|0085|Maximal Rectangle||44.1%|Hard||
|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|51.3%|Medium||
|0087|Scramble String||36.1%|Hard||
|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|45.7%|Easy||
|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|56.4%|Medium||
|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|55.2%|Medium||
|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|32.2%|Medium||
|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|45.3%|Medium||
|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|43.3%|Medium||
|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|72.9%|Easy||
|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|51.4%|Medium||
|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|59.2%|Medium||
|0097|Interleaving String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0097.Interleaving-String)|37.1%|Medium||
|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|31.7%|Medium||
|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|50.2%|Medium||
|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|56.3%|Easy||
|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|52.8%|Easy||
|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|63.2%|Medium||
|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|55.0%|Medium||
|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|73.0%|Easy||
|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|60.6%|Medium||
|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|57.3%|Medium||
|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|60.2%|Medium||
|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|68.9%|Easy||
|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|57.2%|Medium||
|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|48.1%|Easy||
|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|43.5%|Easy||
|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|47.6%|Easy||
|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|56.5%|Medium||
|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|61.0%|Medium||
|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|43.7%|Hard||
|0116|Populating Next Right Pointers in Each Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node)|59.3%|Medium||
|0117|Populating Next Right Pointers in Each Node II||49.6%|Medium||
|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascals-Triangle)|68.9%|Easy||
|0119|Pascal's Triangle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0119.Pascals-Triangle-II)|59.5%|Easy||
|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|53.8%|Medium||
|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|54.5%|Easy||
|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|63.2%|Medium||
|0123|Best Time to Buy and Sell Stock III||44.8%|Hard||
|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|38.4%|Hard||
|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|43.5%|Easy||
|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|27.6%|Hard||
|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|36.6%|Hard||
|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|49.0%|Medium||
|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|58.6%|Medium||
|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|35.8%|Medium||
|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|62.3%|Medium||
|0132|Palindrome Partitioning II||33.6%|Hard||
|0133|Clone Graph||50.5%|Medium||
|0134|Gas Station||45.0%|Medium||
|0135|Candy|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0135.Candy)|40.7%|Hard||
|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|70.0%|Easy||
|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|57.7%|Medium||
|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|50.4%|Medium||
|0139|Word Break||45.4%|Medium||
|0140|Word Break II||44.3%|Hard||
|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|46.8%|Easy||
|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|46.2%|Medium||
|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|50.9%|Medium||
|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|64.5%|Easy||
|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|66.5%|Easy||
|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|40.5%|Medium||
|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|50.1%|Medium||
|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|54.0%|Medium||
|0149|Max Points on a Line||21.7%|Hard||
|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|44.1%|Medium||
|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|30.2%|Medium||
|0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|34.9%|Medium||
|0153|Find Minimum in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array)|48.4%|Medium||
|0154|Find Minimum in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II)|43.4%|Hard||
|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|51.7%|Medium||
|0156|Binary Tree Upside Down||61.5%|Medium||
|0157|Read N Characters Given Read4||40.7%|Easy||
|0158|Read N Characters Given read4 II - Call Multiple Times||41.4%|Hard||
|0159|Longest Substring with At Most Two Distinct Characters||53.5%|Medium||
|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|53.1%|Easy||
|0161|One Edit Distance||34.1%|Medium||
|0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|46.2%|Medium||
|0163|Missing Ranges||31.9%|Easy||
|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|42.6%|Hard||
|0165|Compare Version Numbers||35.3%|Medium||
|0166|Fraction to Recurring Decimal||24.0%|Medium||
|0167|Two Sum II - Input Array Is Sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted)|60.0%|Medium||
|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|34.7%|Easy||
|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|63.8%|Easy||
|0170|Two Sum III - Data structure design||37.3%|Easy||
|0171|Excel Sheet Column Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number)|61.3%|Easy||
|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|41.6%|Medium||
|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|69.0%|Medium||
|0174|Dungeon Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game)|37.2%|Hard||
|0175|Combine Two Tables||72.8%|Easy||
|0176|Second Highest Salary||36.4%|Medium||
|0177|Nth Highest Salary||37.3%|Medium||
|0178|Rank Scores||59.7%|Medium||
|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|33.9%|Medium||
|0180|Consecutive Numbers||46.7%|Medium||
|0181|Employees Earning More Than Their Managers||68.4%|Easy||
|0182|Duplicate Emails||70.5%|Easy||
|0183|Customers Who Never Order||67.6%|Easy||
|0184|Department Highest Salary||49.5%|Medium||
|0185|Department Top Three Salaries||49.9%|Hard||
|0186|Reverse Words in a String II||52.3%|Medium||
|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|46.1%|Medium||
|0188|Best Time to Buy and Sell Stock IV||37.8%|Hard||
|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|39.2%|Medium||
|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|51.9%|Easy||
|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|64.5%|Easy||
|0192|Word Frequency||25.6%|Medium||
|0193|Valid Phone Numbers||26.0%|Easy||
|0194|Transpose File||25.3%|Medium||
|0195|Tenth Line||32.9%|Easy||
|0196|Delete Duplicate Emails||58.3%|Easy||
|0197|Rising Temperature||44.4%|Easy||
|0198|House Robber|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)|48.6%|Medium||
|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|61.1%|Medium||
|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|56.1%|Medium||
|0201|Bitwise AND of Numbers Range|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)|42.2%|Medium||
|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|54.3%|Easy||
|0203|Remove Linked List Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)|44.7%|Easy||
|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|33.1%|Medium||
|0205|Isomorphic Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)|42.5%|Easy||
|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|72.3%|Easy||
|0207|Course Schedule|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)|45.3%|Medium||
|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree)|60.7%|Medium||
|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|44.4%|Medium||
|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|47.9%|Medium||
|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|43.2%|Medium||
|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|37.0%|Hard||
|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|40.6%|Medium||
|0214|Shortest Palindrome||32.2%|Hard||
|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|65.7%|Medium||
|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|67.0%|Medium||
|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|61.2%|Easy||
|0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|41.5%|Hard||
|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|40.9%|Easy||
|0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.8%|Hard||
|0221|Maximal Square||44.4%|Medium||
|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|57.4%|Medium||
|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|40.8%|Medium||
|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|41.1%|Hard||
|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|57.4%|Easy||
|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|73.1%|Easy||
|0227|Basic Calculator II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0227.Basic-Calculator-II)|42.2%|Medium||
|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|46.8%|Easy||
|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|44.0%|Medium||
|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|69.2%|Medium||
|0231|Power of Two|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)|45.6%|Easy||
|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|61.0%|Easy||
|0233|Number of Digit One||34.2%|Hard||
|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|49.4%|Easy||
|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|60.1%|Medium||
|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|57.9%|Medium||
|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|75.1%|Medium||
|0238|Product of Array Except Self||64.7%|Medium||
|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|46.6%|Hard||
|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|50.5%|Medium||
|0241|Different Ways to Add Parentheses||63.1%|Medium||
|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|62.7%|Easy||
|0243|Shortest Word Distance||64.9%|Easy||
|0244|Shortest Word Distance II||60.7%|Medium||
|0245|Shortest Word Distance III||57.5%|Medium||
|0246|Strobogrammatic Number||47.6%|Easy||
|0247|Strobogrammatic Number II||51.4%|Medium||
|0248|Strobogrammatic Number III||41.7%|Hard||
|0249|Group Shifted Strings||64.2%|Medium||
|0250|Count Univalue Subtrees||55.2%|Medium||
|0251|Flatten 2D Vector||48.9%|Medium||
|0252|Meeting Rooms||57.0%|Easy||
|0253|Meeting Rooms II||50.4%|Medium||
|0254|Factor Combinations||48.8%|Medium||
|0255|Verify Preorder Sequence in Binary Search Tree||48.0%|Medium||
|0256|Paint House||60.5%|Medium||
|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|60.5%|Easy||
|0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|63.3%|Easy||
|0259|3Sum Smaller||50.7%|Medium||
|0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|67.4%|Medium||
|0261|Graph Valid Tree||46.8%|Medium||
|0262|Trips and Users||38.4%|Hard||
|0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.7%|Easy||
|0264|Ugly Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0264.Ugly-Number-II)|46.1%|Medium||
|0265|Paint House II||52.2%|Hard||
|0266|Palindrome Permutation||65.8%|Easy||
|0267|Palindrome Permutation II||40.4%|Medium||
|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|61.5%|Easy||
|0269|Alien Dictionary||35.2%|Hard||
|0270|Closest Binary Search Tree Value||54.5%|Easy||
|0271|Encode and Decode Strings||41.3%|Medium||
|0272|Closest Binary Search Tree Value II||58.2%|Hard||
|0273|Integer to English Words||29.9%|Hard||
|0274|H-Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)|38.1%|Medium||
|0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|37.4%|Medium||
|0276|Paint Fence||44.0%|Medium||
|0277|Find the Celebrity||46.7%|Medium||
|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|42.9%|Easy||
|0279|Perfect Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0279.Perfect-Squares)|52.2%|Medium||
|0280|Wiggle Sort||66.3%|Medium||
|0281|Zigzag Iterator||62.3%|Medium||
|0282|Expression Add Operators||39.2%|Hard||
|0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|61.3%|Easy||
|0284|Peeking Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0284.Peeking-Iterator)|58.2%|Medium||
|0285|Inorder Successor in BST||48.3%|Medium||
|0286|Walls and Gates||60.2%|Medium||
|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|59.1%|Medium||
|0288|Unique Word Abbreviation||25.2%|Medium||
|0289|Game of Life||66.6%|Medium||
|0290|Word Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)|40.4%|Easy||
|0291|Word Pattern II||46.9%|Medium||
|0292|Nim Game||55.8%|Easy||
|0293|Flip Game||63.0%|Easy||
|0294|Flip Game II||51.7%|Medium||
|0295|Find Median from Data Stream||51.1%|Hard||
|0296|Best Meeting Point||59.6%|Hard||
|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|54.9%|Hard||
|0298|Binary Tree Longest Consecutive Sequence||52.5%|Medium||
|0299|Bulls and Cows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0299.Bulls-and-Cows)|48.5%|Medium||
|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|51.5%|Medium||
|0301|Remove Invalid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0301.Remove-Invalid-Parentheses)|47.1%|Hard||
|0302|Smallest Rectangle Enclosing Black Pixels||58.2%|Hard||
|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query-Immutable)|57.9%|Easy||
|0304|Range Sum Query 2D - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0304.Range-Sum-Query-2D-Immutable)|52.1%|Medium||
|0305|Number of Islands II||39.5%|Hard||
|0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|30.9%|Medium||
|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query-Mutable)|40.7%|Medium||
|0308|Range Sum Query 2D - Mutable||42.2%|Hard||
|0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|54.4%|Medium||
|0310|Minimum Height Trees||38.5%|Medium||
|0311|Sparse Matrix Multiplication||67.1%|Medium||
|0312|Burst Balloons||56.9%|Hard||
|0313|Super Ugly Number||45.8%|Medium||
|0314|Binary Tree Vertical Order Traversal||52.0%|Medium||
|0315|Count of Smaller Numbers After Self|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)|42.8%|Hard||
|0316|Remove Duplicate Letters||44.5%|Medium||
|0317|Shortest Distance from All Buildings||43.0%|Hard||
|0318|Maximum Product of Word Lengths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)|60.1%|Medium||
|0319|Bulb Switcher|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0319.Bulb-Switcher)|48.0%|Medium||
|0320|Generalized Abbreviation||57.3%|Medium||
|0321|Create Maximum Number||28.8%|Hard||
|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|41.5%|Medium||
|0323|Number of Connected Components in an Undirected Graph||62.0%|Medium||
|0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|32.9%|Medium||
|0325|Maximum Size Subarray Sum Equals k||49.3%|Medium||
|0326|Power of Three|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)|45.2%|Easy||
|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|36.0%|Hard||
|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|60.2%|Medium||
|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|52.1%|Hard||
|0330|Patching Array||40.0%|Hard||
|0331|Verify Preorder Serialization of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)|44.2%|Medium||
|0332|Reconstruct Itinerary||40.9%|Hard||
|0333|Largest BST Subtree||42.3%|Medium||
|0334|Increasing Triplet Subsequence||42.7%|Medium||
|0335|Self Crossing||29.3%|Hard||
|0336|Palindrome Pairs||35.2%|Hard||
|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|53.8%|Medium||
|0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|75.2%|Easy||
|0339|Nested List Weight Sum||82.0%|Medium||
|0340|Longest Substring with At Most K Distinct Characters||47.8%|Medium||
|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|61.5%|Medium||
|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|45.6%|Easy||
|0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|55.3%|Medium||
|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|76.1%|Easy||
|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|47.7%|Easy||
|0346|Moving Average from Data Stream||77.0%|Easy||
|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|64.8%|Medium||
|0348|Design Tic-Tac-Toe||57.6%|Medium||
|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|70.2%|Easy||
|0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|55.5%|Easy||
|0351|Android Unlock Patterns||51.3%|Medium||
|0352|Data Stream as Disjoint Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0352.Data-Stream-as-Disjoint-Intervals)|51.5%|Hard||
|0353|Design Snake Game||39.0%|Medium||
|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|38.3%|Hard||
|0355|Design Twitter||36.5%|Medium||
|0356|Line Reflection||34.6%|Medium||
|0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|51.5%|Medium||
|0358|Rearrange String k Distance Apart||37.5%|Hard||
|0359|Logger Rate Limiter||75.5%|Easy||
|0360|Sort Transformed Array||54.6%|Medium||
|0361|Bomb Enemy||50.9%|Medium||
|0362|Design Hit Counter||68.3%|Medium||
|0363|Max Sum of Rectangle No Larger Than K||44.1%|Hard||
|0364|Nested List Weight Sum II||67.3%|Medium||
|0365|Water and Jug Problem||36.5%|Medium||
|0366|Find Leaves of Binary Tree||80.1%|Medium||
|0367|Valid Perfect Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square)|43.3%|Easy||
|0368|Largest Divisible Subset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0368.Largest-Divisible-Subset)|41.2%|Medium||
|0369|Plus One Linked List||60.9%|Medium||
|0370|Range Addition||70.8%|Medium||
|0371|Sum of Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)|50.7%|Medium||
|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|37.2%|Medium||
|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.4%|Medium||
|0374|Guess Number Higher or Lower|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0374.Guess-Number-Higher-or-Lower)|50.4%|Easy||
|0375|Guess Number Higher or Lower II||46.3%|Medium||
|0376|Wiggle Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0376.Wiggle-Subsequence)|48.2%|Medium||
|0377|Combination Sum IV|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0377.Combination-Sum-IV)|52.1%|Medium||
|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|61.6%|Medium||
|0379|Design Phone Directory||50.9%|Medium||
|0380|Insert Delete GetRandom O(1)||52.0%|Medium||
|0381|Insert Delete GetRandom O(1) - Duplicates allowed||35.7%|Hard||
|0382|Linked List Random Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0382.Linked-List-Random-Node)|59.5%|Medium||
|0383|Ransom Note|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0383.Ransom-Note)|57.6%|Easy||
|0384|Shuffle an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0384.Shuffle-an-Array)|57.6%|Medium||
|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|36.5%|Medium||
|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|60.5%|Medium||
|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|58.8%|Easy||
|0388|Longest Absolute File Path||46.5%|Medium||
|0389|Find the Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)|60.4%|Easy||
|0390|Elimination Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0390.Elimination-Game)|46.6%|Medium||
|0391|Perfect Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0391.Perfect-Rectangle)|32.5%|Hard||
|0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|49.3%|Easy||
|0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|45.2%|Medium||
|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|57.5%|Medium||
|0395|Longest Substring with At Least K Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters)|44.8%|Medium||
|0396|Rotate Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0396.Rotate-Function)|40.3%|Medium||
|0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|35.1%|Medium||
|0398|Random Pick Index||62.9%|Medium||
|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|59.5%|Medium||
|0400|Nth Digit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0400.Nth-Digit)|34.0%|Medium||
|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|51.4%|Easy||
|0402|Remove K Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)|30.5%|Medium||
|0403|Frog Jump||43.1%|Hard||
|0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|56.2%|Easy||
|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|46.1%|Easy||
|0406|Queue Reconstruction by Height||72.8%|Medium||
|0407|Trapping Rain Water II||47.4%|Hard||
|0408|Valid Word Abbreviation||34.8%|Easy||
|0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|54.6%|Easy||
|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|53.2%|Hard||
|0411|Minimum Unique Word Abbreviation||39.2%|Hard||
|0412|Fizz Buzz|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz)|68.6%|Easy||
|0413|Arithmetic Slices|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0413.Arithmetic-Slices)|65.0%|Medium||
|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|32.5%|Easy||
|0415|Add Strings||52.6%|Easy||
|0416|Partition Equal Subset Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)|46.7%|Medium||
|0417|Pacific Atlantic Water Flow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0417.Pacific-Atlantic-Water-Flow)|53.9%|Medium||
|0418|Sentence Screen Fitting||35.6%|Medium||
|0419|Battleships in a Board|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0419.Battleships-in-a-Board)|74.6%|Medium||
|0420|Strong Password Checker||14.3%|Hard||
|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.6%|Medium||
|0422|Valid Word Square||38.8%|Easy||
|0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.3%|Medium||
|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|51.4%|Medium||
|0425|Word Squares||52.6%|Hard||
|0426|Convert Binary Search Tree to Sorted Doubly Linked List||64.6%|Medium||
|0427|Construct Quad Tree||66.3%|Medium||
|0428|Serialize and Deserialize N-ary Tree||65.3%|Hard||
|0429|N-ary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0429.N-ary-Tree-Level-Order-Traversal)|70.6%|Medium||
|0430|Flatten a Multilevel Doubly Linked List||59.4%|Medium||
|0431|Encode N-ary Tree to Binary Tree||78.6%|Hard||
|0432|All O`one Data Structure||36.6%|Hard||
|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|48.1%|Medium||
|0434|Number of Segments in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0434.Number-of-Segments-in-a-String)|37.7%|Easy||
|0435|Non-overlapping Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals)|49.8%|Medium||
|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|50.3%|Medium||
|0437|Path Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)|48.8%|Medium||
|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|48.9%|Medium||
|0439|Ternary Expression Parser||58.2%|Medium||
|0440|K-th Smallest in Lexicographical Order||30.7%|Hard||
|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|46.0%|Easy||
|0442|Find All Duplicates in an Array||73.3%|Medium||
|0443|String Compression||48.7%|Medium||
|0444|Sequence Reconstruction||26.3%|Medium||
|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|59.4%|Medium||
|0446|Arithmetic Slices II - Subsequence||39.8%|Hard||
|0447|Number of Boomerangs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)|54.6%|Medium||
|0448|Find All Numbers Disappeared in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array)|59.6%|Easy||
|0449|Serialize and Deserialize BST||56.7%|Medium||
|0450|Delete Node in a BST||49.9%|Medium||
|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|68.5%|Medium||
|0452|Minimum Number of Arrows to Burst Balloons||53.2%|Medium||
|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|55.6%|Medium||
|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|57.3%|Medium||
|0455|Assign Cookies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies)|50.6%|Easy||
|0456|132 Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern)|32.4%|Medium||
|0457|Circular Array Loop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop)|32.1%|Medium||
|0458|Poor Pigs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0458.Poor-Pigs)|65.0%|Hard||
|0459|Repeated Substring Pattern||43.7%|Easy||
|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|40.3%|Hard||
|0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|74.8%|Easy||
|0462|Minimum Moves to Equal Array Elements II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II)|60.1%|Medium||
|0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|69.4%|Easy||
|0464|Can I Win||29.8%|Medium||
|0465|Optimal Account Balancing||49.3%|Hard||
|0466|Count The Repetitions||29.2%|Hard||
|0467|Unique Substrings in Wraparound String||38.2%|Medium||
|0468|Validate IP Address||26.5%|Medium||
|0469|Convex Polygon||38.5%|Medium||
|0470|Implement Rand10() Using Rand7()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7)|46.7%|Medium||
|0471|Encode String with Shortest Length||50.7%|Hard||
|0472|Concatenated Words||45.5%|Hard||
|0473|Matchsticks to Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0473.Matchsticks-to-Square)|40.5%|Medium||
|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|46.7%|Medium||
|0475|Heaters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters)|36.0%|Medium||
|0476|Number Complement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)|67.1%|Easy||
|0477|Total Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance)|52.2%|Medium||
|0478|Generate Random Point in a Circle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0478.Generate-Random-Point-in-a-Circle)|39.6%|Medium||
|0479|Largest Palindrome Product||31.6%|Hard||
|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|41.4%|Hard||
|0481|Magical String||50.4%|Medium||
|0482|License Key Formatting||43.2%|Easy||
|0483|Smallest Good Base|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base)|38.4%|Hard||
|0484|Find Permutation||67.0%|Medium||
|0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|56.0%|Easy||
|0486|Predict the Winner||50.8%|Medium||
|0487|Max Consecutive Ones II||49.2%|Medium||
|0488|Zuma Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0488.Zuma-Game)|34.9%|Hard||
|0489|Robot Room Cleaner||76.5%|Hard||
|0490|The Maze||55.4%|Medium||
|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|52.0%|Medium||
|0492|Construct the Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0492.Construct-the-Rectangle)|53.6%|Easy||
|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|30.8%|Hard||
|0494|Target Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum)|45.6%|Medium||
|0495|Teemo Attacking|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0495.Teemo-Attacking)|57.0%|Easy||
|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|71.3%|Easy||
|0497|Random Point in Non-overlapping Rectangles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles)|39.3%|Medium||
|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|58.0%|Medium||
|0499|The Maze III||46.9%|Hard||
|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|69.0%|Easy||
|0501|Find Mode in Binary Search Tree||48.5%|Easy||
|0502|IPO||44.9%|Hard||
|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|63.0%|Medium||
|0504|Base 7|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0504.Base-7)|47.9%|Easy||
|0505|The Maze II||52.4%|Medium||
|0506|Relative Ranks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0506.Relative-Ranks)|58.8%|Easy||
|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|37.7%|Easy||
|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|64.2%|Medium||
|0509|Fibonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number)|69.2%|Easy||
|0510|Inorder Successor in BST II||61.1%|Medium||
|0511|Game Play Analysis I||78.8%|Easy||
|0512|Game Play Analysis II||54.1%|Easy||
|0513|Find Bottom Left Tree Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value)|66.3%|Medium||
|0514|Freedom Trail||46.8%|Hard||
|0515|Find Largest Value in Each Tree Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)|64.6%|Medium||
|0516|Longest Palindromic Subsequence||60.6%|Medium||
|0517|Super Washing Machines||39.7%|Hard||
|0518|Coin Change II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0518.Coin-Change-II)|59.7%|Medium||
|0519|Random Flip Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0519.Random-Flip-Matrix)|39.6%|Medium||
|0520|Detect Capital|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0520.Detect-Capital)|55.6%|Easy||
|0521|Longest Uncommon Subsequence I||60.3%|Easy||
|0522|Longest Uncommon Subsequence II||40.4%|Medium||
|0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|27.7%|Medium||
|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|51.2%|Medium||
|0525|Contiguous Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0525.Contiguous-Array)|46.8%|Medium||
|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|64.6%|Medium||
|0527|Word Abbreviation||60.3%|Hard||
|0528|Random Pick with Weight|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight)|46.1%|Medium||
|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|65.5%|Medium||
|0530|Minimum Absolute Difference in BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0530.Minimum-Absolute-Difference-in-BST)|56.7%|Easy||
|0531|Lonely Pixel I||62.0%|Medium||
|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|40.7%|Medium||
|0533|Lonely Pixel II||48.4%|Medium||
|0534|Game Play Analysis III||82.5%|Medium||
|0535|Encode and Decode TinyURL|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0535.Encode-and-Decode-TinyURL)|85.7%|Medium||
|0536|Construct Binary Tree from String||56.1%|Medium||
|0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|71.3%|Medium||
|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|67.3%|Medium||
|0539|Minimum Time Difference||56.3%|Medium||
|0540|Single Element in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0540.Single-Element-in-a-Sorted-Array)|58.5%|Medium||
|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|50.5%|Easy||
|0542|01 Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)|44.1%|Medium||
|0543|Diameter of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0543.Diameter-of-Binary-Tree)|55.9%|Easy||
|0544|Output Contest Matches||76.7%|Medium||
|0545|Boundary of Binary Tree||44.2%|Medium||
|0546|Remove Boxes||47.6%|Hard||
|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|63.2%|Medium||
|0548|Split Array with Equal Sum||50.1%|Hard||
|0549|Binary Tree Longest Consecutive Sequence II||49.5%|Medium||
|0550|Game Play Analysis IV||44.1%|Medium||
|0551|Student Attendance Record I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0551.Student-Attendance-Record-I)|48.0%|Easy||
|0552|Student Attendance Record II||41.1%|Hard||
|0553|Optimal Division||59.7%|Medium||
|0554|Brick Wall|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0554.Brick-Wall)|53.1%|Medium||
|0555|Split Concatenated Strings||43.5%|Medium||
|0556|Next Greater Element III||34.1%|Medium||
|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|81.5%|Easy||
|0558|Logical OR of Two Binary Grids Represented as Quad-Trees||48.2%|Medium||
|0559|Maximum Depth of N-ary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0559.Maximum-Depth-of-N-ary-Tree)|71.6%|Easy||
|0560|Subarray Sum Equals K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0560.Subarray-Sum-Equals-K)|44.0%|Medium||
|0561|Array Partition|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition)|76.5%|Easy||
|0562|Longest Line of Consecutive One in Matrix||50.0%|Medium||
|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|59.3%|Easy||
|0564|Find the Closest Palindrome||21.9%|Hard||
|0565|Array Nesting||56.5%|Medium||
|0566|Reshape the Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)|62.7%|Easy||
|0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|43.8%|Medium||
|0568|Maximum Vacation Days||44.8%|Hard||
|0569|Median Employee Salary||68.3%|Hard||
|0570|Managers with at Least 5 Direct Reports||67.1%|Medium||
|0571|Find Median Given Frequency of Numbers||44.7%|Hard||
|0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|45.9%|Easy||
|0573|Squirrel Simulation||55.0%|Medium||
|0574|Winning Candidate||59.7%|Medium||
|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|66.1%|Easy||
|0576|Out of Boundary Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0576.Out-of-Boundary-Paths)|44.3%|Medium||
|0577|Employee Bonus||75.3%|Easy||
|0578|Get Highest Answer Rate Question||41.7%|Medium||
|0579|Find Cumulative Salary of an Employee||45.0%|Hard||
|0580|Count Student Number in Departments||58.2%|Medium||
|0581|Shortest Unsorted Continuous Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0581.Shortest-Unsorted-Continuous-Subarray)|36.2%|Medium||
|0582|Kill Process||68.4%|Medium||
|0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|59.2%|Medium||
|0584|Find Customer Referee||76.0%|Easy||
|0585|Investments in 2016||53.5%|Medium||
|0586|Customer Placing the Largest Number of Orders||72.5%|Easy||
|0587|Erect the Fence||43.2%|Hard||
|0588|Design In-Memory File System||48.8%|Hard||
|0589|N-ary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0589.N-ary-Tree-Preorder-Traversal)|76.3%|Easy||
|0590|N-ary Tree Postorder Traversal||77.1%|Easy||
|0591|Tag Validator||37.0%|Hard||
|0592|Fraction Addition and Subtraction||52.1%|Medium||
|0593|Valid Square||44.1%|Medium||
|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|53.1%|Easy||
|0595|Big Countries||73.8%|Easy||
|0596|Classes More Than 5 Students||46.5%|Easy||
|0597|Friend Requests I: Overall Acceptance Rate||42.9%|Easy||
|0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|55.0%|Easy||
|0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|52.7%|Easy||
|0600|Non-negative Integers without Consecutive Ones||39.0%|Hard||
|0601|Human Traffic of Stadium||50.6%|Hard||
|0602|Friend Requests II: Who Has the Most Friends||61.3%|Medium||
|0603|Consecutive Available Seats||68.2%|Easy||
|0604|Design Compressed String Iterator||39.4%|Easy||
|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|33.0%|Easy||
|0606|Construct String from Binary Tree||63.5%|Easy||
|0607|Sales Person||72.1%|Easy||
|0608|Tree Node||74.9%|Medium||
|0609|Find Duplicate File in System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0609.Find-Duplicate-File-in-System)|67.8%|Medium||
|0610|Triangle Judgement||71.1%|Easy||
|0611|Valid Triangle Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0611.Valid-Triangle-Number)|50.3%|Medium||
|0612|Shortest Distance in a Plane||63.5%|Medium||
|0613|Shortest Distance in a Line||81.5%|Easy||
|0614|Second Degree Follower||36.9%|Medium||
|0615|Average Salary: Departments VS Company||57.3%|Hard||
|0616|Add Bold Tag in String||48.6%|Medium||
|0617|Merge Two Binary Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0617.Merge-Two-Binary-Trees)|78.5%|Easy||
|0618|Students Report By Geography||64.2%|Hard||
|0619|Biggest Single Number||48.7%|Easy||
|0620|Not Boring Movies||73.3%|Easy||
|0621|Task Scheduler||55.6%|Medium||
|0622|Design Circular Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0622.Design-Circular-Queue)|51.8%|Medium||
|0623|Add One Row to Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0623.Add-One-Row-to-Tree)|59.4%|Medium||
|0624|Maximum Distance in Arrays||41.7%|Medium||
|0625|Minimum Factorization||33.4%|Medium||
|0626|Exchange Seats||70.6%|Medium||
|0627|Swap Salary||82.8%|Easy||
|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.4%|Easy||
|0629|K Inverse Pairs Array||43.0%|Hard||
|0630|Course Schedule III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0630.Course-Schedule-III)|40.2%|Hard||
|0631|Design Excel Sum Formula||43.3%|Hard||
|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|60.4%|Hard||
|0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|34.7%|Medium||
|0634|Find the Derangement of An Array||41.8%|Medium||
|0635|Design Log Storage System||62.7%|Medium||
|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|61.0%|Medium||
|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|71.6%|Easy||
|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|54.3%|Medium||
|0639|Decode Ways II||30.4%|Hard||
|0640|Solve the Equation||43.3%|Medium||
|0641|Design Circular Deque||57.6%|Medium||
|0642|Design Search Autocomplete System||48.7%|Hard||
|0643|Maximum Average Subarray I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0643.Maximum-Average-Subarray-I)|43.8%|Easy||
|0644|Maximum Average Subarray II||35.7%|Hard||
|0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|41.4%|Easy||
|0646|Maximum Length of Pair Chain||56.4%|Medium||
|0647|Palindromic Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0647.Palindromic-Substrings)|66.3%|Medium||
|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|62.7%|Medium||
|0649|Dota2 Senate||40.4%|Medium||
|0650|2 Keys Keyboard||53.1%|Medium||
|0651|4 Keys Keyboard||54.5%|Medium||
|0652|Find Duplicate Subtrees||56.5%|Medium||
|0653|Two Sum IV - Input is a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV-Input-is-a-BST)|60.9%|Easy||
|0654|Maximum Binary Tree||84.4%|Medium||
|0655|Print Binary Tree||61.3%|Medium||
|0656|Coin Path||31.6%|Hard||
|0657|Robot Return to Origin||75.3%|Easy||
|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|46.7%|Medium||
|0659|Split Array into Consecutive Subsequences||50.6%|Medium||
|0660|Remove 9||56.8%|Hard||
|0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|55.0%|Easy||
|0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|40.6%|Medium||
|0663|Equal Tree Partition||41.4%|Medium||
|0664|Strange Printer||46.8%|Hard||
|0665|Non-decreasing Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0665.Non-decreasing-Array)|24.1%|Medium||
|0666|Path Sum IV||59.1%|Medium||
|0667|Beautiful Arrangement II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0667.Beautiful-Arrangement-II)|59.7%|Medium||
|0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|51.5%|Hard||
|0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|66.3%|Medium||
|0670|Maximum Swap||47.8%|Medium||
|0671|Second Minimum Node In a Binary Tree||44.0%|Easy||
|0672|Bulb Switcher II||50.9%|Medium||
|0673|Number of Longest Increasing Subsequence||42.1%|Medium||
|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|49.0%|Easy||
|0675|Cut Off Trees for Golf Event||34.3%|Hard||
|0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|56.9%|Medium||
|0677|Map Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0677.Map-Sum-Pairs)|57.0%|Medium||
|0678|Valid Parenthesis String||33.9%|Medium||
|0679|24 Game||49.1%|Hard||
|0680|Valid Palindrome II||39.3%|Easy||
|0681|Next Closest Time||46.4%|Medium||
|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|73.6%|Easy||
|0683|K Empty Slots||36.9%|Hard||
|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|62.0%|Medium||
|0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|34.1%|Hard||
|0686|Repeated String Match||34.0%|Medium||
|0687|Longest Univalue Path||40.1%|Medium||
|0688|Knight Probability in Chessboard||52.0%|Medium||
|0689|Maximum Sum of 3 Non-Overlapping Subarrays||48.8%|Hard||
|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|65.1%|Medium||
|0691|Stickers to Spell Word||46.3%|Hard||
|0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|55.2%|Medium||
|0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|61.2%|Easy||
|0694|Number of Distinct Islands||60.6%|Medium||
|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|71.6%|Medium||
|0696|Count Binary Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0696.Count-Binary-Substrings)|65.5%|Easy||
|0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|55.8%|Easy||
|0698|Partition to K Equal Sum Subsets||41.1%|Medium||
|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|44.4%|Hard||
|0700|Search in a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0700.Search-in-a-Binary-Search-Tree)|77.1%|Easy||
|0701|Insert into a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0701.Insert-into-a-Binary-Search-Tree)|74.6%|Medium||
|0702|Search in a Sorted Array of Unknown Size||71.4%|Medium||
|0703|Kth Largest Element in a Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0703.Kth-Largest-Element-in-a-Stream)|55.5%|Easy||
|0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|55.1%|Easy||
|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|66.0%|Easy||
|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|65.1%|Easy||
|0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|27.5%|Medium||
|0708|Insert into a Sorted Circular Linked List||34.5%|Medium||
|0709|To Lower Case|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0709.To-Lower-Case)|81.9%|Easy||
|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|33.6%|Hard||
|0711|Number of Distinct Islands II||51.8%|Hard||
|0712|Minimum ASCII Delete Sum for Two Strings||62.2%|Medium||
|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|45.0%|Medium||
|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|64.2%|Medium||
|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|44.6%|Hard||
|0716|Max Stack||45.3%|Hard||
|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|46.0%|Easy||
|0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|51.6%|Medium||
|0719|Find K-th Smallest Pair Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance)|36.3%|Hard||
|0720|Longest Word in Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)|51.8%|Medium||
|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|56.3%|Medium||
|0722|Remove Comments||38.0%|Medium||
|0723|Candy Crush||76.3%|Medium||
|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|53.3%|Easy||
|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|57.2%|Medium||
|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|52.2%|Hard||
|0727|Minimum Window Subsequence||42.8%|Hard||
|0728|Self Dividing Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0728.Self-Dividing-Numbers)|77.5%|Easy||
|0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|57.2%|Medium||
|0730|Count Different Palindromic Subsequences||44.4%|Hard||
|0731|My Calendar II||54.7%|Medium||
|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|71.6%|Hard||
|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|60.3%|Easy||
|0734|Sentence Similarity||43.1%|Easy||
|0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|44.4%|Medium||
|0736|Parse Lisp Expression||51.6%|Hard||
|0737|Sentence Similarity II||48.7%|Medium||
|0738|Monotone Increasing Digits||47.0%|Medium||
|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|66.5%|Medium||
|0740|Delete and Earn||57.4%|Medium||
|0741|Cherry Pickup||36.3%|Hard||
|0742|Closest Leaf in a Binary Tree||45.8%|Medium||
|0743|Network Delay Time||51.4%|Medium||
|0744|Find Smallest Letter Greater Than Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target)|44.6%|Easy||
|0745|Prefix and Suffix Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search)|41.3%|Hard||
|0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|62.3%|Easy||
|0747|Largest Number At Least Twice of Others|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0747.Largest-Number-At-Least-Twice-of-Others)|46.3%|Easy||
|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|59.1%|Easy||
|0749|Contain Virus||50.8%|Hard||
|0750|Number Of Corner Rectangles||67.5%|Medium||
|0751|IP to CIDR||54.7%|Medium||
|0752|Open the Lock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0752.Open-the-Lock)|55.5%|Medium||
|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|55.4%|Hard||
|0754|Reach a Number||42.5%|Medium||
|0755|Pour Water||46.1%|Medium||
|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|53.3%|Medium||
|0757|Set Intersection Size At Least Two||43.8%|Hard||
|0758|Bold Words in String||50.6%|Medium||
|0759|Employee Free Time||71.7%|Hard||
|0760|Find Anagram Mappings||82.8%|Easy||
|0761|Special Binary String||60.3%|Hard||
|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|67.6%|Easy||
|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|79.8%|Medium||
|0764|Largest Plus Sign||48.4%|Medium||
|0765|Couples Holding Hands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)|56.9%|Hard||
|0766|Toeplitz Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix)|68.1%|Easy||
|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|52.7%|Medium||
|0768|Max Chunks To Make Sorted II||52.7%|Hard||
|0769|Max Chunks To Make Sorted||58.2%|Medium||
|0770|Basic Calculator IV||56.0%|Hard||
|0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|88.0%|Easy||
|0772|Basic Calculator III||48.4%|Hard||
|0773|Sliding Puzzle||63.7%|Hard||
|0774|Minimize Max Distance to Gas Station||51.4%|Hard||
|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|43.8%|Medium||
|0776|Split BST||58.7%|Medium||
|0777|Swap Adjacent in LR String||37.1%|Medium||
|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|59.6%|Hard||
|0779|K-th Symbol in Grammar||40.7%|Medium||
|0780|Reaching Points||32.3%|Hard||
|0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|55.3%|Medium||
|0782|Transform to Chessboard||51.9%|Hard||
|0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|56.8%|Easy||
|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|73.4%|Medium||
|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite)|52.6%|Medium||
|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|50.6%|Medium||
|0787|Cheapest Flights Within K Stops||35.9%|Medium||
|0788|Rotated Digits||56.9%|Medium||
|0789|Escape The Ghosts||60.6%|Medium||
|0790|Domino and Tromino Tiling||48.4%|Medium||
|0791|Custom Sort String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0791.Custom-Sort-String)|69.4%|Medium||
|0792|Number of Matching Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0792.Number-of-Matching-Subsequences)|51.9%|Medium||
|0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|42.7%|Hard||
|0794|Valid Tic-Tac-Toe State|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0794.Valid-Tic-Tac-Toe-State)|35.2%|Medium||
|0795|Number of Subarrays with Bounded Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum)|52.7%|Medium||
|0796|Rotate String||54.0%|Easy||
|0797|All Paths From Source to Target||81.4%|Medium||
|0798|Smallest Rotation with Highest Score||49.6%|Hard||
|0799|Champagne Tower||51.2%|Medium||
|0800|Similar RGB Color||66.4%|Easy||
|0801|Minimum Swaps To Make Sequences Increasing||39.2%|Hard||
|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|54.9%|Medium||
|0803|Bricks Falling When Hit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)|34.3%|Hard||
|0804|Unique Morse Code Words||82.6%|Easy||
|0805|Split Array With Same Average||25.9%|Hard||
|0806|Number of Lines To Write String||66.1%|Easy||
|0807|Max Increase to Keep City Skyline|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0807.Max-Increase-to-Keep-City-Skyline)|85.9%|Medium||
|0808|Soup Servings||43.1%|Medium||
|0809|Expressive Words||46.3%|Medium||
|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|55.1%|Hard||
|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|75.1%|Medium||
|0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|60.1%|Easy||
|0813|Largest Sum of Averages||52.9%|Medium||
|0814|Binary Tree Pruning||72.6%|Medium||
|0815|Bus Routes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes)|45.7%|Hard||
|0816|Ambiguous Coordinates|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0816.Ambiguous-Coordinates)|56.0%|Medium||
|0817|Linked List Components|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)|58.1%|Medium||
|0818|Race Car||43.6%|Hard||
|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.0%|Easy||
|0820|Short Encoding of Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0820.Short-Encoding-of-Words)|60.7%|Medium||
|0821|Shortest Distance to a Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0821.Shortest-Distance-to-a-Character)|71.3%|Easy||
|0822|Card Flipping Game||45.4%|Medium||
|0823|Binary Trees With Factors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0823.Binary-Trees-With-Factors)|50.0%|Medium||
|0824|Goat Latin||67.8%|Easy||
|0825|Friends Of Appropriate Ages|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0825.Friends-Of-Appropriate-Ages)|46.3%|Medium||
|0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|44.3%|Medium||
|0827|Making A Large Island||44.7%|Hard||
|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|51.5%|Hard||
|0829|Consecutive Numbers Sum||41.5%|Hard||
|0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|51.7%|Easy||
|0831|Masking Personal Information||46.8%|Medium||
|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|80.3%|Easy||
|0833|Find And Replace in String||54.1%|Medium||
|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|54.1%|Hard||
|0835|Image Overlap||61.0%|Medium||
|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|43.3%|Easy||
|0837|New 21 Game||36.2%|Medium||
|0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|57.0%|Medium||
|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|47.5%|Hard||
|0840|Magic Squares In Grid||38.5%|Medium||
|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|70.1%|Medium||
|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|38.2%|Medium||
|0843|Guess the Word||42.0%|Hard||
|0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|48.0%|Easy||
|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|40.1%|Medium||
|0846|Hand of Straights|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0846.Hand-of-Straights)|56.5%|Medium||
|0847|Shortest Path Visiting All Nodes||61.3%|Hard||
|0848|Shifting Letters||45.4%|Medium||
|0849|Maximize Distance to Closest Person||47.6%|Medium||
|0850|Rectangle Area II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II)|53.7%|Hard||
|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|58.1%|Medium||
|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|69.5%|Medium||
|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|50.0%|Medium||
|0854|K-Similar Strings||40.0%|Hard||
|0855|Exam Room||43.5%|Medium||
|0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|65.1%|Medium||
|0857|Minimum Cost to Hire K Workers||52.0%|Hard||
|0858|Mirror Reflection||63.3%|Medium||
|0859|Buddy Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0859.Buddy-Strings)|29.0%|Easy||
|0860|Lemonade Change||52.8%|Easy||
|0861|Score After Flipping Matrix||75.1%|Medium||
|0862|Shortest Subarray with Sum at Least K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K)|26.1%|Hard||
|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|62.1%|Medium||
|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|45.3%|Hard||
|0865|Smallest Subtree with all the Deepest Nodes||68.5%|Medium||
|0866|Prime Palindrome||25.8%|Medium||
|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|63.4%|Easy||
|0868|Binary Gap||61.9%|Easy||
|0869|Reordered Power of 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0869.Reordered-Power-of-2)|64.1%|Medium||
|0870|Advantage Shuffle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0870.Advantage-Shuffle)|51.6%|Medium||
|0871|Minimum Number of Refueling Stops||39.9%|Hard||
|0872|Leaf-Similar Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees)|65.2%|Easy||
|0873|Length of Longest Fibonacci Subsequence||48.6%|Medium||
|0874|Walking Robot Simulation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0874.Walking-Robot-Simulation)|38.3%|Medium||
|0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|52.4%|Medium||
|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|73.7%|Easy||
|0877|Stone Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0877.Stone-Game)|69.7%|Medium||
|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|35.7%|Hard||
|0879|Profitable Schemes||40.5%|Hard||
|0880|Decoded String at Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)|28.3%|Medium||
|0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|52.7%|Medium||
|0882|Reachable Nodes In Subdivided Graph||50.3%|Hard||
|0883|Projection Area of 3D Shapes||70.7%|Easy||
|0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|65.9%|Easy||
|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|73.0%|Medium||
|0886|Possible Bipartition||48.4%|Medium||
|0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|27.2%|Hard||
|0888|Fair Candy Swap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap)|60.5%|Easy||
|0889|Construct Binary Tree from Preorder and Postorder Traversal||70.8%|Medium||
|0890|Find and Replace Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0890.Find-and-Replace-Pattern)|77.9%|Medium||
|0891|Sum of Subsequence Widths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)|36.4%|Hard||
|0892|Surface Area of 3D Shapes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes)|63.0%|Easy||
|0893|Groups of Special-Equivalent Strings||70.8%|Medium||
|0894|All Possible Full Binary Trees||80.0%|Medium||
|0895|Maximum Frequency Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)|66.8%|Hard||
|0896|Monotonic Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array)|58.2%|Easy||
|0897|Increasing Order Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree)|78.4%|Easy||
|0898|Bitwise ORs of Subarrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)|36.8%|Medium||
|0899|Orderly Queue||59.0%|Hard||
|0900|RLE Iterator||59.5%|Medium||
|0901|Online Stock Span|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)|63.9%|Medium||
|0902|Numbers At Most N Given Digit Set||41.4%|Hard||
|0903|Valid Permutations for DI Sequence||57.7%|Hard||
|0904|Fruit Into Baskets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets)|42.6%|Medium||
|0905|Sort Array By Parity||75.7%|Easy||
|0906|Super Palindromes||39.2%|Hard||
|0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|34.3%|Medium||
|0908|Smallest Range I||67.6%|Easy||
|0909|Snakes and Ladders|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0909.Snakes-and-Ladders)|40.8%|Medium||
|0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|34.4%|Medium||
|0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|52.1%|Medium||
|0912|Sort an Array||60.0%|Medium||
|0913|Cat and Mouse||35.3%|Hard||
|0914|X of a Kind in a Deck of Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards)|32.2%|Easy||
|0915|Partition Array into Disjoint Intervals||48.6%|Medium||
|0916|Word Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0916.Word-Subsets)|54.1%|Medium||
|0917|Reverse Only Letters||61.4%|Easy||
|0918|Maximum Sum Circular Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray)|38.1%|Medium||
|0919|Complete Binary Tree Inserter||64.9%|Medium||
|0920|Number of Music Playlists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists)|50.6%|Hard||
|0921|Minimum Add to Make Parentheses Valid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid)|76.4%|Medium||
|0922|Sort Array By Parity II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)|70.7%|Easy||
|0923|3Sum With Multiplicity|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity)|45.4%|Medium||
|0924|Minimize Malware Spread|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread)|42.1%|Hard||
|0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|33.8%|Easy||
|0926|Flip String to Monotone Increasing||59.6%|Medium||
|0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|39.6%|Hard||
|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|42.6%|Hard||
|0929|Unique Email Addresses||67.2%|Easy||
|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|50.9%|Medium||
|0931|Minimum Falling Path Sum||68.4%|Medium||
|0932|Beautiful Array||65.1%|Medium||
|0933|Number of Recent Calls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls)|73.2%|Easy||
|0934|Shortest Bridge||53.9%|Medium||
|0935|Knight Dialer||49.9%|Medium||
|0936|Stamping The Sequence||63.3%|Hard||
|0937|Reorder Data in Log Files||56.4%|Medium||
|0938|Range Sum of BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0938.Range-Sum-of-BST)|85.3%|Easy||
|0939|Minimum Area Rectangle||53.2%|Medium||
|0940|Distinct Subsequences II||44.4%|Hard||
|0941|Valid Mountain Array||33.5%|Easy||
|0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|76.6%|Easy||
|0943|Find the Shortest Superstring||45.0%|Hard||
|0944|Delete Columns to Make Sorted||69.7%|Easy||
|0945|Minimum Increment to Make Array Unique||49.8%|Medium||
|0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|67.6%|Medium||
|0947|Most Stones Removed with Same Row or Column|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)|57.0%|Medium||
|0948|Bag of Tokens||52.0%|Medium||
|0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|35.2%|Medium||
|0950|Reveal Cards In Increasing Order||77.6%|Medium||
|0951|Flip Equivalent Binary Trees||66.8%|Medium||
|0952|Largest Component Size by Common Factor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)|40.3%|Hard||
|0953|Verifying an Alien Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary)|52.7%|Easy||
|0954|Array of Doubled Pairs||39.1%|Medium||
|0955|Delete Columns to Make Sorted II||34.6%|Medium||
|0956|Tallest Billboard||40.0%|Hard||
|0957|Prison Cells After N Days||39.2%|Medium||
|0958|Check Completeness of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0958.Check-Completeness-of-a-Binary-Tree)|53.8%|Medium||
|0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|69.1%|Medium||
|0960|Delete Columns to Make Sorted III||57.1%|Hard||
|0961|N-Repeated Element in Size 2N Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array)|75.8%|Easy||
|0962|Maximum Width Ramp||48.9%|Medium||
|0963|Minimum Area Rectangle II||54.7%|Medium||
|0964|Least Operators to Express Number||47.8%|Hard||
|0965|Univalued Binary Tree||69.2%|Easy||
|0966|Vowel Spellchecker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0966.Vowel-Spellchecker)|51.5%|Medium||
|0967|Numbers With Same Consecutive Differences||57.0%|Medium||
|0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|46.8%|Hard||
|0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|70.0%|Medium||
|0970|Powerful Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers)|43.6%|Medium||
|0971|Flip Binary Tree To Match Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal)|49.9%|Medium||
|0972|Equal Rational Numbers||43.0%|Hard||
|0973|K Closest Points to Origin|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin)|65.9%|Medium||
|0974|Subarray Sums Divisible by K||53.6%|Medium||
|0975|Odd Even Jump||38.9%|Hard||
|0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|54.8%|Easy||
|0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|71.9%|Easy||
|0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|47.4%|Medium||
|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|72.0%|Medium||
|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|79.6%|Hard||
|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|53.6%|Medium||
|0982|Triples with Bitwise AND Equal To Zero||57.6%|Hard||
|0983|Minimum Cost For Tickets||64.4%|Medium||
|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|42.9%|Medium||
|0985|Sum of Even Numbers After Queries|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries)|68.3%|Medium||
|0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|71.4%|Medium||
|0987|Vertical Order Traversal of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree)|44.6%|Hard||
|0988|Smallest String Starting From Leaf||49.6%|Medium||
|0989|Add to Array-Form of Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0989.Add-to-Array-Form-of-Integer)|45.5%|Easy||
|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|50.7%|Medium||
|0991|Broken Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0991.Broken-Calculator)|54.1%|Medium||
|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|54.3%|Hard||
|0993|Cousins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)|54.1%|Easy||
|0994|Rotting Oranges||52.4%|Medium||
|0995|Minimum Number of K Consecutive Bit Flips|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips)|51.1%|Hard||
|0996|Number of Squareful Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)|49.2%|Hard||
|0997|Find the Town Judge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0997.Find-the-Town-Judge)|49.4%|Easy||
|0998|Maximum Binary Tree II||66.3%|Medium||
|0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.8%|Easy||
|1000|Minimum Cost to Merge Stones||42.3%|Hard||
|1001|Grid Illumination||36.2%|Hard||
|1002|Find Common Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters)|68.3%|Easy||
|1003|Check If Word Is Valid After Substitutions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)|58.2%|Medium||
|1004|Max Consecutive Ones III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)|63.5%|Medium||
|1005|Maximize Sum Of Array After K Negations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations)|51.1%|Easy||
|1006|Clumsy Factorial|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1006.Clumsy-Factorial)|54.7%|Medium||
|1007|Minimum Domino Rotations For Equal Row||52.4%|Medium||
|1008|Construct Binary Search Tree from Preorder Traversal||80.9%|Medium||
|1009|Complement of Base 10 Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1009.Complement-of-Base-10-Integer)|62.0%|Easy||
|1010|Pairs of Songs With Total Durations Divisible by 60|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60)|53.0%|Medium||
|1011|Capacity To Ship Packages Within D Days|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days)|64.4%|Medium||
|1012|Numbers With Repeated Digits||40.4%|Hard||
|1013|Partition Array Into Three Parts With Equal Sum||43.5%|Easy||
|1014|Best Sightseeing Pair||59.5%|Medium||
|1015|Smallest Integer Divisible by K||47.1%|Medium||
|1016|Binary String With Substrings Representing 1 To N||57.6%|Medium||
|1017|Convert to Base -2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base-2)|60.9%|Medium||
|1018|Binary Prefix Divisible By 5|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1018.Binary-Prefix-Divisible-By-5)|47.4%|Easy||
|1019|Next Greater Node In Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)|59.8%|Medium||
|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|64.8%|Medium||
|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|80.1%|Easy||
|1022|Sum of Root To Leaf Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers)|73.8%|Easy||
|1023|Camelcase Matching||60.1%|Medium||
|1024|Video Stitching||50.5%|Medium||
|1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|67.1%|Easy||
|1026|Maximum Difference Between Node and Ancestor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor)|73.4%|Medium||
|1027|Longest Arithmetic Subsequence||47.2%|Medium||
|1028|Recover a Tree From Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal)|72.8%|Hard||
|1029|Two City Scheduling||64.5%|Medium||
|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|69.3%|Easy||
|1031|Maximum Sum of Two Non-Overlapping Subarrays||59.4%|Medium||
|1032|Stream of Characters||51.5%|Hard||
|1033|Moving Stones Until Consecutive||45.6%|Medium||
|1034|Coloring A Border|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1034.Coloring-A-Border)|48.9%|Medium||
|1035|Uncrossed Lines||58.7%|Medium||
|1036|Escape a Large Maze||34.2%|Hard||
|1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.5%|Easy||
|1038|Binary Search Tree to Greater Sum Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree)|85.3%|Medium||
|1039|Minimum Score Triangulation of Polygon||54.5%|Medium||
|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|55.6%|Medium||
|1041|Robot Bounded In Circle||55.3%|Medium||
|1042|Flower Planting With No Adjacent||50.4%|Medium||
|1043|Partition Array for Maximum Sum||71.2%|Medium||
|1044|Longest Duplicate Substring||30.7%|Hard||
|1045|Customers Who Bought All Products||67.6%|Medium||
|1046|Last Stone Weight||64.7%|Easy||
|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|70.5%|Easy||
|1048|Longest String Chain|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1048.Longest-String-Chain)|59.2%|Medium||
|1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|52.4%|Medium||
|1050|Actors and Directors Who Cooperated At Least Three Times||72.4%|Easy||
|1051|Height Checker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker)|75.0%|Easy||
|1052|Grumpy Bookstore Owner|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)|57.0%|Medium||
|1053|Previous Permutation With One Swap||50.8%|Medium||
|1054|Distant Barcodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes)|45.7%|Medium||
|1055|Shortest Way to Form String||59.1%|Medium||
|1056|Confusing Number||46.1%|Easy||
|1057|Campus Bikes||57.7%|Medium||
|1058|Minimize Rounding Error to Meet Target||44.9%|Medium||
|1059|All Paths from Source Lead to Destination||40.5%|Medium||
|1060|Missing Element in Sorted Array||54.6%|Medium||
|1061|Lexicographically Smallest Equivalent String||70.4%|Medium||
|1062|Longest Repeating Substring||59.1%|Medium||
|1063|Number of Valid Subarrays||74.1%|Hard||
|1064|Fixed Point||63.6%|Easy||
|1065|Index Pairs of a String||63.0%|Easy||
|1066|Campus Bikes II||54.5%|Medium||
|1067|Digit Count in Range||44.6%|Hard||
|1068|Product Sales Analysis I||80.4%|Easy||
|1069|Product Sales Analysis II||82.0%|Easy||
|1070|Product Sales Analysis III||49.2%|Medium||
|1071|Greatest Common Divisor of Strings||51.0%|Easy||
|1072|Flip Columns For Maximum Number of Equal Rows||63.1%|Medium||
|1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|36.4%|Medium||
|1074|Number of Submatrices That Sum to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target)|69.8%|Hard||
|1075|Project Employees I||67.2%|Easy||
|1076|Project Employees II||51.0%|Easy||
|1077|Project Employees III||78.7%|Medium||
|1078|Occurrences After Bigram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram)|63.9%|Easy||
|1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|76.1%|Medium||
|1080|Insufficient Nodes in Root to Leaf Paths||52.8%|Medium||
|1081|Smallest Subsequence of Distinct Characters||57.6%|Medium||
|1082|Sales Analysis I||75.4%|Easy||
|1083|Sales Analysis II||50.5%|Easy||
|1084|Sales Analysis III||52.2%|Easy||
|1085|Sum of Digits in the Minimum Number||75.9%|Easy||
|1086|High Five||75.2%|Easy||
|1087|Brace Expansion||66.1%|Medium||
|1088|Confusing Number II||46.5%|Hard||
|1089|Duplicate Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros)|51.5%|Easy||
|1090|Largest Values From Labels||60.9%|Medium||
|1091|Shortest Path in Binary Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1091.Shortest-Path-in-Binary-Matrix)|44.5%|Medium||
|1092|Shortest Common Supersequence||57.8%|Hard||
|1093|Statistics from a Large Sample|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)|44.7%|Medium||
|1094|Car Pooling||57.4%|Medium||
|1095|Find in Mountain Array||35.8%|Hard||
|1096|Brace Expansion II||63.5%|Hard||
|1097|Game Play Analysis V||55.2%|Hard||
|1098|Unpopular Books||45.2%|Medium||
|1099|Two Sum Less Than K||60.4%|Easy||
|1100|Find K-Length Substrings With No Repeated Characters||74.7%|Medium||
|1101|The Earliest Moment When Everyone Become Friends||65.0%|Medium||
|1102|Path With Maximum Minimum Value||53.3%|Medium||
|1103|Distribute Candies to People||63.9%|Easy||
|1104|Path In Zigzag Labelled Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree)|74.9%|Medium||
|1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|58.9%|Medium||
|1106|Parsing A Boolean Expression||58.5%|Hard||
|1107|New Users Daily Count||45.9%|Medium||
|1108|Defanging an IP Address|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address)|89.3%|Easy||
|1109|Corporate Flight Bookings||60.3%|Medium||
|1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|69.4%|Medium||
|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|73.3%|Medium||
|1112|Highest Grade For Each Student||73.8%|Medium||
|1113|Reported Posts||66.1%|Easy||
|1114|Print in Order||68.1%|Easy||
|1115|Print FooBar Alternately||61.7%|Medium||
|1116|Print Zero Even Odd||60.1%|Medium||
|1117|Building H2O||55.7%|Medium||
|1118|Number of Days in a Month||56.7%|Easy||
|1119|Remove Vowels from a String||90.7%|Easy||
|1120|Maximum Average Subtree||65.5%|Medium||
|1121|Divide Array Into Increasing Sequences||60.0%|Hard||
|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.4%|Easy||
|1123|Lowest Common Ancestor of Deepest Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves)|70.6%|Medium||
|1124|Longest Well-Performing Interval||34.6%|Medium||
|1125|Smallest Sufficient Team||47.1%|Hard||
|1126|Active Businesses||67.9%|Medium||
|1127|User Purchase Platform||51.2%|Hard||
|1128|Number of Equivalent Domino Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs)|46.9%|Easy||
|1129|Shortest Path with Alternating Colors||42.9%|Medium||
|1130|Minimum Cost Tree From Leaf Values||68.5%|Medium||
|1131|Maximum of Absolute Value Expression||49.5%|Medium||
|1132|Reported Posts II||33.6%|Medium||
|1133|Largest Unique Number||67.5%|Easy||
|1134|Armstrong Number||78.1%|Easy||
|1135|Connecting Cities With Minimum Cost||61.1%|Medium||
|1136|Parallel Courses||62.0%|Medium||
|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|63.3%|Easy||
|1138|Alphabet Board Path||52.3%|Medium||
|1139|Largest 1-Bordered Square||50.0%|Medium||
|1140|Stone Game II||64.9%|Medium||
|1141|User Activity for the Past 30 Days I||50.2%|Easy||
|1142|User Activity for the Past 30 Days II||36.0%|Easy||
|1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|58.8%|Medium||
|1144|Decrease Elements To Make Array Zigzag||47.0%|Medium||
|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.4%|Medium||
|1146|Snapshot Array||37.3%|Medium||
|1147|Longest Chunked Palindrome Decomposition||60.0%|Hard||
|1148|Article Views I||77.0%|Easy||
|1149|Article Views II||47.6%|Medium||
|1150|Check If a Number Is Majority Element in a Sorted Array||56.8%|Easy||
|1151|Minimum Swaps to Group All 1's Together||60.9%|Medium||
|1152|Analyze User Website Visit Pattern||43.4%|Medium||
|1153|String Transforms Into Another String||35.3%|Hard||
|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|50.3%|Easy||
|1155|Number of Dice Rolls With Target Sum||53.6%|Medium||
|1156|Swap For Longest Repeated Character Substring||45.5%|Medium||
|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|42.0%|Hard||
|1158|Market Analysis I||63.9%|Medium||
|1159|Market Analysis II||58.7%|Hard||
|1160|Find Words That Can Be Formed by Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters)|67.8%|Easy||
|1161|Maximum Level Sum of a Binary Tree||66.2%|Medium||
|1162|As Far from Land as Possible||48.5%|Medium||
|1163|Last Substring in Lexicographical Order||35.1%|Hard||
|1164|Product Price at a Given Date||68.4%|Medium||
|1165|Single-Row Keyboard||85.7%|Easy||
|1166|Design File System||61.8%|Medium||
|1167|Minimum Cost to Connect Sticks||67.7%|Medium||
|1168|Optimize Water Distribution in a Village||64.4%|Hard||
|1169|Invalid Transactions||31.0%|Medium||
|1170|Compare Strings by Frequency of the Smallest Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character)|61.3%|Medium||
|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List)|42.9%|Medium||
|1172|Dinner Plate Stacks||33.7%|Hard||
|1173|Immediate Food Delivery I||83.4%|Easy||
|1174|Immediate Food Delivery II||63.9%|Medium||
|1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|53.5%|Easy||
|1176|Diet Plan Performance||52.4%|Easy||
|1177|Can Make Palindrome from Substring||37.8%|Medium||
|1178|Number of Valid Words for Each Puzzle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle)|46.6%|Hard||
|1179|Reformat Department Table||82.7%|Easy||
|1180|Count Substrings with Only One Distinct Letter||78.9%|Easy||
|1181|Before and After Puzzle||45.1%|Medium||
|1182|Shortest Distance to Target Color||55.5%|Medium||
|1183|Maximum Number of Ones||60.9%|Hard||
|1184|Distance Between Bus Stops|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops)|54.1%|Easy||
|1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|57.8%|Easy||
|1186|Maximum Subarray Sum with One Deletion||41.2%|Medium||
|1187|Make Array Strictly Increasing||45.3%|Hard||
|1188|Design Bounded Blocking Queue||72.9%|Medium||
|1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|62.2%|Easy||
|1190|Reverse Substrings Between Each Pair of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses)|65.9%|Medium||
|1191|K-Concatenation Maximum Sum||24.0%|Medium||
|1192|Critical Connections in a Network||54.5%|Hard||
|1193|Monthly Transactions I||67.2%|Medium||
|1194|Tournament Winners||51.7%|Hard||
|1195|Fizz Buzz Multithreaded||72.5%|Medium||
|1196|How Many Apples Can You Put into the Basket||67.0%|Easy||
|1197|Minimum Knight Moves||39.8%|Medium||
|1198|Find Smallest Common Element in All Rows||76.0%|Medium||
|1199|Minimum Time to Build Blocks||40.7%|Hard||
|1200|Minimum Absolute Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference)|69.8%|Easy||
|1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|28.5%|Medium||
|1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|57.5%|Medium||
|1203|Sort Items by Groups Respecting Dependencies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies)|50.6%|Hard||
|1204|Last Person to Fit in the Bus||74.1%|Medium||
|1205|Monthly Transactions II||43.8%|Medium||
|1206|Design Skiplist||60.5%|Hard||
|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|70.9%|Easy||
|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|47.6%|Medium||
|1209|Remove All Adjacent Duplicates in String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II)|56.0%|Medium||
|1210|Minimum Moves to Reach Target with Rotations||48.9%|Hard||
|1211|Queries Quality and Percentage||71.9%|Easy||
|1212|Team Scores in Football Tournament||57.6%|Medium||
|1213|Intersection of Three Sorted Arrays||80.0%|Easy||
|1214|Two Sum BSTs||66.2%|Medium||
|1215|Stepping Numbers||45.8%|Medium||
|1216|Valid Palindrome III||50.1%|Hard||
|1217|Minimum Cost to Move Chips to The Same Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position)|72.2%|Easy||
|1218|Longest Arithmetic Subsequence of Given Difference||51.8%|Medium||
|1219|Path with Maximum Gold||64.4%|Medium||
|1220|Count Vowels Permutation||60.7%|Hard||
|1221|Split a String in Balanced Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings)|84.7%|Easy||
|1222|Queens That Can Attack the King||71.7%|Medium||
|1223|Dice Roll Simulation||48.4%|Hard||
|1224|Maximum Equal Frequency||36.8%|Hard||
|1225|Report Contiguous Dates||63.4%|Hard||
|1226|The Dining Philosophers||56.6%|Medium||
|1227|Airplane Seat Assignment Probability||64.9%|Medium||
|1228|Missing Number In Arithmetic Progression||51.4%|Easy||
|1229|Meeting Scheduler||55.4%|Medium||
|1230|Toss Strange Coins||53.4%|Medium||
|1231|Divide Chocolate||56.9%|Hard||
|1232|Check If It Is a Straight Line|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line)|41.2%|Easy||
|1233|Remove Sub-Folders from the Filesystem||65.4%|Medium||
|1234|Replace the Substring for Balanced String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String)|36.8%|Medium||
|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|51.1%|Hard||
|1236|Web Crawler||66.3%|Medium||
|1237|Find Positive Integer Solution for a Given Equation||69.3%|Medium||
|1238|Circular Permutation in Binary Representation||68.8%|Medium||
|1239|Maximum Length of a Concatenated String with Unique Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters)|50.6%|Medium||
|1240|Tiling a Rectangle with the Fewest Squares||54.0%|Hard||
|1241|Number of Comments per Post||68.0%|Easy||
|1242|Web Crawler Multithreaded||49.0%|Medium||
|1243|Array Transformation||50.7%|Easy||
|1244|Design A Leaderboard||68.8%|Medium||
|1245|Tree Diameter||61.7%|Medium||
|1246|Palindrome Removal||45.9%|Hard||
|1247|Minimum Swaps to Make Strings Equal||63.7%|Medium||
|1248|Count Number of Nice Subarrays||59.5%|Medium||
|1249|Minimum Remove to Make Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses)|65.6%|Medium||
|1250|Check If It Is a Good Array||58.7%|Hard||
|1251|Average Selling Price||83.2%|Easy||
|1252|Cells with Odd Values in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix)|78.6%|Easy||
|1253|Reconstruct a 2-Row Binary Matrix||43.8%|Medium||
|1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|64.2%|Medium||
|1255|Maximum Score Words Formed by Letters||72.8%|Hard||
|1256|Encode Number||69.9%|Medium||
|1257|Smallest Common Region||64.1%|Medium||
|1258|Synonymous Sentences||56.4%|Medium||
|1259|Handshakes That Don't Cross||56.2%|Hard||
|1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|68.0%|Easy||
|1261|Find Elements in a Contaminated Binary Tree||76.1%|Medium||
|1262|Greatest Sum Divisible by Three||50.9%|Medium||
|1263|Minimum Moves to Move a Box to Their Target Location||49.0%|Hard||
|1264|Page Recommendations||67.8%|Medium||
|1265|Print Immutable Linked List in Reverse||94.3%|Medium||
|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.1%|Easy||
|1267|Count Servers that Communicate||59.1%|Medium||
|1268|Search Suggestions System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1268.Search-Suggestions-System)|66.7%|Medium||
|1269|Number of Ways to Stay in the Same Place After Some Steps||43.6%|Hard||
|1270|All People Report to the Given Manager||88.0%|Medium||
|1271|Hexspeak||57.0%|Easy||
|1272|Remove Interval||63.3%|Medium||
|1273|Delete Tree Nodes||61.2%|Medium||
|1274|Number of Ships in a Rectangle||69.3%|Hard||
|1275|Find Winner on a Tic Tac Toe Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game)|54.3%|Easy||
|1276|Number of Burgers with No Waste of Ingredients||50.6%|Medium||
|1277|Count Square Submatrices with All Ones||74.4%|Medium||
|1278|Palindrome Partitioning III||60.8%|Hard||
|1279|Traffic Light Controlled Intersection||74.5%|Easy||
|1280|Students and Examinations||74.5%|Easy||
|1281|Subtract the Product and Sum of Digits of an Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer)|86.7%|Easy||
|1282|Group the People Given the Group Size They Belong To||85.7%|Medium||
|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|55.3%|Medium||
|1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||72.1%|Hard||
|1285|Find the Start and End Number of Continuous Ranges||88.2%|Medium||
|1286|Iterator for Combination||73.5%|Medium||
|1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-25-In-Sorted-Array)|59.5%|Easy||
|1288|Remove Covered Intervals||57.3%|Medium||
|1289|Minimum Falling Path Sum II||59.6%|Hard||
|1290|Convert Binary Number in a Linked List to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer)|82.6%|Easy||
|1291|Sequential Digits||61.2%|Medium||
|1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||53.1%|Medium||
|1293|Shortest Path in a Grid with Obstacles Elimination|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination)|43.6%|Hard||
|1294|Weather Type in Each Country||67.9%|Easy||
|1295|Find Numbers with Even Number of Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits)|76.9%|Easy||
|1296|Divide Array in Sets of K Consecutive Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers)|56.6%|Medium||
|1297|Maximum Number of Occurrences of a Substring||52.1%|Medium||
|1298|Maximum Candies You Can Get from Boxes||61.1%|Hard||
|1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.7%|Easy||
|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.1%|Medium||
|1301|Number of Paths with Max Score||38.7%|Hard||
|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|87.0%|Medium||
|1303|Find the Team Size||90.8%|Easy||
|1304|Find N Unique Integers Sum up to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero)|77.1%|Easy||
|1305|All Elements in Two Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees)|79.8%|Medium||
|1306|Jump Game III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III)|63.0%|Medium||
|1307|Verbal Arithmetic Puzzle||34.5%|Hard||
|1308|Running Total for Different Genders||88.3%|Medium||
|1309|Decrypt String from Alphabet to Integer Mapping||79.4%|Easy||
|1310|XOR Queries of a Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1310.XOR-Queries-of-a-Subarray)|72.1%|Medium||
|1311|Get Watched Videos by Your Friends||45.9%|Medium||
|1312|Minimum Insertion Steps to Make a String Palindrome||65.5%|Hard||
|1313|Decompress Run-Length Encoded List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List)|85.9%|Easy||
|1314|Matrix Block Sum||75.4%|Medium||
|1315|Sum of Nodes with Even-Valued Grandparent||85.6%|Medium||
|1316|Distinct Echo Substrings||49.8%|Hard||
|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers)|56.2%|Easy||
|1318|Minimum Flips to Make a OR b Equal to c||66.0%|Medium||
|1319|Number of Operations to Make Network Connected|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1319.Number-of-Operations-to-Make-Network-Connected)|58.3%|Medium||
|1320|Minimum Distance to Type a Word Using Two Fingers||59.8%|Hard||
|1321|Restaurant Growth||72.2%|Medium||
|1322|Ads Performance||60.9%|Easy||
|1323|Maximum 69 Number||79.1%|Easy||
|1324|Print Words Vertically||60.0%|Medium||
|1325|Delete Leaves With a Given Value||74.8%|Medium||
|1326|Minimum Number of Taps to Open to Water a Garden||47.8%|Hard||
|1327|List the Products Ordered in a Period||77.1%|Easy||
|1328|Break a Palindrome||53.4%|Medium||
|1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|83.6%|Medium||
|1330|Reverse Subarray To Maximize Array Value||39.9%|Hard||
|1331|Rank Transform of an Array||59.0%|Easy||
|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|76.1%|Easy||
|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||59.4%|Medium||
|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||52.9%|Medium||
|1335|Minimum Difficulty of a Job Schedule||58.8%|Hard||
|1336|Number of Transactions per Visit||51.4%|Hard||
|1337|The K Weakest Rows in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix)|73.1%|Easy||
|1338|Reduce Array Size to The Half||69.8%|Medium||
|1339|Maximum Product of Splitted Binary Tree||43.3%|Medium||
|1340|Jump Game V||62.6%|Hard||
|1341|Movie Rating||58.6%|Medium||
|1342|Number of Steps to Reduce a Number to Zero||85.6%|Easy||
|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||67.7%|Medium||
|1344|Angle Between Hands of a Clock||63.4%|Medium||
|1345|Jump Game IV||44.1%|Hard||
|1346|Check If N and Its Double Exist||36.1%|Easy||
|1347|Minimum Number of Steps to Make Two Strings Anagram||77.2%|Medium||
|1348|Tweet Counts Per Frequency||43.5%|Medium||
|1349|Maximum Students Taking Exam||48.0%|Hard||
|1350|Students With Invalid Departments||90.5%|Easy||
|1351|Count Negative Numbers in a Sorted Matrix||75.3%|Easy||
|1352|Product of the Last K Numbers||49.4%|Medium||
|1353|Maximum Number of Events That Can Be Attended|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended)|32.9%|Medium||
|1354|Construct Target Array With Multiple Sums||36.3%|Hard||
|1355|Activity Participants||74.4%|Medium||
|1356|Sort Integers by The Number of 1 Bits||72.0%|Easy||
|1357|Apply Discount Every n Orders||69.9%|Medium||
|1358|Number of Substrings Containing All Three Characters||62.9%|Medium||
|1359|Count All Valid Pickup and Delivery Options||63.0%|Hard||
|1360|Number of Days Between Two Dates||47.5%|Easy||
|1361|Validate Binary Tree Nodes||40.4%|Medium||
|1362|Closest Divisors||59.8%|Medium||
|1363|Largest Multiple of Three||33.5%|Hard||
|1364|Number of Trusted Contacts of a Customer||79.0%|Medium||
|1365|How Many Numbers Are Smaller Than the Current Number||86.6%|Easy||
|1366|Rank Teams by Votes||58.6%|Medium||
|1367|Linked List in Binary Tree||43.4%|Medium||
|1368|Minimum Cost to Make at Least One Valid Path in a Grid||61.3%|Hard||
|1369|Get the Second Most Recent Activity||69.6%|Hard||
|1370|Increasing Decreasing String||77.5%|Easy||
|1371|Find the Longest Substring Containing Vowels in Even Counts||63.0%|Medium||
|1372|Longest ZigZag Path in a Binary Tree||59.6%|Medium||
|1373|Maximum Sum BST in Binary Tree||39.2%|Hard||
|1374|Generate a String With Characters That Have Odd Counts||77.5%|Easy||
|1375|Number of Times Binary String Is Prefix-Aligned||65.9%|Medium||
|1376|Time Needed to Inform All Employees||58.4%|Medium||
|1377|Frog Position After T Seconds||36.1%|Hard||
|1378|Replace Employee ID With The Unique Identifier||91.4%|Easy||
|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||87.1%|Easy||
|1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.5%|Easy||
|1381|Design a Stack With Increment Operation||77.4%|Medium||
|1382|Balance a Binary Search Tree||80.7%|Medium||
|1383|Maximum Performance of a Team|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1383.Maximum-Performance-of-a-Team)|49.0%|Hard||
|1384|Total Sales Amount by Year||67.6%|Hard||
|1385|Find the Distance Value Between Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays)|65.3%|Easy||
|1386|Cinema Seat Allocation||40.9%|Medium||
|1387|Sort Integers by The Power Value||69.9%|Medium||
|1388|Pizza With 3n Slices||50.1%|Hard||
|1389|Create Target Array in the Given Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order)|85.8%|Easy||
|1390|Four Divisors||41.2%|Medium||
|1391|Check if There is a Valid Path in a Grid||47.0%|Medium||
|1392|Longest Happy Prefix||45.0%|Hard||
|1393|Capital Gain/Loss||91.1%|Medium||
|1394|Find Lucky Integer in an Array||63.5%|Easy||
|1395|Count Number of Teams||68.3%|Medium||
|1396|Design Underground System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1396.Design-Underground-System)|73.7%|Medium||
|1397|Find All Good Strings||42.1%|Hard||
|1398|Customers Who Bought Products A and B but Not C||77.7%|Medium||
|1399|Count Largest Group||67.2%|Easy||
|1400|Construct K Palindrome Strings||63.3%|Medium||
|1401|Circle and Rectangle Overlapping||44.2%|Medium||
|1402|Reducing Dishes||72.0%|Hard||
|1403|Minimum Subsequence in Non-Increasing Order||72.2%|Easy||
|1404|Number of Steps to Reduce a Number in Binary Representation to One||52.0%|Medium||
|1405|Longest Happy String||57.4%|Medium||
|1406|Stone Game III||59.7%|Hard||
|1407|Top Travellers||68.7%|Easy||
|1408|String Matching in an Array||63.9%|Easy||
|1409|Queries on a Permutation With Key||83.3%|Medium||
|1410|HTML Entity Parser||52.1%|Medium||
|1411|Number of Ways to Paint N × 3 Grid||62.3%|Hard||
|1412|Find the Quiet Students in All Exams||63.0%|Hard||
|1413|Minimum Value to Get Positive Step by Step Sum||68.4%|Easy||
|1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||65.4%|Medium||
|1415|The k-th Lexicographical String of All Happy Strings of Length n||72.0%|Medium||
|1416|Restore The Array||38.4%|Hard||
|1417|Reformat The String||55.8%|Easy||
|1418|Display Table of Food Orders in a Restaurant||73.7%|Medium||
|1419|Minimum Number of Frogs Croaking||49.9%|Medium||
|1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||63.6%|Hard||
|1421|NPV Queries||84.1%|Easy||
|1422|Maximum Score After Splitting a String||57.8%|Easy||
|1423|Maximum Points You Can Obtain from Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards)|52.3%|Medium||
|1424|Diagonal Traverse II||50.3%|Medium||
|1425|Constrained Subsequence Sum||47.4%|Hard||
|1426|Counting Elements||59.5%|Easy||
|1427|Perform String Shifts||54.2%|Easy||
|1428|Leftmost Column with at Least a One||53.0%|Medium||
|1429|First Unique Number||52.7%|Medium||
|1430|Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree||46.1%|Medium||
|1431|Kids With the Greatest Number of Candies||87.5%|Easy||
|1432|Max Difference You Can Get From Changing an Integer||43.0%|Medium||
|1433|Check If a String Can Break Another String||68.8%|Medium||
|1434|Number of Ways to Wear Different Hats to Each Other||42.8%|Hard||
|1435|Create a Session Bar Chart||78.3%|Easy||
|1436|Destination City||77.6%|Easy||
|1437|Check If All 1's Are at Least Length K Places Away|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away)|59.2%|Easy||
|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit)|48.0%|Medium||
|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows)|61.4%|Hard||
|1440|Evaluate Boolean Expression||76.5%|Medium||
|1441|Build an Array With Stack Operations||71.3%|Medium||
|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR)|75.6%|Medium||
|1443|Minimum Time to Collect All Apples in a Tree||56.0%|Medium||
|1444|Number of Ways of Cutting a Pizza||58.6%|Hard||
|1445|Apples & Oranges||91.3%|Medium||
|1446|Consecutive Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1446.Consecutive-Characters)|61.7%|Easy||
|1447|Simplified Fractions||64.6%|Medium||
|1448|Count Good Nodes in Binary Tree||74.6%|Medium||
|1449|Form Largest Integer With Digits That Add up to Target||47.1%|Hard||
|1450|Number of Students Doing Homework at a Given Time||75.9%|Easy||
|1451|Rearrange Words in a Sentence||62.5%|Medium||
|1452|People Whose List of Favorite Companies Is Not a Subset of Another List||56.8%|Medium||
|1453|Maximum Number of Darts Inside of a Circular Dartboard||36.8%|Hard||
|1454|Active Users||38.4%|Medium||
|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.2%|Easy||
|1456|Maximum Number of Vowels in a Substring of Given Length||57.9%|Medium||
|1457|Pseudo-Palindromic Paths in a Binary Tree||68.1%|Medium||
|1458|Max Dot Product of Two Subsequences||46.2%|Hard||
|1459|Rectangles Area||70.0%|Medium||
|1460|Make Two Arrays Equal by Reversing Subarrays||72.2%|Easy||
|1461|Check If a String Contains All Binary Codes of Size K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K)|56.8%|Medium||
|1462|Course Schedule IV||48.9%|Medium||
|1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|70.2%|Hard||
|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|79.2%|Easy||
|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts)|40.8%|Medium||
|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.8%|Medium||
|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.8%|Hard||
|1468|Calculate Salaries||81.9%|Medium||
|1469|Find All The Lonely Nodes||81.7%|Easy||
|1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.5%|Easy||
|1471|The k Strongest Values in an Array||60.1%|Medium||
|1472|Design Browser History||76.1%|Medium||
|1473|Paint House III||62.0%|Hard||
|1474|Delete N Nodes After M Nodes of a Linked List||73.8%|Easy||
|1475|Final Prices With a Special Discount in a Shop||75.4%|Easy||
|1476|Subrectangle Queries||88.5%|Medium||
|1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||37.0%|Medium||
|1478|Allocate Mailboxes||55.3%|Hard||
|1479|Sales by Day of the Week||82.4%|Hard||
|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|89.8%|Easy||
|1481|Least Number of Unique Integers after K Removals||57.2%|Medium||
|1482|Minimum Number of Days to Make m Bouquets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets)|56.7%|Medium||
|1483|Kth Ancestor of a Tree Node||33.8%|Hard||
|1484|Group Sold Products By The Date||84.1%|Easy||
|1485|Clone Binary Tree With Random Pointer||79.5%|Medium||
|1486|XOR Operation in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1486.XOR-Operation-in-an-Array)|84.2%|Easy||
|1487|Making File Names Unique||35.6%|Medium||
|1488|Avoid Flood in The City||26.1%|Medium||
|1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||53.4%|Hard||
|1490|Clone N-ary Tree||83.6%|Medium||
|1491|Average Salary Excluding the Minimum and Maximum Salary||63.1%|Easy||
|1492|The kth Factor of n||62.3%|Medium||
|1493|Longest Subarray of 1's After Deleting One Element||60.1%|Medium||
|1494|Parallel Courses II||31.1%|Hard||
|1495|Friendly Movies Streamed Last Month||49.8%|Easy||
|1496|Path Crossing||55.8%|Easy||
|1497|Check If Array Pairs Are Divisible by k||39.8%|Medium||
|1498|Number of Subsequences That Satisfy the Given Sum Condition||38.4%|Medium||
|1499|Max Value of Equation||46.5%|Hard||
|1500|Design a File Sharing System||44.9%|Medium||
|1501|Countries You Can Safely Invest In||58.3%|Medium||
|1502|Can Make Arithmetic Progression From Sequence||68.3%|Easy||
|1503|Last Moment Before All Ants Fall Out of a Plank||55.2%|Medium||
|1504|Count Submatrices With All Ones||57.9%|Medium||
|1505|Minimum Possible Integer After at Most K Adjacent Swaps On Digits||38.1%|Hard||
|1506|Find Root of N-Ary Tree||78.1%|Medium||
|1507|Reformat Date||62.4%|Easy||
|1508|Range Sum of Sorted Subarray Sums||59.4%|Medium||
|1509|Minimum Difference Between Largest and Smallest Value in Three Moves||54.6%|Medium||
|1510|Stone Game IV||60.6%|Hard||
|1511|Customer Order Frequency||73.1%|Easy||
|1512|Number of Good Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1512.Number-of-Good-Pairs)|88.2%|Easy||
|1513|Number of Substrings With Only 1s||45.2%|Medium||
|1514|Path with Maximum Probability||48.3%|Medium||
|1515|Best Position for a Service Centre||38.4%|Hard||
|1516|Move Sub-Tree of N-Ary Tree||63.9%|Hard||
|1517|Find Users With Valid E-Mails||57.1%|Easy||
|1518|Water Bottles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1518.Water-Bottles)|60.3%|Easy||
|1519|Number of Nodes in the Sub-Tree With the Same Label||40.9%|Medium||
|1520|Maximum Number of Non-Overlapping Substrings||37.9%|Hard||
|1521|Find a Value of a Mysterious Function Closest to Target||43.6%|Hard||
|1522|Diameter of N-Ary Tree||73.4%|Medium||
|1523|Count Odd Numbers in an Interval Range||46.4%|Easy||
|1524|Number of Sub-arrays With Odd Sum||43.6%|Medium||
|1525|Number of Good Ways to Split a String||69.5%|Medium||
|1526|Minimum Number of Increments on Subarrays to Form a Target Array||68.6%|Hard||
|1527|Patients With a Condition||42.9%|Easy||
|1528|Shuffle String||85.7%|Easy||
|1529|Minimum Suffix Flips||72.5%|Medium||
|1530|Number of Good Leaf Nodes Pairs||60.5%|Medium||
|1531|String Compression II||50.2%|Hard||
|1532|The Most Recent Three Orders||71.1%|Medium||
|1533|Find the Index of the Large Integer||50.7%|Medium||
|1534|Count Good Triplets||80.8%|Easy||
|1535|Find the Winner of an Array Game||48.8%|Medium||
|1536|Minimum Swaps to Arrange a Binary Grid||46.4%|Medium||
|1537|Get the Maximum Score||39.3%|Hard||
|1538|Guess the Majority in a Hidden Array||63.0%|Medium||
|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|55.9%|Easy||
|1540|Can Convert String in K Moves||33.1%|Medium||
|1541|Minimum Insertions to Balance a Parentheses String||49.9%|Medium||
|1542|Find Longest Awesome Substring||41.6%|Hard||
|1543|Fix Product Name Format||62.4%|Easy||
|1544|Make The String Great||57.0%|Easy||
|1545|Find Kth Bit in Nth Binary String||58.2%|Medium||
|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||47.2%|Medium||
|1547|Minimum Cost to Cut a Stick||56.8%|Hard||
|1548|The Most Similar Path in a Graph||56.9%|Hard||
|1549|The Most Recent Orders for Each Product||67.9%|Medium||
|1550|Three Consecutive Odds||63.7%|Easy||
|1551|Minimum Operations to Make Array Equal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1551.Minimum-Operations-to-Make-Array-Equal)|81.1%|Medium||
|1552|Magnetic Force Between Two Balls||56.8%|Medium||
|1553|Minimum Number of Days to Eat N Oranges||34.4%|Hard||
|1554|Strings Differ by One Character||43.6%|Medium||
|1555|Bank Account Summary||53.0%|Medium||
|1556|Thousand Separator||55.1%|Easy||
|1557|Minimum Number of Vertices to Reach All Nodes||79.6%|Medium||
|1558|Minimum Numbers of Function Calls to Make Target Array||64.3%|Medium||
|1559|Detect Cycles in 2D Grid||48.1%|Medium||
|1560|Most Visited Sector in a Circular Track||58.4%|Easy||
|1561|Maximum Number of Coins You Can Get||78.6%|Medium||
|1562|Find Latest Group of Size M||42.4%|Medium||
|1563|Stone Game V||40.6%|Hard||
|1564|Put Boxes Into the Warehouse I||67.1%|Medium||
|1565|Unique Orders and Customers Per Month||83.6%|Easy||
|1566|Detect Pattern of Length M Repeated K or More Times||43.6%|Easy||
|1567|Maximum Length of Subarray With Positive Product||43.7%|Medium||
|1568|Minimum Number of Days to Disconnect Island||47.1%|Hard||
|1569|Number of Ways to Reorder Array to Get Same BST||48.2%|Hard||
|1570|Dot Product of Two Sparse Vectors||90.4%|Medium||
|1571|Warehouse Manager||90.1%|Easy||
|1572|Matrix Diagonal Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1572.Matrix-Diagonal-Sum)|79.7%|Easy||
|1573|Number of Ways to Split a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1573.Number-of-Ways-to-Split-a-String)|32.4%|Medium||
|1574|Shortest Subarray to be Removed to Make Array Sorted||36.5%|Medium||
|1575|Count All Possible Routes||56.9%|Hard||
|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters)|49.2%|Easy||
|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||39.9%|Medium||
|1578|Minimum Time to Make Rope Colorful||63.7%|Medium||
|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable)|52.7%|Hard||
|1580|Put Boxes Into the Warehouse II||63.5%|Medium||
|1581|Customer Who Visited but Did Not Make Any Transactions||89.0%|Easy||
|1582|Special Positions in a Binary Matrix||65.3%|Easy||
|1583|Count Unhappy Friends||59.8%|Medium||
|1584|Min Cost to Connect All Points||64.3%|Medium||
|1585|Check If String Is Transformable With Substring Sort Operations||48.4%|Hard||
|1586|Binary Search Tree Iterator II||70.8%|Medium||
|1587|Bank Account Summary II||90.2%|Easy||
|1588|Sum of All Odd Length Subarrays||83.6%|Easy||
|1589|Maximum Sum Obtained of Any Permutation||37.0%|Medium||
|1590|Make Sum Divisible by P||28.1%|Medium||
|1591|Strange Printer II||58.4%|Hard||
|1592|Rearrange Spaces Between Words||43.8%|Easy||
|1593|Split a String Into the Max Number of Unique Substrings||55.1%|Medium||
|1594|Maximum Non Negative Product in a Matrix||33.1%|Medium||
|1595|Minimum Cost to Connect Two Groups of Points||46.3%|Hard||
|1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium||
|1597|Build Binary Expression Tree From Infix Expression||62.2%|Hard||
|1598|Crawler Log Folder||64.3%|Easy||
|1599|Maximum Profit of Operating a Centennial Wheel||43.7%|Medium||
|1600|Throne Inheritance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1600.Throne-Inheritance)|63.6%|Medium||
|1601|Maximum Number of Achievable Transfer Requests||51.3%|Hard||
|1602|Find Nearest Right Node in Binary Tree||75.3%|Medium||
|1603|Design Parking System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1603.Design-Parking-System)|88.1%|Easy||
|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||47.4%|Medium||
|1605|Find Valid Matrix Given Row and Column Sums||78.1%|Medium||
|1606|Find Servers That Handled Most Number of Requests||42.8%|Hard||
|1607|Sellers With No Sales||55.3%|Easy||
|1608|Special Array With X Elements Greater Than or Equal X|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X)|60.0%|Easy||
|1609|Even Odd Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1609.Even-Odd-Tree)|53.6%|Medium||
|1610|Maximum Number of Visible Points||37.4%|Hard||
|1611|Minimum One Bit Operations to Make Integers Zero||63.2%|Hard||
|1612|Check If Two Expression Trees are Equivalent||69.9%|Medium||
|1613|Find the Missing IDs||75.9%|Medium||
|1614|Maximum Nesting Depth of the Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses)|82.7%|Easy||
|1615|Maximal Network Rank||58.1%|Medium||
|1616|Split Two Strings to Make Palindrome||31.3%|Medium||
|1617|Count Subtrees With Max Distance Between Cities||65.9%|Hard||
|1618|Maximum Font to Fit a Sentence in a Screen||59.1%|Medium||
|1619|Mean of Array After Removing Some Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements)|64.6%|Easy||
|1620|Coordinate With Maximum Network Quality||37.3%|Medium||
|1621|Number of Sets of K Non-Overlapping Line Segments||42.3%|Medium||
|1622|Fancy Sequence||16.1%|Hard||
|1623|All Valid Triplets That Can Represent a Country||88.0%|Easy||
|1624|Largest Substring Between Two Equal Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters)|59.0%|Easy||
|1625|Lexicographically Smallest String After Applying Operations||66.0%|Medium||
|1626|Best Team With No Conflicts||41.1%|Medium||
|1627|Graph Connectivity With Threshold||45.5%|Hard||
|1628|Design an Expression Tree With Evaluate Function||82.7%|Medium||
|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.4%|Easy||
|1630|Arithmetic Subarrays||79.9%|Medium||
|1631|Path With Minimum Effort|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1631.Path-With-Minimum-Effort)|55.3%|Medium||
|1632|Rank Transform of a Matrix||41.0%|Hard||
|1633|Percentage of Users Attended a Contest||68.8%|Easy||
|1634|Add Two Polynomials Represented as Linked Lists||53.4%|Medium||
|1635|Hopper Company Queries I||53.0%|Hard||
|1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|68.6%|Easy||
|1637|Widest Vertical Area Between Two Points Containing No Points||84.2%|Medium||
|1638|Count Substrings That Differ by One Character||71.5%|Medium||
|1639|Number of Ways to Form a Target String Given a Dictionary||42.9%|Hard||
|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|56.1%|Easy||
|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|77.3%|Medium||
|1642|Furthest Building You Can Reach|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1642.Furthest-Building-You-Can-Reach)|48.3%|Medium||
|1643|Kth Smallest Instructions||46.3%|Hard||
|1644|Lowest Common Ancestor of a Binary Tree II||59.3%|Medium||
|1645|Hopper Company Queries II||38.8%|Hard||
|1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|50.2%|Easy||
|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|59.2%|Medium||
|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.6%|Medium||
|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|37.2%|Hard||
|1650|Lowest Common Ancestor of a Binary Tree III||77.3%|Medium||
|1651|Hopper Company Queries III||68.0%|Hard||
|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|61.1%|Easy||
|1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|58.7%|Medium||
|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|28.6%|Medium||
|1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|39.7%|Hard||
|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|85.3%|Easy||
|1657|Determine if Two Strings Are Close|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1657.Determine-if-Two-Strings-Are-Close)|54.2%|Medium||
|1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|37.6%|Medium||
|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|38.4%|Hard||
|1660|Correct a Binary Tree||72.5%|Medium||
|1661|Average Time of Process per Machine||79.4%|Easy||
|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|81.8%|Easy||
|1663|Smallest String With A Given Numeric Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value)|67.0%|Medium||
|1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|63.6%|Medium||
|1665|Minimum Initial Energy to Finish Tasks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks)|56.2%|Hard||
|1666|Change the Root of a Binary Tree||69.4%|Medium||
|1667|Fix Names in a Table||66.8%|Easy||
|1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|39.6%|Easy||
|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|74.5%|Medium||
|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|56.4%|Medium||
|1671|Minimum Number of Removals to Make Mountain Array||42.6%|Hard||
|1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.4%|Easy||
|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|49.3%|Medium||
|1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|38.5%|Medium||
|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|52.1%|Hard||
|1676|Lowest Common Ancestor of a Binary Tree IV||79.3%|Medium||
|1677|Product's Worth Over Invoices||39.4%|Easy||
|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|86.0%|Easy||
|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|57.4%|Medium||
|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|57.0%|Medium||
|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|37.3%|Hard||
|1682|Longest Palindromic Subsequence II||49.7%|Medium||
|1683|Invalid Tweets||91.0%|Easy||
|1684|Count the Number of Consistent Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1684.Count-the-Number-of-Consistent-Strings)|81.8%|Easy||
|1685|Sum of Absolute Differences in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array)|65.3%|Medium||
|1686|Stone Game VI||54.3%|Medium||
|1687|Delivering Boxes from Storage to Ports||38.2%|Hard||
|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|83.1%|Easy||
|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|89.7%|Medium||
|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|58.7%|Medium||
|1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|54.2%|Hard||
|1692|Count Ways to Distribute Candies||62.0%|Hard||
|1693|Daily Leads and Partners||90.4%|Easy||
|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|64.7%|Easy||
|1695|Maximum Erasure Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1695.Maximum-Erasure-Value)|57.7%|Medium||
|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|46.3%|Medium||
|1697|Checking Existence of Edge Length Limited Paths||50.5%|Hard||
|1698|Number of Distinct Substrings in a String||63.1%|Medium||
|1699|Number of Calls Between Two Persons||85.8%|Medium||
|1700|Number of Students Unable to Eat Lunch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch)|67.7%|Easy||
|1701|Average Waiting Time||62.3%|Medium||
|1702|Maximum Binary String After Change||46.1%|Medium||
|1703|Minimum Adjacent Swaps for K Consecutive Ones||41.3%|Hard||
|1704|Determine if String Halves Are Alike|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1704.Determine-if-String-Halves-Are-Alike)|77.4%|Easy||
|1705|Maximum Number of Eaten Apples|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1705.Maximum-Number-of-Eaten-Apples)|37.9%|Medium||
|1706|Where Will the Ball Fall||65.8%|Medium||
|1707|Maximum XOR With an Element From Array||44.3%|Hard||
|1708|Largest Subarray Length K||63.5%|Easy||
|1709|Biggest Window Between Visits||77.8%|Medium||
|1710|Maximum Units on a Truck|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1710.Maximum-Units-on-a-Truck)|74.0%|Easy||
|1711|Count Good Meals||29.0%|Medium||
|1712|Ways to Split Array Into Three Subarrays||32.4%|Medium||
|1713|Minimum Operations to Make a Subsequence||49.2%|Hard||
|1714|Sum Of Special Evenly-Spaced Elements In Array||49.8%|Hard||
|1715|Count Apples and Oranges||77.8%|Medium||
|1716|Calculate Money in Leetcode Bank|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1716.Calculate-Money-in-Leetcode-Bank)|65.0%|Easy||
|1717|Maximum Score From Removing Substrings||46.0%|Medium||
|1718|Construct the Lexicographically Largest Valid Sequence||51.7%|Medium||
|1719|Number Of Ways To Reconstruct A Tree||42.5%|Hard||
|1720|Decode XORed Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1720.Decode-XORed-Array)|86.0%|Easy||
|1721|Swapping Nodes in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1721.Swapping-Nodes-in-a-Linked-List)|67.8%|Medium||
|1722|Minimize Hamming Distance After Swap Operations||48.6%|Medium||
|1723|Find Minimum Time to Finish All Jobs||42.7%|Hard||
|1724|Checking Existence of Edge Length Limited Paths II||51.3%|Hard||
|1725|Number Of Rectangles That Can Form The Largest Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square)|78.7%|Easy||
|1726|Tuple with Same Product||60.7%|Medium||
|1727|Largest Submatrix With Rearrangements||60.8%|Medium||
|1728|Cat and Mouse II||40.5%|Hard||
|1729|Find Followers Count||71.6%|Easy||
|1730|Shortest Path to Get Food||54.0%|Medium||
|1731|The Number of Employees Which Report to Each Employee||51.1%|Easy||
|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|78.7%|Easy||
|1733|Minimum Number of People to Teach||41.6%|Medium||
|1734|Decode XORed Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1734.Decode-XORed-Permutation)|62.2%|Medium||
|1735|Count Ways to Make Array With Product||49.2%|Hard||
|1736|Latest Time by Replacing Hidden Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits)|42.2%|Easy||
|1737|Change Minimum Characters to Satisfy One of Three Conditions||35.2%|Medium||
|1738|Find Kth Largest XOR Coordinate Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value)|61.6%|Medium||
|1739|Building Boxes||51.7%|Hard||
|1740|Find Distance in a Binary Tree||68.7%|Medium||
|1741|Find Total Time Spent by Each Employee||92.0%|Easy||
|1742|Maximum Number of Balls in a Box|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1742.Maximum-Number-of-Balls-in-a-Box)|73.9%|Easy||
|1743|Restore the Array From Adjacent Pairs||68.7%|Medium||
|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day)|32.8%|Medium||
|1745|Palindrome Partitioning IV||46.3%|Hard||
|1746|Maximum Subarray Sum After One Operation||62.2%|Medium||
|1747|Leetflex Banned Accounts||68.2%|Medium||
|1748|Sum of Unique Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1748.Sum-of-Unique-Elements)|75.6%|Easy||
|1749|Maximum Absolute Sum of Any Subarray||58.2%|Medium||
|1750|Minimum Length of String After Deleting Similar Ends||43.6%|Medium||
|1751|Maximum Number of Events That Can Be Attended II||55.8%|Hard||
|1752|Check if Array Is Sorted and Rotated|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated)|49.2%|Easy||
|1753|Maximum Score From Removing Stones||66.1%|Medium||
|1754|Largest Merge Of Two Strings||45.0%|Medium||
|1755|Closest Subsequence Sum||36.6%|Hard||
|1756|Design Most Recently Used Queue||79.0%|Medium||
|1757|Recyclable and Low Fat Products||93.9%|Easy||
|1758|Minimum Changes To Make Alternating Binary String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String)|58.3%|Easy||
|1759|Count Number of Homogenous Substrings||47.8%|Medium||
|1760|Minimum Limit of Balls in a Bag||60.3%|Medium||
|1761|Minimum Degree of a Connected Trio in a Graph||41.7%|Hard||
|1762|Buildings With an Ocean View||79.2%|Medium||
|1763|Longest Nice Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1763.Longest-Nice-Substring)|61.7%|Easy||
|1764|Form Array by Concatenating Subarrays of Another Array||52.7%|Medium||
|1765|Map of Highest Peak||60.3%|Medium||
|1766|Tree of Coprimes||38.5%|Hard||
|1767|Find the Subtasks That Did Not Execute||84.7%|Hard||
|1768|Merge Strings Alternately||75.9%|Easy||
|1769|Minimum Number of Operations to Move All Balls to Each Box||85.4%|Medium||
|1770|Maximum Score from Performing Multiplication Operations||36.3%|Hard||
|1771|Maximize Palindrome Length From Subsequences||35.2%|Hard||
|1772|Sort Features by Popularity||65.1%|Medium||
|1773|Count Items Matching a Rule||84.3%|Easy||
|1774|Closest Dessert Cost||46.7%|Medium||
|1775|Equal Sum Arrays With Minimum Number of Operations||52.6%|Medium||
|1776|Car Fleet II||53.3%|Hard||
|1777|Product's Price for Each Store||85.4%|Easy||
|1778|Shortest Path in a Hidden Grid||39.7%|Medium||
|1779|Find Nearest Point That Has the Same X or Y Coordinate||67.2%|Easy||
|1780|Check if Number is a Sum of Powers of Three||65.3%|Medium||
|1781|Sum of Beauty of All Substrings||60.4%|Medium||
|1782|Count Pairs Of Nodes||37.9%|Hard||
|1783|Grand Slam Titles||88.9%|Medium||
|1784|Check if Binary String Has at Most One Segment of Ones||40.5%|Easy||
|1785|Minimum Elements to Add to Form a Given Sum||42.4%|Medium||
|1786|Number of Restricted Paths From First to Last Node||39.2%|Medium||
|1787|Make the XOR of All Segments Equal to Zero||39.5%|Hard||
|1788|Maximize the Beauty of the Garden||66.4%|Hard||
|1789|Primary Department for Each Employee||80.0%|Easy||
|1790|Check if One String Swap Can Make Strings Equal||45.6%|Easy||
|1791|Find Center of Star Graph|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1791.Find-Center-of-Star-Graph)|83.6%|Easy||
|1792|Maximum Average Pass Ratio||51.9%|Medium||
|1793|Maximum Score of a Good Subarray||53.2%|Hard||
|1794|Count Pairs of Equal Substrings With Minimum Difference||65.2%|Medium||
|1795|Rearrange Products Table||90.4%|Easy||
|1796|Second Largest Digit in a String||49.0%|Easy||
|1797|Design Authentication Manager||56.1%|Medium||
|1798|Maximum Number of Consecutive Values You Can Make||54.1%|Medium||
|1799|Maximize Score After N Operations||45.7%|Hard||
|1800|Maximum Ascending Subarray Sum||63.8%|Easy||
|1801|Number of Orders in the Backlog||47.2%|Medium||
|1802|Maximum Value at a Given Index in a Bounded Array||31.8%|Medium||
|1803|Count Pairs With XOR in a Range||46.8%|Hard||
|1804|Implement Trie II (Prefix Tree)||59.8%|Medium||
|1805|Number of Different Integers in a String||36.1%|Easy||
|1806|Minimum Number of Operations to Reinitialize a Permutation||71.3%|Medium||
|1807|Evaluate the Bracket Pairs of a String||66.7%|Medium||
|1808|Maximize Number of Nice Divisors||31.2%|Hard||
|1809|Ad-Free Sessions||60.0%|Easy||
|1810|Minimum Path Cost in a Hidden Grid||53.8%|Medium||
|1811|Find Interview Candidates||65.3%|Medium||
|1812|Determine Color of a Chessboard Square||77.4%|Easy||
|1813|Sentence Similarity III||33.0%|Medium||
|1814|Count Nice Pairs in an Array||41.9%|Medium||
|1815|Maximum Number of Groups Getting Fresh Donuts||40.1%|Hard||
|1816|Truncate Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1816.Truncate-Sentence)|81.9%|Easy||
|1817|Finding the Users Active Minutes||80.7%|Medium||
|1818|Minimum Absolute Sum Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1818.Minimum-Absolute-Sum-Difference)|30.1%|Medium||
|1819|Number of Different Subsequences GCDs||37.9%|Hard||
|1820|Maximum Number of Accepted Invitations||49.7%|Medium||
|1821|Find Customers With Positive Revenue this Year||89.4%|Easy||
|1822|Sign of the Product of an Array||66.3%|Easy||
|1823|Find the Winner of the Circular Game||77.7%|Medium||
|1824|Minimum Sideway Jumps||49.8%|Medium||
|1825|Finding MK Average||35.1%|Hard||
|1826|Faulty Sensor||49.5%|Easy||
|1827|Minimum Operations to Make the Array Increasing||78.2%|Easy||
|1828|Queries on Number of Points Inside a Circle||86.5%|Medium||
|1829|Maximum XOR for Each Query||77.0%|Medium||
|1830|Minimum Number of Operations to Make String Sorted||49.2%|Hard||
|1831|Maximum Transaction Each Day||84.3%|Medium||
|1832|Check if the Sentence Is Pangram||83.9%|Easy||
|1833|Maximum Ice Cream Bars||65.5%|Medium||
|1834|Single-Threaded CPU||41.9%|Medium||
|1835|Find XOR Sum of All Pairs Bitwise AND||60.0%|Hard||
|1836|Remove Duplicates From an Unsorted Linked List||69.3%|Medium||
|1837|Sum of Digits in Base K||76.8%|Easy||
|1838|Frequency of the Most Frequent Element||38.3%|Medium||
|1839|Longest Substring Of All Vowels in Order||48.5%|Medium||
|1840|Maximum Building Height||35.3%|Hard||
|1841|League Statistics||57.4%|Medium||
|1842|Next Palindrome Using Same Digits||53.6%|Hard||
|1843|Suspicious Bank Accounts||48.0%|Medium||
|1844|Replace All Digits with Characters||79.7%|Easy||
|1845|Seat Reservation Manager||64.2%|Medium||
|1846|Maximum Element After Decreasing and Rearranging|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging)|59.1%|Medium||
|1847|Closest Room||35.1%|Hard||
|1848|Minimum Distance to the Target Element||58.6%|Easy||
|1849|Splitting a String Into Descending Consecutive Values||32.1%|Medium||
|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||72.0%|Medium||
|1851|Minimum Interval to Include Each Query||47.7%|Hard||
|1852|Distinct Numbers in Each Subarray||71.5%|Medium||
|1853|Convert Date Format||88.0%|Easy||
|1854|Maximum Population Year||59.8%|Easy||
|1855|Maximum Distance Between a Pair of Values||52.6%|Medium||
|1856|Maximum Subarray Min-Product||37.7%|Medium||
|1857|Largest Color Value in a Directed Graph||40.6%|Hard||
|1858|Longest Word With All Prefixes||66.3%|Medium||
|1859|Sorting the Sentence||84.4%|Easy||
|1860|Incremental Memory Leak||71.6%|Medium||
|1861|Rotating the Box||64.7%|Medium||
|1862|Sum of Floored Pairs||28.3%|Hard||
|1863|Sum of All Subset XOR Totals||79.0%|Easy||
|1864|Minimum Number of Swaps to Make the Binary String Alternating||42.0%|Medium||
|1865|Finding Pairs With a Certain Sum||50.3%|Medium||
|1866|Number of Ways to Rearrange Sticks With K Sticks Visible||55.4%|Hard||
|1867|Orders With Maximum Quantity Above Average||75.9%|Medium||
|1868|Product of Two Run-Length Encoded Arrays||57.8%|Medium||
|1869|Longer Contiguous Segments of Ones than Zeros||60.2%|Easy||
|1870|Minimum Speed to Arrive on Time||37.3%|Medium||
|1871|Jump Game VII||25.1%|Medium||
|1872|Stone Game VIII||52.4%|Hard||
|1873|Calculate Special Bonus||64.7%|Easy||
|1874|Minimize Product Sum of Two Arrays||90.4%|Medium||
|1875|Group Employees of the Same Salary||75.6%|Medium||
|1876|Substrings of Size Three with Distinct Characters||70.2%|Easy||
|1877|Minimize Maximum Pair Sum in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array)|80.4%|Medium||
|1878|Get Biggest Three Rhombus Sums in a Grid||46.4%|Medium||
|1879|Minimum XOR Sum of Two Arrays||44.6%|Hard||
|1880|Check if Word Equals Summation of Two Words||73.6%|Easy||
|1881|Maximum Value after Insertion||36.5%|Medium||
|1882|Process Tasks Using Servers||39.5%|Medium||
|1883|Minimum Skips to Arrive at Meeting On Time||38.5%|Hard||
|1884|Egg Drop With 2 Eggs and N Floors||70.3%|Medium||
|1885|Count Pairs in Two Arrays||59.2%|Medium||
|1886|Determine Whether Matrix Can Be Obtained By Rotation||55.3%|Easy||
|1887|Reduction Operations to Make the Array Elements Equal||62.3%|Medium||
|1888|Minimum Number of Flips to Make the Binary String Alternating||37.8%|Medium||
|1889|Minimum Space Wasted From Packaging||30.6%|Hard||
|1890|The Latest Login in 2020||81.8%|Easy||
|1891|Cutting Ribbons||48.1%|Medium||
|1892|Page Recommendations II||44.8%|Hard||
|1893|Check if All the Integers in a Range Are Covered||50.8%|Easy||
|1894|Find the Student that Will Replace the Chalk||43.6%|Medium||
|1895|Largest Magic Square||51.9%|Medium||
|1896|Minimum Cost to Change the Final Value of Expression||54.9%|Hard||
|1897|Redistribute Characters to Make All Strings Equal||60.0%|Easy||
|1898|Maximum Number of Removable Characters||39.2%|Medium||
|1899|Merge Triplets to Form Target Triplet||64.3%|Medium||
|1900|The Earliest and Latest Rounds Where Players Compete||51.8%|Hard||
|1901|Find a Peak Element II||53.3%|Medium||
|1902|Depth of BST Given Insertion Order||45.0%|Medium||
|1903|Largest Odd Number in String||55.7%|Easy||
|1904|The Number of Full Rounds You Have Played||45.7%|Medium||
|1905|Count Sub Islands||67.9%|Medium||
|1906|Minimum Absolute Difference Queries||43.9%|Medium||
|1907|Count Salary Categories||64.6%|Medium||
|1908|Game of Nim||57.3%|Medium||
|1909|Remove One Element to Make the Array Strictly Increasing||26.0%|Easy||
|1910|Remove All Occurrences of a Substring||74.0%|Medium||
|1911|Maximum Alternating Subsequence Sum||59.2%|Medium||
|1912|Design Movie Rental System||41.2%|Hard||
|1913|Maximum Product Difference Between Two Pairs||81.4%|Easy||
|1914|Cyclically Rotating a Grid||48.0%|Medium||
|1915|Number of Wonderful Substrings||44.8%|Medium||
|1916|Count Ways to Build Rooms in an Ant Colony||48.7%|Hard||
|1917|Leetcodify Friends Recommendations||28.9%|Hard||
|1918|Kth Smallest Subarray Sum||52.9%|Medium||
|1919|Leetcodify Similar Friends||43.2%|Hard||
|1920|Build Array from Permutation||91.5%|Easy||
|1921|Eliminate Maximum Number of Monsters||37.8%|Medium||
|1922|Count Good Numbers||38.5%|Medium||
|1923|Longest Common Subpath||27.6%|Hard||
|1924|Erect the Fence II||53.9%|Hard||
|1925|Count Square Sum Triples||67.9%|Easy||
|1926|Nearest Exit from Entrance in Maze||43.1%|Medium||
|1927|Sum Game||47.0%|Medium||
|1928|Minimum Cost to Reach Destination in Time||37.6%|Hard||
|1929|Concatenation of Array||91.5%|Easy||
|1930|Unique Length-3 Palindromic Subsequences||51.8%|Medium||
|1931|Painting a Grid With Three Different Colors||57.3%|Hard||
|1932|Merge BSTs to Create Single BST||35.3%|Hard||
|1933|Check if String Is Decomposable Into Value-Equal Substrings||50.4%|Easy||
|1934|Confirmation Rate||77.8%|Medium||
|1935|Maximum Number of Words You Can Type||71.0%|Easy||
|1936|Add Minimum Number of Rungs||42.8%|Medium||
|1937|Maximum Number of Points with Cost||36.2%|Medium||
|1938|Maximum Genetic Difference Query||39.5%|Hard||
|1939|Users That Actively Request Confirmation Messages||61.7%|Easy||
|1940|Longest Common Subsequence Between Sorted Arrays||79.4%|Medium||
|1941|Check if All Characters Have Equal Number of Occurrences||76.9%|Easy||
|1942|The Number of the Smallest Unoccupied Chair||40.4%|Medium||
|1943|Describe the Painting||47.8%|Medium||
|1944|Number of Visible People in a Queue||69.9%|Hard||
|1945|Sum of Digits of String After Convert||61.1%|Easy||
|1946|Largest Number After Mutating Substring||34.5%|Medium||
|1947|Maximum Compatibility Score Sum||60.9%|Medium||
|1948|Delete Duplicate Folders in System||58.0%|Hard||
|1949|Strong Friendship||58.7%|Medium||
|1950|Maximum of Minimum Values in All Subarrays||50.0%|Medium||
|1951|All the Pairs With the Maximum Number of Common Followers||72.9%|Medium||
|1952|Three Divisors||57.0%|Easy||
|1953|Maximum Number of Weeks for Which You Can Work||39.0%|Medium||
|1954|Minimum Garden Perimeter to Collect Enough Apples||53.0%|Medium||
|1955|Count Number of Special Subsequences||51.3%|Hard||
|1956|Minimum Time For K Virus Variants to Spread||46.5%|Hard||
|1957|Delete Characters to Make Fancy String||56.6%|Easy||
|1958|Check if Move is Legal||44.2%|Medium||
|1959|Minimum Total Space Wasted With K Resizing Operations||41.9%|Medium||
|1960|Maximum Product of the Length of Two Palindromic Substrings||29.6%|Hard||
|1961|Check If String Is a Prefix of Array||54.2%|Easy||
|1962|Remove Stones to Minimize the Total||58.8%|Medium||
|1963|Minimum Number of Swaps to Make the String Balanced||68.3%|Medium||
|1964|Find the Longest Valid Obstacle Course at Each Position||46.9%|Hard||
|1965|Employees With Missing Information||81.1%|Easy||
|1966|Binary Searchable Numbers in an Unsorted Array||65.5%|Medium||
|1967|Number of Strings That Appear as Substrings in Word||79.9%|Easy||
|1968|Array With Elements Not Equal to Average of Neighbors||49.4%|Medium||
|1969|Minimum Non-Zero Product of the Array Elements||33.7%|Medium||
|1970|Last Day Where You Can Still Cross||49.5%|Hard||
|1971|Find if Path Exists in Graph||50.5%|Easy||
|1972|First and Last Call On the Same Day||54.4%|Hard||
|1973|Count Nodes Equal to Sum of Descendants||75.3%|Medium||
|1974|Minimum Time to Type Word Using Special Typewriter||71.5%|Easy||
|1975|Maximum Matrix Sum||45.6%|Medium||
|1976|Number of Ways to Arrive at Destination||32.4%|Medium||
|1977|Number of Ways to Separate Numbers||21.2%|Hard||
|1978|Employees Whose Manager Left the Company||50.5%|Easy||
|1979|Find Greatest Common Divisor of Array||76.8%|Easy||
|1980|Find Unique Binary String||64.2%|Medium||
|1981|Minimize the Difference Between Target and Chosen Elements||32.4%|Medium||
|1982|Find Array Given Subset Sums||48.7%|Hard||
|1983|Widest Pair of Indices With Equal Range Sum||53.1%|Medium||
|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores)|53.5%|Easy||
|1985|Find the Kth Largest Integer in the Array||44.6%|Medium||
|1986|Minimum Number of Work Sessions to Finish the Tasks||33.1%|Medium||
|1987|Number of Unique Good Subsequences||52.2%|Hard||
|1988|Find Cutoff Score for Each School||70.5%|Medium||
|1989|Maximum Number of People That Can Be Caught in Tag||53.8%|Medium||
|1990|Count the Number of Experiments||51.7%|Medium||
|1991|Find the Middle Index in Array||67.3%|Easy||
|1992|Find All Groups of Farmland||68.5%|Medium||
|1993|Operations on Tree||43.5%|Medium||
|1994|The Number of Good Subsets||34.1%|Hard||
|1995|Count Special Quadruplets||59.0%|Easy||
|1996|The Number of Weak Characters in the Game||44.0%|Medium||
|1997|First Day Where You Have Been in All the Rooms||36.0%|Medium||
|1998|GCD Sort of an Array||45.5%|Hard||
|1999|Smallest Greater Multiple Made of Two Digits||50.0%|Medium||
|2000|Reverse Prefix of Word||77.7%|Easy||
|2001|Number of Pairs of Interchangeable Rectangles||44.6%|Medium||
|2002|Maximum Product of the Length of Two Palindromic Subsequences||53.4%|Medium||
|2003|Smallest Missing Genetic Value in Each Subtree||44.1%|Hard||
|2004|The Number of Seniors and Juniors to Join the Company||38.8%|Hard||
|2005|Subtree Removal Game with Fibonacci Tree||62.8%|Hard||
|2006|Count Number of Pairs With Absolute Difference K||82.2%|Easy||
|2007|Find Original Array From Doubled Array||41.0%|Medium||
|2008|Maximum Earnings From Taxi||43.0%|Medium||
|2009|Minimum Number of Operations to Make Array Continuous||45.5%|Hard||
|2010|The Number of Seniors and Juniors to Join the Company II||57.8%|Hard||
|2011|Final Value of Variable After Performing Operations||88.8%|Easy||
|2012|Sum of Beauty in the Array||46.7%|Medium||
|2013|Detect Squares||50.1%|Medium||
|2014|Longest Subsequence Repeated k Times||55.7%|Hard||
|2015|Average Height of Buildings in Each Segment||58.6%|Medium||
|2016|Maximum Difference Between Increasing Elements||53.4%|Easy||
|2017|Grid Game||42.7%|Medium||
|2018|Check if Word Can Be Placed In Crossword||49.3%|Medium||
|2019|The Score of Students Solving Math Expression||33.2%|Hard||
|2020|Number of Accounts That Did Not Stream||73.2%|Medium||
|2021|Brightest Position on Street|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2021.Brightest-Position-on-Street)|62.9%|Medium||
|2022|Convert 1D Array Into 2D Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2022.Convert-1D-Array-Into-2D-Array)|58.3%|Easy||
|2023|Number of Pairs of Strings With Concatenation Equal to Target||72.8%|Medium||
|2024|Maximize the Confusion of an Exam||59.4%|Medium||
|2025|Maximum Number of Ways to Partition an Array||32.0%|Hard||
|2026|Low-Quality Problems||85.5%|Easy||
|2027|Minimum Moves to Convert String||53.8%|Easy||
|2028|Find Missing Observations||43.5%|Medium||
|2029|Stone Game IX||26.1%|Medium||
|2030|Smallest K-Length Subsequence With Occurrences of a Letter||38.9%|Hard||
|2031|Count Subarrays With More Ones Than Zeros||53.2%|Medium||
|2032|Two Out of Three||72.6%|Easy||
|2033|Minimum Operations to Make a Uni-Value Grid||52.3%|Medium||
|2034|Stock Price Fluctuation||49.3%|Medium||
|2035|Partition Array Into Two Arrays to Minimize Sum Difference||17.9%|Hard||
|2036|Maximum Alternating Subarray Sum||41.2%|Medium||
|2037|Minimum Number of Moves to Seat Everyone|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone)|82.2%|Easy||
|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color)|58.1%|Medium||
|2039|The Time When the Network Becomes Idle||50.6%|Medium||
|2040|Kth Smallest Product of Two Sorted Arrays||29.1%|Hard||
|2041|Accepted Candidates From the Interviews||79.4%|Medium||
|2042|Check if Numbers Are Ascending in a Sentence||65.9%|Easy||
|2043|Simple Bank System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2043.Simple-Bank-System)|65.9%|Medium||
|2044|Count Number of Maximum Bitwise-OR Subsets||74.8%|Medium||
|2045|Second Minimum Time to Reach Destination||38.5%|Hard||
|2046|Sort Linked List Already Sorted Using Absolute Values||68.6%|Medium||
|2047|Number of Valid Words in a Sentence||29.5%|Easy||
|2048|Next Greater Numerically Balanced Number||47.1%|Medium||
|2049|Count Nodes With the Highest Score||47.1%|Medium||
|2050|Parallel Courses III||59.4%|Hard||
|2051|The Category of Each Member in the Store||73.5%|Medium||
|2052|Minimum Cost to Separate Sentence Into Rows||51.0%|Medium||
|2053|Kth Distinct String in an Array||71.9%|Easy||
|2054|Two Best Non-Overlapping Events||44.8%|Medium||
|2055|Plates Between Candles||44.7%|Medium||
|2056|Number of Valid Move Combinations On Chessboard||59.1%|Hard||
|2057|Smallest Index With Equal Value||71.2%|Easy||
|2058|Find the Minimum and Maximum Number of Nodes Between Critical Points||57.1%|Medium||
|2059|Minimum Operations to Convert Number||47.2%|Medium||
|2060|Check if an Original String Exists Given Two Encoded Strings||41.0%|Hard||
|2061|Number of Spaces Cleaning Robot Cleaned||54.9%|Medium||
|2062|Count Vowel Substrings of a String||65.9%|Easy||
|2063|Vowels of All Substrings||55.0%|Medium||
|2064|Minimized Maximum of Products Distributed to Any Store||50.0%|Medium||
|2065|Maximum Path Quality of a Graph||57.7%|Hard||
|2066|Account Balance||85.5%|Medium||
|2067|Number of Equal Count Substrings||49.6%|Medium||
|2068|Check Whether Two Strings are Almost Equivalent||64.7%|Easy||
|2069|Walking Robot Simulation II||23.0%|Medium||
|2070|Most Beautiful Item for Each Query||49.5%|Medium||
|2071|Maximum Number of Tasks You Can Assign||34.8%|Hard||
|2072|The Winner University||72.4%|Easy||
|2073|Time Needed to Buy Tickets||62.0%|Easy||
|2074|Reverse Nodes in Even Length Groups||51.5%|Medium||
|2075|Decode the Slanted Ciphertext||50.2%|Medium||
|2076|Process Restricted Friend Requests||53.4%|Hard||
|2077|Paths in Maze That Lead to Same Room||56.8%|Medium||
|2078|Two Furthest Houses With Different Colors||67.3%|Easy||
|2079|Watering Plants||80.2%|Medium||
|2080|Range Frequency Queries||38.1%|Medium||
|2081|Sum of k-Mirror Numbers||42.1%|Hard||
|2082|The Number of Rich Customers||80.7%|Easy||
|2083|Substrings That Begin and End With the Same Letter||68.0%|Medium||
|2084|Drop Type 1 Orders for Customers With Type 0 Orders||91.2%|Medium||
|2085|Count Common Words With One Occurrence||69.6%|Easy||
|2086|Minimum Number of Buckets Required to Collect Rainwater from Houses||45.0%|Medium||
|2087|Minimum Cost Homecoming of a Robot in a Grid||51.4%|Medium||
|2088|Count Fertile Pyramids in a Land||63.3%|Hard||
|2089|Find Target Indices After Sorting Array||76.9%|Easy||
|2090|K Radius Subarray Averages||42.4%|Medium||
|2091|Removing Minimum and Maximum From Array||56.8%|Medium||
|2092|Find All People With Secret||34.2%|Hard||
|2093|Minimum Cost to Reach City With Discounts||56.3%|Medium||
|2094|Finding 3-Digit Even Numbers||57.4%|Easy||
|2095|Delete the Middle Node of a Linked List||60.7%|Medium||
|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another)|48.8%|Medium||
|2097|Valid Arrangement of Pairs||40.9%|Hard||
|2098|Subsequence of Size K With the Largest Even Sum||38.7%|Medium||
|2099|Find Subsequence of Length K With the Largest Sum||42.5%|Easy||
|2100|Find Good Days to Rob the Bank||49.1%|Medium||
|2101|Detonate the Maximum Bombs||40.9%|Medium||
|2102|Sequentially Ordinal Rank Tracker||66.1%|Hard||
|2103|Rings and Rods||81.5%|Easy||
|2104|Sum of Subarray Ranges||60.2%|Medium||
|2105|Watering Plants II||50.2%|Medium||
|2106|Maximum Fruits Harvested After at Most K Steps||35.1%|Hard||
|2107|Number of Unique Flavors After Sharing K Candies||57.2%|Medium||
|2108|Find First Palindromic String in the Array||78.6%|Easy||
|2109|Adding Spaces to a String||56.2%|Medium||
|2110|Number of Smooth Descent Periods of a Stock||57.4%|Medium||
|2111|Minimum Operations to Make the Array K-Increasing||37.7%|Hard||
|2112|The Airport With the Most Traffic||71.2%|Medium||
|2113|Elements in Array After Removing and Replacing Elements||73.4%|Medium||
|2114|Maximum Number of Words Found in Sentences||88.2%|Easy||
|2115|Find All Possible Recipes from Given Supplies||48.2%|Medium||
|2116|Check if a Parentheses String Can Be Valid||31.4%|Medium||
|2117|Abbreviating the Product of a Range||28.1%|Hard||
|2118|Build the Equation||57.8%|Hard||
|2119|A Number After a Double Reversal||75.7%|Easy||
|2120|Execution of All Suffix Instructions Staying in a Grid||83.5%|Medium||
|2121|Intervals Between Identical Elements||43.0%|Medium||
|2122|Recover the Original Array||38.1%|Hard||
|2123|Minimum Operations to Remove Adjacent Ones in Matrix||41.1%|Hard||
|2124|Check if All A's Appears Before All B's||71.5%|Easy||
|2125|Number of Laser Beams in a Bank||82.7%|Medium||
|2126|Destroying Asteroids||49.4%|Medium||
|2127|Maximum Employees to Be Invited to a Meeting||32.9%|Hard||
|2128|Remove All Ones With Row and Column Flips||76.4%|Medium||
|2129|Capitalize the Title||60.1%|Easy||
|2130|Maximum Twin Sum of a Linked List||81.6%|Medium||
|2131|Longest Palindrome by Concatenating Two Letter Words||41.3%|Medium||
|2132|Stamping the Grid||30.6%|Hard||
|2133|Check if Every Row and Column Contains All Numbers||52.8%|Easy||
|2134|Minimum Swaps to Group All 1's Together II||50.3%|Medium||
|2135|Count Words Obtained After Adding a Letter||42.8%|Medium||
|2136|Earliest Possible Day of Full Bloom||68.4%|Hard||
|2137|Pour Water Between Buckets to Make Water Levels Equal||67.1%|Medium||
|2138|Divide a String Into Groups of Size k||65.1%|Easy||
|2139|Minimum Moves to Reach Target Score||48.4%|Medium||
|2140|Solving Questions With Brainpower||45.8%|Medium||
|2141|Maximum Running Time of N Computers||38.7%|Hard||
|2142|The Number of Passengers in Each Bus I||51.1%|Medium||
|2143|Choose Numbers From Two Arrays in Range||51.8%|Hard||
|2144|Minimum Cost of Buying Candies With Discount||60.8%|Easy||
|2145|Count the Hidden Sequences||36.3%|Medium||
|2146|K Highest Ranked Items Within a Price Range||41.2%|Medium||
|2147|Number of Ways to Divide a Long Corridor||39.9%|Hard||
|2148|Count Elements With Strictly Smaller and Greater Elements||60.0%|Easy||
|2149|Rearrange Array Elements by Sign||81.0%|Medium||
|2150|Find All Lonely Numbers in the Array||60.7%|Medium||
|2151|Maximum Good People Based on Statements||48.4%|Hard||
|2152|Minimum Number of Lines to Cover Points||46.7%|Medium||
|2153|The Number of Passengers in Each Bus II||50.4%|Hard||
|2154|Keep Multiplying Found Values by Two||73.3%|Easy||
|2155|All Divisions With the Highest Score of a Binary Array||63.3%|Medium||
|2156|Find Substring With Given Hash Value||21.9%|Hard||
|2157|Groups of Strings||25.2%|Hard||
|2158|Amount of New Area Painted Each Day||55.7%|Hard||
|2159|Order Two Columns Independently||63.5%|Medium||
|2160|Minimum Sum of Four Digit Number After Splitting Digits||88.2%|Easy||
|2161|Partition Array According to Given Pivot||84.3%|Medium||
|2162|Minimum Cost to Set Cooking Time||39.2%|Medium||
|2163|Minimum Difference in Sums After Removal of Elements||46.5%|Hard||
|2164|Sort Even and Odd Indices Independently|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2164.Sort-Even-and-Odd-Indices-Independently)|66.6%|Easy||
|2165|Smallest Value of the Rearranged Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2165.Smallest-Value-of-the-Rearranged-Number)|51.1%|Medium||
|2166|Design Bitset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2166.Design-Bitset)|31.3%|Medium||
|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods)|40.1%|Hard||
|2168|Unique Substrings With Equal Digit Frequency||60.2%|Medium||
|2169|Count Operations to Obtain Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2169.Count-Operations-to-Obtain-Zero)|75.6%|Easy||
|2170|Minimum Op
gitextract_4lwz87pg/
├── .github/
│ ├── FUNDING.yml
│ └── workflows/
│ └── deploy.yml
├── .gitignore
├── .travis.yml
├── .vscode/
│ ├── launch.json
│ └── settings.json
├── LICENSE
├── README.md
├── README_old.md
├── ctl/
│ ├── README.md
│ ├── command.go
│ ├── config.go
│ ├── error.go
│ ├── label.go
│ ├── main.go
│ ├── meta/
│ │ ├── Array
│ │ ├── Backtracking
│ │ ├── Binary_Indexed_Tree
│ │ ├── Binary_Search
│ │ ├── Bit_Manipulation
│ │ ├── Breadth_First_Search
│ │ ├── Depth_First_Search
│ │ ├── Dynamic_Programming
│ │ ├── Hash_Table
│ │ ├── Linked_List
│ │ ├── Math
│ │ ├── PDFPreface
│ │ ├── Segment_Tree
│ │ ├── Sliding_Window
│ │ ├── Sorting
│ │ ├── Stack
│ │ ├── String
│ │ ├── Tree
│ │ ├── Two_Pointers
│ │ ├── Union_Find
│ │ └── meta
│ ├── models/
│ │ ├── go.mod
│ │ ├── go.sum
│ │ ├── lcproblems.go
│ │ ├── mdrow.go
│ │ ├── tagproblem.go
│ │ └── user.go
│ ├── pdf.go
│ ├── rangking.go
│ ├── refresh.go
│ ├── render.go
│ ├── request.go
│ ├── statistic.go
│ ├── template/
│ │ ├── Array.md
│ │ ├── Backtracking.md
│ │ ├── Binary_Indexed_Tree.md
│ │ ├── Binary_Search.md
│ │ ├── Bit_Manipulation.md
│ │ ├── Breadth_First_Search.md
│ │ ├── Depth_First_Search.md
│ │ ├── Dynamic_Programming.md
│ │ ├── Hash_Table.md
│ │ ├── Linked_List.md
│ │ ├── Math.md
│ │ ├── Segment_Tree.md
│ │ ├── Sliding_Window.md
│ │ ├── Sorting.md
│ │ ├── Stack.md
│ │ ├── String.md
│ │ ├── Tree.md
│ │ ├── Two_Pointers.md
│ │ ├── Union_Find.md
│ │ ├── collapseSection.md
│ │ ├── menu.md
│ │ └── template.markdown
│ ├── template_render.go
│ ├── util/
│ │ ├── go.mod
│ │ └── util.go
│ └── version.go
├── go.mod
├── go.sum
├── gotest.sh
├── leetcode/
│ ├── 0001.Two-Sum/
│ │ ├── 1. Two Sum.go
│ │ ├── 1. Two Sum_test.go
│ │ └── README.md
│ ├── 0002.Add-Two-Numbers/
│ │ ├── 2. Add Two Numbers.go
│ │ ├── 2. Add Two Numbers_test.go
│ │ └── README.md
│ ├── 0003.Longest-Substring-Without-Repeating-Characters/
│ │ ├── 3. Longest Substring Without Repeating Characters.go
│ │ ├── 3. Longest Substring Without Repeating Characters_test.go
│ │ └── README.md
│ ├── 0004.Median-of-Two-Sorted-Arrays/
│ │ ├── 4. Median of Two Sorted Arrays.go
│ │ ├── 4. Median of Two Sorted Arrays_test.go
│ │ └── README.md
│ ├── 0005.Longest-Palindromic-Substring/
│ │ ├── 5. Longest Palindromic Substring.go
│ │ ├── 5. Longest Palindromic Substring_test.go
│ │ └── README.md
│ ├── 0006.ZigZag-Conversion/
│ │ ├── 6. ZigZag Conversion.go
│ │ ├── 6. ZigZag Conversion_test.go
│ │ └── README.md
│ ├── 0007.Reverse-Integer/
│ │ ├── 7. Reverse Integer.go
│ │ ├── 7. Reverse Integer_test.go
│ │ └── README.md
│ ├── 0008.String-to-Integer-atoi/
│ │ ├── 8. String to Integer atoi.go
│ │ ├── 8. String to Integer atoi_test.go
│ │ └── README.md
│ ├── 0009.Palindrome-Number/
│ │ ├── 9. Palindrome Number.go
│ │ ├── 9. Palindrome Number_test.go
│ │ └── README.md
│ ├── 0011.Container-With-Most-Water/
│ │ ├── 11. Container With Most Water.go
│ │ ├── 11. Container With Most Water_test.go
│ │ └── README.md
│ ├── 0012.Integer-to-Roman/
│ │ ├── 12. Integer to Roman.go
│ │ ├── 12. Integer to Roman_test.go
│ │ └── README.md
│ ├── 0013.Roman-to-Integer/
│ │ ├── 13. Roman to Integer.go
│ │ ├── 13. Roman to Integer_test.go
│ │ └── README.md
│ ├── 0014.Longest-Common-Prefix/
│ │ ├── 14.Longest Common Prefix.go
│ │ ├── 14.Longest Common Prefix_test.go
│ │ └── README.md
│ ├── 0015.3Sum/
│ │ ├── 15. 3Sum.go
│ │ ├── 15. 3Sum_test.go
│ │ └── README.md
│ ├── 0016.3Sum-Closest/
│ │ ├── 16. 3Sum Closest.go
│ │ ├── 16. 3Sum Closest_test.go
│ │ └── README.md
│ ├── 0017.Letter-Combinations-of-a-Phone-Number/
│ │ ├── 17. Letter Combinations of a Phone Number.go
│ │ ├── 17. Letter Combinations of a Phone Number_test.go
│ │ └── README.md
│ ├── 0018.4Sum/
│ │ ├── 18. 4Sum.go
│ │ ├── 18. 4Sum_test.go
│ │ └── README.md
│ ├── 0019.Remove-Nth-Node-From-End-of-List/
│ │ ├── 19. Remove Nth Node From End of List.go
│ │ ├── 19. Remove Nth Node From End of List_test.go
│ │ └── README.md
│ ├── 0020.Valid-Parentheses/
│ │ ├── 20. Valid Parentheses.go
│ │ ├── 20. Valid Parentheses_test.go
│ │ └── README.md
│ ├── 0021.Merge-Two-Sorted-Lists/
│ │ ├── 21. Merge Two Sorted Lists.go
│ │ ├── 21. Merge Two Sorted Lists_test.go
│ │ └── README.md
│ ├── 0022.Generate-Parentheses/
│ │ ├── 22. Generate Parentheses.go
│ │ ├── 22. Generate Parentheses_test.go
│ │ └── README.md
│ ├── 0023.Merge-k-Sorted-Lists/
│ │ ├── 23. Merge k Sorted Lists.go
│ │ ├── 23. Merge k Sorted Lists_test.go
│ │ └── README.md
│ ├── 0024.Swap-Nodes-in-Pairs/
│ │ ├── 24. Swap Nodes in Pairs.go
│ │ ├── 24. Swap Nodes in Pairs_test.go
│ │ └── README.md
│ ├── 0025.Reverse-Nodes-in-k-Group/
│ │ ├── 25. Reverse Nodes in k Group.go
│ │ ├── 25. Reverse Nodes in k Group_test.go
│ │ └── README.md
│ ├── 0026.Remove-Duplicates-from-Sorted-Array/
│ │ ├── 26. Remove Duplicates from Sorted Array.go
│ │ ├── 26. Remove Duplicates from Sorted Array_test.go
│ │ └── README.md
│ ├── 0027.Remove-Element/
│ │ ├── 27. Remove Element.go
│ │ ├── 27. Remove Element_test.go
│ │ └── README.md
│ ├── 0028.Find-the-Index-of-the-First-Occurrence-in-a-String/
│ │ ├── 28. Find the Index of the First Occurrence in a String.go
│ │ ├── 28. Find the Index of the First Occurrence in a String_test.go
│ │ └── README.md
│ ├── 0029.Divide-Two-Integers/
│ │ ├── 29. Divide Two Integers.go
│ │ ├── 29. Divide Two Integers_test.go
│ │ └── README.md
│ ├── 0030.Substring-with-Concatenation-of-All-Words/
│ │ ├── 30. Substring with Concatenation of All Words.go
│ │ ├── 30. Substring with Concatenation of All Words_test.go
│ │ └── README.md
│ ├── 0031.Next-Permutation/
│ │ ├── 31. Next Permutation.go
│ │ ├── 31. Next Permutation_test.go
│ │ └── README.md
│ ├── 0032.Longest-Valid-Parentheses/
│ │ ├── 32. Longest Valid Parentheses.go
│ │ ├── 32. Longest Valid Parentheses_test.go
│ │ └── README.md
│ ├── 0033.Search-in-Rotated-Sorted-Array/
│ │ ├── 33. Search in Rotated Sorted Array.go
│ │ ├── 33. Search in Rotated Sorted Array_test.go
│ │ └── README.md
│ ├── 0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/
│ │ ├── 34. Find First and Last Position of Element in Sorted Array.go
│ │ ├── 34. Find First and Last Position of Element in Sorted Array_test.go
│ │ └── README.md
│ ├── 0035.Search-Insert-Position/
│ │ ├── 35. Search Insert Position.go
│ │ ├── 35. Search Insert Position_test.go
│ │ └── README.md
│ ├── 0036.Valid-Sudoku/
│ │ ├── 36. Valid Sudoku.go
│ │ ├── 36. Valid Sudoku_test.go
│ │ └── README.md
│ ├── 0037.Sudoku-Solver/
│ │ ├── 37. Sudoku Solver.go
│ │ ├── 37. Sudoku Solver_test.go
│ │ └── README.md
│ ├── 0039.Combination-Sum/
│ │ ├── 39. Combination Sum.go
│ │ ├── 39. Combination Sum_test.go
│ │ └── README.md
│ ├── 0040.Combination-Sum-II/
│ │ ├── 40. Combination Sum II.go
│ │ ├── 40. Combination Sum II_test.go
│ │ └── README.md
│ ├── 0041.First-Missing-Positive/
│ │ ├── 41. First Missing Positive.go
│ │ ├── 41. First Missing Positive_test.go
│ │ └── README.md
│ ├── 0042.Trapping-Rain-Water/
│ │ ├── 42. Trapping Rain Water.go
│ │ ├── 42. Trapping Rain Water_test.go
│ │ └── README.md
│ ├── 0043.Multiply-Strings/
│ │ ├── 43. Multiply Strings.go
│ │ ├── 43. Multiply Strings_test.go
│ │ └── README.md
│ ├── 0045.Jump-Game-II/
│ │ ├── 45. Jump Game II.go
│ │ ├── 45. Jump Game II_test.go
│ │ └── README.md
│ ├── 0046.Permutations/
│ │ ├── 46. Permutations.go
│ │ ├── 46. Permutations_test.go
│ │ └── README.md
│ ├── 0047.Permutations-II/
│ │ ├── 47. Permutations II.go
│ │ ├── 47. Permutations II_test.go
│ │ └── README.md
│ ├── 0048.Rotate-Image/
│ │ ├── 48. Rotate Image.go
│ │ ├── 48. Rotate Image_test.go
│ │ └── README.md
│ ├── 0049.Group-Anagrams/
│ │ ├── 49. Group Anagrams.go
│ │ ├── 49. Group Anagrams_test.go
│ │ └── README.md
│ ├── 0050.Powx-n/
│ │ ├── 50. Pow(x, n).go
│ │ ├── 50. Pow(x, n)_test.go
│ │ └── README.md
│ ├── 0051.N-Queens/
│ │ ├── 51. N-Queens.go
│ │ ├── 51. N-Queens_test.go
│ │ └── README.md
│ ├── 0052.N-Queens-II/
│ │ ├── 52. N-Queens II.go
│ │ ├── 52. N-Queens II_test.go
│ │ └── README.md
│ ├── 0053.Maximum-Subarray/
│ │ ├── 53. Maximum Subarray.go
│ │ ├── 53. Maximum Subarray_test.go
│ │ └── README.md
│ ├── 0054.Spiral-Matrix/
│ │ ├── 54. Spiral Matrix.go
│ │ ├── 54. Spiral Matrix_test.go
│ │ └── README.md
│ ├── 0055.Jump-Game/
│ │ ├── 55. Jump Game.go
│ │ ├── 55. Jump Game_test.go
│ │ └── README.md
│ ├── 0056.Merge-Intervals/
│ │ ├── 56. Merge Intervals.go
│ │ ├── 56. Merge Intervals_test.go
│ │ └── README.md
│ ├── 0057.Insert-Interval/
│ │ ├── 57. Insert Interval.go
│ │ ├── 57. Insert Interval_test.go
│ │ └── README.md
│ ├── 0058.Length-of-Last-Word/
│ │ ├── 58.Length of Last Word.go
│ │ ├── 58.Length of Last Word_test.go
│ │ └── README.md
│ ├── 0059.Spiral-Matrix-II/
│ │ ├── 59. Spiral Matrix II.go
│ │ ├── 59. Spiral Matrix II_test.go
│ │ └── README.md
│ ├── 0060.Permutation-Sequence/
│ │ ├── 60. Permutation Sequence.go
│ │ ├── 60. Permutation Sequence_test.go
│ │ └── README.md
│ ├── 0061.Rotate-List/
│ │ ├── 61. Rotate List.go
│ │ ├── 61. Rotate List_test.go
│ │ └── README.md
│ ├── 0062.Unique-Paths/
│ │ ├── 62. Unique Paths.go
│ │ ├── 62. Unique Paths_test.go
│ │ └── README.md
│ ├── 0063.Unique-Paths-II/
│ │ ├── 63. Unique Paths II.go
│ │ ├── 63. Unique Paths II_test.go
│ │ └── README.md
│ ├── 0064.Minimum-Path-Sum/
│ │ ├── 64. Minimum Path Sum.go
│ │ ├── 64. Minimum Path Sum_test.go
│ │ └── README.md
│ ├── 0065.Valid-Number/
│ │ ├── 65. Valid Number.go
│ │ ├── 65. Valid Number_test.go
│ │ └── README.md
│ ├── 0066.Plus-One/
│ │ ├── 66. Plus One.go
│ │ ├── 66. Plus One_test.go
│ │ └── README.md
│ ├── 0067.Add-Binary/
│ │ ├── 67. Add Binary.go
│ │ ├── 67. Add Binary_test.go
│ │ └── README.md
│ ├── 0069.Sqrtx/
│ │ ├── 69. Sqrt(x).go
│ │ ├── 69. Sqrt(x)_test.go
│ │ └── README.md
│ ├── 0070.Climbing-Stairs/
│ │ ├── 70. Climbing Stairs.go
│ │ ├── 70. Climbing Stairs_test.go
│ │ └── README.md
│ ├── 0071.Simplify-Path/
│ │ ├── 71. Simplify Path.go
│ │ ├── 71. Simplify Path_test.go
│ │ └── README.md
│ ├── 0073.Set-Matrix-Zeroes/
│ │ ├── 73. Set Matrix Zeroes.go
│ │ ├── 73. Set Matrix Zeroes_test.go
│ │ └── README.md
│ ├── 0074.Search-a-2D-Matrix/
│ │ ├── 74. Search a 2D Matrix.go
│ │ ├── 74. Search a 2D Matrix_test.go
│ │ └── README.md
│ ├── 0075.Sort-Colors/
│ │ ├── 75. Sort Colors.go
│ │ ├── 75. Sort Colors_test.go
│ │ └── README.md
│ ├── 0076.Minimum-Window-Substring/
│ │ ├── 76. Minimum Window Substring.go
│ │ ├── 76. Minimum Window Substring_test.go
│ │ └── README.md
│ ├── 0077.Combinations/
│ │ ├── 77. Combinations.go
│ │ ├── 77. Combinations_test.go
│ │ └── README.md
│ ├── 0078.Subsets/
│ │ ├── 78. Subsets.go
│ │ ├── 78. Subsets_test.go
│ │ └── README.md
│ ├── 0079.Word-Search/
│ │ ├── 79. Word Search.go
│ │ ├── 79. Word Search_test.go
│ │ └── README.md
│ ├── 0080.Remove-Duplicates-from-Sorted-Array-II/
│ │ ├── 80. Remove Duplicates from Sorted Array II.go
│ │ ├── 80. Remove Duplicates from Sorted Array II_test.go
│ │ └── README.md
│ ├── 0081.Search-in-Rotated-Sorted-Array-II/
│ │ ├── 81. Search in Rotated Sorted Array II.go
│ │ ├── 81. Search in Rotated Sorted Array II_test.go
│ │ └── README.md
│ ├── 0082.Remove-Duplicates-from-Sorted-List-II/
│ │ ├── 82. Remove Duplicates from Sorted List II.go
│ │ ├── 82. Remove Duplicates from Sorted List II_test.go
│ │ └── README.md
│ ├── 0083.Remove-Duplicates-from-Sorted-List/
│ │ ├── 83. Remove Duplicates from Sorted List.go
│ │ ├── 83. Remove Duplicates from Sorted List_test.go
│ │ └── README.md
│ ├── 0084.Largest-Rectangle-in-Histogram/
│ │ ├── 84. Largest Rectangle in Histogram.go
│ │ ├── 84. Largest Rectangle in Histogram_test.go
│ │ └── README.md
│ ├── 0086.Partition-List/
│ │ ├── 86. Partition List.go
│ │ ├── 86. Partition List_test.go
│ │ └── README.md
│ ├── 0088.Merge-Sorted-Array/
│ │ ├── 88. Merge Sorted Array.go
│ │ ├── 88. Merge Sorted Array_test.go
│ │ └── README.md
│ ├── 0089.Gray-Code/
│ │ ├── 89. Gray Code.go
│ │ ├── 89. Gray Code_test.go
│ │ └── README.md
│ ├── 0090.Subsets-II/
│ │ ├── 90. Subsets II.go
│ │ ├── 90. Subsets II_test.go
│ │ └── README.md
│ ├── 0091.Decode-Ways/
│ │ ├── 91. Decode Ways.go
│ │ ├── 91. Decode Ways_test.go
│ │ └── README.md
│ ├── 0092.Reverse-Linked-List-II/
│ │ ├── 92. Reverse Linked List II.go
│ │ ├── 92. Reverse Linked List II_test.go
│ │ └── README.md
│ ├── 0093.Restore-IP-Addresses/
│ │ ├── 93. Restore IP Addresses.go
│ │ ├── 93. Restore IP Addresses_test.go
│ │ └── README.md
│ ├── 0094.Binary-Tree-Inorder-Traversal/
│ │ ├── 94. Binary Tree Inorder Traversal.go
│ │ ├── 94. Binary Tree Inorder Traversal_test.go
│ │ └── README.md
│ ├── 0095.Unique-Binary-Search-Trees-II/
│ │ ├── 95. Unique Binary Search Trees II.go
│ │ ├── 95. Unique Binary Search Trees II_test.go
│ │ └── README.md
│ ├── 0096.Unique-Binary-Search-Trees/
│ │ ├── 96. Unique Binary Search Trees.go
│ │ ├── 96. Unique Binary Search Trees_test.go
│ │ └── README.md
│ ├── 0097.Interleaving-String/
│ │ ├── 97. Interleaving String.go
│ │ ├── 97. Interleaving String_test.go
│ │ └── README.md
│ ├── 0098.Validate-Binary-Search-Tree/
│ │ ├── 98. Validate Binary Search Tree.go
│ │ ├── 98. Validate Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0099.Recover-Binary-Search-Tree/
│ │ ├── 99. Recover Binary Search Tree.go
│ │ ├── 99. Recover Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0100.Same-Tree/
│ │ ├── 100. Same Tree.go
│ │ ├── 100. Same Tree_test.go
│ │ └── README.md
│ ├── 0101.Symmetric-Tree/
│ │ ├── 101. Symmetric Tree.go
│ │ ├── 101. Symmetric Tree_test.go
│ │ └── README.md
│ ├── 0102.Binary-Tree-Level-Order-Traversal/
│ │ ├── 102. Binary Tree Level Order Traversal.go
│ │ ├── 102. Binary Tree Level Order Traversal_test.go
│ │ └── README.md
│ ├── 0103.Binary-Tree-Zigzag-Level-Order-Traversal/
│ │ ├── 103. Binary Tree Zigzag Level Order Traversal.go
│ │ ├── 103. Binary Tree Zigzag Level Order Traversal_test.go
│ │ └── README.md
│ ├── 0104.Maximum-Depth-of-Binary-Tree/
│ │ ├── 104. Maximum Depth of Binary Tree.go
│ │ ├── 104. Maximum Depth of Binary Tree_test.go
│ │ └── README.md
│ ├── 0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/
│ │ ├── 105. Construct Binary Tree from Preorder and Inorder Traversal.go
│ │ ├── 105. Construct Binary Tree from Preorder and Inorder Traversal_test.go
│ │ └── README.md
│ ├── 0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/
│ │ ├── 106. Construct Binary Tree from Inorder and Postorder Traversal.go
│ │ ├── 106. Construct Binary Tree from Inorder and Postorder Traversal_test.go
│ │ └── README.md
│ ├── 0107.Binary-Tree-Level-Order-Traversal-II/
│ │ ├── 107. Binary Tree Level Order Traversal II.go
│ │ ├── 107. Binary Tree Level Order Traversal II_test.go
│ │ └── README.md
│ ├── 0108.Convert-Sorted-Array-to-Binary-Search-Tree/
│ │ ├── 108. Convert Sorted Array to Binary Search Tree.go
│ │ ├── 108. Convert Sorted Array to Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0109.Convert-Sorted-List-to-Binary-Search-Tree/
│ │ ├── 109. Convert Sorted List to Binary Search Tree.go
│ │ ├── 109. Convert Sorted List to Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0110.Balanced-Binary-Tree/
│ │ ├── 110. Balanced Binary Tree.go
│ │ ├── 110. Balanced Binary Tree_test.go
│ │ └── README.md
│ ├── 0111.Minimum-Depth-of-Binary-Tree/
│ │ ├── 111. Minimum Depth of Binary Tree.go
│ │ ├── 111. Minimum Depth of Binary Tree_test.go
│ │ └── README.md
│ ├── 0112.Path-Sum/
│ │ ├── 112. Path Sum.go
│ │ ├── 112. Path Sum_test.go
│ │ └── README.md
│ ├── 0113.Path-Sum-II/
│ │ ├── 113. Path Sum II.go
│ │ ├── 113. Path Sum II_test.go
│ │ └── README.md
│ ├── 0114.Flatten-Binary-Tree-to-Linked-List/
│ │ ├── 114. Flatten Binary Tree to Linked List.go
│ │ ├── 114. Flatten Binary Tree to Linked List_test.go
│ │ └── README.md
│ ├── 0115.Distinct-Subsequences/
│ │ ├── 115. Distinct Subsequences.go
│ │ ├── 115. Distinct Subsequences_test.go
│ │ └── README.md
│ ├── 0116.Populating-Next-Right-Pointers-in-Each-Node/
│ │ ├── 116.Populating Next Right Pointers in Each Node.go
│ │ ├── 116.Populating Next Right Pointers in Each Node_test.go
│ │ └── README.md
│ ├── 0118.Pascals-Triangle/
│ │ ├── 118. Pascals Triangle.go
│ │ ├── 118. Pascals Triangle_test.go
│ │ └── README.md
│ ├── 0119.Pascals-Triangle-II/
│ │ ├── 119. Pascals Triangle II.go
│ │ ├── 119. Pascals Triangle II_test.go
│ │ └── README.md
│ ├── 0120.Triangle/
│ │ ├── 120. Triangle.go
│ │ ├── 120. Triangle_test.go
│ │ └── README.md
│ ├── 0121.Best-Time-to-Buy-and-Sell-Stock/
│ │ ├── 121. Best Time to Buy and Sell Stock.go
│ │ ├── 121. Best Time to Buy and Sell Stock_test.go
│ │ └── README.md
│ ├── 0122.Best-Time-to-Buy-and-Sell-Stock-II/
│ │ ├── 122. Best Time to Buy and Sell Stock II.go
│ │ ├── 122. Best Time to Buy and Sell Stock II_test.go
│ │ └── README.md
│ ├── 0124.Binary-Tree-Maximum-Path-Sum/
│ │ ├── 124. Binary Tree Maximum Path Sum.go
│ │ ├── 124. Binary Tree Maximum Path Sum_test.go
│ │ └── README.md
│ ├── 0125.Valid-Palindrome/
│ │ ├── 125. Valid Palindrome.go
│ │ ├── 125. Valid Palindrome_test.go
│ │ └── README.md
│ ├── 0126.Word-Ladder-II/
│ │ ├── 126. Word Ladder II.go
│ │ ├── 126. Word Ladder II_test.go
│ │ └── README.md
│ ├── 0127.Word-Ladder/
│ │ ├── 127. Word Ladder.go
│ │ ├── 127. Word Ladder_test.go
│ │ └── README.md
│ ├── 0128.Longest-Consecutive-Sequence/
│ │ ├── 128. Longest Consecutive Sequence.go
│ │ ├── 128. Longest Consecutive Sequence_test.go
│ │ └── README.md
│ ├── 0129.Sum-Root-to-Leaf-Numbers/
│ │ ├── 129. Sum Root to Leaf Numbers.go
│ │ ├── 129. Sum Root to Leaf Numbers_test.go
│ │ └── README.md
│ ├── 0130.Surrounded-Regions/
│ │ ├── 130. Surrounded Regions.go
│ │ ├── 130. Surrounded Regions_test.go
│ │ └── README.md
│ ├── 0131.Palindrome-Partitioning/
│ │ ├── 131. Palindrome Partitioning.go
│ │ ├── 131. Palindrome Partitioning_test.go
│ │ └── README.md
│ ├── 0134.Gas-Station/
│ │ ├── Gas.go
│ │ ├── Gas_test.go
│ │ └── README.md
│ ├── 0135.Candy/
│ │ ├── 135. Candy.go
│ │ ├── 135. Candy_test.go
│ │ └── README.md
│ ├── 0136.Single-Number/
│ │ ├── 136. Single Number.go
│ │ ├── 136. Single Number_test.go
│ │ └── README.md
│ ├── 0137.Single-Number-II/
│ │ ├── 137. Single Number II.go
│ │ ├── 137. Single Number II_test.go
│ │ └── README.md
│ ├── 0138.Copy-List-With-Random-Pointer/
│ │ ├── 138. Copy List With Random Pointer.go
│ │ ├── 138. Copy List With Random Pointer_test.go
│ │ └── README.md
│ ├── 0141.Linked-List-Cycle/
│ │ ├── 141. Linked List Cycle.go
│ │ ├── 141. Linked List Cycle_test.go
│ │ └── README.md
│ ├── 0142.Linked-List-Cycle-II/
│ │ ├── 142. Linked List Cycle II.go
│ │ ├── 142. Linked List Cycle II_test.go
│ │ └── README.md
│ ├── 0143.Reorder-List/
│ │ ├── 143. Reorder List.go
│ │ ├── 143. Reorder List_test.go
│ │ └── README.md
│ ├── 0144.Binary-Tree-Preorder-Traversal/
│ │ ├── 144. Binary Tree Preorder Traversal.go
│ │ ├── 144. Binary Tree Preorder Traversal_test.go
│ │ └── README.md
│ ├── 0145.Binary-Tree-Postorder-Traversal/
│ │ ├── 145. Binary Tree Postorder Traversal.go
│ │ ├── 145. Binary Tree Postorder Traversal_test.go
│ │ └── README.md
│ ├── 0146.LRU-Cache/
│ │ ├── 146. LRU Cache.go
│ │ ├── 146. LRU Cache_test.go
│ │ └── README.md
│ ├── 0147.Insertion-Sort-List/
│ │ ├── 147. Insertion Sort List.go
│ │ ├── 147. Insertion Sort List_test.go
│ │ └── README.md
│ ├── 0148.Sort-List/
│ │ ├── 148. Sort List.go
│ │ ├── 148. Sort List_test.go
│ │ └── README.md
│ ├── 0150.Evaluate-Reverse-Polish-Notation/
│ │ ├── 150. Evaluate Reverse Polish Notation.go
│ │ ├── 150. Evaluate Reverse Polish Notation_test.go
│ │ └── README.md
│ ├── 0151.Reverse-Words-in-a-String/
│ │ ├── 151. Reverse Words in a String.go
│ │ ├── 151. Reverse Words in a String_test.go
│ │ └── README.md
│ ├── 0152.Maximum-Product-Subarray/
│ │ ├── 152. Maximum Product Subarray.go
│ │ ├── 152. Maximum Product Subarray_test.go
│ │ └── README.md
│ ├── 0153.Find-Minimum-in-Rotated-Sorted-Array/
│ │ ├── 153. Find Minimum in Rotated Sorted Array.go
│ │ ├── 153. Find Minimum in Rotated Sorted Array_test.go
│ │ └── README.md
│ ├── 0154.Find-Minimum-in-Rotated-Sorted-Array-II/
│ │ ├── 154. Find Minimum in Rotated Sorted Array II.go
│ │ ├── 154. Find Minimum in Rotated Sorted Array II_test.go
│ │ └── README.md
│ ├── 0155.Min-Stack/
│ │ ├── 155. Min Stack.go
│ │ ├── 155. Min Stack_test.go
│ │ └── README.md
│ ├── 0160.Intersection-of-Two-Linked-Lists/
│ │ ├── 160. Intersection of Two Linked Lists.go
│ │ ├── 160. Intersection of Two Linked Lists_test.go
│ │ └── README.md
│ ├── 0162.Find-Peak-Element/
│ │ ├── 162. Find Peak Element.go
│ │ ├── 162. Find Peak Element_test.go
│ │ └── README.md
│ ├── 0164.Maximum-Gap/
│ │ ├── 164. Maximum Gap.go
│ │ ├── 164. Maximum Gap_test.go
│ │ └── README.md
│ ├── 0167.Two-Sum-II-Input-array-is-sorted/
│ │ ├── 167. Two Sum II - Input array is sorted.go
│ │ ├── 167. Two Sum II - Input array is sorted_test.go
│ │ └── README.md
│ ├── 0168.Excel-Sheet-Column-Title/
│ │ ├── 168. Excel Sheet Column Title.go
│ │ ├── 168. Excel Sheet Column Title_test.go
│ │ └── README.md
│ ├── 0169.Majority-Element/
│ │ ├── 169. Majority Element.go
│ │ ├── 169. Majority Element_test.go
│ │ └── README.md
│ ├── 0171.Excel-Sheet-Column-Number/
│ │ ├── 171. Excel Sheet Column Number.go
│ │ ├── 171. Excel Sheet Column Number_test.go
│ │ └── README.md
│ ├── 0172.Factorial-Trailing-Zeroes/
│ │ ├── 172. Factorial Trailing Zeroes.go
│ │ ├── 172. Factorial Trailing Zeroes_test.go
│ │ └── README.md
│ ├── 0173.Binary-Search-Tree-Iterator/
│ │ ├── 173. Binary Search Tree Iterator.go
│ │ ├── 173. Binary Search Tree Iterator_test.go
│ │ └── README.md
│ ├── 0174.Dungeon-Game/
│ │ ├── 174. Dungeon Game.go
│ │ ├── 174. Dungeon Game_test.go
│ │ └── README.md
│ ├── 0179.Largest-Number/
│ │ ├── 179. Largest Number.go
│ │ ├── 179. Largest Number_test.go
│ │ └── README.md
│ ├── 0187.Repeated-DNA-Sequences/
│ │ ├── 187. Repeated DNA Sequences.go
│ │ ├── 187. Repeated DNA Sequences_test.go
│ │ └── README.md
│ ├── 0189.Rotate-Array/
│ │ ├── 189. Rotate Array.go
│ │ ├── 189. Rotate Array_test.go
│ │ └── README.md
│ ├── 0190.Reverse-Bits/
│ │ ├── 190. Reverse Bits.go
│ │ ├── 190. Reverse Bits_test.go
│ │ └── README.md
│ ├── 0191.Number-of-1-Bits/
│ │ ├── 191. Number of 1 Bits.go
│ │ ├── 191. Number of 1 Bits_test.go
│ │ └── README.md
│ ├── 0198.House-Robber/
│ │ ├── 198. House Robber.go
│ │ ├── 198. House Robber_test.go
│ │ └── README.md
│ ├── 0199.Binary-Tree-Right-Side-View/
│ │ ├── 199. Binary Tree Right Side View.go
│ │ ├── 199. Binary Tree Right Side View_test.go
│ │ └── README.md
│ ├── 0200.Number-of-Islands/
│ │ ├── 200. Number of Islands.go
│ │ ├── 200. Number of Islands_test.go
│ │ └── README.md
│ ├── 0201.Bitwise-AND-of-Numbers-Range/
│ │ ├── 201. Bitwise AND of Numbers Range.go
│ │ ├── 201. Bitwise AND of Numbers Range_test.go
│ │ └── README.md
│ ├── 0202.Happy-Number/
│ │ ├── 202. Happy Number.go
│ │ ├── 202. Happy Number_test.go
│ │ └── README.md
│ ├── 0203.Remove-Linked-List-Elements/
│ │ ├── 203. Remove Linked List Elements.go
│ │ ├── 203. Remove Linked List Elements_test.go
│ │ └── README.md
│ ├── 0204.Count-Primes/
│ │ ├── 204. Count Primes.go
│ │ ├── 204. Count Primes_test.go
│ │ └── README.md
│ ├── 0205.Isomorphic-Strings/
│ │ ├── 205. Isomorphic Strings.go
│ │ ├── 205. Isomorphic Strings_test.go
│ │ └── README.md
│ ├── 0206.Reverse-Linked-List/
│ │ ├── 206. Reverse Linked List.go
│ │ ├── 206. Reverse Linked List_test.go
│ │ └── README.md
│ ├── 0207.Course-Schedule/
│ │ ├── 207. Course Schedule.go
│ │ ├── 207. Course Schedule_test.go
│ │ └── README.md
│ ├── 0208.Implement-Trie-Prefix-Tree/
│ │ ├── 208. Implement Trie (Prefix Tree).go
│ │ ├── 208. Implement Trie (Prefix Tree)_test.go
│ │ └── README.md
│ ├── 0209.Minimum-Size-Subarray-Sum/
│ │ ├── 209. Minimum Size Subarray Sum.go
│ │ ├── 209. Minimum Size Subarray Sum_test.go
│ │ └── README.md
│ ├── 0210.Course-Schedule-II/
│ │ ├── 210. Course Schedule II.go
│ │ ├── 210. Course Schedule II_test.go
│ │ └── README.md
│ ├── 0211.Design-Add-and-Search-Words-Data-Structure/
│ │ ├── 211. Design Add and Search Words Data Structure.go
│ │ ├── 211. Design Add and Search Words Data Structure_test.go
│ │ └── README.md
│ ├── 0212.Word-Search-II/
│ │ ├── 212. Word Search II.go
│ │ ├── 212. Word Search II_test.go
│ │ └── README.md
│ ├── 0213.House-Robber-II/
│ │ ├── 213. House Robber II.go
│ │ ├── 213. House Robber II_test.go
│ │ └── README.md
│ ├── 0215.Kth-Largest-Element-in-an-Array/
│ │ ├── 215. Kth Largest Element in an Array.go
│ │ ├── 215. Kth Largest Element in an Array_test.go
│ │ └── README.md
│ ├── 0216.Combination-Sum-III/
│ │ ├── 216. Combination Sum III.go
│ │ ├── 216. Combination Sum III_test.go
│ │ └── README.md
│ ├── 0217.Contains-Duplicate/
│ │ ├── 217. Contains Duplicate.go
│ │ ├── 217. Contains Duplicate_test.go
│ │ └── README.md
│ ├── 0218.The-Skyline-Problem/
│ │ ├── 218. The Skyline Problem.go
│ │ ├── 218. The Skyline Problem_test.go
│ │ └── README.md
│ ├── 0219.Contains-Duplicate-II/
│ │ ├── 219. Contains Duplicate II.go
│ │ ├── 219. Contains Duplicate II_test.go
│ │ └── README.md
│ ├── 0220.Contains-Duplicate-III/
│ │ ├── 220. Contains Duplicate III.go
│ │ ├── 220. Contains Duplicate III_test.go
│ │ └── README.md
│ ├── 0222.Count-Complete-Tree-Nodes/
│ │ ├── 222. Count Complete Tree Nodes.go
│ │ ├── 222. Count Complete Tree Nodes_test.go
│ │ └── README.md
│ ├── 0223.Rectangle-Area/
│ │ ├── 223. Rectangle Area.go
│ │ ├── 223. Rectangle Area_test.go
│ │ └── README.md
│ ├── 0224.Basic-Calculator/
│ │ ├── 224. Basic Calculator.go
│ │ ├── 224. Basic Calculator_test.go
│ │ └── README.md
│ ├── 0225.Implement-Stack-using-Queues/
│ │ ├── 225. Implement Stack using Queues.go
│ │ ├── 225. Implement Stack using Queues_test.go
│ │ └── README.md
│ ├── 0226.Invert-Binary-Tree/
│ │ ├── 226. Invert Binary Tree.go
│ │ ├── 226. Invert Binary Tree_test.go
│ │ └── README.md
│ ├── 0227.Basic-Calculator-II/
│ │ ├── 227. Basic Calculator II.go
│ │ ├── 227. Basic Calculator II_test.go
│ │ └── README.md
│ ├── 0228.Summary-Ranges/
│ │ ├── 228. Summary Ranges.go
│ │ ├── 228. Summary Ranges_test.go
│ │ └── README.md
│ ├── 0229.Majority-Element-II/
│ │ ├── 229. Majority Element II.go
│ │ ├── 229. Majority Element II_test.go
│ │ └── README.md
│ ├── 0230.Kth-Smallest-Element-in-a-BST/
│ │ ├── 230. Kth Smallest Element in a BST.go
│ │ ├── 230. Kth Smallest Element in a BST_test.go
│ │ └── README.md
│ ├── 0231.Power-of-Two/
│ │ ├── 231. Power of Two.go
│ │ ├── 231. Power of Two_test.go
│ │ └── README.md
│ ├── 0232.Implement-Queue-using-Stacks/
│ │ ├── 232. Implement Queue using Stacks.go
│ │ ├── 232. Implement Queue using Stacks_test.go
│ │ └── README.md
│ ├── 0234.Palindrome-Linked-List/
│ │ ├── 234. Palindrome Linked List.go
│ │ ├── 234. Palindrome Linked List_test.go
│ │ └── README.md
│ ├── 0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/
│ │ ├── 235. Lowest Common Ancestor of a Binary Search Tree.go
│ │ ├── 235. Lowest Common Ancestor of a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0236.Lowest-Common-Ancestor-of-a-Binary-Tree/
│ │ ├── 236. Lowest Common Ancestor of a Binary Tree.go
│ │ ├── 236. Lowest Common Ancestor of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0237.Delete-Node-in-a-Linked-List/
│ │ ├── 237. Delete Node in a Linked List.go
│ │ ├── 237. Delete Node in a Linked List_test.go
│ │ └── README.md
│ ├── 0239.Sliding-Window-Maximum/
│ │ ├── 239. Sliding Window Maximum.go
│ │ ├── 239. Sliding Window Maximum_test.go
│ │ └── README.md
│ ├── 0240.Search-a-2D-Matrix-II/
│ │ ├── 240. Search a 2D Matrix II.go
│ │ ├── 240. Search a 2D Matrix II_test.go
│ │ └── README.md
│ ├── 0242.Valid-Anagram/
│ │ ├── 242. Valid Anagram.go
│ │ ├── 242. Valid Anagram_test.go
│ │ └── README.md
│ ├── 0257.Binary-Tree-Paths/
│ │ ├── 257. Binary Tree Paths.go
│ │ ├── 257. Binary Tree Paths_test.go
│ │ └── README.md
│ ├── 0258.Add-Digits/
│ │ ├── 258. Add Digits.go
│ │ ├── 258. Add Digits_test.go
│ │ └── README.md
│ ├── 0260.Single-Number-III/
│ │ ├── 260. Single Number III.go
│ │ ├── 260. Single Number III_test.go
│ │ └── README.md
│ ├── 0263.Ugly-Number/
│ │ ├── 263. Ugly Number.go
│ │ ├── 263. Ugly Number_test.go
│ │ └── README.md
│ ├── 0264.Ugly-Number-II/
│ │ ├── 264. Ugly Number II.go
│ │ ├── 264. Ugly Number II_test.go
│ │ └── README.md
│ ├── 0268.Missing-Number/
│ │ ├── 268. Missing Number.go
│ │ ├── 268. Missing Number_test.go
│ │ └── README.md
│ ├── 0274.H-Index/
│ │ ├── 274. H-Index.go
│ │ ├── 274. H-Index_test.go
│ │ └── README.md
│ ├── 0275.H-Index-II/
│ │ ├── 275. H-Index II.go
│ │ ├── 275. H-Index II_test.go
│ │ └── README.md
│ ├── 0278.First-Bad-Version/
│ │ ├── 278. First Bad Version.go
│ │ ├── 278. First Bad Version_test.go
│ │ └── README.md
│ ├── 0279.Perfect-Squares/
│ │ ├── 279. Perfect Squares.go
│ │ ├── 279. Perfect Squares_test.go
│ │ └── README.md
│ ├── 0283.Move-Zeroes/
│ │ ├── 283. Move Zeroes.go
│ │ ├── 283. Move Zeroes_test.go
│ │ └── README.md
│ ├── 0284.Peeking-Iterator/
│ │ ├── 284. Peeking Iterator.go
│ │ ├── 284. Peeking Iterator_test.go
│ │ └── README.md
│ ├── 0287.Find-the-Duplicate-Number/
│ │ ├── 287. Find the Duplicate Number.go
│ │ ├── 287. Find the Duplicate Number_test.go
│ │ └── README.md
│ ├── 0290.Word-Pattern/
│ │ ├── 290. Word Pattern.go
│ │ ├── 290. Word Pattern_test.go
│ │ └── README.md
│ ├── 0297.Serialize-and-Deserialize-Binary-Tree/
│ │ ├── 297.Serialize and Deserialize Binary Tree.go
│ │ ├── 297.Serialize and Deserialize Binary Tree_test.go
│ │ └── README.md
│ ├── 0299.Bulls-and-Cows/
│ │ ├── 299.Bulls and Cows.go
│ │ ├── 299.Bulls and Cows_test.go
│ │ └── README.md
│ ├── 0300.Longest-Increasing-Subsequence/
│ │ ├── 300. Longest Increasing Subsequence.go
│ │ ├── 300. Longest Increasing Subsequence_test.go
│ │ └── README.md
│ ├── 0301.Remove-Invalid-Parentheses/
│ │ ├── 301.Remove Invalid Parentheses.go
│ │ ├── 301.Remove Invalid Parentheses_test.go
│ │ └── README.md
│ ├── 0303.Range-Sum-Query-Immutable/
│ │ ├── 303. Range Sum Query - Immutable.go
│ │ ├── 303. Range Sum Query - Immutable_test.go
│ │ └── README.md
│ ├── 0304.Range-Sum-Query-2D-Immutable/
│ │ ├── 304. Range Sum Query 2D - Immutable.go
│ │ ├── 304. Range Sum Query 2D - Immutable_test.go
│ │ └── README.md
│ ├── 0306.Additive-Number/
│ │ ├── 306. Additive Number.go
│ │ ├── 306. Additive Number_test.go
│ │ └── README.md
│ ├── 0307.Range-Sum-Query-Mutable/
│ │ ├── 307. Range Sum Query - Mutable.go
│ │ ├── 307. Range Sum Query - Mutable_test.go
│ │ └── README.md
│ ├── 0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/
│ │ ├── 309. Best Time to Buy and Sell Stock with Cooldown.go
│ │ ├── 309. Best Time to Buy and Sell Stock with Cooldown_test.go
│ │ └── README.md
│ ├── 0315.Count-of-Smaller-Numbers-After-Self/
│ │ ├── 315. Count of Smaller Numbers After Self.go
│ │ ├── 315. Count of Smaller Numbers After Self_test.go
│ │ └── README.md
│ ├── 0318.Maximum-Product-of-Word-Lengths/
│ │ ├── 318. Maximum Product of Word Lengths.go
│ │ ├── 318. Maximum Product of Word Lengths_test.go
│ │ └── README.md
│ ├── 0319.Bulb-Switcher/
│ │ ├── 319.Bulb Switcher.go
│ │ ├── 319.Bulb Switcher_test.go
│ │ └── README.md
│ ├── 0322.Coin-Change/
│ │ ├── 322. Coin Change.go
│ │ ├── 322. Coin Change_test.go
│ │ └── README.md
│ ├── 0324.Wiggle-Sort-II/
│ │ ├── 324. Wiggle Sort II.go
│ │ ├── 324. Wiggle Sort II_test.go
│ │ └── README.md
│ ├── 0326.Power-of-Three/
│ │ ├── 326. Power of Three.go
│ │ ├── 326. Power of Three_test.go
│ │ └── README.md
│ ├── 0327.Count-of-Range-Sum/
│ │ ├── 327. Count of Range Sum.go
│ │ ├── 327. Count of Range Sum_test.go
│ │ └── README.md
│ ├── 0328.Odd-Even-Linked-List/
│ │ ├── 328. Odd Even Linked List.go
│ │ ├── 328. Odd Even Linked List_test.go
│ │ └── README.md
│ ├── 0329.Longest-Increasing-Path-in-a-Matrix/
│ │ ├── 329. Longest Increasing Path in a Matrix.go
│ │ ├── 329. Longest Increasing Path in a Matrix_test.go
│ │ └── README.md
│ ├── 0331.Verify-Preorder-Serialization-of-a-Binary-Tree/
│ │ ├── 331. Verify Preorder Serialization of a Binary Tree.go
│ │ ├── 331. Verify Preorder Serialization of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0337.House-Robber-III/
│ │ ├── 337. House Robber III.go
│ │ ├── 337. House Robber III_test.go
│ │ └── README.md
│ ├── 0338.Counting-Bits/
│ │ ├── 338. Counting Bits.go
│ │ ├── 338. Counting Bits_test.go
│ │ └── README.md
│ ├── 0341.Flatten-Nested-List-Iterator/
│ │ ├── 341. Flatten Nested List Iterator.go
│ │ ├── 341. Flatten Nested List Iterator_test.go
│ │ └── README.md
│ ├── 0342.Power-of-Four/
│ │ ├── 342. Power of Four.go
│ │ ├── 342. Power of Four_test.go
│ │ └── README.md
│ ├── 0343.Integer-Break/
│ │ ├── 343. Integer Break.go
│ │ ├── 343. Integer Break_test.go
│ │ └── README.md
│ ├── 0344.Reverse-String/
│ │ ├── 344. Reverse String.go
│ │ ├── 344. Reverse String_test.go
│ │ └── README.md
│ ├── 0345.Reverse-Vowels-of-a-String/
│ │ ├── 345. Reverse Vowels of a String.go
│ │ ├── 345. Reverse Vowels of a String_test.go
│ │ └── README.md
│ ├── 0347.Top-K-Frequent-Elements/
│ │ ├── 347. Top K Frequent Elements.go
│ │ ├── 347. Top K Frequent Elements_test.go
│ │ └── README.md
│ ├── 0349.Intersection-of-Two-Arrays/
│ │ ├── 349. Intersection of Two Arrays.go
│ │ ├── 349. Intersection of Two Arrays_test.go
│ │ └── README.md
│ ├── 0350.Intersection-of-Two-Arrays-II/
│ │ ├── 350. Intersection of Two Arrays II.go
│ │ ├── 350. Intersection of Two Arrays II_test.go
│ │ └── README.md
│ ├── 0352.Data-Stream-as-Disjoint-Intervals/
│ │ ├── 352.Data Stream as Disjoint Intervals.go
│ │ ├── 352.Data Stream as Disjoint Intervals_test.go
│ │ └── README.md
│ ├── 0354.Russian-Doll-Envelopes/
│ │ ├── 354. Russian Doll Envelopes.go
│ │ ├── 354. Russian Doll Envelopes_test.go
│ │ └── README.md
│ ├── 0357.Count-Numbers-with-Unique-Digits/
│ │ ├── 357. Count Numbers with Unique Digits.go
│ │ ├── 357. Count Numbers with Unique Digits_test.go
│ │ └── README.md
│ ├── 0367.Valid-Perfect-Square/
│ │ ├── 367. Valid Perfect Square.go
│ │ ├── 367. Valid Perfect Square_test.go
│ │ └── README.md
│ ├── 0368.Largest-Divisible-Subset/
│ │ ├── 368. Largest Divisible Subset.go
│ │ ├── 368. Largest Divisible Subset_test.go
│ │ └── README.md
│ ├── 0371.Sum-of-Two-Integers/
│ │ ├── 371. Sum of Two Integers.go
│ │ ├── 371. Sum of Two Integers_test.go
│ │ └── README.md
│ ├── 0372.Super-Pow/
│ │ ├── 372. Super Pow.go
│ │ ├── 372. Super Pow_test.go
│ │ └── README.md
│ ├── 0373.Find-K-Pairs-with-Smallest-Sums/
│ │ ├── 373. Find K Pairs with Smallest Sums.go
│ │ ├── 373. Find K Pairs with Smallest Sums_test.go
│ │ └── README.md
│ ├── 0374.Guess-Number-Higher-or-Lower/
│ │ ├── 374. Guess Number Higher or Lower.go
│ │ ├── 374. Guess Number Higher or Lower_test.go
│ │ └── README.md
│ ├── 0376.Wiggle-Subsequence/
│ │ ├── 376. Wiggle Subsequence.go
│ │ ├── 376. Wiggle Subsequence_test.go
│ │ └── README.md
│ ├── 0377.Combination-Sum-IV/
│ │ ├── 377. Combination Sum IV.go
│ │ ├── 377. Combination Sum IV_test.go
│ │ └── README.md
│ ├── 0378.Kth-Smallest-Element-in-a-Sorted-Matrix/
│ │ ├── 378. Kth Smallest Element in a Sorted Matrix.go
│ │ ├── 378. Kth Smallest Element in a Sorted Matrix_test.go
│ │ └── README.md
│ ├── 0382.Linked-List-Random-Node/
│ │ ├── 382. Linked List Random Node.go
│ │ ├── 382. Linked List Random Node_test.go
│ │ └── README.md
│ ├── 0383.Ransom-Note/
│ │ ├── 383.Ransom Note.go
│ │ ├── 383.Ransom Note_test.go
│ │ └── README.md
│ ├── 0384.Shuffle-an-Array/
│ │ ├── 384.Shuffle an Array.go
│ │ ├── 384.Shuffle an Array_test.go
│ │ └── README.md
│ ├── 0385.Mini-Parser/
│ │ ├── 385. Mini Parser.go
│ │ ├── 385. Mini Parser_test.go
│ │ └── README.md
│ ├── 0386.Lexicographical-Numbers/
│ │ ├── 386. Lexicographical Numbers.go
│ │ ├── 386. Lexicographical Numbers_test.go
│ │ └── README.md
│ ├── 0387.First-Unique-Character-in-a-String/
│ │ ├── 387. First Unique Character in a String.go
│ │ ├── 387. First Unique Character in a String_test.go
│ │ └── README.md
│ ├── 0389.Find-the-Difference/
│ │ ├── 389. Find the Difference.go
│ │ ├── 389. Find the Difference_test.go
│ │ └── README.md
│ ├── 0390.Elimination-Game/
│ │ ├── 390. Elimination Game.go
│ │ ├── 390. Elimination Game_test.go
│ │ └── README.md
│ ├── 0391.Perfect-Rectangle/
│ │ ├── 391.Perfect Rectangle.go
│ │ ├── 391.Perfect Rectangle_test.go
│ │ └── README.md
│ ├── 0392.Is-Subsequence/
│ │ ├── 392. Is Subsequence.go
│ │ ├── 392. Is Subsequence_test.go
│ │ └── README.md
│ ├── 0393.UTF-8-Validation/
│ │ ├── 393. UTF-8 Validation.go
│ │ ├── 393. UTF-8 Validation_test.go
│ │ └── README.md
│ ├── 0394.Decode-String/
│ │ ├── 394. Decode String.go
│ │ ├── 394. Decode String_test.go
│ │ └── README.md
│ ├── 0395.Longest-Substring-with-At-Least-K-Repeating-Characters/
│ │ ├── 395. Longest Substring with At Least K Repeating Characters.go
│ │ ├── 395. Longest Substring with At Least K Repeating Characters_test.go
│ │ └── README.md
│ ├── 0396.Rotate-Function/
│ │ ├── 396. Rotate Function.go
│ │ ├── 396. Rotate Function_test.go
│ │ └── README.md
│ ├── 0397.Integer-Replacement/
│ │ ├── 397. Integer Replacement.go
│ │ ├── 397. Integer Replacement_test.go
│ │ └── README.md
│ ├── 0399.Evaluate-Division/
│ │ ├── 399. Evaluate Division.go
│ │ ├── 399. Evaluate Division_test.go
│ │ └── README.md
│ ├── 0400.Nth-Digit/
│ │ ├── 400.Nth Digit.go
│ │ ├── 400.Nth Digit_test.go
│ │ └── README.md
│ ├── 0401.Binary-Watch/
│ │ ├── 401. Binary Watch.go
│ │ ├── 401. Binary Watch_test.go
│ │ └── README.md
│ ├── 0402.Remove-K-Digits/
│ │ ├── 402. Remove K Digits.go
│ │ ├── 402. Remove K Digits_test.go
│ │ └── README.md
│ ├── 0404.Sum-of-Left-Leaves/
│ │ ├── 404. Sum of Left Leaves.go
│ │ ├── 404. Sum of Left Leaves_test.go
│ │ └── README.md
│ ├── 0405.Convert-a-Number-to-Hexadecimal/
│ │ ├── 405. Convert a Number to Hexadecimal.go
│ │ ├── 405. Convert a Number to Hexadecimal_test.go
│ │ └── README.md
│ ├── 0409.Longest-Palindrome/
│ │ ├── 409. Longest Palindrome.go
│ │ ├── 409. Longest Palindrome_test.go
│ │ └── README.md
│ ├── 0410.Split-Array-Largest-Sum/
│ │ ├── 410. Split Array Largest Sum.go
│ │ ├── 410. Split Array Largest Sum_test.go
│ │ └── README.md
│ ├── 0412.Fizz-Buzz/
│ │ ├── 412. Fizz Buzz.go
│ │ ├── 412. Fizz Buzz_test.go
│ │ └── README.md
│ ├── 0413.Arithmetic-Slices/
│ │ ├── 413. Arithmetic Slices.go
│ │ ├── 413. Arithmetic Slices_test.go
│ │ └── README.md
│ ├── 0414.Third-Maximum-Number/
│ │ ├── 414. Third Maximum Number.go
│ │ ├── 414. Third Maximum Number_test.go
│ │ └── README.md
│ ├── 0416.Partition-Equal-Subset-Sum/
│ │ ├── 416. Partition Equal Subset Sum.go
│ │ ├── 416. Partition Equal Subset Sum_test.go
│ │ └── README.md
│ ├── 0417.Pacific-Atlantic-Water-Flow/
│ │ ├── 417. Pacific Atlantic Water Flow.go
│ │ ├── 417. Pacific Atlantic Water Flow_test.go
│ │ └── README.md
│ ├── 0419.Battleships-in-a-Board/
│ │ ├── 419. Battleships in a Board.go
│ │ ├── 419. Battleships in a Board_test.go
│ │ └── README.md
│ ├── 0421.Maximum-XOR-of-Two-Numbers-in-an-Array/
│ │ ├── 421. Maximum XOR of Two Numbers in an Array.go
│ │ ├── 421. Maximum XOR of Two Numbers in an Array_test.go
│ │ └── README.md
│ ├── 0423.Reconstruct-Original-Digits-from-English/
│ │ ├── 423. Reconstruct Original Digits from English.go
│ │ ├── 423. Reconstruct Original Digits from English_test.go
│ │ └── README.md
│ ├── 0424.Longest-Repeating-Character-Replacement/
│ │ ├── 424. Longest Repeating Character Replacement.go
│ │ ├── 424. Longest Repeating Character Replacement_test.go
│ │ └── README.md
│ ├── 0429.N-ary-Tree-Level-Order-Traversal/
│ │ ├── 429. N-ary Tree Level Order Traversal.go
│ │ ├── 429. N-ary Tree Level Order Traversal_test.go
│ │ └── README.md
│ ├── 0433.Minimum-Genetic-Mutation/
│ │ ├── 433. Minimum Genetic Mutation.go
│ │ ├── 433. Minimum Genetic Mutation_test.go
│ │ └── README.md
│ ├── 0434.Number-of-Segments-in-a-String/
│ │ ├── 434.Number of Segments in a String.go
│ │ ├── 434.Number of Segments in a String_test.go
│ │ └── README.md
│ ├── 0435.Non-overlapping-Intervals/
│ │ ├── 435. Non-overlapping Intervals.go
│ │ ├── 435. Non-overlapping Intervals_test.go
│ │ └── README.md
│ ├── 0436.Find-Right-Interval/
│ │ ├── 436. Find Right Interval.go
│ │ ├── 436. Find Right Interval_test.go
│ │ └── README.md
│ ├── 0437.Path-Sum-III/
│ │ ├── 437. Path Sum III.go
│ │ ├── 437. Path Sum III_test.go
│ │ └── README.md
│ ├── 0438.Find-All-Anagrams-in-a-String/
│ │ ├── 438. Find All Anagrams in a String.go
│ │ ├── 438. Find All Anagrams in a String_test.go
│ │ └── README.md
│ ├── 0441.Arranging-Coins/
│ │ ├── 441. Arranging Coins.go
│ │ ├── 441. Arranging Coins_test.go
│ │ └── README.md
│ ├── 0445.Add-Two-Numbers-II/
│ │ ├── 445. Add Two Numbers II.go
│ │ ├── 445. Add Two Numbers II_test.go
│ │ └── README.md
│ ├── 0447.Number-of-Boomerangs/
│ │ ├── 447. Number of Boomerangs.go
│ │ ├── 447. Number of Boomerangs_test.go
│ │ └── README.md
│ ├── 0448.Find-All-Numbers-Disappeared-in-an-Array/
│ │ ├── 448. Find All Numbers Disappeared in an Array.go
│ │ ├── 448. Find All Numbers Disappeared in an Array_test.go
│ │ └── README.md
│ ├── 0451.Sort-Characters-By-Frequency/
│ │ ├── 451. Sort Characters By Frequency.go
│ │ ├── 451. Sort Characters By Frequency_test.go
│ │ └── README.md
│ ├── 0453.Minimum-Moves-to-Equal-Array-Elements/
│ │ ├── 453. Minimum Moves to Equal Array Elements.go
│ │ ├── 453. Minimum Moves to Equal Array Elements_test.go
│ │ └── README.md
│ ├── 0454.4Sum-II/
│ │ ├── 454. 4Sum II.go
│ │ ├── 454. 4Sum II_test.go
│ │ └── README.md
│ ├── 0455.Assign-Cookies/
│ │ ├── 455. Assign Cookies.go
│ │ ├── 455. Assign Cookies_test.go
│ │ └── README.md
│ ├── 0456.132-Pattern/
│ │ ├── 456. 132 Pattern.go
│ │ ├── 456. 132 Pattern_test.go
│ │ └── README.md
│ ├── 0457.Circular-Array-Loop/
│ │ ├── 457. Circular Array Loop.go
│ │ ├── 457. Circular Array Loop_test.go
│ │ └── README.md
│ ├── 0458.Poor-Pigs/
│ │ ├── 458.Poor Pigs.go
│ │ ├── 458.Poor Pigs_test.go
│ │ └── README.md
│ ├── 0460.LFU-Cache/
│ │ ├── 460. LFU Cache.go
│ │ ├── 460. LFU Cache_test.go
│ │ └── README.md
│ ├── 0461.Hamming-Distance/
│ │ ├── 461. Hamming Distance.go
│ │ ├── 461. Hamming Distance_test.go
│ │ └── README.md
│ ├── 0462.Minimum-Moves-to-Equal-Array-Elements-II/
│ │ ├── 462. Minimum Moves to Equal Array Elements II.go
│ │ ├── 462. Minimum Moves to Equal Array Elements II_test.go
│ │ └── README.md
│ ├── 0463.Island-Perimeter/
│ │ ├── 463. Island Perimeter.go
│ │ ├── 463. Island Perimeter_test.go
│ │ └── README.md
│ ├── 0470.Implement-Rand10-Using-Rand7/
│ │ ├── 470. Implement Rand10() Using Rand7().go
│ │ ├── 470. Implement Rand10() Using Rand7()_test.go
│ │ └── README.md
│ ├── 0473.Matchsticks-to-Square/
│ │ ├── 473. Matchsticks to Square.go
│ │ ├── 473. Matchsticks to Square_test.go
│ │ └── README.md
│ ├── 0474.Ones-and-Zeroes/
│ │ ├── 474. Ones and Zeroes.go
│ │ ├── 474. Ones and Zeroes_test.go
│ │ └── README.md
│ ├── 0475.Heaters/
│ │ ├── 475. Heaters.go
│ │ ├── 475. Heaters_test.go
│ │ └── README.md
│ ├── 0476.Number-Complement/
│ │ ├── 476. Number Complement.go
│ │ ├── 476. Number Complement_test.go
│ │ └── README.md
│ ├── 0477.Total-Hamming-Distance/
│ │ ├── 477. Total Hamming Distance.go
│ │ ├── 477. Total Hamming Distance_test.go
│ │ └── README.md
│ ├── 0478.Generate-Random-Point-in-a-Circle/
│ │ ├── 478. Generate Random Point in a Circle.go
│ │ ├── 478. Generate Random Point in a Circle_test.go
│ │ └── README.md
│ ├── 0480.Sliding-Window-Median/
│ │ ├── 480. Sliding Window Median.go
│ │ ├── 480. Sliding Window Median_test.go
│ │ └── README.md
│ ├── 0483.Smallest-Good-Base/
│ │ ├── 483. Smallest Good Base.go
│ │ ├── 483. Smallest Good Base_test.go
│ │ └── README.md
│ ├── 0485.Max-Consecutive-Ones/
│ │ ├── 485. Max Consecutive Ones.go
│ │ ├── 485. Max Consecutive Ones_test.go
│ │ └── README.md
│ ├── 0488.Zuma-Game/
│ │ ├── 488.Zuma Game.go
│ │ ├── 488.Zuma Game_test.go
│ │ └── README.md
│ ├── 0491.Non-decreasing-Subsequences/
│ │ ├── 491. Non-decreasing Subsequences.go
│ │ ├── 491. Non-decreasing Subsequences_test.go
│ │ └── README.md
│ ├── 0492.Construct-the-Rectangle/
│ │ ├── 492.Construct the Rectangle.go
│ │ ├── 492.Construct the Rectangle_test.go
│ │ └── README.md
│ ├── 0493.Reverse-Pairs/
│ │ ├── 493. Reverse Pairs.go
│ │ ├── 493. Reverse Pairs_test.go
│ │ └── README.md
│ ├── 0494.Target-Sum/
│ │ ├── 494. Target Sum.go
│ │ ├── 494. Target Sum_test.go
│ │ └── README.md
│ ├── 0495.Teemo-Attacking/
│ │ ├── 495.Teemo Attacking.go
│ │ ├── 495.Teemo Attacking_test.go
│ │ └── README.md
│ ├── 0496.Next-Greater-Element-I/
│ │ ├── 496. Next Greater Element I.go
│ │ ├── 496. Next Greater Element I_test.go
│ │ └── README.md
│ ├── 0497.Random-Point-in-Non-overlapping-Rectangles/
│ │ ├── 497. Random Point in Non-overlapping Rectangles.go
│ │ ├── 497. Random Point in Non-overlapping Rectangles_test.go
│ │ └── README.md
│ ├── 0498.Diagonal-Traverse/
│ │ ├── 498. Diagonal Traverse.go
│ │ ├── 498. Diagonal Traverse_test.go
│ │ └── README.md
│ ├── 0500.Keyboard-Row/
│ │ ├── 500. Keyboard Row.go
│ │ ├── 500. Keyboard Row_test.go
│ │ └── README.md
│ ├── 0503.Next-Greater-Element-II/
│ │ ├── 503. Next Greater Element II.go
│ │ ├── 503. Next Greater Element II_test.go
│ │ └── README.md
│ ├── 0504.Base-7/
│ │ ├── 504.Base 7.go
│ │ ├── 504.Base 7_test.go
│ │ └── README.md
│ ├── 0506.Relative-Ranks/
│ │ ├── 506.Relative Ranks.go
│ │ ├── 506.Relative Ranks_test.go
│ │ └── README.md
│ ├── 0507.Perfect-Number/
│ │ ├── 507. Perfect Number.go
│ │ ├── 507. Perfect Number_test.go
│ │ └── README.md
│ ├── 0508.Most-Frequent-Subtree-Sum/
│ │ ├── 508. Most Frequent Subtree Sum.go
│ │ ├── 508. Most Frequent Subtree Sum_test.go
│ │ └── README.md
│ ├── 0509.Fibonacci-Number/
│ │ ├── 509. Fibonacci Number.go
│ │ ├── 509. Fibonacci Number_test.go
│ │ └── README.md
│ ├── 0513.Find-Bottom-Left-Tree-Value/
│ │ ├── 513. Find Bottom Left Tree Value.go
│ │ ├── 513. Find Bottom Left Tree Value_test.go
│ │ └── README.md
│ ├── 0515.Find-Largest-Value-in-Each-Tree-Row/
│ │ ├── 515. Find Largest Value in Each Tree Row.go
│ │ ├── 515. Find Largest Value in Each Tree Row_test.go
│ │ └── README.md
│ ├── 0518.Coin-Change-II/
│ │ ├── 518. Coin Change II.go
│ │ ├── 518. Coin Change II_test.go
│ │ └── README.md
│ ├── 0519.Random-Flip-Matrix/
│ │ ├── 519.Random Flip Matrix.go
│ │ ├── 519.Random Flip Matrix_test.go
│ │ └── README.md
│ ├── 0520.Detect-Capital/
│ │ ├── 520.Detect Capital.go
│ │ ├── 520.Detect Capital_test.go
│ │ └── README.md
│ ├── 0523.Continuous-Subarray-Sum/
│ │ ├── 523. Continuous Subarray Sum.go
│ │ ├── 523. Continuous Subarray Sum_test.go
│ │ └── README.md
│ ├── 0524.Longest-Word-in-Dictionary-through-Deleting/
│ │ ├── 524. Longest Word in Dictionary through Deleting.go
│ │ ├── 524. Longest Word in Dictionary through Deleting_test.go
│ │ └── README.md
│ ├── 0525.Contiguous-Array/
│ │ ├── 525. Contiguous Array.go
│ │ ├── 525. Contiguous Array_test.go
│ │ └── README.md
│ ├── 0526.Beautiful-Arrangement/
│ │ ├── 526. Beautiful Arrangement.go
│ │ ├── 526. Beautiful Arrangement_test.go
│ │ └── README.md
│ ├── 0528.Random-Pick-with-Weight/
│ │ ├── 528. Random Pick with Weight.go
│ │ ├── 528. Random Pick with Weight_test.go
│ │ └── README.md
│ ├── 0529.Minesweeper/
│ │ ├── 529. Minesweeper.go
│ │ ├── 529. Minesweeper_test.go
│ │ └── README.md
│ ├── 0530.Minimum-Absolute-Difference-in-BST/
│ │ ├── 530. Minimum Absolute Difference in BST.go
│ │ ├── 530. Minimum Absolute Difference in BST_test.go
│ │ └── README.md
│ ├── 0532.K-diff-Pairs-in-an-Array/
│ │ ├── 532. K-diff Pairs in an Array.go
│ │ ├── 532. K-diff Pairs in an Array_test.go
│ │ └── README.md
│ ├── 0535.Encode-and-Decode-TinyURL/
│ │ ├── 535. Encode and Decode TinyURL.go
│ │ ├── 535. Encode and Decode TinyURL_test.go
│ │ └── README.md
│ ├── 0537.Complex-Number-Multiplication/
│ │ ├── 537. Complex Number Multiplication.go
│ │ ├── 537. Complex Number Multiplication_test.go
│ │ └── README.md
│ ├── 0538.Convert-BST-to-Greater-Tree/
│ │ ├── 538. Convert BST to Greater Tree.go
│ │ ├── 538. Convert BST to Greater Tree_test.go
│ │ └── README.md
│ ├── 0540.Single-Element-in-a-Sorted-Array/
│ │ ├── 540.Single Element in a Sorted Array.go
│ │ ├── 540.Single Element in a Sorted Array_test.go
│ │ └── README.md
│ ├── 0541.Reverse-String-II/
│ │ ├── 541. Reverse String II.go
│ │ ├── 541. Reverse String II_test.go
│ │ └── README.md
│ ├── 0542.01-Matrix/
│ │ ├── 542. 01 Matrix.go
│ │ ├── 542. 01 Matrix_test.go
│ │ └── README.md
│ ├── 0543.Diameter-of-Binary-Tree/
│ │ ├── 543. Diameter of Binary Tree.go
│ │ ├── 543. Diameter of Binary Tree_test.go
│ │ └── README.md
│ ├── 0547.Number-of-Provinces/
│ │ ├── 547. Number of Provinces.go
│ │ ├── 547. Number of Provinces_test.go
│ │ └── README.md
│ ├── 0551.Student-Attendance-Record-I/
│ │ ├── 551.Student Attendance Record I.go
│ │ ├── 551.Student Attendance Record I_test.go
│ │ └── README.md
│ ├── 0554.Brick-Wall/
│ │ ├── 554. Brick Wall.go
│ │ ├── 554. Brick Wall_test.go
│ │ └── README.md
│ ├── 0557.Reverse-Words-in-a-String-III/
│ │ ├── 557. Reverse Words in a String III.go
│ │ ├── 557. Reverse Words in a String III_test.go
│ │ └── README.md
│ ├── 0559.Maximum-Depth-of-N-ary-Tree/
│ │ ├── 559.Maximum Depth of N-ary Tree.go
│ │ ├── 559.Maximum Depth of N-ary Tree_test.go
│ │ └── README.md
│ ├── 0560.Subarray-Sum-Equals-K/
│ │ ├── 560. Subarray Sum Equals K.go
│ │ ├── 560. Subarray Sum Equals K_test.go
│ │ └── README.md
│ ├── 0561.Array-Partition/
│ │ ├── 561. Array Partition.go
│ │ ├── 561. Array Partition_test.go
│ │ └── README.md
│ ├── 0563.Binary-Tree-Tilt/
│ │ ├── 563. Binary Tree Tilt.go
│ │ ├── 563. Binary Tree Tilt_test.go
│ │ └── README.md
│ ├── 0566.Reshape-the-Matrix/
│ │ ├── 566. Reshape the Matrix.go
│ │ ├── 566. Reshape the Matrix_test.go
│ │ └── README.md
│ ├── 0567.Permutation-in-String/
│ │ ├── 567. Permutation in String.go
│ │ ├── 567. Permutation in String_test.go
│ │ └── README.md
│ ├── 0572.Subtree-of-Another-Tree/
│ │ ├── 572. Subtree of Another Tree.go
│ │ ├── 572. Subtree of Another Tree_test.go
│ │ └── README.md
│ ├── 0575.Distribute-Candies/
│ │ ├── 575. Distribute Candies.go
│ │ ├── 575. Distribute Candies_test.go
│ │ └── README.md
│ ├── 0576.Out-of-Boundary-Paths/
│ │ ├── 576. Out of Boundary Paths.go
│ │ ├── 576. Out of Boundary Paths_test.go
│ │ └── README.md
│ ├── 0581.Shortest-Unsorted-Continuous-Subarray/
│ │ ├── 581. Shortest Unsorted Continuous Subarray.go
│ │ ├── 581. Shortest Unsorted Continuous Subarray_test.go
│ │ └── README.md
│ ├── 0583.Delete-Operation-for-Two-Strings/
│ │ ├── 583. Delete Operation for Two Strings.go
│ │ ├── 583. Delete Operation for Two Strings_test.go
│ │ └── README.md
│ ├── 0589.N-ary-Tree-Preorder-Traversal/
│ │ ├── 589. N-ary Tree Preorder Traversal.go
│ │ ├── 589. N-ary Tree Preorder Traversal_test.go
│ │ └── README.md
│ ├── 0594.Longest-Harmonious-Subsequence/
│ │ ├── 594. Longest Harmonious Subsequence.go
│ │ ├── 594. Longest Harmonious Subsequence_test.go
│ │ └── README.md
│ ├── 0598.Range-Addition-II/
│ │ ├── 598. Range Addition II.go
│ │ ├── 598. Range Addition II_test.go
│ │ └── README.md
│ ├── 0599.Minimum-Index-Sum-of-Two-Lists/
│ │ ├── 599. Minimum Index Sum of Two Lists.go
│ │ ├── 599. Minimum Index Sum of Two Lists_test.go
│ │ └── README.md
│ ├── 0605.Can-Place-Flowers/
│ │ ├── 605. Can Place Flowers.go
│ │ ├── 605. Can Place Flowers_test.go
│ │ └── README.md
│ ├── 0609.Find-Duplicate-File-in-System/
│ │ ├── 609. Find Duplicate File in System.go
│ │ ├── 609. Find Duplicate File in System_test.go
│ │ └── README.md
│ ├── 0611.Valid-Triangle-Number/
│ │ ├── 611. Valid Triangle Number.go
│ │ ├── 611. Valid Triangle Number_test.go
│ │ └── README.md
│ ├── 0617.Merge-Two-Binary-Trees/
│ │ ├── 617. Merge Two Binary Trees.go
│ │ ├── 617. Merge Two Binary Trees_test.go
│ │ └── README.md
│ ├── 0622.Design-Circular-Queue/
│ │ ├── 622. Design Circular Queue.go
│ │ ├── 622. Design Circular Queue_test.go
│ │ └── README.md
│ ├── 0623.Add-One-Row-to-Tree/
│ │ ├── 623. Add One Row to Tree.go
│ │ ├── 623. Add One Row to Tree_test.go
│ │ └── README.md
│ ├── 0628.Maximum-Product-of-Three-Numbers/
│ │ ├── 628. Maximum Product of Three Numbers.go
│ │ ├── 628. Maximum Product of Three Numbers_test.go
│ │ └── README.md
│ ├── 0630.Course-Schedule-III/
│ │ ├── 630. Course Schedule III.go
│ │ ├── 630. Course Schedule III_test.go
│ │ └── README.md
│ ├── 0632.Smallest-Range-Covering-Elements-from-K-Lists/
│ │ ├── 632. Smallest Range Covering Elements from K Lists.go
│ │ ├── 632. Smallest Range Covering Elements from K Lists_test.go
│ │ └── README.md
│ ├── 0633.Sum-of-Square-Numbers/
│ │ ├── 633. Sum of Square Numbers.go
│ │ ├── 633. Sum of Square Numbers_test.go
│ │ └── README.md
│ ├── 0636.Exclusive-Time-of-Functions/
│ │ ├── 636. Exclusive Time of Functions.go
│ │ ├── 636. Exclusive Time of Functions_test.go
│ │ └── README.md
│ ├── 0637.Average-of-Levels-in-Binary-Tree/
│ │ ├── 637. Average of Levels in Binary Tree.go
│ │ ├── 637. Average of Levels in Binary Tree_test.go
│ │ └── README.md
│ ├── 0638.Shopping-Offers/
│ │ ├── 638. Shopping Offers.go
│ │ ├── 638. Shopping Offers_test.go
│ │ └── README.md
│ ├── 0643.Maximum-Average-Subarray-I/
│ │ ├── 643. Maximum Average Subarray I.go
│ │ ├── 643. Maximum Average Subarray I_test.go
│ │ └── README.md
│ ├── 0645.Set-Mismatch/
│ │ ├── 645. Set Mismatch.go
│ │ ├── 645. Set Mismatch_test.go
│ │ └── README.md
│ ├── 0647.Palindromic-Substrings/
│ │ ├── 647. Palindromic Substrings.go
│ │ ├── 647. Palindromic Substrings_test.go
│ │ └── README.md
│ ├── 0648.Replace-Words/
│ │ ├── 648. Replace Words.go
│ │ ├── 648. Replace Words_test.go
│ │ └── README.md
│ ├── 0653.Two-Sum-IV-Input-is-a-BST/
│ │ ├── 653. Two Sum IV - Input is a BST.go
│ │ ├── 653. Two Sum IV - Input is a BST_test.go
│ │ └── README.md
│ ├── 0658.Find-K-Closest-Elements/
│ │ ├── 658. Find K Closest Elements.go
│ │ ├── 658. Find K Closest Elements_test.go
│ │ └── README.md
│ ├── 0661.Image-Smoother/
│ │ ├── 661. Image Smoother.go
│ │ ├── 661. Image Smoother_test.go
│ │ └── README.md
│ ├── 0662.Maximum-Width-of-Binary-Tree/
│ │ ├── 662. Maximum Width of Binary Tree.go
│ │ ├── 662. Maximum Width of Binary Tree_test.go
│ │ └── README.md
│ ├── 0665.Non-decreasing-Array/
│ │ ├── 665. Non-decreasing Array.go
│ │ ├── 665. Non-decreasing Array_test.go
│ │ └── README.md
│ ├── 0667.Beautiful-Arrangement-II/
│ │ ├── 667. Beautiful Arrangement II.go
│ │ ├── 667. Beautiful Arrangement II_test.go
│ │ └── README.md
│ ├── 0668.Kth-Smallest-Number-in-Multiplication-Table/
│ │ ├── 668. Kth Smallest Number in Multiplication Table.go
│ │ ├── 668. Kth Smallest Number in Multiplication Table_test.go
│ │ └── README.md
│ ├── 0669.Trim-a-Binary-Search-Tree/
│ │ ├── 669. Trim a Binary Search Tree.go
│ │ ├── 669. Trim a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0674.Longest-Continuous-Increasing-Subsequence/
│ │ ├── 674. Longest Continuous Increasing Subsequence.go
│ │ ├── 674. Longest Continuous Increasing Subsequence_test.go
│ │ └── README.md
│ ├── 0676.Implement-Magic-Dictionary/
│ │ ├── 676. Implement Magic Dictionary.go
│ │ ├── 676. Implement Magic Dictionary_test.go
│ │ └── README.md
│ ├── 0677.Map-Sum-Pairs/
│ │ ├── 677. Map Sum Pairs.go
│ │ ├── 677. Map Sum Pairs_test.go
│ │ └── README.md
│ ├── 0682.Baseball-Game/
│ │ ├── 682. Baseball Game.go
│ │ ├── 682. Baseball Game_test.go
│ │ └── README.md
│ ├── 0684.Redundant-Connection/
│ │ ├── 684. Redundant Connection.go
│ │ ├── 684. Redundant Connection_test.go
│ │ └── README.md
│ ├── 0685.Redundant-Connection-II/
│ │ ├── 685. Redundant Connection II.go
│ │ ├── 685. Redundant Connection II_test.go
│ │ └── README.md
│ ├── 0690.Employee-Importance/
│ │ ├── 690. Employee Importance.go
│ │ ├── 690. Employee Importance_test.go
│ │ └── README.md
│ ├── 0692.Top-K-Frequent-Words/
│ │ ├── 692. Top K Frequent Words.go
│ │ ├── 692. Top K Frequent Words_test.go
│ │ └── README.md
│ ├── 0693.Binary-Number-with-Alternating-Bits/
│ │ ├── 693. Binary Number with Alternating Bits.go
│ │ ├── 693. Binary Number with Alternating Bits_test.go
│ │ └── README.md
│ ├── 0695.Max-Area-of-Island/
│ │ ├── 695. Max Area of Island.go
│ │ ├── 695. Max Area of Island_test.go
│ │ └── README.md
│ ├── 0696.Count-Binary-Substrings/
│ │ ├── 696. Count Binary Substrings.go
│ │ ├── 696. Count Binary Substrings_test.go
│ │ └── README.md
│ ├── 0697.Degree-of-an-Array/
│ │ ├── 697. Degree of an Array.go
│ │ ├── 697. Degree of an Array_test.go
│ │ └── README.md
│ ├── 0699.Falling-Squares/
│ │ ├── 699. Falling Squares.go
│ │ ├── 699. Falling Squares_test.go
│ │ └── README.md
│ ├── 0700.Search-in-a-Binary-Search-Tree/
│ │ ├── 700.Search in a Binary Search Tree.go
│ │ ├── 700.Search in a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0701.Insert-into-a-Binary-Search-Tree/
│ │ ├── 701. Insert into a Binary Search Tree.go
│ │ ├── 701. Insert into a Binary Search Tree_test.go
│ │ └── README.md
│ ├── 0703.Kth-Largest-Element-in-a-Stream/
│ │ ├── 703. Kth Largest Element in a Stream.go
│ │ ├── 703. Kth Largest Element in a Stream_test.go
│ │ └── README.md
│ ├── 0704.Binary-Search/
│ │ ├── 704. Binary Search.go
│ │ ├── 704. Binary Search_test.go
│ │ └── README.md
│ ├── 0705.Design-HashSet/
│ │ ├── 705. Design HashSet.go
│ │ ├── 705. Design HashSet_test.go
│ │ └── README.md
│ ├── 0706.Design-HashMap/
│ │ ├── 706. Design HashMap.go
│ │ ├── 706. Design HashMap_test.go
│ │ └── README.md
│ ├── 0707.Design-Linked-List/
│ │ ├── 707. Design Linked List.go
│ │ ├── 707. Design Linked List_test.go
│ │ └── README.md
│ ├── 0709.To-Lower-Case/
│ │ ├── 709. To Lower Case.go
│ │ ├── 709. To Lower Case_test.go
│ │ └── README.md
│ ├── 0710.Random-Pick-with-Blacklist/
│ │ ├── 710. Random Pick with Blacklist.go
│ │ ├── 710. Random Pick with Blacklist_test.go
│ │ └── README.md
│ ├── 0713.Subarray-Product-Less-Than-K/
│ │ ├── 713. Subarray Product Less Than K.go
│ │ ├── 713. Subarray Product Less Than K_test.go
│ │ └── README.md
│ ├── 0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/
│ │ ├── 714. Best Time to Buy and Sell Stock with Transaction Fee.go
│ │ ├── 714. Best Time to Buy and Sell Stock with Transaction Fee_test.go
│ │ └── README.md
│ ├── 0715.Range-Module/
│ │ ├── 715. Range Module.go
│ │ ├── 715. Range Module_test.go
│ │ └── README.md
│ ├── 0717.1-bit-and-2-bit-Characters/
│ │ ├── 717. 1-bit and 2-bit Characters.go
│ │ ├── 717. 1-bit and 2-bit Characters_test.go
│ │ └── README.md
│ ├── 0718.Maximum-Length-of-Repeated-Subarray/
│ │ ├── 718. Maximum Length of Repeated Subarray.go
│ │ ├── 718. Maximum Length of Repeated Subarray_test.go
│ │ └── README.md
│ ├── 0719.Find-K-th-Smallest-Pair-Distance/
│ │ ├── 719. Find K-th Smallest Pair Distance.go
│ │ ├── 719. Find K-th Smallest Pair Distance_test.go
│ │ └── README.md
│ ├── 0720.Longest-Word-in-Dictionary/
│ │ ├── 720. Longest Word in Dictionary.go
│ │ ├── 720. Longest Word in Dictionary_test.go
│ │ └── README.md
│ ├── 0721.Accounts-Merge/
│ │ ├── 721. Accounts Merge.go
│ │ ├── 721. Accounts Merge_test.go
│ │ └── README.md
│ ├── 0724.Find-Pivot-Index/
│ │ ├── 724. Find Pivot Index.go
│ │ ├── 724. Find Pivot Index_test.go
│ │ └── README.md
│ ├── 0725.Split-Linked-List-in-Parts/
│ │ ├── 725. Split Linked List in Parts.go
│ │ ├── 725. Split Linked List in Parts_test.go
│ │ └── README.md
│ ├── 0726.Number-of-Atoms/
│ │ ├── 726. Number of Atoms.go
│ │ ├── 726. Number of Atoms_test.go
│ │ └── README.md
│ ├── 0728.Self-Dividing-Numbers/
│ │ ├── 728.Self Dividing Numbers.go
│ │ ├── 728.Self Dividing Numbers_test.go
│ │ └── README.md
│ ├── 0729.My-Calendar-I/
│ │ ├── 729. My Calendar I.go
│ │ ├── 729. My Calendar I_test.go
│ │ └── README.md
│ ├── 0732.My-Calendar-III/
│ │ ├── 732. My Calendar III.go
│ │ ├── 732. My Calendar III_test.go
│ │ └── README.md
│ ├── 0733.Flood-Fill/
│ │ ├── 733. Flood Fill.go
│ │ ├── 733. Flood Fill_test.go
│ │ └── README.md
│ ├── 0735.Asteroid-Collision/
│ │ ├── 735. Asteroid Collision.go
│ │ ├── 735. Asteroid Collision_test.go
│ │ └── README.md
│ ├── 0739.Daily-Temperatures/
│ │ ├── 739. Daily Temperatures.go
│ │ ├── 739. Daily Temperatures_test.go
│ │ └── README.md
│ ├── 0744.Find-Smallest-Letter-Greater-Than-Target/
│ │ ├── 744. Find Smallest Letter Greater Than Target.go
│ │ ├── 744. Find Smallest Letter Greater Than Target_test.go
│ │ └── README.md
│ ├── 0745.Prefix-and-Suffix-Search/
│ │ ├── 745. Prefix and Suffix Search.go
│ │ ├── 745. Prefix and Suffix Search_test.go
│ │ └── README.md
│ ├── 0746.Min-Cost-Climbing-Stairs/
│ │ ├── 746. Min Cost Climbing Stairs.go
│ │ ├── 746. Min Cost Climbing Stairs_test.go
│ │ └── README.md
│ ├── 0747.Largest-Number-At-Least-Twice-of-Others/
│ │ ├── 747. Largest Number At Least Twice of Others.go
│ │ ├── 747. Largest Number At Least Twice of Others_test.go
│ │ └── README.md
│ ├── 0748.Shortest-Completing-Word/
│ │ ├── 748. Shortest Completing Word.go
│ │ ├── 748. Shortest Completing Word_test.go
│ │ └── README.md
│ ├── 0752.Open-the-Lock/
│ │ ├── 752. Open the Lock.go
│ │ ├── 752. Open the Lock_test.go
│ │ └── README.md
│ ├── 0753.Cracking-the-Safe/
│ │ ├── 753. Cracking the Safe.go
│ │ ├── 753. Cracking the Safe_test.go
│ │ └── README.md
│ ├── 0756.Pyramid-Transition-Matrix/
│ │ ├── 756. Pyramid Transition Matrix.go
│ │ ├── 756. Pyramid Transition Matrix_test.go
│ │ └── README.md
│ ├── 0762.Prime-Number-of-Set-Bits-in-Binary-Representation/
│ │ ├── 762. Prime Number of Set Bits in Binary Representation.go
│ │ ├── 762. Prime Number of Set Bits in Binary Representation_test.go
│ │ └── README.md
│ ├── 0763.Partition-Labels/
│ │ ├── 763. Partition Labels.go
│ │ ├── 763. Partition Labels_test.go
│ │ └── README.md
│ ├── 0765.Couples-Holding-Hands/
│ │ ├── 765. Couples Holding Hands.go
│ │ ├── 765. Couples Holding Hands_test.go
│ │ └── README.md
│ ├── 0766.Toeplitz-Matrix/
│ │ ├── 766. Toeplitz Matrix.go
│ │ ├── 766. Toeplitz Matrix_test.go
│ │ └── README.md
│ ├── 0767.Reorganize-String/
│ │ ├── 767. Reorganize String.go
│ │ ├── 767. Reorganize String_test.go
│ │ └── README.md
│ ├── 0771.Jewels-and-Stones/
│ │ ├── 771. Jewels and Stones.go
│ │ ├── 771. Jewels and Stones_test.go
│ │ └── README.md
│ ├── 0775.Global-and-Local-Inversions/
│ │ ├── 775. Global and Local Inversions.go
│ │ ├── 775. Global and Local Inversions_test.go
│ │ └── README.md
│ ├── 0778.Swim-in-Rising-Water/
│ │ ├── 778. Swim in Rising Water.go
│ │ ├── 778. Swim in Rising Water_test.go
│ │ └── README.md
│ ├── 0781.Rabbits-in-Forest/
│ │ ├── 781. Rabbits in Forest.go
│ │ ├── 781. Rabbits in Forest_test.go
│ │ └── README.md
│ ├── 0783.Minimum-Distance-Between-BST-Nodes/
│ │ ├── 783. Minimum Distance Between BST Nodes.go
│ │ ├── 783. Minimum Distance Between BST Nodes_test.go
│ │ └── README.md
│ ├── 0784.Letter-Case-Permutation/
│ │ ├── 784. Letter Case Permutation.go
│ │ ├── 784. Letter Case Permutation_test.go
│ │ └── README.md
│ ├── 0785.Is-Graph-Bipartite/
│ │ ├── 785. Is Graph Bipartite.go
│ │ ├── 785. Is Graph Bipartite_test.go
│ │ └── README.md
│ ├── 0786.K-th-Smallest-Prime-Fraction/
│ │ ├── 786. K-th Smallest Prime Fraction.go
│ │ ├── 786. K-th Smallest Prime Fraction_test.go
│ │ └── README.md
│ ├── 0791.Custom-Sort-String/
│ │ ├── 791. Custom Sort String.go
│ │ ├── 791. Custom Sort String_test.go
│ │ └── README.md
│ ├── 0792.Number-of-Matching-Subsequences/
│ │ ├── 792. Number of Matching Subsequences.go
│ │ ├── 792. Number of Matching Subsequences_test.go
│ │ └── README.md
│ ├── 0793.Preimage-Size-of-Factorial-Zeroes-Function/
│ │ ├── 793. Preimage Size of Factorial Zeroes Function.go
│ │ ├── 793. Preimage Size of Factorial Zeroes Function_test.go
│ │ └── README.md
│ ├── 0794.Valid-Tic-Tac-Toe-State/
│ │ ├── 794.Valid Tic-Tac-Toe State.go
│ │ ├── 794.Valid Tic-Tac-Toe State_test.go
│ │ └── README.md
│ ├── 0795.Number-of-Subarrays-with-Bounded-Maximum/
│ │ ├── 795. Number of Subarrays with Bounded Maximum.go
│ │ ├── 795. Number of Subarrays with Bounded Maximum_test.go
│ │ └── README.md
│ ├── 0802.Find-Eventual-Safe-States/
│ │ ├── 802. Find Eventual Safe States.go
│ │ ├── 802. Find Eventual Safe States_test.go
│ │ └── README.md
│ ├── 0803.Bricks-Falling-When-Hit/
│ │ ├── 803. Bricks Falling When Hit.go
│ │ ├── 803. Bricks Falling When Hit_test.go
│ │ └── README.md
│ ├── 0807.Max-Increase-to-Keep-City-Skyline/
│ │ ├── 807.Max Increase to Keep City Skyline.go
│ │ ├── 807.Max Increase to Keep City Skyline_test.go
│ │ └── README.md
│ ├── 0810.Chalkboard-XOR-Game/
│ │ ├── 810. Chalkboard XOR Game.go
│ │ ├── 810. Chalkboard XOR Game_test.go
│ │ └── README.md
│ ├── 0811.Subdomain-Visit-Count/
│ │ ├── 811. Subdomain Visit Count.go
│ │ ├── 811. Subdomain Visit Count_test.go
│ │ └── README.md
│ ├── 0812.Largest-Triangle-Area/
│ │ ├── 812. Largest Triangle Area.go
│ │ ├── 812. Largest Triangle Area_test.go
│ │ └── README.md
│ ├── 0815.Bus-Routes/
│ │ ├── 815. Bus Routes.go
│ │ ├── 815. Bus Routes_test.go
│ │ └── README.md
│ ├── 0816.Ambiguous-Coordinates/
│ │ ├── 816. Ambiguous Coordinates.go
│ │ ├── 816. Ambiguous Coordinates_test.go
│ │ └── README.md
│ ├── 0817.Linked-List-Components/
│ │ ├── 817. Linked List Components.go
│ │ ├── 817. Linked List Components_test.go
│ │ └── README.md
│ ├── 0819.Most-Common-Word/
│ │ ├── 819. Most Common Word.go
│ │ ├── 819. Most Common Word_test.go
│ │ └── README.md
│ ├── 0820.Short-Encoding-of-Words/
│ │ ├── 820. Short Encoding of Words.go
│ │ ├── 820. Short Encoding of Words_test.go
│ │ └── README.md
│ ├── 0821.Shortest-Distance-to-a-Character/
│ │ ├── 821. Shortest Distance to a Character.go
│ │ ├── 821. Shortest Distance to a Character_test.go
│ │ └── README.md
│ ├── 0823.Binary-Trees-With-Factors/
│ │ ├── 823. Binary Trees With Factors.go
│ │ ├── 823. Binary Trees With Factors_test.go
│ │ └── README.md
│ ├── 0825.Friends-Of-Appropriate-Ages/
│ │ ├── 825. Friends Of Appropriate Ages.go
│ │ ├── 825. Friends Of Appropriate Ages_test.go
│ │ └── README.md
│ ├── 0826.Most-Profit-Assigning-Work/
│ │ ├── 826. Most Profit Assigning Work.go
│ │ ├── 826. Most Profit Assigning Work_test.go
│ │ └── README.md
│ ├── 0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/
│ │ ├── 828. Count Unique Characters of All Substrings of a Given String.go
│ │ ├── 828. Count Unique Characters of All Substrings of a Given String_test.go
│ │ └── README.md
│ ├── 0830.Positions-of-Large-Groups/
│ │ ├── 830. Positions of Large Groups.go
│ │ ├── 830. Positions of Large Groups_test.go
│ │ └── README.md
│ ├── 0832.Flipping-an-Image/
│ │ ├── 832. Flipping an Image.go
│ │ ├── 832. Flipping an Image_test.go
│ │ └── README.md
│ ├── 0834.Sum-of-Distances-in-Tree/
│ │ ├── 834. Sum of Distances in Tree.go
│ │ ├── 834. Sum of Distances in Tree_test.go
│ │ └── README.md
│ ├── 0836.Rectangle-Overlap/
│ │ ├── 836. Rectangle Overlap.go
│ │ ├── 836. Rectangle Overlap_test.go
│ │ └── README.md
│ ├── 0838.Push-Dominoes/
│ │ ├── 838. Push Dominoes.go
│ │ ├── 838. Push Dominoes_test.go
│ │ └── README.md
│ ├── 0839.Similar-String-Groups/
│ │ ├── 839. Similar String Groups.go
│ │ ├── 839. Similar String Groups_test.go
│ │ └── README.md
│ ├── 0841.Keys-and-Rooms/
│ │ ├── 841. Keys and Rooms.go
│ │ ├── 841. Keys and Rooms_test.go
│ │ └── README.md
│ ├── 0842.Split-Array-into-Fibonacci-Sequence/
│ │ ├── 842. Split Array into Fibonacci Sequence.go
│ │ ├── 842. Split Array into Fibonacci Sequence_test.go
│ │ └── README.md
│ ├── 0844.Backspace-String-Compare/
│ │ ├── 844. Backspace String Compare.go
│ │ ├── 844. Backspace String Compare_test.go
│ │ └── README.md
│ ├── 0845.Longest-Mountain-in-Array/
│ │ ├── 845. Longest Mountain in Array.go
│ │ ├── 845. Longest Mountain in Array_test.go
│ │ └── README.md
│ ├── 0846.Hand-of-Straights/
│ │ ├── 846.Hand of Straights.go
│ │ ├── 846.Hand of Straights_test.go
│ │ └── README.md
│ ├── 0850.Rectangle-Area-II/
│ │ ├── 850. Rectangle Area II.go
│ │ ├── 850. Rectangle Area II_test.go
│ │ └── README.md
│ ├── 0851.Loud-and-Rich/
│ │ ├── 851. Loud and Rich.go
│ │ ├── 851. Loud and Rich_test.go
│ │ └── README.md
│ ├── 0852.Peak-Index-in-a-Mountain-Array/
│ │ ├── 852. Peak Index in a Mountain Array.go
│ │ ├── 852. Peak Index in a Mountain Array_test.go
│ │ └── README.md
│ ├── 0853.Car-Fleet/
│ │ ├── 853. Car Fleet.go
│ │ ├── 853. Car Fleet_test.go
│ │ └── README.md
│ ├── 0856.Score-of-Parentheses/
│ │ ├── 856. Score of Parentheses.go
│ │ ├── 856. Score of Parentheses_test.go
│ │ └── README.md
│ ├── 0859.Buddy-Strings/
│ │ ├── 859.Buddy Strings.go
│ │ ├── 859.Buddy Strings_test.go
│ │ └── README.md
│ ├── 0862.Shortest-Subarray-with-Sum-at-Least-K/
│ │ ├── 862. Shortest Subarray with Sum at Least K.go
│ │ ├── 862. Shortest Subarray with Sum at Least K_test.go
│ │ └── README.md
│ ├── 0863.All-Nodes-Distance-K-in-Binary-Tree/
│ │ ├── 863. All Nodes Distance K in Binary Tree.go
│ │ ├── 863. All Nodes Distance K in Binary Tree_test.go
│ │ └── README.md
│ ├── 0864.Shortest-Path-to-Get-All-Keys/
│ │ ├── 864. Shortest Path to Get All Keys.go
│ │ ├── 864. Shortest Path to Get All Keys_test.go
│ │ └── README.md
│ ├── 0867.Transpose-Matrix/
│ │ ├── 867. Transpose Matrix.go
│ │ ├── 867. Transpose Matrix_test.go
│ │ └── README.md
│ ├── 0869.Reordered-Power-of-2/
│ │ ├── 869. Reordered Power of 2.go
│ │ ├── 869. Reordered Power of 2_test.go
│ │ └── README.md
│ ├── 0870.Advantage-Shuffle/
│ │ ├── 870. Advantage Shuffle.go
│ │ ├── 870. Advantage Shuffle_test.go
│ │ └── README.md
│ ├── 0872.Leaf-Similar-Trees/
│ │ ├── 872. Leaf-Similar Trees.go
│ │ ├── 872. Leaf-Similar Trees_test.go
│ │ └── README.md
│ ├── 0874.Walking-Robot-Simulation/
│ │ ├── 874. Walking Robot Simulation.go
│ │ ├── 874. Walking Robot Simulation_test.go
│ │ └── README.md
│ ├── 0875.Koko-Eating-Bananas/
│ │ ├── 875. Koko Eating Bananas.go
│ │ ├── 875. Koko Eating Bananas_test.go
│ │ └── README.md
│ ├── 0876.Middle-of-the-Linked-List/
│ │ ├── 876. Middle of the Linked List.go
│ │ ├── 876. Middle of the Linked List_test.go
│ │ └── README.md
│ ├── 0877.Stone-Game/
│ │ ├── 877. Stone Game.go
│ │ ├── 877. Stone Game_test.go
│ │ └── README.md
│ ├── 0878.Nth-Magical-Number/
│ │ ├── 878. Nth Magical Number.go
│ │ ├── 878. Nth Magical Number_test.go
│ │ └── README.md
│ ├── 0880.Decoded-String-at-Index/
│ │ ├── 880. Decoded String at Index.go
│ │ ├── 880. Decoded String at Index_test.go
│ │ └── README.md
│ ├── 0881.Boats-to-Save-People/
│ │ ├── 881. Boats to Save People.go
│ │ ├── 881. Boats to Save People_test.go
│ │ └── README.md
│ ├── 0884.Uncommon-Words-from-Two-Sentences/
│ │ ├── 884. Uncommon Words from Two Sentences.go
│ │ ├── 884. Uncommon Words from Two Sentences_test.go
│ │ └── README.md
│ ├── 0885.Spiral-Matrix-III/
│ │ ├── 885. Spiral Matrix III.go
│ │ ├── 885. Spiral Matrix III_test.go
│ │ └── README.md
│ ├── 0887.Super-Egg-Drop/
│ │ ├── 887. Super Egg Drop.go
│ │ ├── 887. Super Egg Drop_test.go
│ │ └── README.md
│ ├── 0888.Fair-Candy-Swap/
│ │ ├── 888. Fair Candy Swap.go
│ │ ├── 888. Fair Candy Swap_test.go
│ │ └── README.md
│ ├── 0890.Find-and-Replace-Pattern/
│ │ ├── 890. Find and Replace Pattern.go
│ │ ├── 890. Find and Replace Pattern_test.go
│ │ └── README.md
│ ├── 0891.Sum-of-Subsequence-Widths/
│ │ ├── 891. Sum of Subsequence Widths.go
│ │ ├── 891. Sum of Subsequence Widths_test.go
│ │ └── README.md
│ ├── 0892.Surface-Area-of-3D-Shapes/
│ │ ├── 892. Surface Area of 3D Shapes.go
│ │ ├── 892. Surface Area of 3D Shapes_test.go
│ │ └── README.md
│ ├── 0895.Maximum-Frequency-Stack/
│ │ ├── 895. Maximum Frequency Stack.go
│ │ ├── 895. Maximum Frequency Stack_test.go
│ │ └── README.md
│ ├── 0896.Monotonic-Array/
│ │ ├── 896. Monotonic Array.go
│ │ ├── 896. Monotonic Array_test.go
│ │ └── README.md
│ ├── 0897.Increasing-Order-Search-Tree/
│ │ ├── 897. Increasing Order Search Tree.go
│ │ ├── 897. Increasing Order Search Tree_test.go
│ │ └── README.md
│ ├── 0898.Bitwise-ORs-of-Subarrays/
│ │ ├── 898. Bitwise ORs of Subarrays.go
│ │ ├── 898. Bitwise ORs of Subarrays_test.go
│ │ └── README.md
│ ├── 0901.Online-Stock-Span/
│ │ ├── 901. Online Stock Span.go
│ │ ├── 901. Online Stock Span_test.go
│ │ └── README.md
│ ├── 0904.Fruit-Into-Baskets/
│ │ ├── 904. Fruit Into Baskets.go
│ │ ├── 904. Fruit Into Baskets_test.go
│ │ └── README.md
│ ├── 0907.Sum-of-Subarray-Minimums/
│ │ ├── 907. Sum of Subarray Minimums.go
│ │ ├── 907. Sum of Subarray Minimums_test.go
│ │ └── README.md
│ ├── 0909.Snakes-and-Ladders/
│ │ ├── 909. Snakes and Ladders.go
│ │ ├── 909. Snakes and Ladders_test.go
│ │ └── README.md
│ ├── 0910.Smallest-Range-II/
│ │ ├── 910.Smallest Range II.go
│ │ ├── 910.Smallest Range II_test.go
│ │ └── README.md
│ ├── 0911.Online-Election/
│ │ ├── 911. Online Election.go
│ │ ├── 911. Online Election_test.go
│ │ └── README.md
│ ├── 0914.X-of-a-Kind-in-a-Deck-of-Cards/
│ │ ├── 914. X of a Kind in a Deck of Cards.go
│ │ ├── 914. X of a Kind in a Deck of Cards_test.go
│ │ └── README.md
│ ├── 0916.Word-Subsets/
│ │ ├── 916. Word Subsets.go
│ │ ├── 916. Word Subsets_test.go
│ │ └── README.md
│ ├── 0918.Maximum-Sum-Circular-Subarray/
│ │ ├── 918. Maximum Sum Circular Subarray.go
│ │ ├── 918. Maximum Sum Circular Subarray_test.go
│ │ └── README.md
│ ├── 0920.Number-of-Music-Playlists/
│ │ ├── 920. Number of Music Playlists.go
│ │ ├── 920. Number of Music Playlists_test.go
│ │ └── README.md
│ ├── 0921.Minimum-Add-to-Make-Parentheses-Valid/
│ │ ├── 921. Minimum Add to Make Parentheses Valid.go
│ │ ├── 921. Minimum Add to Make Parentheses Valid_test.go
│ │ └── README.md
│ ├── 0922.Sort-Array-By-Parity-II/
│ │ ├── 922. Sort Array By Parity II.go
│ │ ├── 922. Sort Array By Parity II_test.go
│ │ └── README.md
│ ├── 0923.3Sum-With-Multiplicity/
│ │ ├── 923. 3Sum With Multiplicity.go
│ │ ├── 923. 3Sum With Multiplicity_test.go
│ │ └── README.md
│ ├── 0924.Minimize-Malware-Spread/
│ │ ├── 924. Minimize Malware Spread.go
│ │ ├── 924. Minimize Malware Spread_test.go
│ │ └── README.md
│ ├── 0925.Long-Pressed-Name/
│ │ ├── 925. Long Pressed Name.go
│ │ ├── 925. Long Pressed Name_test.go
│ │ └── README.md
│ ├── 0927.Three-Equal-Parts/
│ │ ├── 927. Three Equal Parts.go
│ │ ├── 927. Three Equal Parts_test.go
│ │ └── README.md
│ ├── 0928.Minimize-Malware-Spread-II/
│ │ ├── 928. Minimize Malware Spread II.go
│ │ ├── 928. Minimize Malware Spread II_test.go
│ │ └── README.md
│ ├── 0930.Binary-Subarrays-With-Sum/
│ │ ├── 930. Binary Subarrays With Sum.go
│ │ ├── 930. Binary Subarrays With Sum_test.go
│ │ └── README.md
│ ├── 0933.Number-of-Recent-Calls/
│ │ ├── 933. Number of Recent Calls.go
│ │ ├── 933. Number of Recent Calls_test.go
│ │ └── README.md
│ ├── 0938.Range-Sum-of-BST/
│ │ ├── 938. Range Sum of BST.go
│ │ ├── 938. Range Sum of BST_test.go
│ │ └── README.md
│ ├── 0942.DI-String-Match/
│ │ ├── 942. DI String Match.go
│ │ ├── 942. DI String Match_test.go
│ │ └── README.md
│ ├── 0946.Validate-Stack-Sequences/
│ │ ├── 946. Validate Stack Sequences.go
│ │ ├── 946. Validate Stack Sequences_test.go
│ │ └── README.md
│ ├── 0947.Most-Stones-Removed-with-Same-Row-or-Column/
│ │ ├── 947. Most Stones Removed with Same Row or Column.go
│ │ ├── 947. Most Stones Removed with Same Row or Column_test.go
│ │ └── README.md
│ ├── 0949.Largest-Time-for-Given-Digits/
│ │ ├── 949. Largest Time for Given Digits.go
│ │ ├── 949. Largest Time for Given Digits_test.go
│ │ └── README.md
│ ├── 0952.Largest-Component-Size-by-Common-Factor/
│ │ ├── 952. Largest Component Size by Common Factor.go
│ │ ├── 952. Largest Component Size by Common Factor_test.go
│ │ └── README.md
│ ├── 0953.Verifying-an-Alien-Dictionary/
│ │ ├── 953. Verifying an Alien Dictionary.go
│ │ ├── 953. Verifying an Alien Dictionary_test.go
│ │ └── README.md
│ ├── 0958.Check-Completeness-of-a-Binary-Tree/
│ │ ├── 0958.Check Completeness of a Binary Tree.go
│ │ ├── 0958.Check Completeness of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0959.Regions-Cut-By-Slashes/
│ │ ├── 959. Regions Cut By Slashes.go
│ │ ├── 959. Regions Cut By Slashes_test.go
│ │ └── README.md
│ ├── 0961.N-Repeated-Element-in-Size-2N-Array/
│ │ ├── 961. N-Repeated Element in Size 2N Array.go
│ │ ├── 961. N-Repeated Element in Size 2N Array_test.go
│ │ └── README.md
│ ├── 0966.Vowel-Spellchecker/
│ │ ├── 966. Vowel Spellchecker.go
│ │ ├── 966. Vowel Spellchecker_test.go
│ │ └── README.md
│ ├── 0968.Binary-Tree-Cameras/
│ │ ├── 968. Binary Tree Cameras.go
│ │ ├── 968. Binary Tree Cameras_test.go
│ │ └── README.md
│ ├── 0969.Pancake-Sorting/
│ │ ├── 969. Pancake Sorting.go
│ │ ├── 969. Pancake Sorting_test.go
│ │ └── README.md
│ ├── 0970.Powerful-Integers/
│ │ ├── 970. Powerful Integers.go
│ │ ├── 970. Powerful Integers_test.go
│ │ └── README.md
│ ├── 0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/
│ │ ├── 971. Flip Binary Tree To Match Preorder Traversal.go
│ │ ├── 971. Flip Binary Tree To Match Preorder Traversal_test.go
│ │ └── README.md
│ ├── 0973.K-Closest-Points-to-Origin/
│ │ ├── 973. K Closest Points to Origin.go
│ │ ├── 973. K Closest Points to Origin_test.go
│ │ └── README.md
│ ├── 0976.Largest-Perimeter-Triangle/
│ │ ├── 976. Largest Perimeter Triangle.go
│ │ ├── 976. Largest Perimeter Triangle_test.go
│ │ └── README.md
│ ├── 0977.Squares-of-a-Sorted-Array/
│ │ ├── 977. Squares of a Sorted Array.go
│ │ ├── 977. Squares of a Sorted Array_test.go
│ │ └── README.md
│ ├── 0978.Longest-Turbulent-Subarray/
│ │ ├── 978. Longest Turbulent Subarray.go
│ │ ├── 978. Longest Turbulent Subarray_test.go
│ │ └── README.md
│ ├── 0979.Distribute-Coins-in-Binary-Tree/
│ │ ├── 979. Distribute Coins in Binary Tree.go
│ │ ├── 979. Distribute Coins in Binary Tree_test.go
│ │ └── README.md
│ ├── 0980.Unique-Paths-III/
│ │ ├── 980. Unique Paths III.go
│ │ ├── 980. Unique Paths III_test.go
│ │ └── README.md
│ ├── 0981.Time-Based-Key-Value-Store/
│ │ ├── 981. Time Based Key-Value Store.go
│ │ ├── 981. Time Based Key-Value Store_test.go
│ │ └── README.md
│ ├── 0984.String-Without-AAA-or-BBB/
│ │ ├── 984. String Without AAA or BBB.go
│ │ ├── 984. String Without AAA or BBB_test.go
│ │ └── README.md
│ ├── 0985.Sum-of-Even-Numbers-After-Queries/
│ │ ├── 985. Sum of Even Numbers After Queries.go
│ │ ├── 985. Sum of Even Numbers After Queries_test.go
│ │ └── README.md
│ ├── 0986.Interval-List-Intersections/
│ │ ├── 986. Interval List Intersections.go
│ │ ├── 986. Interval List Intersections_test.go
│ │ └── README.md
│ ├── 0987.Vertical-Order-Traversal-of-a-Binary-Tree/
│ │ ├── 987. Vertical Order Traversal of a Binary Tree.go
│ │ ├── 987. Vertical Order Traversal of a Binary Tree_test.go
│ │ └── README.md
│ ├── 0989.Add-to-Array-Form-of-Integer/
│ │ ├── 989. Add to Array-Form of Integer.go
│ │ ├── 989. Add to Array-Form of Integer_test.go
│ │ └── README.md
│ ├── 0990.Satisfiability-of-Equality-Equations/
│ │ ├── 990. Satisfiability of Equality Equations.go
│ │ ├── 990. Satisfiability of Equality Equations_test.go
│ │ └── README.md
│ ├── 0991.Broken-Calculator/
│ │ ├── 991. Broken Calculator.go
│ │ ├── 991. Broken Calculator_test.go
│ │ └── README.md
│ ├── 0992.Subarrays-with-K-Different-Integers/
│ │ ├── 992. Subarrays with K Different Integers.go
│ │ ├── 992. Subarrays with K Different Integers_test.go
│ │ └── README.md
│ ├── 0993.Cousins-in-Binary-Tree/
│ │ ├── 993. Cousins in Binary Tree.go
│ │ ├── 993. Cousins in Binary Tree_test.go
│ │ └── README.md
│ ├── 0995.Minimum-Number-of-K-Consecutive-Bit-Flips/
│ │ ├── 995. Minimum Number of K Consecutive Bit Flips.go
│ │ ├── 995. Minimum Number of K Consecutive Bit Flips_test.go
│ │ └── README.md
│ ├── 0996.Number-of-Squareful-Arrays/
│ │ ├── 996. Number of Squareful Arrays.go
│ │ ├── 996. Number of Squareful Arrays_test.go
│ │ └── README.md
│ ├── 0997.Find-the-Town-Judge/
│ │ ├── 997.Find the Town Judge.go
│ │ ├── 997.Find the Town Judge_test.go
│ │ └── README.md
│ ├── 0999.Available-Captures-for-Rook/
│ │ ├── 999. Available Captures for Rook.go
│ │ ├── 999. Available Captures for Rook_test.go
│ │ └── README.md
│ ├── 1002.Find-Common-Characters/
│ │ ├── 1002. Find Common Characters.go
│ │ ├── 1002. Find Common Characters_test.go
│ │ └── README.md
│ ├── 1003.Check-If-Word-Is-Valid-After-Substitutions/
│ │ ├── 1003. Check If Word Is Valid After Substitutions.go
│ │ ├── 1003. Check If Word Is Valid After Substitutions_test.go
│ │ └── README.md
│ ├── 1004.Max-Consecutive-Ones-III/
│ │ ├── 1004. Max Consecutive Ones III.go
│ │ ├── 1004. Max Consecutive Ones III_test.go
│ │ └── README.md
│ ├── 1005.Maximize-Sum-Of-Array-After-K-Negations/
│ │ ├── 1005. Maximize Sum Of Array After K Negations.go
│ │ ├── 1005. Maximize Sum Of Array After K Negations_test.go
│ │ └── README.md
│ ├── 1006.Clumsy-Factorial/
│ │ ├── 1006. Clumsy Factorial.go
│ │ ├── 1006. Clumsy Factorial_test.go
│ │ └── README.md
│ ├── 1009.Complement-of-Base-10-Integer/
│ │ ├── 1009. Complement of Base 10 Integer.go
│ │ ├── 1009. Complement of Base 10 Integer_test.go
│ │ └── README.md
│ ├── 1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/
│ │ ├── 1010. Pairs of Songs With Total Durations Divisible by 60.go
│ │ ├── 1010. Pairs of Songs With Total Durations Divisible by 60_test.go
│ │ └── README.md
│ ├── 1011.Capacity-To-Ship-Packages-Within-D-Days/
│ │ ├── 1011. Capacity To Ship Packages Within D Days.go
│ │ ├── 1011. Capacity To Ship Packages Within D Days_test.go
│ │ └── README.md
│ ├── 1017.Convert-to-Base-2/
│ │ ├── 1017. Convert to Base -2.go
│ │ ├── 1017. Convert to Base -2_test.go
│ │ └── README.md
│ ├── 1018.Binary-Prefix-Divisible-By-5/
│ │ ├── 1018. Binary Prefix Divisible By 5.go
│ │ ├── 1018. Binary Prefix Divisible By 5_test.go
│ │ └── README.md
│ ├── 1019.Next-Greater-Node-In-Linked-List/
│ │ ├── 1019. Next Greater Node In Linked List.go
│ │ ├── 1019. Next Greater Node In Linked List_test.go
│ │ └── README.md
│ ├── 1020.Number-of-Enclaves/
│ │ ├── 1020. Number of Enclaves.go
│ │ ├── 1020. Number of Enclaves_test.go
│ │ └── README.md
│ ├── 1021.Remove-Outermost-Parentheses/
│ │ ├── 1021. Remove Outermost Parentheses.go
│ │ ├── 1021. Remove Outermost Parentheses_test.go
│ │ └── README.md
│ ├── 1022.Sum-of-Root-To-Leaf-Binary-Numbers/
│ │ ├── 1022. Sum of Root To Leaf Binary Numbers.go
│ │ ├── 1022. Sum of Root To Leaf Binary Numbers_test.go
│ │ └── README.md
│ ├── 1025.Divisor-Game/
│ │ ├── 1025. Divisor Game.go
│ │ ├── 1025. Divisor Game_test.go
│ │ └── README.md
│ ├── 1026.Maximum-Difference-Between-Node-and-Ancestor/
│ │ ├── 1026. Maximum Difference Between Node and Ancestor.go
│ │ ├── 1026. Maximum Difference Between Node and Ancestor_test.go
│ │ └── README.md
│ ├── 1028.Recover-a-Tree-From-Preorder-Traversal/
│ │ ├── 1028. Recover a Tree From Preorder Traversal.go
│ │ ├── 1028. Recover a Tree From Preorder Traversal_test.go
│ │ └── README.md
│ ├── 1030.Matrix-Cells-in-Distance-Order/
│ │ ├── 1030. Matrix Cells in Distance Order.go
│ │ ├── 1030. Matrix Cells in Distance Order_test.go
│ │ └── README.md
│ ├── 1034.Coloring-A-Border/
│ │ ├── 1034.Coloring A Border.go
│ │ ├── 1034.Coloring A Border_test.go
│ │ └── README.md
│ ├── 1037.Valid-Boomerang/
│ │ ├── 1037. Valid Boomerang.go
│ │ ├── 1037. Valid Boomerang_test.go
│ │ └── README.md
│ ├── 1038.Binary-Search-Tree-to-Greater-Sum-Tree/
│ │ ├── 1038. Binary Search Tree to Greater Sum Tree.go
│ │ ├── 1038. Binary Search Tree to Greater Sum Tree_test.go
│ │ └── README.md
│ ├── 1040.Moving-Stones-Until-Consecutive-II/
│ │ ├── 1040. Moving Stones Until Consecutive II.go
│ │ ├── 1040. Moving Stones Until Consecutive II_test.go
│ │ └── README.md
│ ├── 1047.Remove-All-Adjacent-Duplicates-In-String/
│ │ ├── 1047. Remove All Adjacent Duplicates In String.go
│ │ ├── 1047. Remove All Adjacent Duplicates In String_test.go
│ │ └── README.md
│ ├── 1048.Longest-String-Chain/
│ │ ├── 1048. Longest String Chain.go
│ │ ├── 1048. Longest String Chain_test.go
│ │ └── README.md
│ ├── 1049.Last-Stone-Weight-II/
│ │ ├── 1049. Last Stone Weight II.go
│ │ ├── 1049. Last Stone Weight II_test.go
│ │ └── README.md
│ ├── 1051.Height-Checker/
│ │ ├── 1051. Height Checker.go
│ │ ├── 1051. Height Checker_test.go
│ │ └── README.md
│ ├── 1052.Grumpy-Bookstore-Owner/
│ │ ├── 1052. Grumpy Bookstore Owner.go
│ │ ├── 1052. Grumpy Bookstore Owner_test.go
│ │ └── README.md
│ ├── 1054.Distant-Barcodes/
│ │ ├── 1054. Distant Barcodes.go
│ │ ├── 1054. Distant Barcodes_test.go
│ │ └── README.md
│ ├── 1073.Adding-Two-Negabinary-Numbers/
│ │ ├── 1073. Adding Two Negabinary Numbers.go
│ │ ├── 1073. Adding Two Negabinary Numbers_test.go
│ │ └── README.md
│ ├── 1074.Number-of-Submatrices-That-Sum-to-Target/
│ │ ├── 1074. Number of Submatrices That Sum to Target.go
│ │ ├── 1074. Number of Submatrices That Sum to Target_test.go
│ │ └── README.md
│ ├── 1078.Occurrences-After-Bigram/
│ │ ├── 1078. Occurrences After Bigram.go
│ │ ├── 1078. Occurrences After Bigram_test.go
│ │ └── README.md
│ ├── 1079.Letter-Tile-Possibilities/
│ │ ├── 1079. Letter Tile Possibilities.go
│ │ ├── 1079. Letter Tile Possibilities_test.go
│ │ └── README.md
│ ├── 1089.Duplicate-Zeros/
│ │ ├── 1089. Duplicate Zeros.go
│ │ ├── 1089. Duplicate Zeros_test.go
│ │ └── README.md
│ ├── 1091.Shortest-Path-in-Binary-Matrix/
│ │ ├── 1091. Shortest Path in Binary Matrix.go
│ │ ├── 1091. Shortest Path in Binary Matrix_test.go
│ │ └── README.md
│ ├── 1093.Statistics-from-a-Large-Sample/
│ │ ├── 1093. Statistics from a Large Sample.go
│ │ ├── 1093. Statistics from a Large Sample_test.go
│ │ └── README.md
│ ├── 1104.Path-In-Zigzag-Labelled-Binary-Tree/
│ │ ├── 1104.Path In Zigzag Labelled Binary Tree.go
│ │ ├── 1104.Path In Zigzag Labelled Binary Tree_test.go
│ │ └── README.md
│ ├── 1105.Filling-Bookcase-Shelves/
│ │ ├── 1105. Filling Bookcase Shelves.go
│ │ ├── 1105. Filling Bookcase Shelves_test.go
│ │ └── README.md
│ ├── 1108.Defanging-an-IP-Address/
│ │ ├── 1108. Defanging an IP Address.go
│ │ ├── 1108. Defanging an IP Address_test.go
│ │ └── README.md
│ ├── 1110.Delete-Nodes-And-Return-Forest/
│ │ ├── 1110. Delete Nodes And Return Forest.go
│ │ ├── 1110. Delete Nodes And Return Forest_test.go
│ │ └── README.md
│ ├── 1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/
│ │ ├── 1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go
│ │ ├── 1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go
│ │ └── README.md
│ ├── 1122.Relative-Sort-Array/
│ │ ├── 1122. Relative Sort Array.go
│ │ ├── 1122. Relative Sort Array_test.go
│ │ └── README.md
│ ├── 1123.Lowest-Common-Ancestor-of-Deepest-Leaves/
│ │ ├── 1123. Lowest Common Ancestor of Deepest Leaves.go
│ │ ├── 1123. Lowest Common Ancestor of Deepest Leaves_test.go
│ │ └── README.md
│ ├── 1128.Number-of-Equivalent-Domino-Pairs/
│ │ ├── 1128. Number of Equivalent Domino Pairs.go
│ │ ├── 1128. Number of Equivalent Domino Pairs_test.go
│ │ └── README.md
│ ├── 1137.N-th-Tribonacci-Number/
│ │ ├── 1137. N-th Tribonacci Number.go
│ │ ├── 1137. N-th Tribonacci Number_test.go
│ │ └── README.md
│ ├── 1143.Longest-Common-Subsequence/
│ │ ├── 1143. Longest Common Subsequence.go
│ │ ├── 1143. Longest Common Subsequence_test.go
│ │ └── README.md
│ ├── 1145.Binary-Tree-Coloring-Game/
│ │ ├── 1145. Binary Tree Coloring Game.go
│ │ ├── 1145. Binary Tree Coloring Game_test.go
│ │ └── README.md
│ ├── 1154.Day-of-the-Year/
│ │ ├── 1154. Day of the Year.go
│ │ ├── 1154. Day of the Year_test.go
│ │ └── README.md
│ ├── 1157.Online-Majority-Element-In-Subarray/
│ │ ├── 1157. Online Majority Element In Subarray.go
│ │ ├── 1157. Online Majority Element In Subarray_test.go
│ │ └── README.md
│ ├── 1160.Find-Words-That-Can-Be-Formed-by-Characters/
│ │ ├── 1160. Find Words That Can Be Formed by Characters.go
│ │ ├── 1160. Find Words That Can Be Formed by Characters_test.go
│ │ └── README.md
│ ├── 1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/
│ │ ├── 1170. Compare Strings by Frequency of the Smallest Character.go
│ │ ├── 1170. Compare Strings by Frequency of the Smallest Character_test.go
│ │ └── README.md
│ ├── 1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/
│ │ ├── 1171. Remove Zero Sum Consecutive Nodes from Linked List.go
│ │ ├── 1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go
│ │ └── README.md
│ ├── 1175.Prime-Arrangements/
│ │ ├── 1175. Prime Arrangements.go
│ │ ├── 1175. Prime Arrangements_test.go
│ │ └── README.md
│ ├── 1178.Number-of-Valid-Words-for-Each-Puzzle/
│ │ ├── 1178. Number of Valid Words for Each Puzzle.go
│ │ ├── 1178. Number of Valid Words for Each Puzzle_test.go
│ │ └── README.md
│ ├── 1184.Distance-Between-Bus-Stops/
│ │ ├── 1184. Distance Between Bus Stops.go
│ │ ├── 1184. Distance Between Bus Stops_test.go
│ │ └── README.md
│ ├── 1185.Day-of-the-Week/
│ │ ├── 1185. Day of the Week.go
│ │ ├── 1185. Day of the Week_test.go
│ │ └── README.md
│ ├── 1189.Maximum-Number-of-Balloons/
│ │ ├── 1189. Maximum Number of Balloons.go
│ │ ├── 1189. Maximum Number of Balloons_test.go
│ │ └── README.md
│ ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/
│ │ ├── 1190. Reverse Substrings Between Each Pair of Parentheses.go
│ │ ├── 1190. Reverse Substrings Between Each Pair of Parentheses_test.go
│ │ └── README.md
│ ├── 1200.Minimum-Absolute-Difference/
│ │ ├── 1200. Minimum Absolute Difference.go
│ │ ├── 1200. Minimum Absolute Difference_test.go
│ │ └── README.md
│ ├── 1201.Ugly-Number-III/
│ │ ├── 1201. Ugly Number III.go
│ │ ├── 1201. Ugly Number III_test.go
│ │ └── README.md
│ ├── 1202.Smallest-String-With-Swaps/
│ │ ├── 1202. Smallest String With Swaps.go
│ │ ├── 1202. Smallest String With Swaps_test.go
│ │ └── README.md
│ ├── 1203.Sort-Items-by-Groups-Respecting-Dependencies/
│ │ ├── 1203. Sort Items by Groups Respecting Dependencies.go
│ │ ├── 1203. Sort Items by Groups Respecting Dependencies_test.go
│ │ └── README.md
│ ├── 1207.Unique-Number-of-Occurrences/
│ │ ├── 1207. Unique Number of Occurrences.go
│ │ ├── 1207. Unique Number of Occurrences_test.go
│ │ └── README.md
│ ├── 1208.Get-Equal-Substrings-Within-Budget/
│ │ ├── 1208. Get Equal Substrings Within Budget.go
│ │ ├── 1208. Get Equal Substrings Within Budget_test.go
│ │ └── README.md
│ ├── 1209.Remove-All-Adjacent-Duplicates-in-String-II/
│ │ ├── 1209. Remove All Adjacent Duplicates in String II.go
│ │ ├── 1209. Remove All Adjacent Duplicates in String II_test.go
│ │ └── README.md
│ ├── 1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/
│ │ ├── 1217. Minimum Cost to Move Chips to The Same Position.go
│ │ ├── 1217. Minimum Cost to Move Chips to The Same Position_test.go
│ │ └── README.md
│ ├── 1221.Split-a-String-in-Balanced-Strings/
│ │ ├── 1221. Split a String in Balanced Strings.go
│ │ ├── 1221. Split a String in Balanced Strings_test.go
│ │ └── README.md
│ ├── 1232.Check-If-It-Is-a-Straight-Line/
│ │ ├── 1232. Check If It Is a Straight Line.go
│ │ ├── 1232. Check If It Is a Straight Line_test.go
│ │ └── README.md
│ ├── 1234.Replace-the-Substring-for-Balanced-String/
│ │ ├── 1234. Replace the Substring for Balanced String.go
│ │ ├── 1234. Replace the Substring for Balanced String_test.go
│ │ └── README.md
│ ├── 1235.Maximum-Profit-in-Job-Scheduling/
│ │ ├── 1235. Maximum Profit in Job Scheduling.go
│ │ ├── 1235. Maximum Profit in Job Scheduling_test.go
│ │ └── README.md
│ ├── 1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/
│ │ ├── 1239. Maximum Length of a Concatenated String with Unique Characters.go
│ │ ├── 1239. Maximum Length of a Concatenated String with Unique Characters_test.go
│ │ └── README.md
│ ├── 1249.Minimum-Remove-to-Make-Valid-Parentheses/
│ │ ├── 1249. Minimum Remove to Make Valid Parentheses.go
│ │ ├── 1249. Minimum Remove to Make Valid Parentheses_test.go
│ │ └── README.md
│ ├── 1252.Cells-with-Odd-Values-in-a-Matrix/
│ │ ├── 1252. Cells with Odd Values in a Matrix.go
│ │ ├── 1252. Cells with Odd Values in a Matrix_test.go
│ │ └── README.md
│ ├── 1254.Number-of-Closed-Islands/
│ │ ├── 1254. Number of Closed Islands.go
│ │ ├── 1254. Number of Closed Islands_test.go
│ │ └── README.md
│ ├── 1260.Shift-2D-Grid/
│ │ ├── 1260. Shift 2D Grid.go
│ │ ├── 1260. Shift 2D Grid_test.go
│ │ └── README.md
│ ├── 1266.Minimum-Time-Visiting-All-Points/
│ │ ├── 1266. Minimum Time Visiting All Points.go
│ │ ├── 1266. Minimum Time Visiting All Points_test.go
│ │ └── README.md
│ ├── 1268.Search-Suggestions-System/
│ │ ├── 1268. Search Suggestions System.go
│ │ ├── 1268. Search Suggestions System_test.go
│ │ └── README.md
│ ├── 1275.Find-Winner-on-a-Tic-Tac-Toe-Game/
│ │ ├── 1275. Find Winner on a Tic Tac Toe Game.go
│ │ ├── 1275. Find Winner on a Tic Tac Toe Game_test.go
│ │ └── README.md
│ ├── 1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/
│ │ ├── 1281. Subtract the Product and Sum of Digits of an Integer.go
│ │ ├── 1281. Subtract the Product and Sum of Digits of an Integer_test.go
│ │ └── README.md
│ ├── 1283.Find-the-Smallest-Divisor-Given-a-Threshold/
│ │ ├── 1283. Find the Smallest Divisor Given a Threshold.go
│ │ ├── 1283. Find the Smallest Divisor Given a Threshold_test.go
│ │ └── README.md
│ ├── 1287.Element-Appearing-More-Than-In-Sorted-Array/
│ │ ├── 1287. Element Appearing More Than 25% In Sorted Array.go
│ │ ├── 1287. Element Appearing More Than 25% In Sorted Array_test.go
│ │ └── README.md
│ ├── 1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/
│ │ ├── 1290. Convert Binary Number in a Linked List to Integer.go
│ │ ├── 1290. Convert Binary Number in a Linked List to Integer_test.go
│ │ └── README.md
│ ├── 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/
│ │ ├── 1293. Shortest Path in a Grid with Obstacles Elimination.go
│ │ ├── 1293. Shortest Path in a Grid with Obstacles Elimination_test.go
│ │ └── README.md
│ ├── 1295.Find-Numbers-with-Even-Number-of-Digits/
│ │ ├── 1295. Find Numbers with Even Number of Digits.go
│ │ ├── 1295. Find Numbers with Even Number of Digits_test.go
│ │ └── README.md
│ ├── 1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/
│ │ ├── 1296.Divide Array in Sets of K Consecutive Numbers.go
│ │ ├── 1296.Divide Array in Sets of K Consecutive Numbers_test.go
│ │ └── README.md
│ ├── 1299.Replace-Elements-with-Greatest-Element-on-Right-Side/
│ │ ├── 1299. Replace Elements with Greatest Element on Right Side.go
│ │ ├── 1299. Replace Elements with Greatest Element on Right Side_test.go
│ │ └── README.md
│ ├── 1300.Sum-of-Mutated-Array-Closest-to-Target/
│ │ ├── 1300. Sum of Mutated Array Closest to Target.go
│ │ ├── 1300. Sum of Mutated Array Closest to Target_test.go
│ │ └── README.md
│ ├── 1302.Deepest-Leaves-Sum/
│ │ ├── 1302. Deepest Leaves Sum.go
│ │ ├── 1302. Deepest Leaves Sum_test.go
│ │ └── README.md
│ ├── 1304.Find-N-Unique-Integers-Sum-up-to-Zero/
│ │ ├── 1304. Find N Unique Integers Sum up to Zero.go
│ │ ├── 1304. Find N Unique Integers Sum up to Zero_test.go
│ │ └── README.md
│ ├── 1305.All-Elements-in-Two-Binary-Search-Trees/
│ │ ├── 1305. All Elements in Two Binary Search Trees.go
│ │ ├── 1305. All Elements in Two Binary Search Trees_test.go
│ │ └── README.md
│ ├── 1306.Jump-Game-III/
│ │ ├── 1306. Jump Game III.go
│ │ ├── 1306. Jump Game III_test.go
│ │ └── README.md
│ ├── 1310.XOR-Queries-of-a-Subarray/
│ │ ├── 1310. XOR Queries of a Subarray.go
│ │ ├── 1310. XOR Queries of a Subarray_test.go
│ │ └── README.md
│ ├── 1313.Decompress-Run-Length-Encoded-List/
│ │ ├── 1313. Decompress Run-Length Encoded List.go
│ │ ├── 1313. Decompress Run-Length Encoded List_test.go
│ │ └── README.md
│ ├── 1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/
│ │ ├── 1317. Convert Integer to the Sum of Two No-Zero Integers.go
│ │ ├── 1317. Convert Integer to the Sum of Two No-Zero Integers_test.go
│ │ └── README.md
│ ├── 1319.Number-of-Operations-to-Make-Network-Connected/
│ │ ├── 1319. Number of Operations to Make Network Connected.go
│ │ ├── 1319. Number of Operations to Make Network Connected_test.go
│ │ └── README.md
│ ├── 1329.Sort-the-Matrix-Diagonally/
│ │ ├── 1329. Sort the Matrix Diagonally.go
│ │ ├── 1329. Sort the Matrix Diagonally_test.go
│ │ └── README.md
│ ├── 1332.Remove-Palindromic-Subsequences/
│ │ ├── 1332. Remove Palindromic Subsequences.go
│ │ ├── 1332. Remove Palindromic Subsequences_test.go
│ │ └── README.md
│ ├── 1337.The-K-Weakest-Rows-in-a-Matrix/
│ │ ├── 1337. The K Weakest Rows in a Matrix.go
│ │ ├── 1337. The K Weakest Rows in a Matrix_test.go
│ │ └── README.md
│ ├── 1353.Maximum-Number-of-Events-That-Can-Be-Attended/
│ │ ├── 1353. Maximum Number of Events That Can Be Attended.go
│ │ ├── 1353. Maximum Number of Events That Can Be Attended_test.go
│ │ └── README.md
│ ├── 1380.Lucky-Numbers-in-a-Matrix/
│ │ ├── 1380. Lucky Numbers in a Matrix.go
│ │ ├── 1380. Lucky Numbers in a Matrix_test.go
│ │ └── README.md
│ ├── 1383.Maximum-Performance-of-a-Team/
│ │ ├── 1383. Maximum Performance of a Team.go
│ │ ├── 1383. Maximum Performance of a Team_test.go
│ │ └── README.md
│ ├── 1385.Find-the-Distance-Value-Between-Two-Arrays/
│ │ ├── 1385. Find the Distance Value Between Two Arrays.go
│ │ ├── 1385. Find the Distance Value Between Two Arrays_test.go
│ │ └── README.md
│ ├── 1389.Create-Target-Array-in-the-Given-Order/
│ │ ├── 1389. Create Target Array in the Given Order.go
│ │ ├── 1389. Create Target Array in the Given Order_test.go
│ │ └── README.md
│ ├── 1396.Design-Underground-System/
│ │ ├── 1396. Design Underground System.go
│ │ ├── 1396. Design Underground System_test.go
│ │ └── README.md
│ ├── 1423.Maximum-Points-You-Can-Obtain-from-Cards/
│ │ ├── 1423. Maximum Points You Can Obtain from Cards.go
│ │ ├── 1423. Maximum Points You Can Obtain from Cards_test.go
│ │ └── README.md
│ ├── 1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/
│ │ ├── 1437. Check If All 1s Are at Least Length K Places Away.go
│ │ ├── 1437. Check If All 1s Are at Least Length K Places Away_test.go
│ │ └── README.md
│ ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/
│ │ ├── 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.go
│ │ ├── 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit_test.go
│ │ └── README.md
│ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/
│ │ ├── 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.go
│ │ ├── 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows_test.go
│ │ └── README.md
│ ├── 1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/
│ │ ├── 1442. Count Triplets That Can Form Two Arrays of Equal XOR.go
│ │ ├── 1442. Count Triplets That Can Form Two Arrays of Equal XOR_test.go
│ │ └── README.md
│ ├── 1446.Consecutive-Characters/
│ │ ├── 1446.Consecutive Characters.go
│ │ ├── 1446.Consecutive Characters_test.go
│ │ └── README.md
│ ├── 1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/
│ │ ├── 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.go
│ │ ├── 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence_test.go
│ │ └── README.md
│ ├── 1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/
│ │ ├── 1461. Check If a String Contains All Binary Codes of Size K.go
│ │ ├── 1461. Check If a String Contains All Binary Codes of Size K_test.go
│ │ └── README.md
│ ├── 1463.Cherry-Pickup-II/
│ │ ├── 1463. Cherry Pickup II.go
│ │ ├── 1463. Cherry Pickup II_test.go
│ │ └── README.md
│ ├── 1464.Maximum-Product-of-Two-Elements-in-an-Array/
│ │ ├── 1464. Maximum Product of Two Elements in an Array.go
│ │ ├── 1464. Maximum Product of Two Elements in an Array_test.go
│ │ └── README.md
│ ├── 1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/
│ │ ├── 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.go
│ │ ├── 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts_test.go
│ │ └── README.md
│ ├── 1470.Shuffle-the-Array/
│ │ ├── 1470. Shuffle the Array.go
│ │ ├── 1470. Shuffle the Array_test.go
│ │ └── README.md
│ ├── 1480.Running-Sum-of-1d-Array/
│ │ ├── 1480. Running Sum of 1d Array.go
│ │ ├── 1480. Running Sum of 1d Array_test.go
│ │ └── README.md
│ ├── 1482.Minimum-Number-of-Days-to-Make-m-Bouquets/
│ │ ├── 1482. Minimum Number of Days to Make m Bouquets.go
│ │ ├── 1482. Minimum Number of Days to Make m Bouquets_test.go
│ │ └── README.md
│ ├── 1486.XOR-Operation-in-an-Array/
│ │ ├── 1486. XOR Operation in an Array.go
│ │ ├── 1486. XOR Operation in an Array_test.go
│ │ └── README.md
│ ├── 1512.Number-of-Good-Pairs/
│ │ ├── 1512. Number of Good Pairs.go
│ │ ├── 1512. Number of Good Pairs_test.go
│ │ └── README.md
│ ├── 1518.Water-Bottles/
│ │ ├── 1518.Water Bottles.go
│ │ ├── 1518.Water Bottles_test.go
│ │ └── README.md
│ ├── 1539.Kth-Missing-Positive-Number/
│ │ ├── 1539. Kth Missing Positive Number.go
│ │ ├── 1539. Kth Missing Positive Number_test.go
│ │ └── README.md
│ ├── 1551.Minimum-Operations-to-Make-Array-Equal/
│ │ ├── 1551. Minimum Operations to Make Array Equal.go
│ │ ├── 1551. Minimum Operations to Make Array Equal_test.go
│ │ └── README.md
│ ├── 1572.Matrix-Diagonal-Sum/
│ │ ├── 1572.Matrix Diagonal Sum.go
│ │ ├── 1572.Matrix Diagonal Sum_test.go
│ │ └── README.md
│ ├── 1573.Number-of-Ways-to-Split-a-String/
│ │ ├── 1573. Number of Ways to Split a String.go
│ │ ├── 1573. Number of Ways to Split a String_test.go
│ │ └── README.md
│ ├── 1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/
│ │ ├── 1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.go
│ │ ├── 1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters_test.go
│ │ └── README.md
│ ├── 1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/
│ │ ├── 1579. Remove Max Number of Edges to Keep Graph Fully Traversable.go
│ │ ├── 1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go
│ │ └── README.md
│ ├── 1600.Throne-Inheritance/
│ │ ├── 1600. Throne Inheritance.go
│ │ ├── 1600. Throne Inheritance_test.go
│ │ └── README.md
│ ├── 1603.Design-Parking-System/
│ │ ├── 1603. Design Parking System.go
│ │ ├── 1603. Design Parking System_test.go
│ │ └── README.md
│ ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/
│ │ ├── 1608. Special Array With X Elements Greater Than or Equal X.go
│ │ ├── 1608. Special Array With X Elements Greater Than or Equal X_test.go
│ │ └── README.md
│ ├── 1609.Even-Odd-Tree/
│ │ ├── 1609.Even Odd Tree.go
│ │ ├── 1609.Even Odd Tree_test.go
│ │ └── README.md
│ ├── 1614.Maximum-Nesting-Depth-of-the-Parentheses/
│ │ ├── 1614. Maximum Nesting Depth of the Parentheses.go
│ │ ├── 1614. Maximum Nesting Depth of the Parentheses_test.go
│ │ └── README.md
│ ├── 1619.Mean-of-Array-After-Removing-Some-Elements/
│ │ ├── 1619. Mean of Array After Removing Some Elements.go
│ │ ├── 1619. Mean of Array After Removing Some Elements_test.go
│ │ └── README.md
│ ├── 1624.Largest-Substring-Between-Two-Equal-Characters/
│ │ ├── 1624. Largest Substring Between Two Equal Characters.go
│ │ ├── 1624. Largest Substring Between Two Equal Characters_test.go
│ │ └── README.md
│ ├── 1629.Slowest-Key/
│ │ ├── 1629. Slowest Key.go
│ │ ├── 1629. Slowest Key_test.go
│ │ └── README.md
│ ├── 1631.Path-With-Minimum-Effort/
│ │ ├── 1631. Path With Minimum Effort.go
│ │ ├── 1631. Path With Minimum Effort_test.go
│ │ └── README.md
│ ├── 1636.Sort-Array-by-Increasing-Frequency/
│ │ ├── 1636. Sort Array by Increasing Frequency.go
│ │ ├── 1636. Sort Array by Increasing Frequency_test.go
│ │ └── README.md
│ ├── 1640.Check-Array-Formation-Through-Concatenation/
│ │ ├── 1640. Check Array Formation Through Concatenation.go
│ │ ├── 1640. Check Array Formation Through Concatenation_test.go
│ │ └── README.md
│ ├── 1641.Count-Sorted-Vowel-Strings/
│ │ ├── 1641. Count Sorted Vowel Strings.go
│ │ ├── 1641. Count Sorted Vowel Strings_test.go
│ │ └── README.md
│ ├── 1642.Furthest-Building-You-Can-Reach/
│ │ ├── 1642. Furthest Building You Can Reach.go
│ │ ├── 1642. Furthest Building You Can Reach_test.go
│ │ └── README.md
│ ├── 1646.Get-Maximum-in-Generated-Array/
│ │ ├── 1646. Get Maximum in Generated Array.go
│ │ ├── 1646. Get Maximum in Generated Array_test.go
│ │ └── README.md
│ ├── 1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/
│ │ ├── 1647. Minimum Deletions to Make Character Frequencies Unique.go
│ │ ├── 1647. Minimum Deletions to Make Character Frequencies Unique_test.go
│ │ └── README.md
│ ├── 1648.Sell-Diminishing-Valued-Colored-Balls/
│ │ ├── 1648. Sell Diminishing-Valued Colored Balls.go
│ │ ├── 1648. Sell Diminishing-Valued Colored Balls_test.go
│ │ └── README.md
│ ├── 1649.Create-Sorted-Array-through-Instructions/
│ │ ├── 1649. Create Sorted Array through Instructions.go
│ │ ├── 1649. Create Sorted Array through Instructions_test.go
│ │ └── README.md
│ ├── 1652.Defuse-the-Bomb/
│ │ ├── 1652. Defuse the Bomb.go
│ │ ├── 1652. Defuse the Bomb_test.go
│ │ └── README.md
│ ├── 1653.Minimum-Deletions-to-Make-String-Balanced/
│ │ ├── 1653. Minimum Deletions to Make String Balanced.go
│ │ ├── 1653. Minimum Deletions to Make String Balanced_test.go
│ │ └── README.md
│ ├── 1654.Minimum-Jumps-to-Reach-Home/
│ │ ├── 1654. Minimum Jumps to Reach Home.go
│ │ ├── 1654. Minimum Jumps to Reach Home_test.go
│ │ └── README.md
│ ├── 1655.Distribute-Repeating-Integers/
│ │ ├── 1655. Distribute Repeating Integers.go
│ │ ├── 1655. Distribute Repeating Integers_test.go
│ │ └── README.md
│ ├── 1656.Design-an-Ordered-Stream/
│ │ ├── 1656. Design an Ordered Stream.go
│ │ ├── 1656. Design an Ordered Stream_test.go
│ │ └── README.md
│ ├── 1657.Determine-if-Two-Strings-Are-Close/
│ │ ├── 1657. Determine if Two Strings Are Close.go
│ │ ├── 1657. Determine if Two Strings Are Close_test.go
│ │ └── README.md
│ ├── 1658.Minimum-Operations-to-Reduce-X-to-Zero/
│ │ ├── 1658. Minimum Operations to Reduce X to Zero.go
│ │ ├── 1658. Minimum Operations to Reduce X to Zero_test.go
│ │ └── README.md
│ ├── 1659.Maximize-Grid-Happiness/
│ │ ├── 1659. Maximize Grid Happiness.go
│ │ ├── 1659. Maximize Grid Happiness_test.go
│ │ └── README.md
│ ├── 1662.Check-If-Two-String-Arrays-are-Equivalent/
│ │ ├── 1662. Check If Two String Arrays are Equivalent.go
│ │ ├── 1662. Check If Two String Arrays are Equivalent_test.go
│ │ └── README.md
│ ├── 1663.Smallest-String-With-A-Given-Numeric-Value/
│ │ ├── 1663. Smallest String With A Given Numeric Value.go
│ │ ├── 1663. Smallest String With A Given Numeric Value_test.go
│ │ └── README.md
│ ├── 1664.Ways-to-Make-a-Fair-Array/
│ │ ├── 1664. Ways to Make a Fair Array.go
│ │ ├── 1664. Ways to Make a Fair Array_test.go
│ │ └── README.md
│ ├── 1665.Minimum-Initial-Energy-to-Finish-Tasks/
│ │ ├── 1665. Minimum Initial Energy to Finish Tasks.go
│ │ ├── 1665. Minimum Initial Energy to Finish Tasks_test.go
│ │ └── README.md
│ ├── 1668.Maximum-Repeating-Substring/
│ │ ├── 1668. Maximum Repeating Substring.go
│ │ ├── 1668. Maximum Repeating Substring_test.go
│ │ └── README.md
│ ├── 1669.Merge-In-Between-Linked-Lists/
│ │ ├── 1669. Merge In Between Linked Lists.go
│ │ ├── 1669. Merge In Between Linked Lists_test.go
│ │ └── README.md
│ ├── 1670.Design-Front-Middle-Back-Queue/
│ │ ├── 1670. Design Front Middle Back Queue.go
│ │ ├── 1670. Design Front Middle Back Queue_test.go
│ │ └── README.md
│ ├── 1672.Richest-Customer-Wealth/
│ │ ├── 1672. Richest Customer Wealth.go
│ │ ├── 1672. Richest Customer Wealth_test.go
│ │ └── README.md
│ ├── 1673.Find-the-Most-Competitive-Subsequence/
│ │ ├── 1673. Find the Most Competitive Subsequence.go
│ │ ├── 1673. Find the Most Competitive Subsequence_test.go
│ │ └── README.md
│ ├── 1674.Minimum-Moves-to-Make-Array-Complementary/
│ │ ├── 1674. Minimum Moves to Make Array Complementary.go
│ │ ├── 1674. Minimum Moves to Make Array Complementary_test.go
│ │ └── README.md
│ ├── 1675.Minimize-Deviation-in-Array/
│ │ ├── 1675. Minimize Deviation in Array.go
│ │ ├── 1675. Minimize Deviation in Array_test.go
│ │ └── README.md
│ ├── 1678.Goal-Parser-Interpretation/
│ │ ├── 1678. Goal Parser Interpretation.go
│ │ ├── 1678. Goal Parser Interpretation_test.go
│ │ └── README.md
│ ├── 1679.Max-Number-of-K-Sum-Pairs/
│ │ ├── 1679. Max Number of K-Sum Pairs.go
│ │ ├── 1679. Max Number of K-Sum Pairs_test.go
│ │ └── README.md
│ ├── 1680.Concatenation-of-Consecutive-Binary-Numbers/
│ │ ├── 1680. Concatenation of Consecutive Binary Numbers.go
│ │ ├── 1680. Concatenation of Consecutive Binary Numbers_test.go
│ │ └── README.md
│ ├── 1681.Minimum-Incompatibility/
│ │ ├── 1681. Minimum Incompatibility.go
│ │ ├── 1681. Minimum Incompatibility_test.go
│ │ └── README.md
│ ├── 1684.Count-the-Number-of-Consistent-Strings/
│ │ ├── 1684. Count the Number of Consistent Strings.go
│ │ ├── 1684. Count the Number of Consistent Strings_test.go
│ │ └── README.md
│ ├── 1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/
│ │ ├── 1685. Sum of Absolute Differences in a Sorted Array.go
│ │ ├── 1685. Sum of Absolute Differences in a Sorted Array_test.go
│ │ └── README.md
│ ├── 1688.Count-of-Matches-in-Tournament/
│ │ ├── 1688. Count of Matches in Tournament.go
│ │ ├── 1688. Count of Matches in Tournament_test.go
│ │ └── README.md
│ ├── 1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/
│ │ ├── 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.go
│ │ ├── 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers_test.go
│ │ └── README.md
│ ├── 1690.Stone-Game-VII/
│ │ ├── 1690. Stone Game VII.go
│ │ ├── 1690. Stone Game VII_test.go
│ │ └── README.md
│ ├── 1691.Maximum-Height-by-Stacking-Cuboids/
│ │ ├── 1691. Maximum Height by Stacking Cuboids.go
│ │ ├── 1691. Maximum Height by Stacking Cuboids_test.go
│ │ └── README.md
│ ├── 1694.Reformat-Phone-Number/
│ │ ├── 1694. Reformat Phone Number.go
│ │ ├── 1694. Reformat Phone Number_test.go
│ │ └── README.md
│ ├── 1695.Maximum-Erasure-Value/
│ │ ├── 1695. Maximum Erasure Value.go
│ │ ├── 1695. Maximum Erasure Value_test.go
│ │ └── README.md
│ ├── 1696.Jump-Game-VI/
│ │ ├── 1696. Jump Game VI.go
│ │ ├── 1696. Jump Game VI_test.go
│ │ └── README.md
│ ├── 1700.Number-of-Students-Unable-to-Eat-Lunch/
│ │ ├── 1700. Number of Students Unable to Eat Lunch.go
│ │ ├── 1700. Number of Students Unable to Eat Lunch_test.go
│ │ └── README.md
│ ├── 1704.Determine-if-String-Halves-Are-Alike/
│ │ ├── 1704. Determine if String Halves Are Alike.go
│ │ ├── 1704. Determine if String Halves Are Alike_test.go
│ │ └── README.md
│ ├── 1705.Maximum-Number-of-Eaten-Apples/
│ │ ├── 1705.Maximum Number of Eaten Apples.go
│ │ ├── 1705.Maximum Number of Eaten Apples_test.go
│ │ └── README.md
│ ├── 1710.Maximum-Units-on-a-Truck/
│ │ ├── 1710. Maximum Units on a Truck.go
│ │ ├── 1710. Maximum Units on a Truck_test.go
│ │ └── README.md
│ ├── 1716.Calculate-Money-in-Leetcode-Bank/
│ │ ├── 1716. Calculate Money in Leetcode Bank.go
│ │ ├── 1716. Calculate Money in Leetcode Bank_test.go
│ │ └── README.md
│ ├── 1720.Decode-XORed-Array/
│ │ ├── 1720. Decode XORed Array.go
│ │ ├── 1720. Decode XORed Array_test.go
│ │ └── README.md
│ ├── 1721.Swapping-Nodes-in-a-Linked-List/
│ │ ├── 1721. Swapping Nodes in a Linked List.go
│ │ ├── 1721. Swapping Nodes in a Linked List_test.go
│ │ └── README.md
│ ├── 1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/
│ │ ├── 1725. Number Of Rectangles That Can Form The Largest Square.go
│ │ ├── 1725. Number Of Rectangles That Can Form The Largest Square_test.go
│ │ └── README.md
│ ├── 1732.Find-the-Highest-Altitude/
│ │ ├── 1732. Find the Highest Altitude.go
│ │ ├── 1732. Find the Highest Altitude_test.go
│ │ └── README.md
│ ├── 1734.Decode-XORed-Permutation/
│ │ ├── 1734. Decode XORed Permutation.go
│ │ ├── 1734. Decode XORed Permutation_test.go
│ │ └── README.md
│ ├── 1736.Latest-Time-by-Replacing-Hidden-Digits/
│ │ ├── 1736. Latest Time by Replacing Hidden Digits.go
│ │ ├── 1736. Latest Time by Replacing Hidden Digits_test.go
│ │ └── README.md
│ ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value/
│ │ ├── 1738. Find Kth Largest XOR Coordinate Value.go
│ │ ├── 1738. Find Kth Largest XOR Coordinate Value_test.go
│ │ └── README.md
│ ├── 1742.Maximum-Number-of-Balls-in-a-Box/
│ │ ├── 1742. Maximum Number of Balls in a Box.go
│ │ ├── 1742. Maximum Number of Balls in a Box_test.go
│ │ └── README.md
│ ├── 1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/
│ │ ├── 1744. Can You Eat Your Favorite Candy on Your Favorite Day.go
│ │ ├── 1744. Can You Eat Your Favorite Candy on Your Favorite Day_test.go
│ │ └── README.md
│ ├── 1748.Sum-of-Unique-Elements/
│ │ ├── 1748. Sum of Unique Elements.go
│ │ ├── 1748. Sum of Unique Elements_test.go
│ │ └── README.md
│ ├── 1752.Check-if-Array-Is-Sorted-and-Rotated/
│ │ ├── 1752. Check if Array Is Sorted and Rotated.go
│ │ ├── 1752. Check if Array Is Sorted and Rotated_test.go
│ │ └── README.md
│ ├── 1758.Minimum-Changes-To-Make-Alternating-Binary-String/
│ │ ├── 1758. Minimum Changes To Make Alternating Binary String.go
│ │ ├── 1758. Minimum Changes To Make Alternating Binary String_test.go
│ │ └── README.md
│ ├── 1763.Longest-Nice-Substring/
│ │ ├── 1763. Longest Nice Substring.go
│ │ ├── 1763. Longest Nice Substring_test.go
│ │ └── README.md
│ ├── 1791.Find-Center-of-Star-Graph/
│ │ ├── 1791.Find Center of Star Graph.go
│ │ ├── 1791.Find Center of Star Graph_test.go
│ │ └── README.md
│ ├── 1816.Truncate-Sentence/
│ │ ├── 1816.Truncate Sentence.go
│ │ ├── 1816.Truncate Sentence_test.go
│ │ └── README.md
│ ├── 1818.Minimum-Absolute-Sum-Difference/
│ │ ├── 1818. Minimum Absolute Sum Difference.go
│ │ ├── 1818. Minimum Absolute Sum Difference_test.go
│ │ └── README.md
│ ├── 1846.Maximum-Element-After-Decreasing-and-Rearranging/
│ │ ├── 1846. Maximum Element After Decreasing and Rearranging.go
│ │ ├── 1846. Maximum Element After Decreasing and Rearranging_test.go
│ │ └── README.md
│ ├── 1877.Minimize-Maximum-Pair-Sum-in-Array/
│ │ ├── 1877. Minimize Maximum Pair Sum in Array.go
│ │ ├── 1877. Minimize Maximum Pair Sum in Array_test.go
│ │ └── README.md
│ ├── 1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/
│ │ ├── 1984.Minimum Difference Between Highest and Lowest of K Scores.go
│ │ ├── 1984.Minimum Difference Between Highest and Lowest of K Scores_test.go
│ │ └── README.md
│ ├── 2021.Brightest-Position-on-Street/
│ │ ├── 2021. Brightest Position on Street.go
│ │ ├── 2021. Brightest Position on Street_test.go
│ │ └── README.md
│ ├── 2022.Convert-1D-Array-Into-2D-Array/
│ │ ├── 2022. Convert 1D Array Into 2D Array.go
│ │ ├── 2022. Convert 1D Array Into 2D Array_test.go
│ │ └── README.md
│ ├── 2037.Minimum-Number-of-Moves-to-Seat-Everyone/
│ │ ├── 2037.Minimum Number of Moves to Seat Everyone.go
│ │ ├── 2037.Minimum Number of Moves to Seat Everyone_test.go
│ │ └── README.md
│ ├── 2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/
│ │ ├── 2038.Remove Colored Pieces if Both Neighbors are the Same Color.go
│ │ ├── 2038.Remove Colored Pieces if Both Neighbors are the Same Color_test.go
│ │ └── README.md
│ ├── 2043.Simple-Bank-System/
│ │ ├── 2043.Simple Bank System.go
│ │ ├── 2043.Simple Bank System_test.go
│ │ └── README.md
│ ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/
│ │ ├── 2096. Step-By-Step Directions From a Binary Tree Node to Another.go
│ │ ├── 2096. Step-By-Step Directions From a Binary Tree Node to Another_test.go
│ │ └── README.md
│ ├── 2164.Sort-Even-and-Odd-Indices-Independently/
│ │ ├── 2164. Sort Even and Odd Indices Independently.go
│ │ ├── 2164. Sort Even and Odd Indices Independently_test.go
│ │ └── README.md
│ ├── 2165.Smallest-Value-of-the-Rearranged-Number/
│ │ ├── 2165. Smallest Value of the Rearranged Number.go
│ │ ├── 2165. Smallest Value of the Rearranged Number_test.go
│ │ └── README.md
│ ├── 2166.Design-Bitset/
│ │ ├── 2166. Design Bitset.go
│ │ ├── 2166. Design Bitset_test.go
│ │ └── README.md
│ ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/
│ │ ├── 2167. Minimum Time to Remove All Cars Containing Illegal Goods.go
│ │ ├── 2167. Minimum Time to Remove All Cars Containing Illegal Goods_test.go
│ │ └── README.md
│ ├── 2169.Count-Operations-to-Obtain-Zero/
│ │ ├── 2169. Count Operations to Obtain Zero.go
│ │ ├── 2169. Count Operations to Obtain Zero_test.go
│ │ └── README.md
│ ├── 2170.Minimum-Operations-to-Make-the-Array-Alternating/
│ │ ├── 2170. Minimum Operations to Make the Array Alternating.go
│ │ ├── 2170. Minimum Operations to Make the Array Alternating_test.go
│ │ └── README.md
│ ├── 2171.Removing-Minimum-Number-of-Magic-Beans/
│ │ ├── 2171. Removing Minimum Number of Magic Beans.go
│ │ ├── 2171. Removing Minimum Number of Magic Beans_test.go
│ │ └── README.md
│ ├── 2180.Count-Integers-With-Even-Digit-Sum/
│ │ ├── 2180. Count Integers With Even Digit Sum.go
│ │ ├── 2180. Count Integers With Even Digit Sum_test.go
│ │ └── README.md
│ ├── 2181.Merge-Nodes-in-Between-Zeros/
│ │ ├── 2181. Merge Nodes in Between Zeros.go
│ │ ├── 2181. Merge Nodes in Between Zeros_test.go
│ │ └── README.md
│ ├── 2182.Construct-String-With-Repeat-Limit/
│ │ ├── 2182. Construct String With Repeat Limit.go
│ │ ├── 2182. Construct String With Repeat Limit_test.go
│ │ └── README.md
│ ├── 2183.Count-Array-Pairs-Divisible-by-K/
│ │ ├── 2183. Count Array Pairs Divisible by K.go
│ │ ├── 2183. Count Array Pairs Divisible by K_test.go
│ │ └── README.md
│ ├── 9990085.Maximal-Rectangle/
│ │ ├── 85. Maximal Rectangle.go
│ │ └── 85. Maximal Rectangle_test.go
│ ├── 9990132.Palindrome-Partitioning-II/
│ │ ├── 132. Palindrome Partitioning II.go
│ │ └── 132. Palindrome Partitioning II_test.go
│ ├── 9990316.Remove-Duplicate-Letters/
│ │ ├── 316. Remove Duplicate Letters.go
│ │ └── 316. Remove Duplicate Letters_test.go
│ ├── 9990352.Data-Stream-as-Disjoint-Intervals/
│ │ ├── 352. Data Stream as Disjoint Intervals.go
│ │ └── 352. Data Stream as Disjoint Intervals_test.go
│ ├── 9990363.Max-Sum-of-Rectangle-No-Larger-Than-K/
│ │ ├── 363. Max Sum of Rectangle No Larger Than K.go
│ │ └── 363. Max Sum of Rectangle No Larger Than K_test.go
│ ├── 9990975.Odd-Even-Jump/
│ │ ├── 975. Odd Even Jump.go
│ │ └── 975. Odd Even Jump_test.go
│ ├── 9991044.Longest-Duplicate-Substring/
│ │ ├── 1044. Longest Duplicate Substring.go
│ │ └── 1044. Longest Duplicate Substring_test.go
│ └── 9991292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/
│ ├── 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold.go
│ └── 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold_test.go
├── note/
│ ├── grokking_algorithms.md
│ └── time_complexity.md
├── structures/
│ ├── Heap.go
│ ├── Heap_test.go
│ ├── Interval.go
│ ├── Interval_test.go
│ ├── ListNode.go
│ ├── ListNode_test.go
│ ├── NestedInteger.go
│ ├── NestedInterger_test.go
│ ├── Point.go
│ ├── Point_test.go
│ ├── PriorityQueue.go
│ ├── PriorityQueue_test.go
│ ├── Queue.go
│ ├── Queue_test.go
│ ├── Stack.go
│ ├── Stack_test.go
│ ├── TreeNode.go
│ ├── TreeNode_test.go
│ ├── go.mod
│ └── go.sum
├── template/
│ ├── BIT.go
│ ├── BIT_test.go
│ ├── CLRUCache.go
│ ├── CLRUCache_test.go
│ ├── LFUCache.go
│ ├── LRUCache.go
│ ├── SegmentTree.go
│ ├── UnionFind.go
│ ├── bucket.go
│ ├── go.mod
│ └── go.sum
└── website/
├── archetypes/
│ └── default.md
├── content/
│ ├── ChapterFour/
│ │ ├── 0001~0099/
│ │ │ ├── 0001.Two-Sum.md
│ │ │ ├── 0002.Add-Two-Numbers.md
│ │ │ ├── 0003.Longest-Substring-Without-Repeating-Characters.md
│ │ │ ├── 0004.Median-of-Two-Sorted-Arrays.md
│ │ │ ├── 0005.Longest-Palindromic-Substring.md
│ │ │ ├── 0006.ZigZag-Conversion.md
│ │ │ ├── 0007.Reverse-Integer.md
│ │ │ ├── 0008.String-to-Integer-atoi.md
│ │ │ ├── 0009.Palindrome-Number.md
│ │ │ ├── 0011.Container-With-Most-Water.md
│ │ │ ├── 0012.Integer-to-Roman.md
│ │ │ ├── 0013.Roman-to-Integer.md
│ │ │ ├── 0014.Longest-Common-Prefix.md
│ │ │ ├── 0015.3Sum.md
│ │ │ ├── 0016.3Sum-Closest.md
│ │ │ ├── 0017.Letter-Combinations-of-a-Phone-Number.md
│ │ │ ├── 0018.4Sum.md
│ │ │ ├── 0019.Remove-Nth-Node-From-End-of-List.md
│ │ │ ├── 0020.Valid-Parentheses.md
│ │ │ ├── 0021.Merge-Two-Sorted-Lists.md
│ │ │ ├── 0022.Generate-Parentheses.md
│ │ │ ├── 0023.Merge-k-Sorted-Lists.md
│ │ │ ├── 0024.Swap-Nodes-in-Pairs.md
│ │ │ ├── 0025.Reverse-Nodes-in-k-Group.md
│ │ │ ├── 0026.Remove-Duplicates-from-Sorted-Array.md
│ │ │ ├── 0027.Remove-Element.md
│ │ │ ├── 0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
│ │ │ ├── 0029.Divide-Two-Integers.md
│ │ │ ├── 0030.Substring-with-Concatenation-of-All-Words.md
│ │ │ ├── 0031.Next-Permutation.md
│ │ │ ├── 0032.Longest-Valid-Parentheses.md
│ │ │ ├── 0033.Search-in-Rotated-Sorted-Array.md
│ │ │ ├── 0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
│ │ │ ├── 0035.Search-Insert-Position.md
│ │ │ ├── 0036.Valid-Sudoku.md
│ │ │ ├── 0037.Sudoku-Solver.md
│ │ │ ├── 0039.Combination-Sum.md
│ │ │ ├── 0040.Combination-Sum-II.md
│ │ │ ├── 0041.First-Missing-Positive.md
│ │ │ ├── 0042.Trapping-Rain-Water.md
│ │ │ ├── 0043.Multiply-Strings.md
│ │ │ ├── 0045.Jump-Game-II.md
│ │ │ ├── 0046.Permutations.md
│ │ │ ├── 0047.Permutations-II.md
│ │ │ ├── 0048.Rotate-Image.md
│ │ │ ├── 0049.Group-Anagrams.md
│ │ │ ├── 0050.Powx-n.md
│ │ │ ├── 0051.N-Queens.md
│ │ │ ├── 0052.N-Queens-II.md
│ │ │ ├── 0053.Maximum-Subarray.md
│ │ │ ├── 0054.Spiral-Matrix.md
│ │ │ ├── 0055.Jump-Game.md
│ │ │ ├── 0056.Merge-Intervals.md
│ │ │ ├── 0057.Insert-Interval.md
│ │ │ ├── 0058.Length-of-Last-Word.md
│ │ │ ├── 0059.Spiral-Matrix-II.md
│ │ │ ├── 0060.Permutation-Sequence.md
│ │ │ ├── 0061.Rotate-List.md
│ │ │ ├── 0062.Unique-Paths.md
│ │ │ ├── 0063.Unique-Paths-II.md
│ │ │ ├── 0064.Minimum-Path-Sum.md
│ │ │ ├── 0065.Valid-Number.md
│ │ │ ├── 0066.Plus-One.md
│ │ │ ├── 0067.Add-Binary.md
│ │ │ ├── 0069.Sqrtx.md
│ │ │ ├── 0070.Climbing-Stairs.md
│ │ │ ├── 0071.Simplify-Path.md
│ │ │ ├── 0073.Set-Matrix-Zeroes.md
│ │ │ ├── 0074.Search-a-2D-Matrix.md
│ │ │ ├── 0075.Sort-Colors.md
│ │ │ ├── 0076.Minimum-Window-Substring.md
│ │ │ ├── 0077.Combinations.md
│ │ │ ├── 0078.Subsets.md
│ │ │ ├── 0079.Word-Search.md
│ │ │ ├── 0080.Remove-Duplicates-from-Sorted-Array-II.md
│ │ │ ├── 0081.Search-in-Rotated-Sorted-Array-II.md
│ │ │ ├── 0082.Remove-Duplicates-from-Sorted-List-II.md
│ │ │ ├── 0083.Remove-Duplicates-from-Sorted-List.md
│ │ │ ├── 0084.Largest-Rectangle-in-Histogram.md
│ │ │ ├── 0086.Partition-List.md
│ │ │ ├── 0088.Merge-Sorted-Array.md
│ │ │ ├── 0089.Gray-Code.md
│ │ │ ├── 0090.Subsets-II.md
│ │ │ ├── 0091.Decode-Ways.md
│ │ │ ├── 0092.Reverse-Linked-List-II.md
│ │ │ ├── 0093.Restore-IP-Addresses.md
│ │ │ ├── 0094.Binary-Tree-Inorder-Traversal.md
│ │ │ ├── 0095.Unique-Binary-Search-Trees-II.md
│ │ │ ├── 0096.Unique-Binary-Search-Trees.md
│ │ │ ├── 0097.Interleaving-String.md
│ │ │ ├── 0098.Validate-Binary-Search-Tree.md
│ │ │ ├── 0099.Recover-Binary-Search-Tree.md
│ │ │ └── _index.md
│ │ ├── 0100~0199/
│ │ │ ├── 0100.Same-Tree.md
│ │ │ ├── 0101.Symmetric-Tree.md
│ │ │ ├── 0102.Binary-Tree-Level-Order-Traversal.md
│ │ │ ├── 0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
│ │ │ ├── 0104.Maximum-Depth-of-Binary-Tree.md
│ │ │ ├── 0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
│ │ │ ├── 0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
│ │ │ ├── 0107.Binary-Tree-Level-Order-Traversal-II.md
│ │ │ ├── 0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
│ │ │ ├── 0109.Convert-Sorted-List-to-Binary-Search-Tree.md
│ │ │ ├── 0110.Balanced-Binary-Tree.md
│ │ │ ├── 0111.Minimum-Depth-of-Binary-Tree.md
│ │ │ ├── 0112.Path-Sum.md
│ │ │ ├── 0113.Path-Sum-II.md
│ │ │ ├── 0114.Flatten-Binary-Tree-to-Linked-List.md
│ │ │ ├── 0115.Distinct-Subsequences.md
│ │ │ ├── 0116.Populating-Next-Right-Pointers-in-Each-Node.md
│ │ │ ├── 0118.Pascals-Triangle.md
│ │ │ ├── 0119.Pascals-Triangle-II.md
│ │ │ ├── 0120.Triangle.md
│ │ │ ├── 0121.Best-Time-to-Buy-and-Sell-Stock.md
│ │ │ ├── 0122.Best-Time-to-Buy-and-Sell-Stock-II.md
│ │ │ ├── 0124.Binary-Tree-Maximum-Path-Sum.md
│ │ │ ├── 0125.Valid-Palindrome.md
│ │ │ ├── 0126.Word-Ladder-II.md
│ │ │ ├── 0127.Word-Ladder.md
│ │ │ ├── 0128.Longest-Consecutive-Sequence.md
│ │ │ ├── 0129.Sum-Root-to-Leaf-Numbers.md
│ │ │ ├── 0130.Surrounded-Regions.md
│ │ │ ├── 0131.Palindrome-Partitioning.md
│ │ │ ├── 0135.Candy.md
│ │ │ ├── 0136.Single-Number.md
│ │ │ ├── 0137.Single-Number-II.md
│ │ │ ├── 0138.Copy-List-With-Random-Pointer.md
│ │ │ ├── 0141.Linked-List-Cycle.md
│ │ │ ├── 0142.Linked-List-Cycle-II.md
│ │ │ ├── 0143.Reorder-List.md
│ │ │ ├── 0144.Binary-Tree-Preorder-Traversal.md
│ │ │ ├── 0145.Binary-Tree-Postorder-Traversal.md
│ │ │ ├── 0146.LRU-Cache.md
│ │ │ ├── 0147.Insertion-Sort-List.md
│ │ │ ├── 0148.Sort-List.md
│ │ │ ├── 0150.Evaluate-Reverse-Polish-Notation.md
│ │ │ ├── 0151.Reverse-Words-in-a-String.md
│ │ │ ├── 0152.Maximum-Product-Subarray.md
│ │ │ ├── 0153.Find-Minimum-in-Rotated-Sorted-Array.md
│ │ │ ├── 0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
│ │ │ ├── 0155.Min-Stack.md
│ │ │ ├── 0160.Intersection-of-Two-Linked-Lists.md
│ │ │ ├── 0162.Find-Peak-Element.md
│ │ │ ├── 0164.Maximum-Gap.md
│ │ │ ├── 0167.Two-Sum-II-Input-array-is-sorted.md
│ │ │ ├── 0168.Excel-Sheet-Column-Title.md
│ │ │ ├── 0169.Majority-Element.md
│ │ │ ├── 0171.Excel-Sheet-Column-Number.md
│ │ │ ├── 0172.Factorial-Trailing-Zeroes.md
│ │ │ ├── 0173.Binary-Search-Tree-Iterator.md
│ │ │ ├── 0174.Dungeon-Game.md
│ │ │ ├── 0179.Largest-Number.md
│ │ │ ├── 0187.Repeated-DNA-Sequences.md
│ │ │ ├── 0189.Rotate-Array.md
│ │ │ ├── 0190.Reverse-Bits.md
│ │ │ ├── 0191.Number-of-1-Bits.md
│ │ │ ├── 0198.House-Robber.md
│ │ │ ├── 0199.Binary-Tree-Right-Side-View.md
│ │ │ └── _index.md
│ │ ├── 0200~0299/
│ │ │ ├── 0200.Number-of-Islands.md
│ │ │ ├── 0201.Bitwise-AND-of-Numbers-Range.md
│ │ │ ├── 0202.Happy-Number.md
│ │ │ ├── 0203.Remove-Linked-List-Elements.md
│ │ │ ├── 0204.Count-Primes.md
│ │ │ ├── 0205.Isomorphic-Strings.md
│ │ │ ├── 0206.Reverse-Linked-List.md
│ │ │ ├── 0207.Course-Schedule.md
│ │ │ ├── 0208.Implement-Trie-Prefix-Tree.md
│ │ │ ├── 0209.Minimum-Size-Subarray-Sum.md
│ │ │ ├── 0210.Course-Schedule-II.md
│ │ │ ├── 0211.Design-Add-and-Search-Words-Data-Structure.md
│ │ │ ├── 0212.Word-Search-II.md
│ │ │ ├── 0213.House-Robber-II.md
│ │ │ ├── 0215.Kth-Largest-Element-in-an-Array.md
│ │ │ ├── 0216.Combination-Sum-III.md
│ │ │ ├── 0217.Contains-Duplicate.md
│ │ │ ├── 0218.The-Skyline-Problem.md
│ │ │ ├── 0219.Contains-Duplicate-II.md
│ │ │ ├── 0220.Contains-Duplicate-III.md
│ │ │ ├── 0222.Count-Complete-Tree-Nodes.md
│ │ │ ├── 0223.Rectangle-Area.md
│ │ │ ├── 0224.Basic-Calculator.md
│ │ │ ├── 0225.Implement-Stack-using-Queues.md
│ │ │ ├── 0226.Invert-Binary-Tree.md
│ │ │ ├── 0227.Basic-Calculator-II.md
│ │ │ ├── 0228.Summary-Ranges.md
│ │ │ ├── 0229.Majority-Element-II.md
│ │ │ ├── 0230.Kth-Smallest-Element-in-a-BST.md
│ │ │ ├── 0231.Power-of-Two.md
│ │ │ ├── 0232.Implement-Queue-using-Stacks.md
│ │ │ ├── 0234.Palindrome-Linked-List.md
│ │ │ ├── 0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
│ │ │ ├── 0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
│ │ │ ├── 0237.Delete-Node-in-a-Linked-List.md
│ │ │ ├── 0239.Sliding-Window-Maximum.md
│ │ │ ├── 0240.Search-a-2D-Matrix-II.md
│ │ │ ├── 0242.Valid-Anagram.md
│ │ │ ├── 0257.Binary-Tree-Paths.md
│ │ │ ├── 0258.Add-Digits.md
│ │ │ ├── 0260.Single-Number-III.md
│ │ │ ├── 0263.Ugly-Number.md
│ │ │ ├── 0264.Ugly-Number-II.md
│ │ │ ├── 0268.Missing-Number.md
│ │ │ ├── 0274.H-Index.md
│ │ │ ├── 0275.H-Index-II.md
│ │ │ ├── 0278.First-Bad-Version.md
│ │ │ ├── 0279.Perfect-Squares.md
│ │ │ ├── 0283.Move-Zeroes.md
│ │ │ ├── 0284.Peeking-Iterator.md
│ │ │ ├── 0287.Find-the-Duplicate-Number.md
│ │ │ ├── 0290.Word-Pattern.md
│ │ │ ├── 0297.Serialize-and-Deserialize-Binary-Tree.md
│ │ │ ├── 0299.Bulls-and-Cows.md
│ │ │ └── _index.md
│ │ ├── 0300~0399/
│ │ │ ├── 0300.Longest-Increasing-Subsequence.md
│ │ │ ├── 0301.Remove-Invalid-Parentheses.md
│ │ │ ├── 0303.Range-Sum-Query-Immutable.md
│ │ │ ├── 0304.Range-Sum-Query-2D-Immutable.md
│ │ │ ├── 0306.Additive-Number.md
│ │ │ ├── 0307.Range-Sum-Query-Mutable.md
│ │ │ ├── 0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
│ │ │ ├── 0315.Count-of-Smaller-Numbers-After-Self.md
│ │ │ ├── 0318.Maximum-Product-of-Word-Lengths.md
│ │ │ ├── 0319.Bulb-Switcher.md
│ │ │ ├── 0322.Coin-Change.md
│ │ │ ├── 0324.Wiggle-Sort-II.md
│ │ │ ├── 0326.Power-of-Three.md
│ │ │ ├── 0327.Count-of-Range-Sum.md
│ │ │ ├── 0328.Odd-Even-Linked-List.md
│ │ │ ├── 0329.Longest-Increasing-Path-in-a-Matrix.md
│ │ │ ├── 0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
│ │ │ ├── 0337.House-Robber-III.md
│ │ │ ├── 0338.Counting-Bits.md
│ │ │ ├── 0341.Flatten-Nested-List-Iterator.md
│ │ │ ├── 0342.Power-of-Four.md
│ │ │ ├── 0343.Integer-Break.md
│ │ │ ├── 0344.Reverse-String.md
│ │ │ ├── 0345.Reverse-Vowels-of-a-String.md
│ │ │ ├── 0347.Top-K-Frequent-Elements.md
│ │ │ ├── 0349.Intersection-of-Two-Arrays.md
│ │ │ ├── 0350.Intersection-of-Two-Arrays-II.md
│ │ │ ├── 0352.Data-Stream-as-Disjoint-Intervals.md
│ │ │ ├── 0354.Russian-Doll-Envelopes.md
│ │ │ ├── 0357.Count-Numbers-with-Unique-Digits.md
│ │ │ ├── 0367.Valid-Perfect-Square.md
│ │ │ ├── 0368.Largest-Divisible-Subset.md
│ │ │ ├── 0371.Sum-of-Two-Integers.md
│ │ │ ├── 0372.Super-Pow.md
│ │ │ ├── 0373.Find-K-Pairs-with-Smallest-Sums.md
│ │ │ ├── 0374.Guess-Number-Higher-or-Lower.md
│ │ │ ├── 0376.Wiggle-Subsequence.md
│ │ │ ├── 0377.Combination-Sum-IV.md
│ │ │ ├── 0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
│ │ │ ├── 0382.Linked-List-Random-Node.md
│ │ │ ├── 0383.Ransom-Note.md
│ │ │ ├── 0384.Shuffle-an-Array.md
│ │ │ ├── 0385.Mini-Parser.md
│ │ │ ├── 0386.Lexicographical-Numbers.md
│ │ │ ├── 0387.First-Unique-Character-in-a-String.md
│ │ │ ├── 0389.Find-the-Difference.md
│ │ │ ├── 0390.Elimination-Game.md
│ │ │ ├── 0391.Perfect-Rectangle.md
│ │ │ ├── 0392.Is-Subsequence.md
│ │ │ ├── 0393.UTF-8-Validation.md
│ │ │ ├── 0394.Decode-String.md
│ │ │ ├── 0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
│ │ │ ├── 0396.Rotate-Function.md
│ │ │ ├── 0397.Integer-Replacement.md
│ │ │ ├── 0399.Evaluate-Division.md
│ │ │ └── _index.md
│ │ ├── 0400~0499/
│ │ │ ├── 0400.Nth-Digit.md
│ │ │ ├── 0401.Binary-Watch.md
│ │ │ ├── 0402.Remove-K-Digits.md
│ │ │ ├── 0404.Sum-of-Left-Leaves.md
│ │ │ ├── 0405.Convert-a-Number-to-Hexadecimal.md
│ │ │ ├── 0409.Longest-Palindrome.md
│ │ │ ├── 0410.Split-Array-Largest-Sum.md
│ │ │ ├── 0412.Fizz-Buzz.md
│ │ │ ├── 0413.Arithmetic-Slices.md
│ │ │ ├── 0414.Third-Maximum-Number.md
│ │ │ ├── 0416.Partition-Equal-Subset-Sum.md
│ │ │ ├── 0417.Pacific-Atlantic-Water-Flow.md
│ │ │ ├── 0419.Battleships-in-a-Board.md
│ │ │ ├── 0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
│ │ │ ├── 0423.Reconstruct-Original-Digits-from-English.md
│ │ │ ├── 0424.Longest-Repeating-Character-Replacement.md
│ │ │ ├── 0429.N-ary-Tree-Level-Order-Traversal.md
│ │ │ ├── 0433.Minimum-Genetic-Mutation.md
│ │ │ ├── 0434.Number-of-Segments-in-a-String.md
│ │ │ ├── 0435.Non-overlapping-Intervals.md
│ │ │ ├── 0436.Find-Right-Interval.md
│ │ │ ├── 0437.Path-Sum-III.md
│ │ │ ├── 0438.Find-All-Anagrams-in-a-String.md
│ │ │ ├── 0441.Arranging-Coins.md
│ │ │ ├── 0445.Add-Two-Numbers-II.md
│ │ │ ├── 0447.Number-of-Boomerangs.md
│ │ │ ├── 0448.Find-All-Numbers-Disappeared-in-an-Array.md
│ │ │ ├── 0451.Sort-Characters-By-Frequency.md
│ │ │ ├── 0453.Minimum-Moves-to-Equal-Array-Elements.md
│ │ │ ├── 0454.4Sum-II.md
│ │ │ ├── 0455.Assign-Cookies.md
│ │ │ ├── 0456.132-Pattern.md
│ │ │ ├── 0457.Circular-Array-Loop.md
│ │ │ ├── 0458.Poor-Pigs.md
│ │ │ ├── 0460.LFU-Cache.md
│ │ │ ├── 0461.Hamming-Distance.md
│ │ │ ├── 0462.Minimum-Moves-to-Equal-Array-Elements-II.md
│ │ │ ├── 0463.Island-Perimeter.md
│ │ │ ├── 0470.Implement-Rand10-Using-Rand7.md
│ │ │ ├── 0473.Matchsticks-to-Square.md
│ │ │ ├── 0474.Ones-and-Zeroes.md
│ │ │ ├── 0475.Heaters.md
│ │ │ ├── 0476.Number-Complement.md
│ │ │ ├── 0477.Total-Hamming-Distance.md
│ │ │ ├── 0478.Generate-Random-Point-in-a-Circle.md
│ │ │ ├── 0480.Sliding-Window-Median.md
│ │ │ ├── 0483.Smallest-Good-Base.md
│ │ │ ├── 0485.Max-Consecutive-Ones.md
│ │ │ ├── 0488.Zuma-Game.md
│ │ │ ├── 0491.Non-decreasing-Subsequences.md
│ │ │ ├── 0492.Construct-the-Rectangle.md
│ │ │ ├── 0493.Reverse-Pairs.md
│ │ │ ├── 0494.Target-Sum.md
│ │ │ ├── 0495.Teemo-Attacking.md
│ │ │ ├── 0496.Next-Greater-Element-I.md
│ │ │ ├── 0497.Random-Point-in-Non-overlapping-Rectangles.md
│ │ │ ├── 0498.Diagonal-Traverse.md
│ │ │ └── _index.md
│ │ ├── 0500~0599/
│ │ │ ├── 0500.Keyboard-Row.md
│ │ │ ├── 0503.Next-Greater-Element-II.md
│ │ │ ├── 0504.Base-7.md
│ │ │ ├── 0506.Relative-Ranks.md
│ │ │ ├── 0507.Perfect-Number.md
│ │ │ ├── 0508.Most-Frequent-Subtree-Sum.md
│ │ │ ├── 0509.Fibonacci-Number.md
│ │ │ ├── 0513.Find-Bottom-Left-Tree-Value.md
│ │ │ ├── 0515.Find-Largest-Value-in-Each-Tree-Row.md
│ │ │ ├── 0518.Coin-Change-II.md
│ │ │ ├── 0519.Random-Flip-Matrix.md
│ │ │ ├── 0520.Detect-Capital.md
│ │ │ ├── 0523.Continuous-Subarray-Sum.md
│ │ │ ├── 0524.Longest-Word-in-Dictionary-through-Deleting.md
│ │ │ ├── 0525.Contiguous-Array.md
│ │ │ ├── 0526.Beautiful-Arrangement.md
│ │ │ ├── 0528.Random-Pick-with-Weight.md
│ │ │ ├── 0529.Minesweeper.md
│ │ │ ├── 0530.Minimum-Absolute-Difference-in-BST.md
│ │ │ ├── 0532.K-diff-Pairs-in-an-Array.md
│ │ │ ├── 0535.Encode-and-Decode-TinyURL.md
│ │ │ ├── 0537.Complex-Number-Multiplication.md
│ │ │ ├── 0538.Convert-BST-to-Greater-Tree.md
│ │ │ ├── 0540.Single-Element-in-a-Sorted-Array.md
│ │ │ ├── 0541.Reverse-String-II.md
│ │ │ ├── 0542.01-Matrix.md
│ │ │ ├── 0543.Diameter-of-Binary-Tree.md
│ │ │ ├── 0547.Number-of-Provinces.md
│ │ │ ├── 0551.Student-Attendance-Record-I.md
│ │ │ ├── 0554.Brick-Wall.md
│ │ │ ├── 0557.Reverse-Words-in-a-String-III.md
│ │ │ ├── 0559.Maximum-Depth-of-N-ary-Tree.md
│ │ │ ├── 0560.Subarray-Sum-Equals-K.md
│ │ │ ├── 0561.Array-Partition.md
│ │ │ ├── 0563.Binary-Tree-Tilt.md
│ │ │ ├── 0566.Reshape-the-Matrix.md
│ │ │ ├── 0567.Permutation-in-String.md
│ │ │ ├── 0572.Subtree-of-Another-Tree.md
│ │ │ ├── 0575.Distribute-Candies.md
│ │ │ ├── 0576.Out-of-Boundary-Paths.md
│ │ │ ├── 0581.Shortest-Unsorted-Continuous-Subarray.md
│ │ │ ├── 0583.Delete-Operation-for-Two-Strings.md
│ │ │ ├── 0589.N-ary-Tree-Preorder-Traversal.md
│ │ │ ├── 0594.Longest-Harmonious-Subsequence.md
│ │ │ ├── 0598.Range-Addition-II.md
│ │ │ ├── 0599.Minimum-Index-Sum-of-Two-Lists.md
│ │ │ └── _index.md
│ │ ├── 0600~0699/
│ │ │ ├── 0605.Can-Place-Flowers.md
│ │ │ ├── 0609.Find-Duplicate-File-in-System.md
│ │ │ ├── 0611.Valid-Triangle-Number.md
│ │ │ ├── 0617.Merge-Two-Binary-Trees.md
│ │ │ ├── 0622.Design-Circular-Queue.md
│ │ │ ├── 0623.Add-One-Row-to-Tree.md
│ │ │ ├── 0628.Maximum-Product-of-Three-Numbers.md
│ │ │ ├── 0630.Course-Schedule-III.md
│ │ │ ├── 0632.Smallest-Range-Covering-Elements-from-K-Lists.md
│ │ │ ├── 0633.Sum-of-Square-Numbers.md
│ │ │ ├── 0636.Exclusive-Time-of-Functions.md
│ │ │ ├── 0637.Average-of-Levels-in-Binary-Tree.md
│ │ │ ├── 0638.Shopping-Offers.md
│ │ │ ├── 0643.Maximum-Average-Subarray-I.md
│ │ │ ├── 0645.Set-Mismatch.md
│ │ │ ├── 0647.Palindromic-Substrings.md
│ │ │ ├── 0648.Replace-Words.md
│ │ │ ├── 0653.Two-Sum-IV-Input-is-a-BST.md
│ │ │ ├── 0658.Find-K-Closest-Elements.md
│ │ │ ├── 0661.Image-Smoother.md
│ │ │ ├── 0662.Maximum-Width-of-Binary-Tree.md
│ │ │ ├── 0665.Non-decreasing-Array.md
│ │ │ ├── 0667.Beautiful-Arrangement-II.md
│ │ │ ├── 0668.Kth-Smallest-Number-in-Multiplication-Table.md
│ │ │ ├── 0669.Trim-a-Binary-Search-Tree.md
│ │ │ ├── 0674.Longest-Continuous-Increasing-Subsequence.md
│ │ │ ├── 0676.Implement-Magic-Dictionary.md
│ │ │ ├── 0677.Map-Sum-Pairs.md
│ │ │ ├── 0682.Baseball-Game.md
│ │ │ ├── 0684.Redundant-Connection.md
│ │ │ ├── 0685.Redundant-Connection-II.md
│ │ │ ├── 0690.Employee-Importance.md
│ │ │ ├── 0692.Top-K-Frequent-Words.md
│ │ │ ├── 0693.Binary-Number-with-Alternating-Bits.md
│ │ │ ├── 0695.Max-Area-of-Island.md
│ │ │ ├── 0696.Count-Binary-Substrings.md
│ │ │ ├── 0697.Degree-of-an-Array.md
│ │ │ ├── 0699.Falling-Squares.md
│ │ │ └── _index.md
│ │ ├── 0700~0799/
│ │ │ ├── 0700.Search-in-a-Binary-Search-Tree.md
│ │ │ ├── 0701.Insert-into-a-Binary-Search-Tree.md
│ │ │ ├── 0703.Kth-Largest-Element-in-a-Stream.md
│ │ │ ├── 0704.Binary-Search.md
│ │ │ ├── 0705.Design-HashSet.md
│ │ │ ├── 0706.Design-HashMap.md
│ │ │ ├── 0707.Design-Linked-List.md
│ │ │ ├── 0709.To-Lower-Case.md
│ │ │ ├── 0710.Random-Pick-with-Blacklist.md
│ │ │ ├── 0713.Subarray-Product-Less-Than-K.md
│ │ │ ├── 0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
│ │ │ ├── 0715.Range-Module.md
│ │ │ ├── 0717.1-bit-and-2-bit-Characters.md
│ │ │ ├── 0718.Maximum-Length-of-Repeated-Subarray.md
│ │ │ ├── 0719.Find-K-th-Smallest-Pair-Distance.md
│ │ │ ├── 0720.Longest-Word-in-Dictionary.md
│ │ │ ├── 0721.Accounts-Merge.md
│ │ │ ├── 0724.Find-Pivot-Index.md
│ │ │ ├── 0725.Split-Linked-List-in-Parts.md
│ │ │ ├── 0726.Number-of-Atoms.md
│ │ │ ├── 0728.Self-Dividing-Numbers.md
│ │ │ ├── 0729.My-Calendar-I.md
│ │ │ ├── 0732.My-Calendar-III.md
│ │ │ ├── 0733.Flood-Fill.md
│ │ │ ├── 0735.Asteroid-Collision.md
│ │ │ ├── 0739.Daily-Temperatures.md
│ │ │ ├── 0744.Find-Smallest-Letter-Greater-Than-Target.md
│ │ │ ├── 0745.Prefix-and-Suffix-Search.md
│ │ │ ├── 0746.Min-Cost-Climbing-Stairs.md
│ │ │ ├── 0747.Largest-Number-At-Least-Twice-of-Others.md
│ │ │ ├── 0748.Shortest-Completing-Word.md
│ │ │ ├── 0752.Open-the-Lock.md
│ │ │ ├── 0753.Cracking-the-Safe.md
│ │ │ ├── 0756.Pyramid-Transition-Matrix.md
│ │ │ ├── 0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
│ │ │ ├── 0763.Partition-Labels.md
│ │ │ ├── 0765.Couples-Holding-Hands.md
│ │ │ ├── 0766.Toeplitz-Matrix.md
│ │ │ ├── 0767.Reorganize-String.md
│ │ │ ├── 0771.Jewels-and-Stones.md
│ │ │ ├── 0775.Global-and-Local-Inversions.md
│ │ │ ├── 0778.Swim-in-Rising-Water.md
│ │ │ ├── 0781.Rabbits-in-Forest.md
│ │ │ ├── 0783.Minimum-Distance-Between-BST-Nodes.md
│ │ │ ├── 0784.Letter-Case-Permutation.md
│ │ │ ├── 0785.Is-Graph-Bipartite.md
│ │ │ ├── 0786.K-th-Smallest-Prime-Fraction.md
│ │ │ ├── 0791.Custom-Sort-String.md
│ │ │ ├── 0792.Number-of-Matching-Subsequences.md
│ │ │ ├── 0793.Preimage-Size-of-Factorial-Zeroes-Function.md
│ │ │ ├── 0794.Valid-Tic-Tac-Toe-State.md
│ │ │ ├── 0795.Number-of-Subarrays-with-Bounded-Maximum.md
│ │ │ └── _index.md
│ │ ├── 0800~0899/
│ │ │ ├── 0802.Find-Eventual-Safe-States.md
│ │ │ ├── 0803.Bricks-Falling-When-Hit.md
│ │ │ ├── 0807.Max-Increase-to-Keep-City-Skyline.md
│ │ │ ├── 0810.Chalkboard-XOR-Game.md
│ │ │ ├── 0811.Subdomain-Visit-Count.md
│ │ │ ├── 0812.Largest-Triangle-Area.md
│ │ │ ├── 0815.Bus-Routes.md
│ │ │ ├── 0816.Ambiguous-Coordinates.md
│ │ │ ├── 0817.Linked-List-Components.md
│ │ │ ├── 0819.Most-Common-Word.md
│ │ │ ├── 0820.Short-Encoding-of-Words.md
│ │ │ ├── 0821.Shortest-Distance-to-a-Character.md
│ │ │ ├── 0823.Binary-Trees-With-Factors.md
│ │ │ ├── 0825.Friends-Of-Appropriate-Ages.md
│ │ │ ├── 0826.Most-Profit-Assigning-Work.md
│ │ │ ├── 0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
│ │ │ ├── 0830.Positions-of-Large-Groups.md
│ │ │ ├── 0832.Flipping-an-Image.md
│ │ │ ├── 0834.Sum-of-Distances-in-Tree.md
│ │ │ ├── 0836.Rectangle-Overlap.md
│ │ │ ├── 0838.Push-Dominoes.md
│ │ │ ├── 0839.Similar-String-Groups.md
│ │ │ ├── 0841.Keys-and-Rooms.md
│ │ │ ├── 0842.Split-Array-into-Fibonacci-Sequence.md
│ │ │ ├── 0844.Backspace-String-Compare.md
│ │ │ ├── 0845.Longest-Mountain-in-Array.md
│ │ │ ├── 0846.Hand-of-Straights.md
│ │ │ ├── 0850.Rectangle-Area-II.md
│ │ │ ├── 0851.Loud-and-Rich.md
│ │ │ ├── 0852.Peak-Index-in-a-Mountain-Array.md
│ │ │ ├── 0853.Car-Fleet.md
│ │ │ ├── 0856.Score-of-Parentheses.md
│ │ │ ├── 0859.Buddy-Strings.md
│ │ │ ├── 0862.Shortest-Subarray-with-Sum-at-Least-K.md
│ │ │ ├── 0863.All-Nodes-Distance-K-in-Binary-Tree.md
│ │ │ ├── 0864.Shortest-Path-to-Get-All-Keys.md
│ │ │ ├── 0867.Transpose-Matrix.md
│ │ │ ├── 0869.Reordered-Power-of-2.md
│ │ │ ├── 0870.Advantage-Shuffle.md
│ │ │ ├── 0872.Leaf-Similar-Trees.md
│ │ │ ├── 0874.Walking-Robot-Simulation.md
│ │ │ ├── 0875.Koko-Eating-Bananas.md
│ │ │ ├── 0876.Middle-of-the-Linked-List.md
│ │ │ ├── 0877.Stone-Game.md
│ │ │ ├── 0878.Nth-Magical-Number.md
│ │ │ ├── 0880.Decoded-String-at-Index.md
│ │ │ ├── 0881.Boats-to-Save-People.md
│ │ │ ├── 0884.Uncommon-Words-from-Two-Sentences.md
│ │ │ ├── 0885.Spiral-Matrix-III.md
│ │ │ ├── 0887.Super-Egg-Drop.md
│ │ │ ├── 0888.Fair-Candy-Swap.md
│ │ │ ├── 0890.Find-and-Replace-Pattern.md
│ │ │ ├── 0891.Sum-of-Subsequence-Widths.md
│ │ │ ├── 0892.Surface-Area-of-3D-Shapes.md
│ │ │ ├── 0895.Maximum-Frequency-Stack.md
│ │ │ ├── 0896.Monotonic-Array.md
│ │ │ ├── 0897.Increasing-Order-Search-Tree.md
│ │ │ ├── 0898.Bitwise-ORs-of-Subarrays.md
│ │ │ └── _index.md
│ │ ├── 0900~0999/
│ │ │ ├── 0901.Online-Stock-Span.md
│ │ │ ├── 0904.Fruit-Into-Baskets.md
│ │ │ ├── 0907.Sum-of-Subarray-Minimums.md
│ │ │ ├── 0909.Snakes-and-Ladders.md
│ │ │ ├── 0910.Smallest-Range-II.md
│ │ │ ├── 0911.Online-Election.md
│ │ │ ├── 0914.X-of-a-Kind-in-a-Deck-of-Cards.md
│ │ │ ├── 0916.Word-Subsets.md
│ │ │ ├── 0918.Maximum-Sum-Circular-Subarray.md
│ │ │ ├── 0920.Number-of-Music-Playlists.md
│ │ │ ├── 0921.Minimum-Add-to-Make-Parentheses-Valid.md
│ │ │ ├── 0922.Sort-Array-By-Parity-II.md
│ │ │ ├── 0923.3Sum-With-Multiplicity.md
│ │ │ ├── 0924.Minimize-Malware-Spread.md
│ │ │ ├── 0925.Long-Pressed-Name.md
│ │ │ ├── 0927.Three-Equal-Parts.md
│ │ │ ├── 0928.Minimize-Malware-Spread-II.md
│ │ │ ├── 0930.Binary-Subarrays-With-Sum.md
│ │ │ ├── 0933.Number-of-Recent-Calls.md
│ │ │ ├── 0938.Range-Sum-of-BST.md
│ │ │ ├── 0942.DI-String-Match.md
│ │ │ ├── 0946.Validate-Stack-Sequences.md
│ │ │ ├── 0947.Most-Stones-Removed-with-Same-Row-or-Column.md
│ │ │ ├── 0949.Largest-Time-for-Given-Digits.md
│ │ │ ├── 0952.Largest-Component-Size-by-Common-Factor.md
│ │ │ ├── 0953.Verifying-an-Alien-Dictionary.md
│ │ │ ├── 0958.Check-Completeness-of-a-Binary-Tree.md
│ │ │ ├── 0959.Regions-Cut-By-Slashes.md
│ │ │ ├── 0961.N-Repeated-Element-in-Size-2N-Array.md
│ │ │ ├── 0966.Vowel-Spellchecker.md
│ │ │ ├── 0968.Binary-Tree-Cameras.md
│ │ │ ├── 0969.Pancake-Sorting.md
│ │ │ ├── 0970.Powerful-Integers.md
│ │ │ ├── 0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
│ │ │ ├── 0973.K-Closest-Points-to-Origin.md
│ │ │ ├── 0976.Largest-Perimeter-Triangle.md
│ │ │ ├── 0977.Squares-of-a-Sorted-Array.md
│ │ │ ├── 0978.Longest-Turbulent-Subarray.md
│ │ │ ├── 0979.Distribute-Coins-in-Binary-Tree.md
│ │ │ ├── 0980.Unique-Paths-III.md
│ │ │ ├── 0981.Time-Based-Key-Value-Store.md
│ │ │ ├── 0984.String-Without-AAA-or-BBB.md
│ │ │ ├── 0985.Sum-of-Even-Numbers-After-Queries.md
│ │ │ ├── 0986.Interval-List-Intersections.md
│ │ │ ├── 0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
│ │ │ ├── 0989.Add-to-Array-Form-of-Integer.md
│ │ │ ├── 0990.Satisfiability-of-Equality-Equations.md
│ │ │ ├── 0991.Broken-Calculator.md
│ │ │ ├── 0992.Subarrays-with-K-Different-Integers.md
│ │ │ ├── 0993.Cousins-in-Binary-Tree.md
│ │ │ ├── 0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
│ │ │ ├── 0996.Number-of-Squareful-Arrays.md
│ │ │ ├── 0997.Find-the-Town-Judge.md
│ │ │ ├── 0999.Available-Captures-for-Rook.md
│ │ │ └── _index.md
│ │ ├── 1000~1099/
│ │ │ ├── 1002.Find-Common-Characters.md
│ │ │ ├── 1003.Check-If-Word-Is-Valid-After-Substitutions.md
│ │ │ ├── 1004.Max-Consecutive-Ones-III.md
│ │ │ ├── 1005.Maximize-Sum-Of-Array-After-K-Negations.md
│ │ │ ├── 1006.Clumsy-Factorial.md
│ │ │ ├── 1009.Complement-of-Base-10-Integer.md
│ │ │ ├── 1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
│ │ │ ├── 1011.Capacity-To-Ship-Packages-Within-D-Days.md
│ │ │ ├── 1017.Convert-to-Base-2.md
│ │ │ ├── 1018.Binary-Prefix-Divisible-By-5.md
│ │ │ ├── 1019.Next-Greater-Node-In-Linked-List.md
│ │ │ ├── 1020.Number-of-Enclaves.md
│ │ │ ├── 1021.Remove-Outermost-Parentheses.md
│ │ │ ├── 1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
│ │ │ ├── 1025.Divisor-Game.md
│ │ │ ├── 1026.Maximum-Difference-Between-Node-and-Ancestor.md
│ │ │ ├── 1028.Recover-a-Tree-From-Preorder-Traversal.md
│ │ │ ├── 1030.Matrix-Cells-in-Distance-Order.md
│ │ │ ├── 1034.Coloring-A-Border.md
│ │ │ ├── 1037.Valid-Boomerang.md
│ │ │ ├── 1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
│ │ │ ├── 1040.Moving-Stones-Until-Consecutive-II.md
│ │ │ ├── 1047.Remove-All-Adjacent-Duplicates-In-String.md
│ │ │ ├── 1048.Longest-String-Chain.md
│ │ │ ├── 1049.Last-Stone-Weight-II.md
│ │ │ ├── 1051.Height-Checker.md
│ │ │ ├── 1052.Grumpy-Bookstore-Owner.md
│ │ │ ├── 1054.Distant-Barcodes.md
│ │ │ ├── 1073.Adding-Two-Negabinary-Numbers.md
│ │ │ ├── 1074.Number-of-Submatrices-That-Sum-to-Target.md
│ │ │ ├── 1078.Occurrences-After-Bigram.md
│ │ │ ├── 1079.Letter-Tile-Possibilities.md
│ │ │ ├── 1089.Duplicate-Zeros.md
│ │ │ ├── 1091.Shortest-Path-in-Binary-Matrix.md
│ │ │ ├── 1093.Statistics-from-a-Large-Sample.md
│ │ │ └── _index.md
│ │ ├── 1100~1199/
│ │ │ ├── 1104.Path-In-Zigzag-Labelled-Binary-Tree.md
│ │ │ ├── 1105.Filling-Bookcase-Shelves.md
│ │ │ ├── 1108.Defanging-an-IP-Address.md
│ │ │ ├── 1110.Delete-Nodes-And-Return-Forest.md
│ │ │ ├── 1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
│ │ │ ├── 1122.Relative-Sort-Array.md
│ │ │ ├── 1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
│ │ │ ├── 1128.Number-of-Equivalent-Domino-Pairs.md
│ │ │ ├── 1137.N-th-Tribonacci-Number.md
│ │ │ ├── 1143.Longest-Common-Subsequence.md
│ │ │ ├── 1145.Binary-Tree-Coloring-Game.md
│ │ │ ├── 1154.Day-of-the-Year.md
│ │ │ ├── 1157.Online-Majority-Element-In-Subarray.md
│ │ │ ├── 1160.Find-Words-That-Can-Be-Formed-by-Characters.md
│ │ │ ├── 1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
│ │ │ ├── 1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
│ │ │ ├── 1175.Prime-Arrangements.md
│ │ │ ├── 1178.Number-of-Valid-Words-for-Each-Puzzle.md
│ │ │ ├── 1184.Distance-Between-Bus-Stops.md
│ │ │ ├── 1185.Day-of-the-Week.md
│ │ │ ├── 1189.Maximum-Number-of-Balloons.md
│ │ │ ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
│ │ │ └── _index.md
│ │ ├── 1200~1299/
│ │ │ ├── 1200.Minimum-Absolute-Difference.md
│ │ │ ├── 1201.Ugly-Number-III.md
│ │ │ ├── 1202.Smallest-String-With-Swaps.md
│ │ │ ├── 1203.Sort-Items-by-Groups-Respecting-Dependencies.md
│ │ │ ├── 1207.Unique-Number-of-Occurrences.md
│ │ │ ├── 1208.Get-Equal-Substrings-Within-Budget.md
│ │ │ ├── 1209.Remove-All-Adjacent-Duplicates-in-String-II.md
│ │ │ ├── 1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
│ │ │ ├── 1221.Split-a-String-in-Balanced-Strings.md
│ │ │ ├── 1232.Check-If-It-Is-a-Straight-Line.md
│ │ │ ├── 1234.Replace-the-Substring-for-Balanced-String.md
│ │ │ ├── 1235.Maximum-Profit-in-Job-Scheduling.md
│ │ │ ├── 1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
│ │ │ ├── 1249.Minimum-Remove-to-Make-Valid-Parentheses.md
│ │ │ ├── 1252.Cells-with-Odd-Values-in-a-Matrix.md
│ │ │ ├── 1254.Number-of-Closed-Islands.md
│ │ │ ├── 1260.Shift-2D-Grid.md
│ │ │ ├── 1266.Minimum-Time-Visiting-All-Points.md
│ │ │ ├── 1268.Search-Suggestions-System.md
│ │ │ ├── 1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
│ │ │ ├── 1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
│ │ │ ├── 1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
│ │ │ ├── 1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
│ │ │ ├── 1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
│ │ │ ├── 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
│ │ │ ├── 1295.Find-Numbers-with-Even-Number-of-Digits.md
│ │ │ ├── 1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
│ │ │ ├── 1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
│ │ │ └── _index.md
│ │ ├── 1300~1399/
│ │ │ ├── 1300.Sum-of-Mutated-Array-Closest-to-Target.md
│ │ │ ├── 1302.Deepest-Leaves-Sum.md
│ │ │ ├── 1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
│ │ │ ├── 1305.All-Elements-in-Two-Binary-Search-Trees.md
│ │ │ ├── 1306.Jump-Game-III.md
│ │ │ ├── 1310.XOR-Queries-of-a-Subarray.md
│ │ │ ├── 1313.Decompress-Run-Length-Encoded-List.md
│ │ │ ├── 1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
│ │ │ ├── 1319.Number-of-Operations-to-Make-Network-Connected.md
│ │ │ ├── 1329.Sort-the-Matrix-Diagonally.md
│ │ │ ├── 1332.Remove-Palindromic-Subsequences.md
│ │ │ ├── 1337.The-K-Weakest-Rows-in-a-Matrix.md
│ │ │ ├── 1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
│ │ │ ├── 1380.Lucky-Numbers-in-a-Matrix.md
│ │ │ ├── 1383.Maximum-Performance-of-a-Team.md
│ │ │ ├── 1385.Find-the-Distance-Value-Between-Two-Arrays.md
│ │ │ ├── 1389.Create-Target-Array-in-the-Given-Order.md
│ │ │ ├── 1396.Design-Underground-System.md
│ │ │ └── _index.md
│ │ ├── 1400~1499/
│ │ │ ├── 1423.Maximum-Points-You-Can-Obtain-from-Cards.md
│ │ │ ├── 1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
│ │ │ ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
│ │ │ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
│ │ │ ├── 1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
│ │ │ ├── 1446.Consecutive-Characters.md
│ │ │ ├── 1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
│ │ │ ├── 1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
│ │ │ ├── 1463.Cherry-Pickup-II.md
│ │ │ ├── 1464.Maximum-Product-of-Two-Elements-in-an-Array.md
│ │ │ ├── 1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
│ │ │ ├── 1470.Shuffle-the-Array.md
│ │ │ ├── 1480.Running-Sum-of-1d-Array.md
│ │ │ ├── 1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
│ │ │ ├── 1486.XOR-Operation-in-an-Array.md
│ │ │ └── _index.md
│ │ ├── 1500~1599/
│ │ │ ├── 1512.Number-of-Good-Pairs.md
│ │ │ ├── 1518.Water-Bottles.md
│ │ │ ├── 1539.Kth-Missing-Positive-Number.md
│ │ │ ├── 1551.Minimum-Operations-to-Make-Array-Equal.md
│ │ │ ├── 1572.Matrix-Diagonal-Sum.md
│ │ │ ├── 1573.Number-of-Ways-to-Split-a-String.md
│ │ │ ├── 1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
│ │ │ ├── 1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
│ │ │ └── _index.md
│ │ ├── 1600~1699/
│ │ │ ├── 1600.Throne-Inheritance.md
│ │ │ ├── 1603.Design-Parking-System.md
│ │ │ ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
│ │ │ ├── 1609.Even-Odd-Tree.md
│ │ │ ├── 1614.Maximum-Nesting-Depth-of-the-Parentheses.md
│ │ │ ├── 1619.Mean-of-Array-After-Removing-Some-Elements.md
│ │ │ ├── 1624.Largest-Substring-Between-Two-Equal-Characters.md
│ │ │ ├── 1629.Slowest-Key.md
│ │ │ ├── 1631.Path-With-Minimum-Effort.md
│ │ │ ├── 1636.Sort-Array-by-Increasing-Frequency.md
│ │ │ ├── 1640.Check-Array-Formation-Through-Concatenation.md
│ │ │ ├── 1641.Count-Sorted-Vowel-Strings.md
│ │ │ ├── 1642.Furthest-Building-You-Can-Reach.md
│ │ │ ├── 1646.Get-Maximum-in-Generated-Array.md
│ │ │ ├── 1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
│ │ │ ├── 1648.Sell-Diminishing-Valued-Colored-Balls.md
│ │ │ ├── 1649.Create-Sorted-Array-through-Instructions.md
│ │ │ ├── 1652.Defuse-the-Bomb.md
│ │ │ ├── 1653.Minimum-Deletions-to-Make-String-Balanced.md
│ │ │ ├── 1654.Minimum-Jumps-to-Reach-Home.md
│ │ │ ├── 1655.Distribute-Repeating-Integers.md
│ │ │ ├── 1656.Design-an-Ordered-Stream.md
│ │ │ ├── 1657.Determine-if-Two-Strings-Are-Close.md
│ │ │ ├── 1658.Minimum-Operations-to-Reduce-X-to-Zero.md
│ │ │ ├── 1659.Maximize-Grid-Happiness.md
│ │ │ ├── 1662.Check-If-Two-String-Arrays-are-Equivalent.md
│ │ │ ├── 1663.Smallest-String-With-A-Given-Numeric-Value.md
│ │ │ ├── 1664.Ways-to-Make-a-Fair-Array.md
│ │ │ ├── 1665.Minimum-Initial-Energy-to-Finish-Tasks.md
│ │ │ ├── 1668.Maximum-Repeating-Substring.md
│ │ │ ├── 1669.Merge-In-Between-Linked-Lists.md
│ │ │ ├── 1670.Design-Front-Middle-Back-Queue.md
│ │ │ ├── 1672.Richest-Customer-Wealth.md
│ │ │ ├── 1673.Find-the-Most-Competitive-Subsequence.md
│ │ │ ├── 1674.Minimum-Moves-to-Make-Array-Complementary.md
│ │ │ ├── 1675.Minimize-Deviation-in-Array.md
│ │ │ ├── 1678.Goal-Parser-Interpretation.md
│ │ │ ├── 1679.Max-Number-of-K-Sum-Pairs.md
│ │ │ ├── 1680.Concatenation-of-Consecutive-Binary-Numbers.md
│ │ │ ├── 1681.Minimum-Incompatibility.md
│ │ │ ├── 1684.Count-the-Number-of-Consistent-Strings.md
│ │ │ ├── 1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
│ │ │ ├── 1688.Count-of-Matches-in-Tournament.md
│ │ │ ├── 1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
│ │ │ ├── 1690.Stone-Game-VII.md
│ │ │ ├── 1691.Maximum-Height-by-Stacking-Cuboids.md
│ │ │ ├── 1694.Reformat-Phone-Number.md
│ │ │ ├── 1695.Maximum-Erasure-Value.md
│ │ │ ├── 1696.Jump-Game-VI.md
│ │ │ └── _index.md
│ │ ├── 1700~1799/
│ │ │ ├── 1700.Number-of-Students-Unable-to-Eat-Lunch.md
│ │ │ ├── 1704.Determine-if-String-Halves-Are-Alike.md
│ │ │ ├── 1705.Maximum-Number-of-Eaten-Apples.md
│ │ │ ├── 1710.Maximum-Units-on-a-Truck.md
│ │ │ ├── 1716.Calculate-Money-in-Leetcode-Bank.md
│ │ │ ├── 1720.Decode-XORed-Array.md
│ │ │ ├── 1721.Swapping-Nodes-in-a-Linked-List.md
│ │ │ ├── 1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
│ │ │ ├── 1732.Find-the-Highest-Altitude.md
│ │ │ ├── 1734.Decode-XORed-Permutation.md
│ │ │ ├── 1736.Latest-Time-by-Replacing-Hidden-Digits.md
│ │ │ ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value.md
│ │ │ ├── 1742.Maximum-Number-of-Balls-in-a-Box.md
│ │ │ ├── 1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
│ │ │ ├── 1748.Sum-of-Unique-Elements.md
│ │ │ ├── 1752.Check-if-Array-Is-Sorted-and-Rotated.md
│ │ │ ├── 1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
│ │ │ ├── 1763.Longest-Nice-Substring.md
│ │ │ ├── 1791.Find-Center-of-Star-Graph.md
│ │ │ └── _index.md
│ │ ├── 1800~1899/
│ │ │ ├── 1816.Truncate-Sentence.md
│ │ │ ├── 1818.Minimum-Absolute-Sum-Difference.md
│ │ │ ├── 1846.Maximum-Element-After-Decreasing-and-Rearranging.md
│ │ │ ├── 1877.Minimize-Maximum-Pair-Sum-in-Array.md
│ │ │ └── _index.md
│ │ ├── 1900~1999/
│ │ │ ├── 1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
│ │ │ └── _index.md
│ │ ├── 2000~2099/
│ │ │ ├── 2021.Brightest-Position-on-Street.md
│ │ │ ├── 2022.Convert-1D-Array-Into-2D-Array.md
│ │ │ ├── 2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
│ │ │ ├── 2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
│ │ │ ├── 2043.Simple-Bank-System.md
│ │ │ ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
│ │ │ └── _index.md
│ │ ├── 2100~2199/
│ │ │ ├── 2164.Sort-Even-and-Odd-Indices-Independently.md
│ │ │ ├── 2165.Smallest-Value-of-the-Rearranged-Number.md
│ │ │ ├── 2166.Design-Bitset.md
│ │ │ ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
│ │ │ ├── 2169.Count-Operations-to-Obtain-Zero.md
│ │ │ ├── 2170.Minimum-Operations-to-Make-the-Array-Alternating.md
│ │ │ ├── 2171.Removing-Minimum-Number-of-Magic-Beans.md
│ │ │ ├── 2180.Count-Integers-With-Even-Digit-Sum.md
│ │ │ ├── 2181.Merge-Nodes-in-Between-Zeros.md
│ │ │ ├── 2182.Construct-String-With-Repeat-Limit.md
│ │ │ ├── 2183.Count-Array-Pairs-Divisible-by-K.md
│ │ │ └── _index.md
│ │ ├── 2200~2299/
│ │ │ └── _index.md
│ │ ├── _index.md
│ │ └── pytool/
│ │ ├── AddTOC.py
│ │ ├── CutContent.py
│ │ ├── GenerateIndex.py
│ │ ├── GenerateOne.py
│ │ ├── GetFile.py
│ │ └── WordCount.py
│ ├── ChapterOne/
│ │ ├── Algorithm.md
│ │ ├── Data_Structure.md
│ │ ├── Time_Complexity.md
│ │ └── _index.md
│ ├── ChapterThree/
│ │ ├── Binary_Indexed_Tree.md
│ │ ├── LFUCache.md
│ │ ├── LRUCache.md
│ │ ├── Segment_Tree.md
│ │ ├── UnionFind.md
│ │ └── _index.md
│ ├── ChapterTwo/
│ │ ├── Array.md
│ │ ├── Backtracking.md
│ │ ├── Binary_Indexed_Tree.md
│ │ ├── Binary_Search.md
│ │ ├── Bit_Manipulation.md
│ │ ├── Breadth_First_Search.md
│ │ ├── Depth_First_Search.md
│ │ ├── Dynamic_Programming.md
│ │ ├── Hash_Table.md
│ │ ├── Linked_List.md
│ │ ├── Math.md
│ │ ├── Segment_Tree.md
│ │ ├── Sliding_Window.md
│ │ ├── Sorting.md
│ │ ├── Stack.md
│ │ ├── String.md
│ │ ├── Tree.md
│ │ ├── Two_Pointers.md
│ │ ├── Union_Find.md
│ │ └── _index.md
│ └── _index.md
├── resources/
│ └── _gen/
│ └── assets/
│ └── scss/
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.content
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.json
│ └── leetcode/
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.content
│ └── book.scss_50fc8c04e12a2f59027287995557ceff.json
├── static/
│ ├── prism.css
│ └── prism.js
└── themes/
└── book/
├── .github/
│ └── workflows/
│ └── main.yml
├── .gitignore
├── LICENSE
├── README.md
├── archetypes/
│ ├── docs.md
│ └── posts.md
├── assets/
│ ├── _custom.scss
│ ├── _defaults.scss
│ ├── _fonts.scss
│ ├── _main.scss
│ ├── _markdown.scss
│ ├── _print.scss
│ ├── _shortcodes.scss
│ ├── _utils.scss
│ ├── _variables.scss
│ ├── book.scss
│ ├── manifest.json
│ ├── menu-reset.js
│ ├── mermaid.json
│ ├── normalize.css
│ ├── plugins/
│ │ ├── _dark.scss
│ │ ├── _numbered.scss
│ │ └── _scrollbars.scss
│ ├── search-data.js
│ ├── search.js
│ ├── serviceworker-v1.js
│ ├── sw-register.js
│ ├── sw.js
│ └── themes/
│ ├── _auto.scss
│ ├── _dark.scss
│ └── _light.scss
├── exampleSite/
│ ├── assets/
│ │ ├── _custom.scss
│ │ └── _variables.scss
│ ├── config.yaml
│ ├── content/
│ │ ├── _index.md
│ │ ├── docs/
│ │ │ ├── example/
│ │ │ │ ├── _index.md
│ │ │ │ ├── collapsed/
│ │ │ │ │ ├── 3rd-level/
│ │ │ │ │ │ ├── 4th-level.md
│ │ │ │ │ │ └── _index.md
│ │ │ │ │ └── _index.md
│ │ │ │ ├── hidden.md
│ │ │ │ └── table-of-contents/
│ │ │ │ ├── _index.md
│ │ │ │ ├── with-toc.md
│ │ │ │ └── without-toc.md
│ │ │ └── shortcodes/
│ │ │ ├── _index.md
│ │ │ ├── buttons.md
│ │ │ ├── columns.md
│ │ │ ├── details.md
│ │ │ ├── expand.md
│ │ │ ├── hints.md
│ │ │ ├── katex.md
│ │ │ ├── mermaid.md
│ │ │ ├── section/
│ │ │ │ ├── _index.md
│ │ │ │ ├── page1.md
│ │ │ │ └── page2.md
│ │ │ └── tabs.md
│ │ ├── menu/
│ │ │ └── index.md
│ │ └── posts/
│ │ ├── _index.md
│ │ ├── creating-a-new-theme.md
│ │ ├── goisforlovers.md
│ │ ├── hugoisforlovers.md
│ │ └── migrate-from-jekyll.md
│ ├── content.bn/
│ │ └── _index.md
│ ├── content.ru/
│ │ └── _index.md
│ ├── content.zh/
│ │ └── _index.md
│ └── resources/
│ └── _gen/
│ └── assets/
│ └── scss/
│ ├── book.scss_50fc8c04e12a2f59027287995557ceff.content
│ └── book.scss_50fc8c04e12a2f59027287995557ceff.json
├── i18n/
│ ├── bn.yaml
│ ├── cn.yaml
│ ├── cs.yaml
│ ├── de.yaml
│ ├── en.yaml
│ ├── es.yaml
│ ├── fr.yaml
│ ├── ja.yaml
│ ├── jp.yaml
│ ├── ko.yaml
│ ├── nb.yaml
│ ├── pt.yaml
│ ├── ru.yaml
│ ├── sv.yaml
│ ├── tr.yaml
│ ├── uk.yaml
│ ├── zh-TW.yaml
│ └── zh.yaml
├── layouts/
│ ├── 404.html
│ ├── _default/
│ │ ├── _markup/
│ │ │ ├── render-heading.html
│ │ │ ├── render-image.html
│ │ │ └── render-link.html
│ │ ├── baseof.html
│ │ ├── list.html
│ │ └── single.html
│ ├── partials/
│ │ └── docs/
│ │ ├── brand.html
│ │ ├── comments.html
│ │ ├── date.html
│ │ ├── footer.html
│ │ ├── gitalk.html
│ │ ├── header.html
│ │ ├── html-head.html
│ │ ├── inject/
│ │ │ ├── body.html
│ │ │ ├── content-after.html
│ │ │ ├── content-before.html
│ │ │ ├── footer.html
│ │ │ ├── head.html
│ │ │ ├── menu-after.html
│ │ │ ├── menu-before.html
│ │ │ ├── toc-after.html
│ │ │ └── toc-before.html
│ │ ├── languages.html
│ │ ├── menu-bundle.html
│ │ ├── menu-filetree.html
│ │ ├── menu-hugo.html
│ │ ├── menu.html
│ │ ├── post-meta.html
│ │ ├── search.html
│ │ ├── taxonomy.html
│ │ ├── title.html
│ │ └── toc.html
│ ├── posts/
│ │ ├── list.html
│ │ └── single.html
│ ├── shortcodes/
│ │ ├── button.html
│ │ ├── columns.html
│ │ ├── details.html
│ │ ├── expand.html
│ │ ├── hint.html
│ │ ├── katex.html
│ │ ├── mermaid.html
│ │ ├── section.html
│ │ ├── tab.html
│ │ └── tabs.html
│ └── taxonomy/
│ ├── list.html
│ └── taxonomy.html
└── static/
├── js/
│ └── sw-toolbox.js
├── prism.css
└── prism.js
Showing preview only (484K chars total). Download the full file or copy to clipboard to get everything.
SYMBOL INDEX (5343 symbols across 1641 files)
FILE: ctl/command.go
function execute (line 15) | func execute() {
function init (line 22) | func init() {
FILE: ctl/config.go
constant configTOML (line 11) | configTOML = "config.toml"
type config (line 14) | type config struct
method String (line 21) | func (c config) String() string {
function getConfig (line 25) | func getConfig() *config {
FILE: ctl/error.go
constant ExitSuccess (line 10) | ExitSuccess = iota
constant ExitError (line 12) | ExitError
constant ExitBadArgs (line 14) | ExitBadArgs
function ExitWithError (line 18) | func ExitWithError(code int, err error) {
FILE: ctl/label.go
function getChapterFourFileOrder (line 78) | func getChapterFourFileOrder() ([]string, []int) {
function newLabelCommand (line 86) | func newLabelCommand() *cobra.Command {
function newAddPreNext (line 99) | func newAddPreNext() *cobra.Command {
function newDeletePreNext (line 112) | func newDeletePreNext() *cobra.Command {
function addPreNext (line 125) | func addPreNext() {
function addPreNextLabel (line 138) | func addPreNextLabel(order, preOrder []string, chapterFourIds []int, pre...
function eofAdd (line 202) | func eofAdd(filePath string, labelString string) ([]byte, error) {
function delPreNext (line 225) | func delPreNext() {
function delPreNextLabel (line 237) | func delPreNextLabel(order []string, chapterFourIds []int, chapter strin...
function needAdd (line 269) | func needAdd(filePath string) (bool, error) {
function eofDel (line 295) | func eofDel(filePath string) ([]byte, error) {
function removeLine (line 337) | func removeLine(path string, lineNumber int) {
FILE: ctl/main.go
function main (line 3) | func main() {
FILE: ctl/models/lcproblems.go
type LeetCodeProblemAll (line 9) | type LeetCodeProblemAll struct
function ConvertUserInfoModel (line 26) | func ConvertUserInfoModel(lpa LeetCodeProblemAll) UserInfo {
type StatStatusPairs (line 41) | type StatStatusPairs struct
function ConvertMdModelFromSsp (line 52) | func ConvertMdModelFromSsp(problems []StatStatusPairs) []Mdrow {
function ConvertMdModelFromIds (line 68) | func ConvertMdModelFromIds(problemsMap map[int]StatStatusPairs, ids []in...
type Stat (line 84) | type Stat struct
type Difficulty (line 95) | type Difficulty struct
FILE: ctl/models/mdrow.go
type Mdrow (line 9) | type Mdrow struct
method tableLine (line 56) | func (m Mdrow) tableLine() string {
function GenerateMdRows (line 20) | func GenerateMdRows(solutionIds []int, mdrows []Mdrow) {
type SortByQuestionID (line 61) | type SortByQuestionID
method Len (line 63) | func (a SortByQuestionID) Len() int { return len(a) }
method Swap (line 64) | func (a SortByQuestionID) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
method Less (line 65) | func (a SortByQuestionID) Less(i, j int) bool {
type Mdrows (line 70) | type Mdrows struct
method table (line 76) | func (mds Mdrows) table() string {
method AvailableTable (line 88) | func (mds Mdrows) AvailableTable() string {
FILE: ctl/models/tagproblem.go
type Graphql (line 13) | type Graphql struct
type GraphQLResp (line 22) | type GraphQLResp struct
type TopicTag (line 30) | type TopicTag struct
type Question (line 40) | type Question struct
method generateTagStatus (line 62) | func (q Question) generateTagStatus() (TagStatus, error) {
type TopicTags (line 55) | type TopicTags struct
type TagStatus (line 73) | type TagStatus struct
function ConvertMdModelFromQuestions (line 82) | func ConvertMdModelFromQuestions(questions []Question) []Mdrow {
type TagList (line 102) | type TagList struct
method tableLine (line 114) | func (t TagList) tableLine() string {
function standardizedTitle (line 118) | func standardizedTitle(orig string, frontendQuestionID int32) string {
function GenerateTagMdRows (line 154) | func GenerateTagMdRows(solutionIds []int, metaMap map[int]TagList, mdrow...
type TagLists (line 179) | type TagLists struct
method table (line 185) | func (tls TagLists) table() string {
method AvailableTagTable (line 197) | func (tls TagLists) AvailableTagTable() string {
type FavoritesLists (line 202) | type FavoritesLists struct
type Gproblem (line 224) | type Gproblem struct
type Gstat (line 265) | type Gstat struct
type GcodeSnippet (line 279) | type GcodeSnippet struct
FILE: ctl/models/user.go
type UserInfo (line 8) | type UserInfo struct
method table (line 28) | func (ui UserInfo) table() string {
method PersonalData (line 42) | func (ui UserInfo) PersonalData() string {
FILE: ctl/pdf.go
function newPDFCommand (line 43) | func newPDFCommand() *cobra.Command {
function generatePDF (line 56) | func generatePDF() {
function loadChapter (line 97) | func loadChapter(order []string, path, chapter string) ([]byte, error) {
function prepare (line 128) | func prepare(path string) {
function clean (line 171) | func clean(filePath string) ([]byte, error) {
function removeHeader (line 213) | func removeHeader(path, newPath string, lineNumber int) {
FILE: ctl/rangking.go
function getRanking (line 10) | func getRanking() int {
FILE: ctl/refresh.go
function newRefresh (line 7) | func newRefresh() *cobra.Command {
function refresh (line 20) | func refresh() {
FILE: ctl/render.go
function newBuildCommand (line 28) | func newBuildCommand() *cobra.Command {
function newBuildREADME (line 42) | func newBuildREADME() *cobra.Command {
function newBuildChapterTwo (line 55) | func newBuildChapterTwo() *cobra.Command {
function newBuildMenu (line 68) | func newBuildMenu() *cobra.Command {
function buildREADME (line 81) | func buildREADME() {
function renderReadme (line 122) | func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdr...
function buildChapterTwo (line 168) | func buildChapterTwo(internal bool) {
function loadMetaData (line 209) | func loadMetaData(filePath string) (map[int]m.TagList, error) {
function renderChapterTwo (line 239) | func renderChapterTwo(filePath string, tls m.TagLists) ([]byte, error) {
function buildBookMenu (line 267) | func buildBookMenu() {
function copyLackFile (line 280) | func copyLackFile() {
function generateMenu (line 311) | func generateMenu() string {
function menuLine (line 321) | func menuLine(order []string, chapter string) string {
function renderBookMenu (line 341) | func renderBookMenu(filePath string) ([]byte, error) {
FILE: ctl/request.go
constant AllProblemURL (line 14) | AllProblemURL = "https://leetcode.com/api/problems/all/"
constant QraphqlURL (line 16) | QraphqlURL = "https://leetcode.com/graphql"
constant LoginPageURL (line 18) | LoginPageURL = "https://leetcode.com/accounts/login/"
constant AlgorithmsURL (line 20) | AlgorithmsURL = "https://leetcode.com/api/problems/Algorithms/"
constant ArrayProblemURL (line 23) | ArrayProblemURL = "https://leetcode.com/tag/array/"
function newReq (line 28) | func newReq() *request.Request {
function signin (line 35) | func signin() *request.Request {
function getRaw (line 49) | func getRaw(URL string) []byte {
function getProblemAllList (line 69) | func getProblemAllList() []byte {
type Variables (line 74) | type Variables struct
function getQraphql (line 78) | func getQraphql(payload string) []byte {
function getTopicTag (line 98) | func getTopicTag(variable string) string {
function getTagProblemList (line 108) | func getTagProblemList(tag string) []byte {
FILE: ctl/statistic.go
function statisticalData (line 10) | func statisticalData(problemsMap map[int]m.StatStatusPairs, solutionIds ...
FILE: ctl/template_render.go
function makeReadmeFile (line 14) | func makeReadmeFile(mdrows m.Mdrows) {
function readTMPL (line 27) | func readTMPL(path string) string {
FILE: ctl/util/util.go
function LoadSolutionsDir (line 16) | func LoadSolutionsDir() ([]int, []string, int) {
function loadFile (line 22) | func loadFile(path string) ([]int, []string, int) {
function GetAllFile (line 48) | func GetAllFile(pathname string, fileList *[]string) ([]string, error) {
function LoadChapterFourDir (line 63) | func LoadChapterFourDir() ([]string, []int) {
function WriteFile (line 92) | func WriteFile(fileName string, content []byte) {
function LoadFile (line 107) | func LoadFile(filePath string) ([]byte, error) {
function DestoryDir (line 128) | func DestoryDir(path string) {
function CopyFile (line 149) | func CopyFile(dstName, srcName string) (written int64, err error) {
function BinarySearch (line 164) | func BinarySearch(nums []int, target int) int {
function GetChpaterFourFileNum (line 180) | func GetChpaterFourFileNum(num int) string {
FILE: leetcode/0001.Two-Sum/1. Two Sum.go
function twoSum (line 3) | func twoSum(nums []int, target int) []int {
FILE: leetcode/0001.Two-Sum/1. Two Sum_test.go
type question1 (line 8) | type question1 struct
type para1 (line 15) | type para1 struct
type ans1 (line 22) | type ans1 struct
function Test_Problem1 (line 26) | func Test_Problem1(t *testing.T) {
FILE: leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go
function addTwoNumbers (line 18) | func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
FILE: leetcode/0002.Add-Two-Numbers/2. Add Two Numbers_test.go
type question2 (line 10) | type question2 struct
type para2 (line 17) | type para2 struct
type ans2 (line 24) | type ans2 struct
function Test_Problem2 (line 28) | func Test_Problem2(t *testing.T) {
FILE: leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go
function lengthOfLongestSubstring (line 4) | func lengthOfLongestSubstring(s string) int {
function lengthOfLongestSubstring1 (line 30) | func lengthOfLongestSubstring1(s string) int {
function lengthOfLongestSubstring2 (line 52) | func lengthOfLongestSubstring2(s string) int {
function max (line 66) | func max(a int, b int) int {
FILE: leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go
type question3 (line 8) | type question3 struct
type para3 (line 15) | type para3 struct
type ans3 (line 21) | type ans3 struct
function Test_Problem3 (line 25) | func Test_Problem3(t *testing.T) {
FILE: leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go
function findMedianSortedArrays (line 3) | func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
function max (line 45) | func max(a int, b int) int {
function min (line 52) | func min(a int, b int) int {
FILE: leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go
type question4 (line 8) | type question4 struct
type para4 (line 15) | type para4 struct
type ans4 (line 22) | type ans4 struct
function Test_Problem4 (line 26) | func Test_Problem4(t *testing.T) {
FILE: leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring.go
function longestPalindrome (line 4) | func longestPalindrome(s string) string {
function min (line 46) | func min(x, y int) int {
function longestPalindrome1 (line 54) | func longestPalindrome1(s string) string {
function longestPalindrome2 (line 80) | func longestPalindrome2(s string) string {
function maxPalindrome (line 89) | func maxPalindrome(s string, i, j int, res string) string {
function longestPalindrome3 (line 103) | func longestPalindrome3(s string) string {
FILE: leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go
type question5 (line 8) | type question5 struct
type para5 (line 15) | type para5 struct
type ans5 (line 21) | type ans5 struct
function Test_Problem5 (line 25) | func Test_Problem5(t *testing.T) {
FILE: leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion.go
function convert (line 3) | func convert(s string, numRows int) string {
FILE: leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion_test.go
type question6 (line 8) | type question6 struct
type para6 (line 15) | type para6 struct
type ans6 (line 22) | type ans6 struct
function Test_Problem6 (line 26) | func Test_Problem6(t *testing.T) {
FILE: leetcode/0007.Reverse-Integer/7. Reverse Integer.go
function reverse7 (line 3) | func reverse7(x int) int {
FILE: leetcode/0007.Reverse-Integer/7. Reverse Integer_test.go
type question7 (line 8) | type question7 struct
type para7 (line 15) | type para7 struct
type ans7 (line 21) | type ans7 struct
function Test_Problem7 (line 25) | func Test_Problem7(t *testing.T) {
FILE: leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go
function myAtoi (line 3) | func myAtoi(s string) int {
FILE: leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go
type question8 (line 8) | type question8 struct
type para8 (line 15) | type para8 struct
type ans8 (line 21) | type ans8 struct
function Test_Problem8 (line 25) | func Test_Problem8(t *testing.T) {
FILE: leetcode/0009.Palindrome-Number/9. Palindrome Number.go
function isPalindrome (line 6) | func isPalindrome(x int) bool {
function isPalindrome1 (line 31) | func isPalindrome1(x int) bool {
FILE: leetcode/0009.Palindrome-Number/9. Palindrome Number_test.go
type question9 (line 8) | type question9 struct
type para9 (line 15) | type para9 struct
type ans9 (line 21) | type ans9 struct
function Test_Problem9 (line 25) | func Test_Problem9(t *testing.T) {
FILE: leetcode/0011.Container-With-Most-Water/11. Container With Most Water.go
function maxArea (line 3) | func maxArea(height []int) int {
FILE: leetcode/0011.Container-With-Most-Water/11. Container With Most Water_test.go
type question11 (line 8) | type question11 struct
type para11 (line 15) | type para11 struct
type ans11 (line 21) | type ans11 struct
function Test_Problem11 (line 25) | func Test_Problem11(t *testing.T) {
FILE: leetcode/0012.Integer-to-Roman/12. Integer to Roman.go
function intToRoman (line 3) | func intToRoman(num int) string {
FILE: leetcode/0012.Integer-to-Roman/12. Integer to Roman_test.go
type question12 (line 8) | type question12 struct
type para12 (line 15) | type para12 struct
type ans12 (line 21) | type ans12 struct
function Test_Problem12 (line 25) | func Test_Problem12(t *testing.T) {
FILE: leetcode/0013.Roman-to-Integer/13. Roman to Integer.go
function romanToInt (line 13) | func romanToInt(s string) int {
FILE: leetcode/0013.Roman-to-Integer/13. Roman to Integer_test.go
type question13 (line 8) | type question13 struct
type para13 (line 15) | type para13 struct
type ans13 (line 21) | type ans13 struct
function Test_Problem13 (line 25) | func Test_Problem13(t *testing.T) {
FILE: leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go
function longestCommonPrefix (line 3) | func longestCommonPrefix(strs []string) string {
FILE: leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go
type question14 (line 8) | type question14 struct
type para14 (line 14) | type para14 struct
type ans14 (line 19) | type ans14 struct
function Test_Problem14 (line 23) | func Test_Problem14(t *testing.T) {
FILE: leetcode/0015.3Sum/15. 3Sum.go
function threeSum (line 8) | func threeSum(nums []int) [][]int {
function threeSum1 (line 41) | func threeSum1(nums []int) [][]int {
FILE: leetcode/0015.3Sum/15. 3Sum_test.go
type question15 (line 8) | type question15 struct
type para15 (line 15) | type para15 struct
type ans15 (line 21) | type ans15 struct
function Test_Problem15 (line 25) | func Test_Problem15(t *testing.T) {
FILE: leetcode/0016.3Sum-Closest/16. 3Sum Closest.go
function threeSumClosest (line 9) | func threeSumClosest(nums []int, target int) int {
function threeSumClosest1 (line 36) | func threeSumClosest1(nums []int, target int) int {
function abs (line 51) | func abs(a int) int {
FILE: leetcode/0016.3Sum-Closest/16. 3Sum Closest_test.go
type question16 (line 8) | type question16 struct
type para16 (line 15) | type para16 struct
type ans16 (line 22) | type ans16 struct
function Test_Problem16 (line 26) | func Test_Problem16(t *testing.T) {
FILE: leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go
function letterCombinations (line 21) | func letterCombinations(digits string) []string {
function findCombination (line 30) | func findCombination(digits *string, index int, s string) {
function letterCombinations_ (line 44) | func letterCombinations_(digits string) []string {
function letterCombinationsBT (line 83) | func letterCombinationsBT(digits string) []string {
function letterFunc (line 92) | func letterFunc(res string, digits string) {
FILE: leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go
type question17 (line 8) | type question17 struct
type para17 (line 15) | type para17 struct
type ans17 (line 21) | type ans17 struct
function Test_Problem17 (line 25) | func Test_Problem17(t *testing.T) {
FILE: leetcode/0018.4Sum/18. 4Sum.go
function fourSum (line 6) | func fourSum(nums []int, target int) (quadruplets [][]int) {
function fourSum1 (line 36) | func fourSum1(nums []int, target int) [][]int {
function kSum (line 43) | func kSum(nums []int, left, right int, target int, k int, cur []int, res...
function twoSum (line 63) | func twoSum(nums []int, left, right int, target int, cur []int, res *[][...
function fourSum2 (line 90) | func fourSum2(nums []int, target int) [][]int {
FILE: leetcode/0018.4Sum/18. 4Sum_test.go
type question18 (line 8) | type question18 struct
type para18 (line 15) | type para18 struct
type ans18 (line 22) | type ans18 struct
function Test_Problem18 (line 26) | func Test_Problem18(t *testing.T) {
FILE: leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go
function removeNthFromEnd (line 19) | func removeNthFromEnd(head *ListNode, n int) *ListNode {
function removeNthFromEnd1 (line 35) | func removeNthFromEnd1(head *ListNode, n int) *ListNode {
FILE: leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go
type question19 (line 10) | type question19 struct
type para19 (line 17) | type para19 struct
type ans19 (line 24) | type ans19 struct
function Test_Problem19 (line 28) | func Test_Problem19(t *testing.T) {
FILE: leetcode/0020.Valid-Parentheses/20. Valid Parentheses.go
function isValid (line 3) | func isValid(s string) bool {
FILE: leetcode/0020.Valid-Parentheses/20. Valid Parentheses_test.go
type question20 (line 8) | type question20 struct
type para20 (line 15) | type para20 struct
type ans20 (line 21) | type ans20 struct
function Test_Problem20 (line 25) | func Test_Problem20(t *testing.T) {
FILE: leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go
function mergeTwoLists (line 17) | func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
FILE: leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go
type question21 (line 10) | type question21 struct
type para21 (line 17) | type para21 struct
type ans21 (line 24) | type ans21 struct
function Test_Problem21 (line 28) | func Test_Problem21(t *testing.T) {
FILE: leetcode/0022.Generate-Parentheses/22. Generate Parentheses.go
function generateParenthesis (line 3) | func generateParenthesis(n int) []string {
function findGenerateParenthesis (line 12) | func findGenerateParenthesis(lindex, rindex int, str string, res *[]stri...
FILE: leetcode/0022.Generate-Parentheses/22. Generate Parentheses_test.go
type question22 (line 8) | type question22 struct
type para22 (line 15) | type para22 struct
type ans22 (line 21) | type ans22 struct
function Test_Problem22 (line 25) | func Test_Problem22(t *testing.T) {
FILE: leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go
function mergeKLists (line 17) | func mergeKLists(lists []*ListNode) *ListNode {
function mergeTwoLists1 (line 31) | func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode {
FILE: leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go
type question23 (line 10) | type question23 struct
type para23 (line 17) | type para23 struct
type ans23 (line 23) | type ans23 struct
function Test_Problem23 (line 27) | func Test_Problem23(t *testing.T) {
FILE: leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go
function swapPairs (line 18) | func swapPairs(head *ListNode) *ListNode {
FILE: leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go
type question24 (line 10) | type question24 struct
type para24 (line 17) | type para24 struct
type ans24 (line 23) | type ans24 struct
function Test_Problem24 (line 27) | func Test_Problem24(t *testing.T) {
FILE: leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go
function reverseKGroup (line 17) | func reverseKGroup(head *ListNode, k int) *ListNode {
function reverse (line 30) | func reverse(first *ListNode, last *ListNode) *ListNode {
FILE: leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go
type question25 (line 10) | type question25 struct
type para25 (line 17) | type para25 struct
type ans25 (line 24) | type ans25 struct
function Test_Problem25 (line 28) | func Test_Problem25(t *testing.T) {
FILE: leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go
function removeDuplicates (line 4) | func removeDuplicates(nums []int) int {
function removeDuplicates1 (line 23) | func removeDuplicates1(nums []int) int {
function removeElement1 (line 42) | func removeElement1(nums []int, start, val int) int {
FILE: leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go
type question26 (line 8) | type question26 struct
type para26 (line 15) | type para26 struct
type ans26 (line 21) | type ans26 struct
function Test_Problem26 (line 25) | func Test_Problem26(t *testing.T) {
FILE: leetcode/0027.Remove-Element/27. Remove Element.go
function removeElement (line 3) | func removeElement(nums []int, val int) int {
FILE: leetcode/0027.Remove-Element/27. Remove Element_test.go
type question27 (line 8) | type question27 struct
type para27 (line 15) | type para27 struct
type ans27 (line 22) | type ans27 struct
function Test_Problem27 (line 26) | func Test_Problem27(t *testing.T) {
FILE: leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String.go
function strStr (line 6) | func strStr(haystack string, needle string) int {
function strStr1 (line 23) | func strStr1(haystack string, needle string) int {
FILE: leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String_test.go
type question28 (line 8) | type question28 struct
type para28 (line 15) | type para28 struct
type ans28 (line 22) | type ans28 struct
function Test_Problem28 (line 26) | func Test_Problem28(t *testing.T) {
FILE: leetcode/0029.Divide-Two-Integers/29. Divide Two Integers.go
function divide (line 8) | func divide(dividend int, divisor int) int {
function binarySearchQuotient (line 54) | func binarySearchQuotient(low, high, val, dividend int) int {
function divide1 (line 72) | func divide1(divided int, divisor int) int {
function abs (line 95) | func abs(a int) int {
FILE: leetcode/0029.Divide-Two-Integers/29. Divide Two Integers_test.go
type question29 (line 8) | type question29 struct
type para29 (line 15) | type para29 struct
type ans29 (line 22) | type ans29 struct
function Test_Problem29 (line 26) | func Test_Problem29(t *testing.T) {
FILE: leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go
function findSubstring (line 3) | func findSubstring(s string, words []string) []int {
function checkWords (line 32) | func checkWords(s map[string]int) bool {
function copyMap (line 43) | func copyMap(s map[string]int) map[string]int {
FILE: leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go
type question30 (line 8) | type question30 struct
type para30 (line 15) | type para30 struct
type ans30 (line 22) | type ans30 struct
function Test_Problem30 (line 26) | func Test_Problem30(t *testing.T) {
FILE: leetcode/0031.Next-Permutation/31. Next Permutation.go
function nextPermutation (line 4) | func nextPermutation(nums []int) {
function reverse (line 22) | func reverse(nums *[]int, i, j int) {
function swap (line 30) | func swap(nums *[]int, i, j int) {
function nextPermutation1 (line 36) | func nextPermutation1(nums []int) {
function checkPermutationPossibility (line 61) | func checkPermutationPossibility(nums []int) (idx int) {
FILE: leetcode/0031.Next-Permutation/31. Next Permutation_test.go
type question31 (line 8) | type question31 struct
type para31 (line 15) | type para31 struct
type ans31 (line 21) | type ans31 struct
function Test_Problem31 (line 25) | func Test_Problem31(t *testing.T) {
FILE: leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses.go
function longestValidParentheses (line 4) | func longestValidParentheses(s string) int {
function max (line 22) | func max(a, b int) int {
function longestValidParentheses1 (line 30) | func longestValidParentheses1(s string) int {
FILE: leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses_test.go
type question32 (line 8) | type question32 struct
type para32 (line 15) | type para32 struct
type ans32 (line 21) | type ans32 struct
function Test_Problem32 (line 25) | func Test_Problem32(t *testing.T) {
FILE: leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go
function search33 (line 3) | func search33(nums []int, target int) int {
FILE: leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go
type question33 (line 8) | type question33 struct
type para33 (line 15) | type para33 struct
type ans33 (line 22) | type ans33 struct
function Test_Problem33 (line 26) | func Test_Problem33(t *testing.T) {
FILE: leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go
function searchRange (line 3) | func searchRange(nums []int, target int) []int {
function searchFirstEqualElement (line 9) | func searchFirstEqualElement(nums []int, target int) int {
function searchLastEqualElement (line 28) | func searchLastEqualElement(nums []int, target int) int {
function searchFirstGreaterElement (line 47) | func searchFirstGreaterElement(nums []int, target int) int {
function searchLastLessElement (line 64) | func searchLastLessElement(nums []int, target int) int {
FILE: leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go
type question34 (line 8) | type question34 struct
type para34 (line 15) | type para34 struct
type ans34 (line 22) | type ans34 struct
function Test_Problem34 (line 26) | func Test_Problem34(t *testing.T) {
FILE: leetcode/0035.Search-Insert-Position/35. Search Insert Position.go
function searchInsert (line 3) | func searchInsert(nums []int, target int) int {
FILE: leetcode/0035.Search-Insert-Position/35. Search Insert Position_test.go
type question35 (line 8) | type question35 struct
type para35 (line 15) | type para35 struct
type ans35 (line 22) | type ans35 struct
function Test_Problem35 (line 26) | func Test_Problem35(t *testing.T) {
FILE: leetcode/0036.Valid-Sudoku/36. Valid Sudoku.go
function isValidSudoku (line 6) | func isValidSudoku(board [][]byte) bool {
function isValidSudoku1 (line 63) | func isValidSudoku1(board [][]byte) bool {
FILE: leetcode/0036.Valid-Sudoku/36. Valid Sudoku_test.go
type question36 (line 8) | type question36 struct
type para36 (line 15) | type para36 struct
type ans36 (line 21) | type ans36 struct
function Test_Problem36 (line 25) | func Test_Problem36(t *testing.T) {
FILE: leetcode/0037.Sudoku-Solver/37. Sudoku Solver.go
type position (line 3) | type position struct
function solveSudoku (line 8) | func solveSudoku(board [][]byte) {
function putSudoku (line 20) | func putSudoku(board *[][]byte, pos []position, index int, succ *bool) {
function checkSudoku (line 40) | func checkSudoku(board *[][]byte, pos position, val int) bool {
FILE: leetcode/0037.Sudoku-Solver/37. Sudoku Solver_test.go
type question37 (line 8) | type question37 struct
type para37 (line 15) | type para37 struct
type ans37 (line 21) | type ans37 struct
function Test_Problem37 (line 25) | func Test_Problem37(t *testing.T) {
FILE: leetcode/0039.Combination-Sum/39. Combination Sum.go
function combinationSum (line 5) | func combinationSum(candidates []int, target int) [][]int {
function findcombinationSum (line 15) | func findcombinationSum(nums []int, target, index int, c []int, res *[][...
FILE: leetcode/0039.Combination-Sum/39. Combination Sum_test.go
type question39 (line 8) | type question39 struct
type para39 (line 15) | type para39 struct
type ans39 (line 22) | type ans39 struct
function Test_Problem39 (line 26) | func Test_Problem39(t *testing.T) {
FILE: leetcode/0040.Combination-Sum-II/40. Combination Sum II.go
function combinationSum2 (line 7) | func combinationSum2(candidates []int, target int) [][]int {
function findcombinationSum2 (line 17) | func findcombinationSum2(nums []int, target, index int, c []int, res *[]...
FILE: leetcode/0040.Combination-Sum-II/40. Combination Sum II_test.go
type question40 (line 8) | type question40 struct
type para40 (line 15) | type para40 struct
type ans40 (line 22) | type ans40 struct
function Test_Problem40 (line 26) | func Test_Problem40(t *testing.T) {
FILE: leetcode/0041.First-Missing-Positive/41. First Missing Positive.go
function firstMissingPositive (line 3) | func firstMissingPositive(nums []int) int {
FILE: leetcode/0041.First-Missing-Positive/41. First Missing Positive_test.go
type question41 (line 8) | type question41 struct
type para41 (line 15) | type para41 struct
type ans41 (line 21) | type ans41 struct
function Test_Problem41 (line 25) | func Test_Problem41(t *testing.T) {
FILE: leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water.go
function trap (line 3) | func trap(height []int) int {
FILE: leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go
type question42 (line 8) | type question42 struct
type para42 (line 15) | type para42 struct
type ans42 (line 21) | type ans42 struct
function Test_Problem42 (line 25) | func Test_Problem42(t *testing.T) {
FILE: leetcode/0043.Multiply-Strings/43. Multiply Strings.go
function multiply (line 3) | func multiply(num1 string, num2 string) string {
FILE: leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go
type question43 (line 8) | type question43 struct
type para43 (line 15) | type para43 struct
type ans43 (line 22) | type ans43 struct
function Test_Problem43 (line 26) | func Test_Problem43(t *testing.T) {
FILE: leetcode/0045.Jump-Game-II/45. Jump Game II.go
function jump (line 3) | func jump(nums []int) int {
FILE: leetcode/0045.Jump-Game-II/45. Jump Game II_test.go
type question45 (line 8) | type question45 struct
type para45 (line 15) | type para45 struct
type ans45 (line 21) | type ans45 struct
function Test_Problem45 (line 25) | func Test_Problem45(t *testing.T) {
FILE: leetcode/0046.Permutations/46. Permutations.go
function permute (line 3) | func permute(nums []int) [][]int {
function generatePermutation (line 12) | func generatePermutation(nums []int, index int, p []int, res *[][]int, u...
FILE: leetcode/0046.Permutations/46. Permutations_test.go
type question46 (line 8) | type question46 struct
type para46 (line 15) | type para46 struct
type ans46 (line 21) | type ans46 struct
function Test_Problem46 (line 25) | func Test_Problem46(t *testing.T) {
FILE: leetcode/0047.Permutations-II/47. Permutations II.go
function permuteUnique (line 5) | func permuteUnique(nums []int) [][]int {
function generatePermutation47 (line 15) | func generatePermutation47(nums []int, index int, p []int, res *[][]int,...
FILE: leetcode/0047.Permutations-II/47. Permutations II_test.go
type question47 (line 8) | type question47 struct
type para47 (line 15) | type para47 struct
type ans47 (line 21) | type ans47 struct
function Test_Problem47 (line 25) | func Test_Problem47(t *testing.T) {
FILE: leetcode/0048.Rotate-Image/48. Rotate Image.go
function rotate (line 4) | func rotate(matrix [][]int) {
function rotate1 (line 21) | func rotate1(matrix [][]int) {
function swap (line 47) | func swap(nums [][]int, i, j int) {
function reverse (line 52) | func reverse(nums []int) []int {
FILE: leetcode/0048.Rotate-Image/48. Rotate Image_test.go
type question48 (line 8) | type question48 struct
type para48 (line 15) | type para48 struct
type ans48 (line 21) | type ans48 struct
function Test_Problem48 (line 25) | func Test_Problem48(t *testing.T) {
FILE: leetcode/0049.Group-Anagrams/49. Group Anagrams.go
type sortRunes (line 5) | type sortRunes
method Less (line 7) | func (s sortRunes) Less(i, j int) bool {
method Swap (line 11) | func (s sortRunes) Swap(i, j int) {
method Len (line 15) | func (s sortRunes) Len() int {
function groupAnagrams (line 19) | func groupAnagrams(strs []string) [][]string {
FILE: leetcode/0049.Group-Anagrams/49. Group Anagrams_test.go
type question49 (line 8) | type question49 struct
type para49 (line 15) | type para49 struct
type ans49 (line 21) | type ans49 struct
function Test_Problem49 (line 25) | func Test_Problem49(t *testing.T) {
FILE: leetcode/0050.Powx-n/50. Pow(x, n).go
function myPow (line 4) | func myPow(x float64, n int) float64 {
FILE: leetcode/0050.Powx-n/50. Pow(x, n)_test.go
type question50 (line 8) | type question50 struct
type para50 (line 15) | type para50 struct
type ans50 (line 22) | type ans50 struct
function Test_Problem50 (line 26) | func Test_Problem50(t *testing.T) {
FILE: leetcode/0051.N-Queens/51. N-Queens.go
function solveNQueens (line 4) | func solveNQueens(n int) [][]string {
function putQueen (line 11) | func putQueen(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *[]...
function generateBoard (line 33) | func generateBoard(n int, row *[]int) []string {
function solveNQueens2 (line 51) | func solveNQueens2(n int) (res [][]string) {
FILE: leetcode/0051.N-Queens/51. N-Queens_test.go
type question51 (line 8) | type question51 struct
type para51 (line 15) | type para51 struct
type ans51 (line 21) | type ans51 struct
function Test_Problem51 (line 25) | func Test_Problem51(t *testing.T) {
FILE: leetcode/0052.N-Queens-II/52. N-Queens II.go
function totalNQueens (line 4) | func totalNQueens(n int) int {
function totalNQueens1 (line 10) | func totalNQueens1(n int) int {
function putQueen52 (line 17) | func putQueen52(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *...
FILE: leetcode/0052.N-Queens-II/52. N-Queens II_test.go
type question52 (line 8) | type question52 struct
type para52 (line 15) | type para52 struct
type ans52 (line 21) | type ans52 struct
function Test_Problem52 (line 25) | func Test_Problem52(t *testing.T) {
FILE: leetcode/0053.Maximum-Subarray/53. Maximum Subarray.go
function maxSubArray (line 4) | func maxSubArray(nums []int) int {
function maxSubArray1 (line 25) | func maxSubArray1(nums []int) int {
function max (line 43) | func max(a int, b int) int {
FILE: leetcode/0053.Maximum-Subarray/53. Maximum Subarray_test.go
type question53 (line 8) | type question53 struct
type para53 (line 15) | type para53 struct
type ans53 (line 21) | type ans53 struct
function Test_Problem53 (line 25) | func Test_Problem53(t *testing.T) {
FILE: leetcode/0054.Spiral-Matrix/54. Spiral Matrix.go
function spiralOrder (line 4) | func spiralOrder(matrix [][]int) []int {
function spiralOrder2 (line 72) | func spiralOrder2(matrix [][]int) []int {
FILE: leetcode/0054.Spiral-Matrix/54. Spiral Matrix_test.go
type question54 (line 8) | type question54 struct
type para54 (line 15) | type para54 struct
type ans54 (line 21) | type ans54 struct
function Test_Problem54 (line 25) | func Test_Problem54(t *testing.T) {
FILE: leetcode/0055.Jump-Game/55. Jump Game.go
function canJump (line 3) | func canJump(nums []int) bool {
function max (line 21) | func max(a int, b int) int {
FILE: leetcode/0055.Jump-Game/55. Jump Game_test.go
type question55 (line 8) | type question55 struct
type para55 (line 15) | type para55 struct
type ans55 (line 21) | type ans55 struct
function Test_Problem55 (line 25) | func Test_Problem55(t *testing.T) {
FILE: leetcode/0056.Merge-Intervals/56. Merge Intervals.go
function merge56 (line 18) | func merge56(intervals []Interval) []Interval {
function max (line 37) | func max(a int, b int) int {
function min (line 44) | func min(a int, b int) int {
function partitionSort (line 51) | func partitionSort(a []Interval, lo, hi int) int {
function quickSort (line 63) | func quickSort(a []Interval, lo, hi int) {
FILE: leetcode/0056.Merge-Intervals/56. Merge Intervals_test.go
type question56 (line 8) | type question56 struct
type para56 (line 15) | type para56 struct
type ans56 (line 21) | type ans56 struct
function Test_Problem56 (line 25) | func Test_Problem56(t *testing.T) {
FILE: leetcode/0057.Insert-Interval/57. Insert Interval.go
function insert (line 18) | func insert(intervals []Interval, newInterval Interval) []Interval {
function max (line 43) | func max(a int, b int) int {
function min (line 50) | func min(a int, b int) int {
FILE: leetcode/0057.Insert-Interval/57. Insert Interval_test.go
type question57 (line 8) | type question57 struct
type para57 (line 15) | type para57 struct
type ans57 (line 22) | type ans57 struct
function Test_Problem57 (line 26) | func Test_Problem57(t *testing.T) {
FILE: leetcode/0058.Length-of-Last-Word/58.Length of Last Word.go
function lengthOfLastWord (line 3) | func lengthOfLastWord(s string) int {
FILE: leetcode/0058.Length-of-Last-Word/58.Length of Last Word_test.go
type question58 (line 8) | type question58 struct
type para58 (line 14) | type para58 struct
type ans58 (line 19) | type ans58 struct
function Test_Problem58 (line 23) | func Test_Problem58(t *testing.T) {
FILE: leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II.go
function generateMatrix (line 3) | func generateMatrix(n int) [][]int {
FILE: leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go
type question59 (line 8) | type question59 struct
type para59 (line 15) | type para59 struct
type ans59 (line 21) | type ans59 struct
function Test_Problem59 (line 25) | func Test_Problem59(t *testing.T) {
FILE: leetcode/0060.Permutation-Sequence/60. Permutation Sequence.go
function getPermutation (line 8) | func getPermutation(n int, k int) string {
function findPermutation (line 17) | func findPermutation(n, index int, k *int, p []int, res *string, used *[...
FILE: leetcode/0060.Permutation-Sequence/60. Permutation Sequence_test.go
type question60 (line 8) | type question60 struct
type para60 (line 15) | type para60 struct
type ans60 (line 22) | type ans60 struct
function Test_Problem60 (line 26) | func Test_Problem60(t *testing.T) {
FILE: leetcode/0061.Rotate-List/61. Rotate List.go
function rotateRight (line 17) | func rotateRight(head *ListNode, k int) *ListNode {
FILE: leetcode/0061.Rotate-List/61. Rotate List_test.go
type question61 (line 10) | type question61 struct
type para61 (line 17) | type para61 struct
type ans61 (line 24) | type ans61 struct
function Test_Problem61 (line 28) | func Test_Problem61(t *testing.T) {
FILE: leetcode/0062.Unique-Paths/62. Unique Paths.go
function uniquePaths (line 3) | func uniquePaths(m int, n int) int {
FILE: leetcode/0062.Unique-Paths/62. Unique Paths_test.go
type question62 (line 8) | type question62 struct
type para62 (line 15) | type para62 struct
type ans62 (line 22) | type ans62 struct
function Test_Problem62 (line 26) | func Test_Problem62(t *testing.T) {
FILE: leetcode/0063.Unique-Paths-II/63. Unique Paths II.go
function uniquePathsWithObstacles (line 3) | func uniquePathsWithObstacles(obstacleGrid [][]int) int {
FILE: leetcode/0063.Unique-Paths-II/63. Unique Paths II_test.go
type question63 (line 8) | type question63 struct
type para63 (line 15) | type para63 struct
type ans63 (line 21) | type ans63 struct
function Test_Problem63 (line 25) | func Test_Problem63(t *testing.T) {
FILE: leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum.go
function minPathSum (line 4) | func minPathSum(grid [][]int) int {
function minPathSum1 (line 22) | func minPathSum1(grid [][]int) int {
function min (line 59) | func min(a int, b int) int {
FILE: leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go
type question64 (line 8) | type question64 struct
type para64 (line 15) | type para64 struct
type ans64 (line 21) | type ans64 struct
function Test_Problem64 (line 25) | func Test_Problem64(t *testing.T) {
FILE: leetcode/0065.Valid-Number/65. Valid Number.go
function isNumber (line 3) | func isNumber(s string) bool {
FILE: leetcode/0065.Valid-Number/65. Valid Number_test.go
function Test_Problem65 (line 8) | func Test_Problem65(t *testing.T) {
FILE: leetcode/0066.Plus-One/66. Plus One.go
function plusOne (line 3) | func plusOne(digits []int) []int {
FILE: leetcode/0066.Plus-One/66. Plus One_test.go
type question66 (line 8) | type question66 struct
type para66 (line 15) | type para66 struct
type ans66 (line 21) | type ans66 struct
function Test_Problem66 (line 25) | func Test_Problem66(t *testing.T) {
FILE: leetcode/0067.Add-Binary/67. Add Binary.go
function addBinary (line 8) | func addBinary(a string, b string) string {
FILE: leetcode/0067.Add-Binary/67. Add Binary_test.go
type question67 (line 8) | type question67 struct
type para67 (line 15) | type para67 struct
type ans67 (line 22) | type ans67 struct
function Test_Problem67 (line 26) | func Test_Problem67(t *testing.T) {
FILE: leetcode/0069.Sqrtx/69. Sqrt(x).go
function mySqrt (line 4) | func mySqrt(x int) int {
function mySqrt1 (line 18) | func mySqrt1(x int) int {
FILE: leetcode/0069.Sqrtx/69. Sqrt(x)_test.go
type question69 (line 8) | type question69 struct
type para69 (line 15) | type para69 struct
type ans69 (line 21) | type ans69 struct
function Test_Problem69 (line 25) | func Test_Problem69(t *testing.T) {
FILE: leetcode/0070.Climbing-Stairs/70. Climbing Stairs.go
function climbStairs (line 3) | func climbStairs(n int) int {
FILE: leetcode/0070.Climbing-Stairs/70. Climbing Stairs_test.go
type question70 (line 8) | type question70 struct
type para70 (line 15) | type para70 struct
type ans70 (line 21) | type ans70 struct
function Test_Problem70 (line 25) | func Test_Problem70(t *testing.T) {
FILE: leetcode/0071.Simplify-Path/71. Simplify Path.go
function simplifyPath (line 9) | func simplifyPath(path string) string {
function simplifyPath1 (line 32) | func simplifyPath1(path string) string {
FILE: leetcode/0071.Simplify-Path/71. Simplify Path_test.go
type question71 (line 8) | type question71 struct
type para71 (line 15) | type para71 struct
type ans71 (line 21) | type ans71 struct
function Test_Problem71 (line 25) | func Test_Problem71(t *testing.T) {
FILE: leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go
function setZeroes (line 3) | func setZeroes(matrix [][]int) {
FILE: leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go
type question73 (line 8) | type question73 struct
type para73 (line 15) | type para73 struct
type ans73 (line 21) | type ans73 struct
function Test_Problem73 (line 24) | func Test_Problem73(t *testing.T) {
FILE: leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go
function searchMatrix (line 3) | func searchMatrix(matrix [][]int, target int) bool {
FILE: leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go
type question74 (line 8) | type question74 struct
type para74 (line 15) | type para74 struct
type ans74 (line 22) | type ans74 struct
function Test_Problem74 (line 26) | func Test_Problem74(t *testing.T) {
FILE: leetcode/0075.Sort-Colors/75. Sort Colors.go
function sortColors (line 3) | func sortColors(nums []int) {
FILE: leetcode/0075.Sort-Colors/75. Sort Colors_test.go
type question75 (line 8) | type question75 struct
type para75 (line 15) | type para75 struct
type ans75 (line 21) | type ans75 struct
function Test_Problem75 (line 25) | func Test_Problem75(t *testing.T) {
FILE: leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go
function minWindow (line 3) | func minWindow(s string, t string) string {
FILE: leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go
type question76 (line 8) | type question76 struct
type para76 (line 15) | type para76 struct
type ans76 (line 22) | type ans76 struct
function Test_Problem76 (line 26) | func Test_Problem76(t *testing.T) {
FILE: leetcode/0077.Combinations/77. Combinations.go
function combine (line 3) | func combine(n int, k int) [][]int {
function generateCombinations (line 12) | func generateCombinations(n, k, start int, c []int, res *[][]int) {
FILE: leetcode/0077.Combinations/77. Combinations_test.go
type question77 (line 8) | type question77 struct
type para77 (line 15) | type para77 struct
type ans77 (line 22) | type ans77 struct
function Test_Problem77 (line 26) | func Test_Problem77(t *testing.T) {
FILE: leetcode/0078.Subsets/78. Subsets.go
function subsets (line 6) | func subsets(nums []int) [][]int {
function generateSubsets (line 14) | func generateSubsets(nums []int, k, start int, c []int, res *[][]int) {
function subsets1 (line 31) | func subsets1(nums []int) [][]int {
function subsets2 (line 46) | func subsets2(nums []int) [][]int {
FILE: leetcode/0078.Subsets/78. Subsets_test.go
type question78 (line 8) | type question78 struct
type para78 (line 15) | type para78 struct
type ans78 (line 21) | type ans78 struct
function Test_Problem78 (line 25) | func Test_Problem78(t *testing.T) {
FILE: leetcode/0079.Word-Search/79. Word Search.go
function exist (line 10) | func exist(board [][]byte, word string) bool {
function isInBoard (line 25) | func isInBoard(board [][]byte, x, y int) bool {
function searchWord (line 29) | func searchWord(board [][]byte, visited [][]bool, word string, index, x,...
FILE: leetcode/0079.Word-Search/79. Word Search_test.go
type question79 (line 8) | type question79 struct
type para79 (line 15) | type para79 struct
type ans79 (line 22) | type ans79 struct
function Test_Problem79 (line 26) | func Test_Problem79(t *testing.T) {
FILE: leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go
function removeDuplicates (line 3) | func removeDuplicates(nums []int) int {
FILE: leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go
type question80 (line 8) | type question80 struct
type para80 (line 15) | type para80 struct
type ans80 (line 21) | type ans80 struct
function Test_Problem80 (line 25) | func Test_Problem80(t *testing.T) {
FILE: leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go
function search (line 3) | func search(nums []int, target int) bool {
FILE: leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go
type question81 (line 8) | type question81 struct
type para81 (line 15) | type para81 struct
type ans81 (line 22) | type ans81 struct
function Test_Problem81 (line 26) | func Test_Problem81(t *testing.T) {
FILE: leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go
function deleteDuplicates1 (line 17) | func deleteDuplicates1(head *ListNode) *ListNode {
function deleteDuplicates2 (line 63) | func deleteDuplicates2(head *ListNode) *ListNode {
function deleteDuplicates (line 77) | func deleteDuplicates(head *ListNode) *ListNode {
function deleteDuplicates3 (line 96) | func deleteDuplicates3(head *ListNode) *ListNode {
function deleteDuplicates4 (line 119) | func deleteDuplicates4(head *ListNode) *ListNode {
FILE: leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go
type question82 (line 10) | type question82 struct
type para82 (line 17) | type para82 struct
type ans82 (line 23) | type ans82 struct
function Test_Problem82 (line 27) | func Test_Problem82(t *testing.T) {
FILE: leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go
function deleteDuplicates (line 18) | func deleteDuplicates(head *ListNode) *ListNode {
FILE: leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go
type question83 (line 10) | type question83 struct
type para83 (line 17) | type para83 struct
type ans83 (line 23) | type ans83 struct
function Test_Problem83 (line 27) | func Test_Problem83(t *testing.T) {
FILE: leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go
function largestRectangleArea (line 3) | func largestRectangleArea(heights []int) int {
function max (line 27) | func max(a int, b int) int {
FILE: leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go
type question84 (line 8) | type question84 struct
type para84 (line 15) | type para84 struct
type ans84 (line 21) | type ans84 struct
function Test_Problem84 (line 25) | func Test_Problem84(t *testing.T) {
FILE: leetcode/0086.Partition-List/86. Partition List.go
function partition (line 19) | func partition(head *ListNode, x int) *ListNode {
type DoublyListNode (line 41) | type DoublyListNode struct
function partition1 (line 48) | func partition1(head *ListNode, x int) *ListNode {
function genDoublyListNode (line 92) | func genDoublyListNode(head *ListNode) *DoublyListNode {
function genListNode (line 105) | func genListNode(head *DoublyListNode) *ListNode {
FILE: leetcode/0086.Partition-List/86. Partition List_test.go
type question86 (line 10) | type question86 struct
type para86 (line 17) | type para86 struct
type ans86 (line 24) | type ans86 struct
function Test_Problem86 (line 28) | func Test_Problem86(t *testing.T) {
FILE: leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go
function merge (line 3) | func merge(nums1 []int, m int, nums2 []int, n int) {
FILE: leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go
type question88 (line 8) | type question88 struct
type para88 (line 15) | type para88 struct
type ans88 (line 24) | type ans88 struct
function Test_Problem88 (line 28) | func Test_Problem88(t *testing.T) {
FILE: leetcode/0089.Gray-Code/89. Gray Code.go
function grayCode (line 4) | func grayCode(n int) []int {
function generateGrayCode (line 14) | func generateGrayCode(n, step int, num *[]int, res *[]int) {
function convertBinary (line 39) | func convertBinary(num []int) int {
function flipGrayCode (line 48) | func flipGrayCode(num int) int {
function grayCode1 (line 56) | func grayCode1(n int) []int {
FILE: leetcode/0089.Gray-Code/89. Gray Code_test.go
type question89 (line 8) | type question89 struct
type para89 (line 15) | type para89 struct
type ans89 (line 21) | type ans89 struct
function Test_Problem89 (line 25) | func Test_Problem89(t *testing.T) {
FILE: leetcode/0090.Subsets-II/90. Subsets II.go
function subsetsWithDup (line 8) | func subsetsWithDup(nums []int) [][]int {
function generateSubsetsWithDup (line 17) | func generateSubsetsWithDup(nums []int, k, start int, c []int, res *[][]...
FILE: leetcode/0090.Subsets-II/90. Subsets II_test.go
type question90 (line 8) | type question90 struct
type para90 (line 15) | type para90 struct
type ans90 (line 21) | type ans90 struct
function Test_Problem90 (line 25) | func Test_Problem90(t *testing.T) {
FILE: leetcode/0091.Decode-Ways/91. Decode Ways.go
function numDecodings (line 3) | func numDecodings(s string) int {
FILE: leetcode/0091.Decode-Ways/91. Decode Ways_test.go
type question91 (line 8) | type question91 struct
type para91 (line 15) | type para91 struct
type ans91 (line 21) | type ans91 struct
function Test_Problem91 (line 25) | func Test_Problem91(t *testing.T) {
FILE: leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go
function reverseBetween (line 18) | func reverseBetween(head *ListNode, m int, n int) *ListNode {
FILE: leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go
type question92 (line 10) | type question92 struct
type para92 (line 17) | type para92 struct
type ans92 (line 24) | type ans92 struct
function Test_Problem92 (line 28) | func Test_Problem92(t *testing.T) {
FILE: leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses.go
function restoreIPAddresses (line 7) | func restoreIPAddresses(s string) []string {
function dfs (line 16) | func dfs(s string, index int, ip []int, res *[]string) {
function getString (line 43) | func getString(ip []int) string {
FILE: leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go
type question93 (line 8) | type question93 struct
type para93 (line 15) | type para93 struct
type ans93 (line 21) | type ans93 struct
function Test_Problem93 (line 25) | func Test_Problem93(t *testing.T) {
FILE: leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go
function inorderTraversal (line 19) | func inorderTraversal(root *TreeNode) []int {
function inorder (line 25) | func inorder(root *TreeNode, output *[]int) {
FILE: leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go
type question94 (line 10) | type question94 struct
type para94 (line 17) | type para94 struct
type ans94 (line 23) | type ans94 struct
function Test_Problem94 (line 27) | func Test_Problem94(t *testing.T) {
FILE: leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go
function generateTrees (line 19) | func generateTrees(n int) []*TreeNode {
function generateBSTree (line 26) | func generateBSTree(start, end int) []*TreeNode {
FILE: leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go
type question95 (line 10) | type question95 struct
type para95 (line 17) | type para95 struct
type ans95 (line 23) | type ans95 struct
function Test_Problem95 (line 27) | func Test_Problem95(t *testing.T) {
FILE: leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go
function numTrees (line 3) | func numTrees(n int) int {
FILE: leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go
type question96 (line 8) | type question96 struct
type para96 (line 15) | type para96 struct
type ans96 (line 21) | type ans96 struct
function Test_Problem96 (line 25) | func Test_Problem96(t *testing.T) {
FILE: leetcode/0097.Interleaving-String/97. Interleaving String.go
function isInterleave (line 3) | func isInterleave(s1 string, s2 string, s3 string) bool {
function dfs (line 11) | func dfs(s1, s2, s3 string, p1, p2 int, visited map[int]bool) bool {
FILE: leetcode/0097.Interleaving-String/97. Interleaving String_test.go
type question97 (line 8) | type question97 struct
type para97 (line 15) | type para97 struct
type ans97 (line 23) | type ans97 struct
function Test_Problem97 (line 27) | func Test_Problem97(t *testing.T) {
FILE: leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go
function isValidBST (line 22) | func isValidBST(root *TreeNode) bool {
function isValidbst (line 25) | func isValidbst(root *TreeNode, min, max float64) bool {
function isValidBST1 (line 34) | func isValidBST1(root *TreeNode) bool {
function inOrder (line 45) | func inOrder(root *TreeNode, arr *[]int) {
FILE: leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go
type question98 (line 10) | type question98 struct
type para98 (line 17) | type para98 struct
type ans98 (line 23) | type ans98 struct
function Test_Problem98 (line 27) | func Test_Problem98(t *testing.T) {
FILE: leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go
function recoverTree (line 19) | func recoverTree(root *TreeNode) {
function inOrderTraverse (line 28) | func inOrderTraverse(root, prev, target1, target2 *TreeNode) (*TreeNode,...
FILE: leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go
type question99 (line 10) | type question99 struct
type para99 (line 17) | type para99 struct
type ans99 (line 23) | type ans99 struct
function Test_Problem99 (line 27) | func Test_Problem99(t *testing.T) {
FILE: leetcode/0100.Same-Tree/100. Same Tree.go
function isSameTree (line 19) | func isSameTree(p *TreeNode, q *TreeNode) bool {
FILE: leetcode/0100.Same-Tree/100. Same Tree_test.go
type question100 (line 10) | type question100 struct
type para100 (line 17) | type para100 struct
type ans100 (line 24) | type ans100 struct
function Test_Problem100 (line 28) | func Test_Problem100(t *testing.T) {
FILE: leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go
function isSymmetric (line 20) | func isSymmetric(root *TreeNode) bool {
function isMirror (line 27) | func isMirror(left *TreeNode, right *TreeNode) bool {
function isSymmetric1 (line 38) | func isSymmetric1(root *TreeNode) bool {
function isSameTree (line 45) | func isSameTree(p *TreeNode, q *TreeNode) bool {
function invertTree (line 58) | func invertTree(root *TreeNode) *TreeNode {
FILE: leetcode/0101.Symmetric-Tree/101. Symmetric Tree_test.go
type question101 (line 10) | type question101 struct
type para101 (line 17) | type para101 struct
type ans101 (line 23) | type ans101 struct
function Test_Problem101 (line 27) | func Test_Problem101(t *testing.T) {
FILE: leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go
function levelOrder (line 20) | func levelOrder(root *TreeNode) [][]int {
function levelOrder1 (line 45) | func levelOrder1(root *TreeNode) [][]int {
FILE: leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go
type question102 (line 10) | type question102 struct
type para102 (line 17) | type para102 struct
type ans102 (line 23) | type ans102 struct
function Test_Problem102 (line 27) | func Test_Problem102(t *testing.T) {
FILE: leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go
function zigzagLevelOrder (line 20) | func zigzagLevelOrder(root *TreeNode) [][]int {
function zigzagLevelOrder0 (line 63) | func zigzagLevelOrder0(root *TreeNode) [][]int {
function search (line 69) | func search(root *TreeNode, depth int, res *[][]int) {
function zigzagLevelOrder1 (line 86) | func zigzagLevelOrder1(root *TreeNode) [][]int {
FILE: leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go
type question103 (line 10) | type question103 struct
type para103 (line 17) | type para103 struct
type ans103 (line 23) | type ans103 struct
function Test_Problem103 (line 27) | func Test_Problem103(t *testing.T) {
FILE: leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go
function maxDepth (line 19) | func maxDepth(root *TreeNode) int {
function max (line 26) | func max(a int, b int) int {
FILE: leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go
type question104 (line 10) | type question104 struct
type para104 (line 17) | type para104 struct
type ans104 (line 23) | type ans104 struct
function Test_Problem104 (line 27) | func Test_Problem104(t *testing.T) {
FILE: leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go
function buildTree (line 20) | func buildTree(preorder []int, inorder []int) *TreeNode {
function buildTree1 (line 35) | func buildTree1(preorder []int, inorder []int) *TreeNode {
function buildPreIn2TreeDFS (line 43) | func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int...
FILE: leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go
type question105 (line 10) | type question105 struct
type para105 (line 17) | type para105 struct
type ans105 (line 24) | type ans105 struct
function Test_Problem105 (line 28) | func Test_Problem105(t *testing.T) {
FILE: leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go
function buildTree (line 20) | func buildTree(inorder []int, postorder []int) *TreeNode {
function buildTree1 (line 37) | func buildTree1(inorder []int, postorder []int) *TreeNode {
function buildInPos2TreeDFS (line 45) | func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart ...
FILE: leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go
type question106 (line 10) | type question106 struct
type para106 (line 17) | type para106 struct
type ans106 (line 24) | type ans106 struct
function Test_Problem106 (line 28) | func Test_Problem106(t *testing.T) {
FILE: leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go
function levelOrderBottom (line 19) | func levelOrderBottom(root *TreeNode) [][]int {
function levelOrder (line 28) | func levelOrder(root *TreeNode) [][]int {
FILE: leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go
type question107 (line 10) | type question107 struct
type para107 (line 17) | type para107 struct
type ans107 (line 23) | type ans107 struct
function Test_Problem107 (line 27) | func Test_Problem107(t *testing.T) {
FILE: leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go
function sortedArrayToBST (line 19) | func sortedArrayToBST(nums []int) *TreeNode {
FILE: leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go
type question108 (line 10) | type question108 struct
type para108 (line 17) | type para108 struct
type ans108 (line 23) | type ans108 struct
function Test_Problem108 (line 27) | func Test_Problem108(t *testing.T) {
FILE: leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go
function sortedListToBST (line 30) | func sortedListToBST(head *ListNode) *TreeNode {
function middleNodeAndPreNode (line 50) | func middleNodeAndPreNode(head *ListNode) (middle *ListNode, pre *ListNo...
FILE: leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go
type question109 (line 10) | type question109 struct
type para109 (line 17) | type para109 struct
type ans109 (line 23) | type ans109 struct
function Test_Problem109 (line 27) | func Test_Problem109(t *testing.T) {
FILE: leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go
function isBalanced (line 19) | func isBalanced(root *TreeNode) bool {
function depth (line 28) | func depth(root *TreeNode) int {
function abs (line 35) | func abs(a int) int {
function max (line 42) | func max(a int, b int) int {
FILE: leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go
type question110 (line 10) | type question110 struct
type para110 (line 17) | type para110 struct
type ans110 (line 23) | type ans110 struct
function Test_Problem110 (line 27) | func Test_Problem110(t *testing.T) {
FILE: leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go
function minDepth (line 19) | func minDepth(root *TreeNode) int {
function min (line 32) | func min(a int, b int) int {
FILE: leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go
type question111 (line 10) | type question111 struct
type para111 (line 17) | type para111 struct
type ans111 (line 23) | type ans111 struct
function Test_Problem111 (line 27) | func Test_Problem111(t *testing.T) {
FILE: leetcode/0112.Path-Sum/112. Path Sum.go
function hasPathSum (line 19) | func hasPathSum(root *TreeNode, sum int) bool {
FILE: leetcode/0112.Path-Sum/112. Path Sum_test.go
type question112 (line 10) | type question112 struct
type para112 (line 17) | type para112 struct
type ans112 (line 24) | type ans112 struct
function Test_Problem112 (line 28) | func Test_Problem112(t *testing.T) {
FILE: leetcode/0113.Path-Sum-II/113. Path Sum II.go
function pathSum (line 20) | func pathSum(root *TreeNode, sum int) [][]int {
function findPath (line 26) | func findPath(n *TreeNode, sum int, slice [][]int, stack []int) [][]int {
function pathSum1 (line 42) | func pathSum1(root *TreeNode, sum int) [][]int {
FILE: leetcode/0113.Path-Sum-II/113. Path Sum II_test.go
type question113 (line 10) | type question113 struct
type para113 (line 17) | type para113 struct
type ans113 (line 24) | type ans113 struct
function Test_Problem113 (line 28) | func Test_Problem113(t *testing.T) {
FILE: leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go
function flatten (line 20) | func flatten(root *TreeNode) {
function preorder (line 29) | func preorder(root *TreeNode) (ans []*TreeNode) {
function flatten1 (line 39) | func flatten1(root *TreeNode) {
function flatten2 (line 55) | func flatten2(root *TreeNode) {
FILE: leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go
type question114 (line 10) | type question114 struct
type para114 (line 17) | type para114 struct
type ans114 (line 23) | type ans114 struct
function Test_Problem114 (line 27) | func Test_Problem114(t *testing.T) {
FILE: leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences.go
function numDistinct (line 4) | func numDistinct(s string, t string) int {
function numDistinct1 (line 25) | func numDistinct1(s, t string) int {
FILE: leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences_test.go
type question115 (line 8) | type question115 struct
type para115 (line 15) | type para115 struct
type ans115 (line 22) | type ans115 struct
function Test_Problem115 (line 26) | func Test_Problem115(t *testing.T) {
FILE: leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node.go
type Node (line 3) | type Node struct
function connect (line 11) | func connect(root *Node) *Node {
function connect2 (line 36) | func connect2(root *Node) *Node {
function connectTwoNode (line 44) | func connectTwoNode(node1, node2 *Node) {
FILE: leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node_test.go
type question116 (line 8) | type question116 struct
type para116 (line 15) | type para116 struct
type ans116 (line 21) | type ans116 struct
function newQuestionNode (line 25) | func newQuestionNode() *Node {
function newResultNode (line 58) | func newResultNode() *Node {
function Test_Problem116 (line 100) | func Test_Problem116(t *testing.T) {
FILE: leetcode/0118.Pascals-Triangle/118. Pascals Triangle.go
function generate (line 3) | func generate(numRows int) [][]int {
FILE: leetcode/0118.Pascals-Triangle/118. Pascals Triangle_test.go
type question118 (line 8) | type question118 struct
type para118 (line 15) | type para118 struct
type ans118 (line 21) | type ans118 struct
function Test_Problem118 (line 25) | func Test_Problem118(t *testing.T) {
FILE: leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II.go
function getRow (line 3) | func getRow(rowIndex int) []int {
FILE: leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II_test.go
type question119 (line 8) | type question119 struct
type para119 (line 15) | type para119 struct
type ans119 (line 21) | type ans119 struct
function Test_Problem119 (line 25) | func Test_Problem119(t *testing.T) {
FILE: leetcode/0120.Triangle/120. Triangle.go
function minimumTotal (line 8) | func minimumTotal(triangle [][]int) int {
function min (line 20) | func min(a int, b int) int {
function minimumTotal1 (line 28) | func minimumTotal1(triangle [][]int) int {
FILE: leetcode/0120.Triangle/120. Triangle_test.go
type question120 (line 8) | type question120 struct
type para120 (line 15) | type para120 struct
type ans120 (line 21) | type ans120 struct
function Test_Problem120 (line 25) | func Test_Problem120(t *testing.T) {
FILE: leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go
function maxProfit (line 4) | func maxProfit(prices []int) int {
function maxProfit1 (line 21) | func maxProfit1(prices []int) int {
function max (line 44) | func max(a int, b int) int {
FILE: leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go
type question121 (line 8) | type question121 struct
type para121 (line 15) | type para121 struct
type ans121 (line 21) | type ans121 struct
function Test_Problem121 (line 25) | func Test_Problem121(t *testing.T) {
FILE: leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go
function maxProfit122 (line 3) | func maxProfit122(prices []int) int {
FILE: leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go
type question122 (line 8) | type question122 struct
type para122 (line 15) | type para122 struct
type ans122 (line 21) | type ans122 struct
function Test_Problem122 (line 25) | func Test_Problem122(t *testing.T) {
FILE: leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go
function maxPathSum (line 21) | func maxPathSum(root *TreeNode) int {
function getPathSum (line 30) | func getPathSum(root *TreeNode, maxSum *int) int {
function max (line 42) | func max(a int, b int) int {
FILE: leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go
type question124 (line 10) | type question124 struct
type para124 (line 17) | type para124 struct
type ans124 (line 23) | type ans124 struct
function Test_Problem124 (line 27) | func Test_Problem124(t *testing.T) {
FILE: leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go
function isPalindrome (line 7) | func isPalindrome(s string) bool {
function isChar (line 27) | func isChar(c byte) bool {
FILE: leetcode/0125.Valid-Palindrome/125. Valid Palindrome_test.go
function Test_Problem125 (line 8) | func Test_Problem125(t *testing.T) {
FILE: leetcode/0126.Word-Ladder-II/126. Word Ladder II.go
function findLadders (line 3) | func findLadders(beginWord string, endWord string, wordList []string) []...
FILE: leetcode/0126.Word-Ladder-II/126. Word Ladder II_test.go
type question126 (line 8) | type question126 struct
type para126 (line 15) | type para126 struct
type ans126 (line 23) | type ans126 struct
function Test_Problem126 (line 27) | func Test_Problem126(t *testing.T) {
FILE: leetcode/0127.Word-Ladder/127. Word Ladder.go
function ladderLength (line 3) | func ladderLength(beginWord string, endWord string, wordList []string) i...
function getWordMap (line 26) | func getWordMap(wordList []string, beginWord string) map[string]int {
function getCandidates (line 38) | func getCandidates(word string) []string {
FILE: leetcode/0127.Word-Ladder/127. Word Ladder_test.go
type question127 (line 8) | type question127 struct
type para127 (line 15) | type para127 struct
type ans127 (line 23) | type ans127 struct
function Test_Problem127 (line 27) | func Test_Problem127(t *testing.T) {
FILE: leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go
function longestConsecutive (line 8) | func longestConsecutive(nums []int) int {
function max (line 39) | func max(a int, b int) int {
function longestConsecutive1 (line 47) | func longestConsecutive1(nums []int) int {
function longestConsecutive2 (line 81) | func longestConsecutive2(nums []int) int {
FILE: leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go
type question128 (line 8) | type question128 struct
type para128 (line 15) | type para128 struct
type ans128 (line 21) | type ans128 struct
function Test_Problem128 (line 25) | func Test_Problem128(t *testing.T) {
FILE: leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go
function sumNumbers (line 19) | func sumNumbers(root *TreeNode) int {
function dfs (line 25) | func dfs(root *TreeNode, sum int, res *int) {
FILE: leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go
type question129 (line 10) | type question129 struct
type para129 (line 17) | type para129 struct
type ans129 (line 23) | type ans129 struct
function Test_Problem129 (line 27) | func Test_Problem129(t *testing.T) {
FILE: leetcode/0130.Surrounded-Regions/130. Surrounded Regions.go
function solve (line 15) | func solve(board [][]byte) {
function solve1 (line 54) | func solve1(board [][]byte) {
function dfs130 (line 76) | func dfs130(i, j int, board [][]byte) {
FILE: leetcode/0130.Surrounded-Regions/130. Surrounded Regions_test.go
type question130 (line 8) | type question130 struct
type para130 (line 15) | type para130 struct
type ans130 (line 21) | type ans130 struct
function Test_Problem130 (line 25) | func Test_Problem130(t *testing.T) {
FILE: leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go
function partition131 (line 4) | func partition131(s string) [][]string {
function findPalindrome (line 13) | func findPalindrome(str string, index int, s string, isPal bool, pal []s...
function isPalindrome131 (line 42) | func isPalindrome131(s string) bool {
function partition131_1 (line 53) | func partition131_1(s string) [][]string {
function dfs131 (line 64) | func dfs131(s string, idx int, cur []string, result *[][]string) {
function isPal (line 79) | func isPal(str string, s, e int) bool {
FILE: leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go
type question131 (line 8) | type question131 struct
type para131 (line 15) | type para131 struct
type ans131 (line 21) | type ans131 struct
function Test_Problem131 (line 25) | func Test_Problem131(t *testing.T) {
FILE: leetcode/0134.Gas-Station/Gas.go
function canCompleteCircuit (line 3) | func canCompleteCircuit(gas []int, cost []int) int {
FILE: leetcode/0134.Gas-Station/Gas_test.go
type question134 (line 8) | type question134 struct
type para134 (line 15) | type para134 struct
type ans134 (line 22) | type ans134 struct
function Test_Problem134 (line 26) | func Test_Problem134(t *testing.T) {
FILE: leetcode/0135.Candy/135. Candy.go
function candy (line 3) | func candy(ratings []int) int {
FILE: leetcode/0135.Candy/135. Candy_test.go
type question135 (line 8) | type question135 struct
type para135 (line 15) | type para135 struct
type ans135 (line 21) | type ans135 struct
function Test_Problem135 (line 25) | func Test_Problem135(t *testing.T) {
FILE: leetcode/0136.Single-Number/136. Single Number.go
function singleNumber (line 3) | func singleNumber(nums []int) int {
FILE: leetcode/0136.Single-Number/136. Single Number_test.go
type question136 (line 8) | type question136 struct
type para136 (line 15) | type para136 struct
type ans136 (line 21) | type ans136 struct
function Test_Problem136 (line 25) | func Test_Problem136(t *testing.T) {
FILE: leetcode/0137.Single-Number-II/137. Single Number II.go
function singleNumberII (line 3) | func singleNumberII(nums []int) int {
function singleNumberIIIII (line 16) | func singleNumberIIIII(nums []int) int {
function singleNumberIIIII1 (line 27) | func singleNumberIIIII1(nums []int) int {
FILE: leetcode/0137.Single-Number-II/137. Single Number II_test.go
type question137 (line 8) | type question137 struct
type para137 (line 15) | type para137 struct
type ans137 (line 21) | type ans137 struct
function Test_Problem137 (line 25) | func Test_Problem137(t *testing.T) {
FILE: leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer.go
type Node (line 4) | type Node struct
function copyRandomList (line 10) | func copyRandomList(head *Node) *Node {
function splitLinkedList (line 18) | func splitLinkedList(head *Node) *Node {
function copyNodeToLinkedList (line 27) | func copyNodeToLinkedList(head *Node) *Node {
FILE: leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer_test.go
type question138 (line 10) | type question138 struct
type para138 (line 17) | type para138 struct
type ans138 (line 23) | type ans138 struct
function Test_Problem138 (line 27) | func Test_Problem138(t *testing.T) {
function ints2Node (line 61) | func ints2Node(one [][]int) *Node {
function node2Ints (line 84) | func node2Ints(head *Node) (res [][]int) {
FILE: leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go
function hasCycle (line 18) | func hasCycle(head *ListNode) bool {
FILE: leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go
type question141 (line 10) | type question141 struct
type para141 (line 17) | type para141 struct
type ans141 (line 23) | type ans141 struct
function Test_Problem141 (line 27) | func Test_Problem141(t *testing.T) {
FILE: leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go
function detectCycle (line 17) | func detectCycle(head *ListNode) *ListNode {
function hasCycle142 (line 33) | func hasCycle142(head *ListNode) (bool, *ListNode) {
FILE: leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go
function Test_Problem142 (line 5) | func Test_Problem142(t *testing.T) {
FILE: leetcode/0143.Reorder-List/143. Reorder List.go
function reorderList (line 19) | func reorderList(head *ListNode) *ListNode {
function reorderList1 (line 56) | func reorderList1(head *ListNode) *ListNode {
function listToArray (line 78) | func listToArray(head *ListNode) []int {
FILE: leetcode/0143.Reorder-List/143. Reorder List_test.go
type question143 (line 10) | type question143 struct
type para143 (line 17) | type para143 struct
type ans143 (line 23) | type ans143 struct
function Test_Problem143 (line 27) | func Test_Problem143(t *testing.T) {
FILE: leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go
function preorderTraversal (line 20) | func preorderTraversal(root *TreeNode) []int {
function preorderTraversal1 (line 37) | func preorderTraversal1(root *TreeNode) []int {
function preorder (line 43) | func preorder(root *TreeNode, output *[]int) {
function preorderTraversal2 (line 52) | func preorderTraversal2(root *TreeNode) []int {
FILE: leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go
type question144 (line 10) | type question144 struct
type para144 (line 17) | type para144 struct
type ans144 (line 23) | type ans144 struct
function Test_Problem144 (line 27) | func Test_Problem144(t *testing.T) {
FILE: leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go
function postorderTraversal (line 19) | func postorderTraversal(root *TreeNode) []int {
function postorder (line 25) | func postorder(root *TreeNode, output *[]int) {
FILE: leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go
type question145 (line 10) | type question145 struct
type para145 (line 17) | type para145 struct
type ans145 (line 23) | type ans145 struct
function Test_Problem145 (line 27) | func Test_Problem145(t *testing.T) {
FILE: leetcode/0146.LRU-Cache/146. LRU Cache.go
type LRUCache (line 3) | type LRUCache struct
method Get (line 18) | func (this *LRUCache) Get(key int) int {
method Put (line 27) | func (this *LRUCache) Put(key int, value int) {
method Add (line 44) | func (this *LRUCache) Add(node *Node) {
method Remove (line 57) | func (this *LRUCache) Remove(node *Node) {
type Node (line 9) | type Node struct
function Constructor (line 14) | func Constructor(capacity int) LRUCache {
FILE: leetcode/0146.LRU-Cache/146. LRU Cache_test.go
function Test_Problem146 (line 8) | func Test_Problem146(t *testing.T) {
function MList2Ints (line 31) | func MList2Ints(lru *LRUCache) [][]int {
FILE: leetcode/0147.Insertion-Sort-List/147. Insertion Sort List.go
function insertionSortList (line 17) | func insertionSortList(head *ListNode) *ListNode {
FILE: leetcode/0147.Insertion-Sort-List/147. Insertion Sort List_test.go
type question147 (line 10) | type question147 struct
type para147 (line 17) | type para147 struct
type ans147 (line 23) | type ans147 struct
function Test_Problem147 (line 27) | func Test_Problem147(t *testing.T) {
FILE: leetcode/0148.Sort-List/148. Sort List.go
function sortList (line 17) | func sortList(head *ListNode) *ListNode {
function middleNode (line 38) | func middleNode(head *ListNode) *ListNode {
function mergeTwoLists (line 51) | func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
FILE: leetcode/0148.Sort-List/148. Sort List_test.go
type question148 (line 10) | type question148 struct
type para148 (line 17) | type para148 struct
type ans148 (line 23) | type ans148 struct
function Test_Problem148 (line 27) | func Test_Problem148(t *testing.T) {
FILE: leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go
function evalRPN (line 7) | func evalRPN(tokens []string) int {
FILE: leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go
type question150 (line 8) | type question150 struct
type para150 (line 15) | type para150 struct
type ans150 (line 21) | type ans150 struct
function Test_Problem150 (line 25) | func Test_Problem150(t *testing.T) {
FILE: leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go
function reverseWords151 (line 5) | func reverseWords151(s string) string {
function reverse151 (line 11) | func reverse151(m *[]string, i int, j int) {
FILE: leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go
type question151 (line 8) | type question151 struct
type para151 (line 15) | type para151 struct
type ans151 (line 21) | type ans151 struct
function Test_Problem151 (line 25) | func Test_Problem151(t *testing.T) {
FILE: leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go
function maxProduct (line 3) | func maxProduct(nums []int) int {
function max (line 16) | func max(a int, b int) int {
function min (line 23) | func min(a int, b int) int {
FILE: leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go
type question152 (line 8) | type question152 struct
type para152 (line 15) | type para152 struct
type ans152 (line 21) | type ans152 struct
function Test_Problem152 (line 25) | func Test_Problem152(t *testing.T) {
FILE: leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go
function findMin (line 4) | func findMin(nums []int) int {
function findMin1 (line 21) | func findMin1(nums []int) int {
function findMin2 (line 57) | func findMin2(nums []int) int {
FILE: leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go
type question153 (line 8) | type question153 struct
type para153 (line 15) | type para153 struct
type ans153 (line 21) | type ans153 struct
function Test_Problem153 (line 25) | func Test_Problem153(t *testing.T) {
FILE: leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go
function findMin154 (line 3) | func findMin154(nums []int) int {
FILE: leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go
type question154 (line 8) | type question154 struct
type para154 (line 15) | type para154 struct
type ans154 (line 21) | type ans154 struct
function Test_Problem154 (line 25) | func Test_Problem154(t *testing.T) {
FILE: leetcode/0155.Min-Stack/155. Min Stack.go
type MinStack (line 4) | type MinStack struct
method Push (line 17) | func (this *MinStack) Push(x int) {
method Pop (line 32) | func (this *MinStack) Pop() {
method Top (line 38) | func (this *MinStack) Top() int {
method GetMin (line 42) | func (this *MinStack) GetMin() int {
function Constructor155 (line 12) | func Constructor155() MinStack {
FILE: leetcode/0155.Min-Stack/155. Min Stack_test.go
function Test_Problem155 (line 8) | func Test_Problem155(t *testing.T) {
FILE: leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go
function getIntersectionNode (line 19) | func getIntersectionNode(headA, headB *ListNode) *ListNode {
FILE: leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go
type question160 (line 10) | type question160 struct
type para160 (line 17) | type para160 struct
type ans160 (line 24) | type ans160 struct
function Test_Problem160 (line 28) | func Test_Problem160(t *testing.T) {
FILE: leetcode/0162.Find-Peak-Element/162. Find Peak Element.go
function findPeakElement (line 4) | func findPeakElement(nums []int) int {
function findPeakElement1 (line 31) | func findPeakElement1(nums []int) int {
FILE: leetcode/0162.Find-Peak-Element/162. Find Peak Element_test.go
type question162 (line 8) | type question162 struct
type para162 (line 15) | type para162 struct
type ans162 (line 21) | type ans162 struct
function Test_Problem162 (line 25) | func Test_Problem162(t *testing.T) {
FILE: leetcode/0164.Maximum-Gap/164. Maximum Gap.go
function maximumGap (line 4) | func maximumGap(nums []int) int {
function partition164 (line 18) | func partition164(a []int, lo, hi int) int {
function quickSort164 (line 30) | func quickSort164(a []int, lo, hi int) {
function maximumGap1 (line 40) | func maximumGap1(nums []int) int {
function max (line 78) | func max(a int, b int) int {
FILE: leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go
type question164 (line 8) | type question164 struct
type para164 (line 15) | type para164 struct
type ans164 (line 21) | type ans164 struct
function Test_Problem164 (line 25) | func Test_Problem164(t *testing.T) {
FILE: leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
function twoSum167 (line 4) | func twoSum167(numbers []int, target int) []int {
function twoSum167_1 (line 20) | func twoSum167_1(numbers []int, target int) []int {
FILE: leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
type question167 (line 8) | type question167 struct
type para167 (line 15) | type para167 struct
type ans167 (line 22) | type ans167 struct
function Test_Problem167 (line 26) | func Test_Problem167(t *testing.T) {
FILE: leetcode/0168.Excel-Sheet-Column-Title/168. Excel Sheet Column Title.go
function convertToTitle (line 3) | func convertToTitle(n int) string {
FILE: leetcode/0168.Excel-Sheet-Column-Title/168. Excel Sheet Column Title_test.go
type question168 (line 8) | type question168 struct
type para168 (line 15) | type para168 struct
type ans168 (line 21) | type ans168 struct
function Test_Problem168 (line 25) | func Test_Problem168(t *testing.T) {
FILE: leetcode/0169.Majority-Element/169. Majority Element.go
function majorityElement (line 4) | func majorityElement(nums []int) int {
function majorityElement1 (line 21) | func majorityElement1(nums []int) int {
FILE: leetcode/0169.Majority-Element/169. Majority Element_test.go
type question169 (line 8) | type question169 struct
type para169 (line 15) | type para169 struct
type ans169 (line 21) | type ans169 struct
function Test_Problem169 (line 25) | func Test_Problem169(t *testing.T) {
FILE: leetcode/0171.Excel-Sheet-Column-Number/171. Excel Sheet Column Number.go
function titleToNumber (line 3) | func titleToNumber(s string) int {
FILE: leetcode/0171.Excel-Sheet-Column-Number/171. Excel Sheet Column Number_test.go
type question171 (line 8) | type question171 struct
type para171 (line 15) | type para171 struct
type ans171 (line 21) | type ans171 struct
function Test_Problem171 (line 25) | func Test_Problem171(t *testing.T) {
FILE: leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go
function trailingZeroes (line 3) | func trailingZeroes(n int) int {
FILE: leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go
type question172 (line 8) | type question172 struct
type para172 (line 15) | type para172 struct
type ans172 (line 21) | type ans172 struct
function Test_Problem172 (line 25) | func Test_Problem172(t *testing.T) {
FILE: leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go
type BSTIterator (line 22) | type BSTIterator struct
method Next (line 47) | func (this *BSTIterator) Next() int {
method HasNext (line 53) | func (this *BSTIterator) HasNext() bool {
function Constructor173 (line 28) | func Constructor173(root *TreeNode) BSTIterator {
function postorder (line 38) | func postorder(root *TreeNode, output *[]int) {
type PriorityQueueOfInt (line 63) | type PriorityQueueOfInt
method Len (line 65) | func (pq PriorityQueueOfInt) Len() int {
method Less (line 69) | func (pq PriorityQueueOfInt) Less(i, j int) bool {
method Swap (line 73) | func (pq PriorityQueueOfInt) Swap(i, j int) {
method Push (line 77) | func (pq *PriorityQueueOfInt) Push(x interface{}) {
method Pop (line 82) | func (pq *PriorityQueueOfInt) Pop() interface{} {
FILE: leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go
function Test_Problem173 (line 10) | func Test_Problem173(t *testing.T) {
FILE: leetcode/0174.Dungeon-Game/174. Dungeon Game.go
function calculateMinimumHP (line 6) | func calculateMinimumHP(dungeon [][]int) int {
function max (line 30) | func max(a int, b int) int {
function min (line 37) | func min(a int, b int) int {
function calculateMinimumHP1 (line 45) | func calculateMinimumHP1(dungeon [][]int) int {
function canCross (line 58) | func canCross(dungeon [][]int, start int) bool {
FILE: leetcode/0174.Dungeon-Game/174. Dungeon Game_test.go
type question174 (line 8) | type question174 struct
type para174 (line 15) | type para174 struct
type ans174 (line 21) | type ans174 struct
function Test_Problem174 (line 25) | func Test_Problem174(t *testing.T) {
FILE: leetcode/0179.Largest-Number/179. Largest Number.go
function largestNumber (line 7) | func largestNumber(nums []int) string {
function toStringArray (line 23) | func toStringArray(nums []int) []string {
function partitionString (line 30) | func partitionString(a []string, lo, hi int) int {
function quickSortString (line 44) | func quickSortString(a []string, lo, hi int) {
FILE: leetcode/0179.Largest-Number/179. Largest Number_test.go
type question179 (line 8) | type question179 struct
type para179 (line 15) | type para179 struct
type ans179 (line 21) | type ans179 struct
function Test_Problem179 (line 25) | func Test_Problem179(t *testing.T) {
FILE: leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go
function findRepeatedDnaSequences (line 4) | func findRepeatedDnaSequences(s string) []string {
function findRepeatedDnaSequences1 (line 26) | func findRepeatedDnaSequences1(s string) []string {
FILE: leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go
type question187 (line 8) | type question187 struct
type para187 (line 15) | type para187 struct
type ans187 (line 21) | type ans187 struct
function Test_Problem187 (line 25) | func Test_Problem187(t *testing.T) {
FILE: leetcode/0189.Rotate-Array/189. Rotate Array.go
function rotate (line 4) | func rotate(nums []int, k int) {
function reverse (line 11) | func reverse(a []int) {
function rotate1 (line 18) | func rotate1(nums []int, k int) {
FILE: leetcode/0189.Rotate-Array/189. Rotate Array_test.go
type question189 (line 8) | type question189 struct
type para189 (line 15) | type para189 struct
type ans189 (line 22) | type ans189 struct
function Test_Problem189 (line 26) | func Test_Problem189(t *testing.T) {
FILE: leetcode/0190.Reverse-Bits/190. Reverse Bits.go
function reverseBits (line 3) | func reverseBits(num uint32) uint32 {
FILE: leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go
type question190 (line 9) | type question190 struct
type para190 (line 16) | type para190 struct
type ans190 (line 22) | type ans190 struct
function Test_Problem190 (line 26) | func Test_Problem190(t *testing.T) {
FILE: leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits.go
function hammingWeight (line 6) | func hammingWeight(num uint32) int {
function hammingWeight1 (line 11) | func hammingWeight1(num uint32) int {
FILE: leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go
type question191 (line 9) | type question191 struct
type para191 (line 16) | type para191 struct
type ans191 (line 22) | type ans191 struct
function Test_Problem191 (line 26) | func Test_Problem191(t *testing.T) {
FILE: leetcode/0198.House-Robber/198. House Robber.go
function rob198 (line 4) | func rob198(nums []int) int {
function max (line 21) | func max(a int, b int) int {
function rob198_1 (line 29) | func rob198_1(nums []int) int {
function rob (line 44) | func rob(nums []int) int {
FILE: leetcode/0198.House-Robber/198. House Robber_test.go
type question198 (line 8) | type question198 struct
type para198 (line 15) | type para198 struct
type ans198 (line 21) | type ans198 struct
function Test_Problem198 (line 25) | func Test_Problem198(t *testing.T) {
FILE: leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go
function rightSideView (line 19) | func rightSideView(root *TreeNode) []int {
FILE: leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go
type question199 (line 10) | type question199 struct
type para199 (line 17) | type para199 struct
type ans199 (line 23) | type ans199 struct
function Test_Problem199 (line 27) | func Test_Problem199(t *testing.T) {
FILE: leetcode/0200.Number-of-Islands/200. Number of Islands.go
function numIslands (line 10) | func numIslands(grid [][]byte) int {
function searchIslands (line 34) | func searchIslands(grid [][]byte, visited *[][]bool, x, y int) {
function isInBoard (line 45) | func isInBoard(board [][]byte, x, y int) bool {
FILE: leetcode/0200.Number-of-Islands/200. Number of Islands_test.go
type question200 (line 8) | type question200 struct
type para200 (line 15) | type para200 struct
type ans200 (line 21) | type ans200 struct
function Test_Problem200 (line 25) | func Test_Problem200(t *testing.T) {
FILE: leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go
function rangeBitwiseAnd1 (line 4) | func rangeBitwiseAnd1(m int, n int) int {
function rangeBitwiseAnd (line 18) | func rangeBitwiseAnd(m int, n int) int {
FILE: leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go
type question201 (line 8) | type question201 struct
type para201 (line 15) | type para201 struct
type ans201 (line 22) | type ans201 struct
function Test_Problem201 (line 26) | func Test_Problem201(t *testing.T) {
FILE: leetcode/0202.Happy-Number/202. Happy Number.go
function isHappy (line 3) | func isHappy(n int) bool {
function getSquareOfDigits (line 17) | func getSquareOfDigits(n int) int {
FILE: leetcode/0202.Happy-Number/202. Happy Number_test.go
type question202 (line 8) | type question202 struct
type para202 (line 15) | type para202 struct
type ans202 (line 21) | type ans202 struct
function Test_Problem202 (line 25) | func Test_Problem202(t *testing.T) {
FILE: leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go
function removeElements (line 17) | func removeElements(head *ListNode, val int) *ListNode {
FILE: leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go
type question203 (line 10) | type question203 struct
type para203 (line 17) | type para203 struct
type ans203 (line 24) | type ans203 struct
function Test_Problem203 (line 28) | func Test_Problem203(t *testing.T) {
FILE: leetcode/0204.Count-Primes/204. Count Primes.go
function countPrimes (line 3) | func countPrimes(n int) int {
FILE: leetcode/0204.Count-Primes/204. Count Primes_test.go
type question204 (line 8) | type question204 struct
type para204 (line 15) | type para204 struct
type ans204 (line 21) | type ans204 struct
function Test_Problem204 (line 25) | func Test_Problem204(t *testing.T) {
FILE: leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings.go
function isIsomorphic (line 3) | func isIsomorphic(s string, t string) bool {
FILE: leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go
type question205 (line 8) | type question205 struct
type para205 (line 15) | type para205 struct
type ans205 (line 22) | type ans205 struct
function Test_Problem205 (line 26) | func Test_Problem205(t *testing.T) {
FILE: leetcode/0206.Reverse-Linked-List/206. Reverse Linked List.go
function reverseList (line 18) | func reverseList(head *ListNode) *ListNode {
FILE: leetcode/0206.Reverse-Linked-List/206. Reverse Linked List_test.go
type question206 (line 10) | type question206 struct
type para206 (line 17) | type para206 struct
type ans206 (line 23) | type ans206 struct
function Test_Problem206 (line 27) | func Test_Problem206(t *testing.T) {
FILE: leetcode/0207.Course-Schedule/207. Course Schedule.go
function canFinish (line 4) | func canFinish(n int, pre [][]int) bool {
FILE: leetcode/0207.Course-Schedule/207. Course Schedule_test.go
type question207 (line 8) | type question207 struct
type para207 (line 15) | type para207 struct
type ans207 (line 22) | type ans207 struct
function Test_Problem207 (line 26) | func Test_Problem207(t *testing.T) {
FILE: leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go
type Trie (line 3) | type Trie struct
method Insert (line 14) | func (this *Trie) Insert(word string) {
method Search (line 29) | func (this *Trie) Search(word string) bool {
method StartsWith (line 42) | func (this *Trie) StartsWith(prefix string) bool {
function Constructor208 (line 9) | func Constructor208() Trie {
FILE: leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go
function Test_Problem208 (line 8) | func Test_Problem208(t *testing.T) {
FILE: leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go
function minSubArrayLen (line 3) | func minSubArrayLen(target int, nums []int) int {
function min (line 19) | func min(a int, b int) int {
FILE: leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go
type question209 (line 8) | type question209 struct
type para209 (line 15) | type para209 struct
type ans209 (line 22) | type ans209 struct
function Test_Problem209 (line 26) | func Test_Problem209(t *testing.T) {
FILE: leetcode/0210.Course-Schedule-II/210. Course Schedule II.go
function findOrder (line 3) | func findOrder(numCourses int, prerequisites [][]int) []int {
FILE: leetcode/0210.Course-Schedule-II/210. Course Schedule II_test.go
type question210 (line 8) | type question210 struct
type para210 (line 15) | type para210 struct
type ans210 (line 22) | type ans210 struct
function Test_Problem210 (line 26) | func Test_Problem210(t *testing.T) {
FILE: leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure.go
type WordDictionary (line 3) | type WordDictionary struct
method AddWord (line 14) | func (this *WordDictionary) AddWord(word string) {
method Search (line 29) | func (this *WordDictionary) Search(word string) bool {
function Constructor211 (line 9) | func Constructor211() WordDictionary {
FILE: leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure_test.go
function Test_Problem211 (line 8) | func Test_Problem211(t *testing.T) {
FILE: leetcode/0212.Word-Search-II/212. Word Search II.go
function findWords (line 3) | func findWords(board [][]byte, words []string) []string {
function exist (line 21) | func exist(board [][]byte, word string) bool {
function isInBoard (line 36) | func isInBoard(board [][]byte, x, y int) bool {
function searchWord (line 40) | func searchWord(board [][]byte, visited [][]bool, word string, index, x,...
FILE: leetcode/0212.Word-Search-II/212. Word Search II_test.go
type question212 (line 8) | type question212 struct
type para212 (line 15) | type para212 struct
type ans212 (line 22) | type ans212 struct
function Test_Problem212 (line 26) | func Test_Problem212(t *testing.T) {
FILE: leetcode/0213.House-Robber-II/213. House Robber II.go
function rob213 (line 3) | func rob213(nums []int) int {
function rob213_1 (line 18) | func rob213_1(nums []int, start, end int) int {
function max (line 29) | func max(a int, b int) int {
FILE: leetcode/0213.House-Robber-II/213. House Robber II_test.go
type question213 (line 8) | type question213 struct
type para213 (line 15) | type para213 struct
type ans213 (line 21) | type ans213 struct
function Test_Problem213 (line 25) | func Test_Problem213(t *testing.T) {
FILE: leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go
function findKthLargest1 (line 9) | func findKthLargest1(nums []int, k int) int {
function findKthLargest (line 16) | func findKthLargest(nums []int, k int) int {
function selectSmallest (line 21) | func selectSmallest(nums []int, l, r, i int) int {
function partition (line 37) | func partition(nums []int, l, r int) int {
function getLeastNumbers (line 54) | func getLeastNumbers(arr []int, k int) []int {
function selectSmallest1 (line 59) | func selectSmallest1(nums []int, l, r, i int) []int {
FILE: leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go
type question215 (line 8) | type question215 struct
type para215 (line 15) | type para215 struct
type ans215 (line 22) | type ans215 struct
function Test_Problem215 (line 26) | func Test_Problem215(t *testing.T) {
FILE: leetcode/0216.Combination-Sum-III/216. Combination Sum III.go
function combinationSum3 (line 3) | func combinationSum3(k int, n int) [][]int {
function findcombinationSum3 (line 12) | func findcombinationSum3(k, target, index int, c []int, res *[][]int) {
FILE: leetcode/0216.Combination-Sum-III/216. Combination Sum III_test.go
type question216 (line 8) | type question216 struct
type para216 (line 15) | type para216 struct
type ans216 (line 22) | type ans216 struct
function Test_Problem216 (line 26) | func Test_Problem216(t *testing.T) {
FILE: leetcode/0217.Contains-Duplicate/217. Contains Duplicate.go
function containsDuplicate (line 3) | func containsDuplicate(nums []int) bool {
FILE: leetcode/0217.Contains-Duplicate/217. Contains Duplicate_test.go
type question217 (line 8) | type question217 struct
type para217 (line 15) | type para217 struct
type ans217 (line 21) | type ans217 struct
function Test_Problem217 (line 25) | func Test_Problem217(t *testing.T) {
FILE: leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go
constant LEFTSIDE (line 10) | LEFTSIDE = 1
constant RIGHTSIDE (line 11) | RIGHTSIDE = 2
type Point (line 13) | type Point struct
function getSkyline (line 19) | func getSkyline(buildings [][]int) [][]int {
type BinaryIndexedTree (line 58) | type BinaryIndexedTree struct
method Init (line 64) | func (bit *BinaryIndexedTree) Init(capacity int) {
method Add (line 69) | func (bit *BinaryIndexedTree) Add(index int, val int) {
method Query (line 76) | func (bit *BinaryIndexedTree) Query(index int) int {
function getSkyline1 (line 85) | func getSkyline1(buildings [][]int) [][]int {
function discretization218 (line 108) | func discretization218(positions [][]int) (map[int]int, []int) {
function max (line 125) | func max(a int, b int) int {
function getSkyline2 (line 133) | func getSkyline2(buildings [][]int) [][]int {
type E (line 194) | type E struct
function NewE (line 202) | func NewE(n, x, h, t int) E {
type IndexMaxPQ (line 212) | type IndexMaxPQ struct
method Enque (line 233) | func (q *IndexMaxPQ) Enque(key, val int) {
method Front (line 242) | func (q *IndexMaxPQ) Front() int {
method Remove (line 250) | func (q *IndexMaxPQ) Remove(key int) {
method sink (line 258) | func (q *IndexMaxPQ) sink(n int) {
method swim (line 272) | func (q *IndexMaxPQ) swim(n int) {
method exch (line 283) | func (q *IndexMaxPQ) exch(i, j int) {
method less (line 289) | func (q *IndexMaxPQ) less(i, j int) bool {
function NewIndexMaxPQ (line 220) | func NewIndexMaxPQ(n int) IndexMaxPQ {
FILE: leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go
type question218 (line 8) | type question218 struct
type para218 (line 15) | type para218 struct
type ans218 (line 21) | type ans218 struct
function Test_Problem218 (line 25) | func Test_Problem218(t *testing.T) {
FILE: leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II.go
function containsNearbyDuplicate (line 3) | func containsNearbyDuplicate(nums []int, k int) bool {
FILE: leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go
type question219 (line 8) | type question219 struct
type para219 (line 15) | type para219 struct
type ans219 (line 22) | type ans219 struct
function Test_Problem219 (line 26) | func Test_Problem219(t *testing.T) {
FILE: leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go
function containsNearbyAlmostDuplicate (line 4) | func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
function containsNearbyAlmostDuplicate1 (line 37) | func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool {
function abs (line 57) | func abs(a int) int {
FILE: leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go
type question220 (line 8) | type question220 struct
type para220 (line 15) | type para220 struct
type ans220 (line 23) | type ans220 struct
function Test_Problem220 (line 27) | func Test_Problem220(t *testing.T) {
FILE: leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go
function countNodes (line 19) | func countNodes(root *TreeNode) int {
FILE: leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go
type question222 (line 10) | type question222 struct
type para222 (line 17) | type para222 struct
type ans222 (line 23) | type ans222 struct
function Test_Problem222 (line 27) | func Test_Problem222(t *testing.T) {
FILE: leetcode/0223.Rectangle-Area/223. Rectangle Area.go
function computeArea (line 3) | func computeArea(A int, B int, C int, D int, E int, F int, G int, H int)...
function area (line 8) | func area(x0, y0, x1, y1 int) int {
function max (line 16) | func max(a int, b int) int {
function min (line 23) | func min(a int, b int) int {
FILE: leetcode/0223.Rectangle-Area/223. Rectangle Area_test.go
type question223 (line 8) | type question223 struct
type para223 (line 15) | type para223 struct
type ans223 (line 28) | type ans223 struct
function Test_Problem223 (line 32) | func Test_Problem223(t *testing.T) {
FILE: leetcode/0224.Basic-Calculator/224. Basic Calculator.go
function calculate (line 10) | func calculate(s string) int {
function calculate1 (line 44) | func calculate1(s string) int {
function calculateStr (line 70) | func calculateStr(str string) int {
function isDigital (line 114) | func isDigital(v byte) bool {
FILE: leetcode/0224.Basic-Calculator/224. Basic Calculator_test.go
type question224 (line 8) | type question224 struct
type para224 (line 15) | type para224 struct
type ans224 (line 21) | type ans224 struct
function Test_Problem224 (line 25) | func Test_Problem224(t *testing.T) {
FILE: leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go
type MyStack (line 3) | type MyStack struct
method Push (line 14) | func (this *MyStack) Push(x int) {
method Pop (line 19) | func (this *MyStack) Pop() int {
method Top (line 33) | func (this *MyStack) Top() int {
method Empty (line 41) | func (this *MyStack) Empty() bool {
function Constructor225 (line 9) | func Constructor225() MyStack {
FILE: leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go
function Test_Problem225 (line 8) | func Test_Problem225(t *testing.T) {
FILE: leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree.go
function invertTree (line 19) | func invertTree(root *TreeNode) *TreeNode {
FILE: leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go
type question226 (line 10) | type question226 struct
type para226 (line 17) | type para226 struct
type ans226 (line 23) | type ans226 struct
function Test_Problem226 (line 27) | func Test_Problem226(t *testing.T) {
FILE: leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go
function calculate (line 3) | func calculate(s string) int {
FILE: leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go
type question227 (line 8) | type question227 struct
type para227 (line 15) | type para227 struct
type ans227 (line 21) | type ans227 struct
function Test_Problem227 (line 25) | func Test_Problem227(t *testing.T) {
FILE: leetcode/0228.Summary-Ranges/228. Summary Ranges.go
function summaryRanges (line 7) | func summaryRanges(nums []int) (ans []string) {
FILE: leetcode/0228.Summary-Ranges/228. Summary Ranges_test.go
type question228 (line 8) | type question228 struct
type para228 (line 15) | type para228 struct
type ans228 (line 21) | type ans228 struct
function Test_Problem228 (line 25) | func Test_Problem228(t *testing.T) {
FILE: leetcode/0229.Majority-Element-II/229. Majority Element II.go
function majorityElement229 (line 4) | func majorityElement229(nums []int) []int {
function majorityElement229_1 (line 49) | func majorityElement229_1(nums []int) []int {
FILE: leetcode/0229.Majority-Element-II/229. Majority Element II_test.go
type question229 (line 8) | type question229 struct
type para229 (line 15) | type para229 struct
type ans229 (line 21) | type ans229 struct
function Test_Problem229 (line 25) | func Test_Problem229(t *testing.T) {
FILE: leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go
function kthSmallest (line 19) | func kthSmallest(root *TreeNode, k int) int {
function inorder230 (line 25) | func inorder230(node *TreeNode, k int, count *int, ans *int) {
FILE: leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go
type question230 (line 10) | type question230 struct
type para230 (line 17) | type para230 struct
type ans230 (line 24) | type ans230 struct
function Test_Problem230 (line 28) | func Test_Problem230(t *testing.T) {
FILE: leetcode/0231.Power-of-Two/231. Power of Two.go
function isPowerOfTwo (line 4) | func isPowerOfTwo(num int) bool {
function isPowerOfTwo1 (line 9) | func isPowerOfTwo1(num int) bool {
function isPowerOfTwo2 (line 14) | func isPowerOfTwo2(num int) bool {
function isPowerOfTwo3 (line 21) | func isPowerOfTwo3(num int) bool {
FILE: leetcode/0231.Power-of-Two/231. Power of Two_test.go
type question231 (line 8) | type question231 struct
type para231 (line 15) | type para231 struct
type ans231 (line 21) | type ans231 struct
function Test_Problem231 (line 25) | func Test_Problem231(t *testing.T) {
FILE: leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go
type MyQueue (line 3) | type MyQueue struct
method Push (line 15) | func (this *MyQueue) Push(x int) {
method Pop (line 20) | func (this *MyQueue) Pop() int {
method Peek (line 31) | func (this *MyQueue) Peek() int {
method Empty (line 40) | func (this *MyQueue) Empty() bool {
method fromStackToQueue (line 44) | func (this *MyQueue) fromStackToQueue(s, q *[]int) {
function Constructor232 (line 9) | func Constructor232() MyQueue {
FILE: leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go
function Test_Problem232 (line 8) | func Test_Problem232(t *testing.T) {
FILE: leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go
function isPalindrome (line 19) | func isPalindrome(head *ListNode) bool {
function isPalindrome1 (line 37) | func isPalindrome1(head *ListNode) bool {
function L2ss (line 82) | func L2ss(head *ListNode) []int {
FILE: leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go
type question234 (line 10) | type question234 struct
type para234 (line 17) | type para234 struct
type ans234 (line 23) | type ans234 struct
function Test_Problem234 (line 27) | func Test_Problem234(t *testing.T) {
FILE: leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go
function lowestCommonAncestor (line 19) | func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
FILE: leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go
type question235 (line 10) | type question235 struct
type para235 (line 17) | type para235 struct
type ans235 (line 25) | type ans235 struct
function Test_Problem235 (line 29) | func Test_Problem235(t *testing.T) {
FILE: leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go
function lowestCommonAncestor236 (line 19) | func lowestCommonAncestor236(root, p, q *TreeNode) *TreeNode {
FILE: leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go
type question236 (line 10) | type question236 struct
type para236 (line 17) | type para236 struct
type ans236 (line 25) | type ans236 struct
function Test_Problem236 (line 29) | func Test_Problem236(t *testing.T) {
FILE: leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go
function deleteNode (line 17) | func deleteNode(node *ListNode) {
FILE: leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go
type question237 (line 10) | type question237 struct
type para237 (line 17) | type para237 struct
type ans237 (line 24) | type ans237 struct
function Test_Problem237 (line 28) | func Test_Problem237(t *testing.T) {
function removeElements (line 77) | func removeElements(head *ListNode, val int) *ListNode {
FILE: leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go
function maxSlidingWindow1 (line 4) | func maxSlidingWindow1(a []int, k int) []int {
function maxSlidingWindow (line 24) | func maxSlidingWindow(nums []int, k int) []int {
FILE: leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go
type question239 (line 8) | type question239 struct
type para239 (line 15) | type para239 struct
type ans239 (line 22) | type ans239 struct
function Test_Problem239 (line 26) | func Test_Problem239(t *testing.T) {
FILE: leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go
function searchMatrix240 (line 4) | func searchMatrix240(matrix [][]int, target int) bool {
function searchMatrix2401 (line 22) | func searchMatrix2401(matrix [][]int, target int) bool {
FILE: leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go
type question240 (line 8) | type question240 struct
type para240 (line 15) | type para240 struct
type ans240 (line 22) | type ans240 struct
function Test_Problem240 (line 26) | func Test_Problem240(t *testing.T) {
FILE: leetcode/0242.Valid-Anagram/242. Valid Anagram.go
function isAnagram (line 4) | func isAnagram(s string, t string) bool {
function isAnagram1 (line 26) | func isAnagram1(s string, t string) bool {
FILE: leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go
type question242 (line 8) | type question242 struct
type para242 (line 15) | type para242 struct
type ans242 (line 22) | type ans242 struct
function Test_Problem242 (line 26) | func Test_Problem242(t *testing.T) {
FILE: leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go
function binaryTreePaths (line 21) | func binaryTreePaths(root *TreeNode) []string {
FILE: leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go
type question257 (line 10) | type question257 struct
type para257 (line 17) | type para257 struct
type ans257 (line 23) | type ans257 struct
function Test_Problem257 (line 27) | func Test_Problem257(t *testing.T) {
FILE: leetcode/0258.Add-Digits/258. Add Digits.go
function addDigits (line 3) | func addDigits(num int) int {
FILE: leetcode/0258.Add-Digits/258. Add Digits_test.go
type question258 (line 8) | type question258 struct
type para258 (line 15) | type para258 struct
type ans258 (line 21) | type ans258 struct
function Test_Problem258 (line 25) | func Test_Problem258(t *testing.T) {
FILE: leetcode/0260.Single-Number-III/260. Single Number III.go
function singleNumberIII (line 3) | func singleNumberIII(nums []int) []int {
FILE: leetcode/0260.Single-Number-III/260. Single Number III_test.go
type question260 (line 8) | type question260 struct
type para260 (line 15) | type para260 struct
type ans260 (line 21) | type ans260 struct
function Test_Problem260 (line 25) | func Test_Problem260(t *testing.T) {
FILE: leetcode/0263.Ugly-Number/263. Ugly Number.go
function isUgly (line 3) | func isUgly(num int) bool {
FILE: leetcode/0263.Ugly-Number/263. Ugly Number_test.go
type question263 (line 8) | type question263 struct
type para263 (line 15) | type para263 struct
type ans263 (line 21) | type ans263 struct
function Test_Problem263 (line 25) | func Test_Problem263(t *testing.T) {
FILE: leetcode/0264.Ugly-Number-II/264. Ugly Number II.go
function nthUglyNumber (line 3) | func nthUglyNumber(n int) int {
function min (line 22) | func min(a, b int) int {
FILE: leetcode/0264.Ugly-Number-II/264. Ugly Number II_test.go
type question264 (line 8) | type question264 struct
type para264 (line 15) | type para264 struct
type ans264 (line 21) | type ans264 struct
function Test_Problem264 (line 25) | func Test_Problem264(t *testing.T) {
FILE: leetcode/0268.Missing-Number/268. Missing Number.go
function missingNumber (line 3) | func missingNumber(nums []int) int {
FILE: leetcode/0268.Missing-Number/268. Missing Number_test.go
type question268 (line 8) | type question268 struct
type para268 (line 15) | type para268 struct
type ans268 (line 21) | type ans268 struct
function Test_Problem268 (line 25) | func Test_Problem268(t *testing.T) {
FILE: leetcode/0274.H-Index/274. H-Index.go
function hIndex (line 4) | func hIndex(citations []int) int {
function hIndex1 (line 25) | func hIndex1(citations []int) int {
function quickSort164 (line 38) | func quickSort164(a []int, lo, hi int) {
function partition164 (line 47) | func partition164(a []int, lo, hi int) int {
FILE: leetcode/0274.H-Index/274. H-Index_test.go
type question274 (line 8) | type question274 struct
type para274 (line 15) | type para274 struct
type ans274 (line 21) | type ans274 struct
function Test_Problem274 (line 25) | func Test_Problem274(t *testing.T) {
FILE: leetcode/0275.H-Index-II/275. H-Index II.go
function hIndex275 (line 3) | func hIndex275(citations []int) int {
FILE: leetcode/0275.H-Index-II/275. H-Index II_test.go
type question275 (line 8) | type question275 struct
type para275 (line 15) | type para275 struct
type ans275 (line 21) | type ans275 struct
function Test_Problem275 (line 25) | func Test_Problem275(t *testing.T) {
FILE: leetcode/0278.First-Bad-Version/278. First Bad Version.go
function firstBadVersion (line 13) | func firstBadVersion(n int) int {
function isBadVersion (line 17) | func isBadVersion(version int) bool {
FILE: leetcode/0278.First-Bad-Version/278. First Bad Version_test.go
type question278 (line 8) | type question278 struct
type para278 (line 15) | type para278 struct
type ans278 (line 21) | type ans278 struct
function Test_Problem278 (line 25) | func Test_Problem278(t *testing.T) {
FILE: leetcode/0279.Perfect-Squares/279. Perfect Squares.go
function numSquares (line 5) | func numSquares(n int) int {
function isPerfectSquare (line 22) | func isPerfectSquare(n int) bool {
function checkAnswer4 (line 28) | func checkAnswer4(x int) bool {
FILE: leetcode/0279.Perfect-Squares/279. Perfect Squares_test.go
type question279 (line 8) | type question279 struct
type para279 (line 15) | type para279 struct
type ans279 (line 21) | type ans279 struct
function Test_Problem279 (line 25) | func Test_Problem279(t *testing.T) {
FILE: leetcode/0283.Move-Zeroes/283. Move Zeroes.go
function moveZeroes (line 3) | func moveZeroes(nums []int) {
FILE: leetcode/0283.Move-Zeroes/283. Move Zeroes_test.go
type question283 (line 8) | type question283 struct
type para283 (line 15) | type para283 struct
type ans283 (line 21) | type ans283 struct
function Test_Problem283 (line 25) | func Test_Problem283(t *testing.T) {
FILE: leetcode/0284.Peeking-Iterator/284. Peeking Iterator.go
type Iterator (line 5) | type Iterator struct
method hasNext (line 8) | func (this *Iterator) hasNext() bool {
method next (line 13) | func (this *Iterator) next() int {
type PeekingIterator (line 18) | type PeekingIterator struct
method hasNext (line 30) | func (this *PeekingIterator) hasNext() bool {
method next (line 37) | func (this *PeekingIterator) next() int {
method peek (line 46) | func (this *PeekingIterator) peek() int {
function Constructor (line 24) | func Constructor(iter *Iterator) *PeekingIterator {
FILE: leetcode/0284.Peeking-Iterator/284. Peeking Iterator_test.go
function Test_Problem284 (line 7) | func Test_Problem284(t *testing.T) {
FILE: leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go
function findDuplicate (line 6) | func findDuplicate(nums []int) int {
function findDuplicate1 (line 22) | func findDuplicate1(nums []int) int {
function findDuplicate2 (line 41) | func findDuplicate2(nums []int) int {
FILE: leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go
type question287 (line 8) | type question287 struct
type para287 (line 15) | type para287 struct
type ans287 (line 21) | type ans287 struct
function Test_Problem287 (line 25) | func Test_Problem287(t *testing.T) {
FILE: leetcode/0290.Word-Pattern/290. Word Pattern.go
function wordPattern (line 5) | func wordPattern(pattern string, str string) bool {
FILE: leetcode/0290.Word-Pattern/290. Word Pattern_test.go
type question290 (line 8) | type question290 struct
type para290 (line 15) | type para290 struct
type ans290 (line 22) | type ans290 struct
function Test_Problem290 (line 26) | func Test_Problem290(t *testing.T) {
FILE: leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.go
type Codec (line 12) | type Codec struct
method serialize (line 22) | func (this *Codec) serialize(root *TreeNode) string {
method deserialize (line 34) | func (this *Codec) deserialize(data string) *TreeNode {
method deserializeHelper (line 42) | func (this *Codec) deserializeHelper() *TreeNode {
function Constructor (line 17) | func Constructor() Codec {
FILE: leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree_test.go
type question297 (line 10) | type question297 struct
type para297 (line 17) | type para297 struct
type ans297 (line 23) | type ans297 struct
function Test_Problem297 (line 27) | func Test_Problem297(t *testing.T) {
FILE: leetcode/0299.Bulls-and-Cows/299.Bulls and Cows.go
function getHint (line 5) | func getHint(secret string, guess string) string {
FILE: leetcode/0299.Bulls-and-Cows/299.Bulls and Cows_test.go
type question299 (line 8) | type question299 struct
type para299 (line 14) | type para299 struct
type ans299 (line 20) | type ans299 struct
function Test_Problem299 (line 24) | func Test_Problem299(t *testing.T) {
FILE: leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go
function lengthOfLIS (line 6) | func lengthOfLIS(nums []int) int {
function max (line 21) | func max(a int, b int) int {
function lengthOfLIS1 (line 29) | func lengthOfLIS1(nums []int) int {
FILE: leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go
type question300 (line 8) | type question300 struct
type para300 (line 15) | type para300 struct
type ans300 (line 21) | type ans300 struct
function Test_Problem300 (line 25) | func Test_Problem300(t *testing.T) {
FILE: leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses.go
function removeInvalidParentheses (line 12) | func removeInvalidParentheses(s string) []string {
function backtrace (line 37) | func backtrace(i int, cur string, lmoves int, rmoves int, score int) {
function min (line 64) | func min(a, b int) int {
FILE: leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses_test.go
type question301 (line 8) | type question301 struct
type para301 (line 14) | type para301 struct
type ans301 (line 19) | type ans301 struct
function Test_Problem301 (line 23) | func Test_Problem301(t *testing.T) {
FILE: leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go
type NumArray (line 10) | type NumArray struct
method SumRange (line 24) | func (ma *NumArray) SumRange(i int, j int) int {
function Constructor303 (line 15) | func Constructor303(nums []int) NumArray {
FILE: leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable_test.go
function Test_Problem303 (line 8) | func Test_Problem303(t *testing.T) {
FILE: leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable.go
type NumMatrix (line 3) | type NumMatrix struct
method SumRegion (line 22) | func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 in...
function Constructor (line 7) | func Constructor(matrix [][]int) NumMatrix {
FILE: leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable_test.go
function Test_Problem304 (line 8) | func Test_Problem304(t *testing.T) {
FILE: leetcode/0306.Additive-Number/306. Additive Number.go
function isAdditiveNumber (line 9) | func isAdditiveNumber(num string) bool {
function max (line 31) | func max(a int, b int) int {
function recursiveCheck (line 39) | func recursiveCheck(num string, x1 int, x2 int, left int) bool {
FILE: leetcode/0306.Additive-Number/306. Additive Number_test.go
type question306 (line 8) | type question306 struct
type para306 (line 15) | type para306 struct
type ans306 (line 21) | type ans306 struct
function Test_Problem306 (line 25) | func Test_Problem306(t *testing.T) {
FILE: leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go
type NumArray (line 6) | type NumArray struct
method Update (line 20) | func (this *NumArray) Update(i int, val int) {
method SumRange (line 25) | func (this *NumArray) SumRange(i int, j int) int {
function Constructor307 (line 11) | func Constructor307(nums []int) NumArray {
FILE: leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go
function Test_Problem307 (line 8) | func Test_Problem307(t *testing.T) {
FILE: leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go
function maxProfit309 (line 8) | func maxProfit309(prices []int) int {
function max (line 26) | func max(a int, b int) int {
function maxProfit309_1 (line 34) | func maxProfit309_1(prices []int) int {
FILE: leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go
type question309 (line 8) | type question309 struct
type para309 (line 15) | type para309 struct
type ans309 (line 21) | type ans309 struct
function Test_Problem309 (line 25) | func Test_Problem309(t *testing.T) {
FILE: leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go
function countSmaller (line 10) | func countSmaller(nums []int) []int {
function countSmaller1 (line 41) | func countSmaller1(nums []int) []int {
FILE: leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go
type question315 (line 8) | type question315 struct
type para315 (line 15) | type para315 struct
type ans315 (line 21) | type ans315 struct
function Test_Problem315 (line 25) | func Test_Problem315(t *testing.T) {
FILE: leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go
function maxProduct318 (line 3) | func maxProduct318(words []string) int {
FILE: leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go
type question318 (line 8) | type question318 struct
type para318 (line 15) | type para318 struct
type ans318 (line 21) | type ans318 struct
function Test_Problem318 (line 25) | func Test_Problem318(t *testing.T) {
FILE: leetcode/0319.Bulb-Switcher/319.Bulb Switcher.go
function bulbSwitch (line 5) | func bulbSwitch(n int) int {
FILE: leetcode/0319.Bulb-Switcher/319.Bulb Switcher_test.go
type question319 (line 8) | type question319 struct
type para319 (line 14) | type para319 struct
type ans319 (line 19) | type ans319 struct
function Test_Problem319 (line 23) | func Test_Problem319(t *testing.T) {
FILE: leetcode/0322.Coin-Change/322. Coin Change.go
function coinChange (line 3) | func coinChange(coins []int, amount int) int {
function min (line 22) | func min(a int, b int) int {
FILE: leetcode/0322.Coin-Change/322. Coin Change_test.go
type question322 (line 8) | type question322 struct
type para322 (line 15) | type para322 struct
type ans322 (line 22) | type ans322 struct
function Test_Problem322 (line 26) | func Test_Problem322(t *testing.T) {
FILE: leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II.go
function wiggleSort (line 8) | func wiggleSort(nums []int) {
function indexMap (line 29) | func indexMap(index, n int) int {
function findKthLargest324 (line 33) | func findKthLargest324(nums []int, k int) int {
function selection324 (line 40) | func selection324(arr []int, l, r, k int) int {
function partition324 (line 55) | func partition324(a []int, lo, hi int) int {
function wiggleSort1 (line 69) | func wiggleSort1(nums []int) {
FILE: leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go
type question324 (line 8) | type question324 struct
type para324 (line 15) | type para324 struct
type ans324 (line 21) | type ans324 struct
function Test_Problem324 (line 25) | func Test_Problem324(t *testing.T) {
FILE: leetcode/0326.Power-of-Three/326. Power of Three.go
function isPowerOfThree (line 4) | func isPowerOfThree(n int) bool {
function isPowerOfThree1 (line 10) | func isPowerOfThree1(n int) bool {
function isPowerOfThree2 (line 18) | func isPowerOfThree2(num int) bool {
FILE: leetcode/0326.Power-of-Three/326. Power of Three_test.go
type question326 (line 8) | type question326 struct
type para326 (line 15) | type para326 struct
type ans326 (line 21) | type ans326 struct
function Test_Problem326 (line 25) | func Test_Problem326(t *testing.T) {
FILE: leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go
function countRangeSum (line 10) | func countRangeSum(nums []int, lower int, upper int) int {
function countRangeSum1 (line 44) | func countRangeSum1(nums []int, lower int, upper int) int {
function countRangeSum2 (line 75) | func countRangeSum2(nums []int, lower int, upper int) int {
FILE: leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go
type question327 (line 8) | type question327 struct
type para327 (line 15) | type para327 struct
type ans327 (line 23) | type ans327 struct
function Test_Problem327 (line 27) | func Test_Problem327(t *testing.T) {
FILE: leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go
function oddEvenList (line 18) | func oddEvenList(head *ListNode) *ListNode {
FILE: leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go
type question328 (line 10) | type question328 struct
type para328 (line 17) | type para328 struct
type ans328 (line 23) | type ans328 struct
function Test_Problem328 (line 27) | func Test_Problem328(t *testing.T) {
FILE: leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go
function longestIncreasingPath (line 14) | func longestIncreasingPath(matrix [][]int) int {
function max (line 28) | func max(a int, b int) int {
function isInIntBoard (line 35) | func isInIntBoard(board [][]int, x, y int) bool {
function searchPath (line 39) | func searchPath(board, cache [][]int, lastNum, x, y int) int {
FILE: leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go
type question329 (line 8) | type question329 struct
type para329 (line 15) | type para329 struct
type ans329 (line 21) | type ans329 struct
function Test_Problem329 (line 25) | func Test_Problem329(t *testing.T) {
FILE: leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go
function isValidSerialization (line 5) | func isValidSerialization(preorder string) bool {
FILE: leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go
type question331 (line 8) | type question331 struct
type para331 (line 15) | type para331 struct
type ans331 (line 21) | type ans331 struct
function Test_Problem331 (line 25) | func Test_Problem331(t *testing.T) {
FILE: leetcode/0337.House-Robber-III/337. House Robber III.go
function rob337 (line 18) | func rob337(root *TreeNode) int {
function dfsTreeRob (line 23) | func dfsTreeRob(root *TreeNode) (a, b int) {
function max (line 36) | func max(a int, b int) int {
FILE: leetcode/0337.House-Robber-III/337. House Robber III_test.go
type question337 (line 10) | type question337 struct
type para337 (line 17) | type para337 struct
type ans337 (line 23) | type ans337 struct
function Test_Problem337 (line 27) | func Test_Problem337(t *testing.T) {
FILE: leetcode/0338.Counting-Bits/338. Counting Bits.go
function countBits (line 3) | func countBits(num int) []int {
FILE: leetcode/0338.Counting-Bits/338. Counting Bits_test.go
type question338 (line 8) | type question338 struct
type para338 (line 15) | type para338 struct
type ans338 (line 21) | type ans338 struct
function Test_Problem338 (line 25) | func Test_Problem338(t *testing.T) {
FILE: leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator.go
type NestedInteger (line 7) | type NestedInteger struct
method IsInteger (line 11) | func (this NestedInteger) IsInteger() bool { return true }
method GetInteger (line 16) | func (this NestedInteger) GetInteger() int { return 0 }
method SetInteger (line 19) | func (n *NestedInteger) SetInteger(value int) {}
method Add (line 22) | func (this *NestedInteger) Add(elem NestedInteger) {}
method GetList (line 27) | func (this NestedInteger) GetList() []*NestedInteger { return nil }
type NestedIterator (line 29) | type NestedIterator struct
method Next (line 44) | func (this *NestedIterator) Next() int {
method HasNext (line 55) | func (this *NestedIterator) HasNext() bool {
type listIndex (line 33) | type listIndex struct
function Constructor (line 38) | func Constructor(nestedList []*NestedInteger) *NestedIterator {
FILE: leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator_test.go
function Test_Problem338 (line 8) | func Test_Problem338(t *testing.T) {
FILE: leetcode/0342.Power-of-Four/342. Power of Four.go
function isPowerOfFour (line 4) | func isPowerOfFour(num int) bool {
function isPowerOfFour1 (line 9) | func isPowerOfFour1(num int) bool {
FILE: leetcode/0342.Power-of-Four/342. Power of Four_test.go
type question342 (line 8) | type question342 struct
type para342 (line 15) | type para342 struct
type ans342 (line 21) | type ans342 struct
function Test_Problem342 (line 25) | func Test_Problem342(t *testing.T) {
FILE: leetcode/0343.Integer-Break/343. Integer Break.go
function integerBreak (line 3) | func integerBreak(n int) int {
function max (line 15) | func max(a int, b int) int {
FILE: leetcode/0343.Integer-Break/343. Integer Break_test.go
type question343 (line 8) | type question343 struct
type para343 (line 15) | type para343 struct
type ans343 (line 21) | type ans343 struct
function Test_Problem343 (line 25) | func Test_Problem343(t *testing.T) {
FILE: leetcode/0344.Reverse-String/344. Reverse String.go
function reverseString (line 3) | func reverseString(s []byte) {
FILE: leetcode/0344.Reverse-String/344. Reverse String_test.go
type question344 (line 8) | type question344 struct
type para344 (line 15) | type para344 struct
type ans344 (line 21) | type ans344 struct
function Test_Problem344 (line 25) | func Test_Problem344(t *testing.T) {
FILE: leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go
function reverseVowels (line 3) | func reverseVowels(s string) string {
function isVowel (line 21) | func isVowel(s byte) bool {
FILE: leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go
type question345 (line 8) | type question345 struct
type para345 (line 15) | type para345 struct
type ans345 (line 21) | type ans345 struct
function Test_Problem345 (line 25) | func Test_Problem345(t *testing.T) {
FILE: leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go
function topKFrequent (line 5) | func topKFrequent(nums []int, k int) []int {
type Item (line 23) | type Item struct
type PriorityQueue (line 29) | type PriorityQueue
method Len (line 31) | func (pq PriorityQueue) Len() int {
method Less (line 35) | func (pq PriorityQueue) Less(i, j int) bool {
method Swap (line 40) | func (pq PriorityQueue) Swap(i, j int) {
method Push (line 45) | func (pq *PriorityQueue) Push(x interface{}) {
method Pop (line 51) | func (pq *PriorityQueue) Pop() interface{} {
FILE: leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go
type question347 (line 8) | type question347 struct
type para347 (line 15) | type para347 struct
type ans347 (line 22) | type ans347 struct
function Test_Problem347 (line 26) | func Test_Problem347(t *testing.T) {
FILE: leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go
function intersection (line 3) | func intersection(nums1 []int, nums2 []int) []int {
FILE: leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go
type question349 (line 8) | type question349 struct
type para349 (line 15) | type para349 struct
type ans349 (line 22) | type ans349 struct
function Test_Problem349 (line 26) | func Test_Problem349(t *testing.T) {
FILE: leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go
function intersect (line 3) | func intersect(nums1 []int, nums2 []int) []int {
FILE: leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go
type question350 (line 8) | type question350 struct
type para350 (line 15) | type para350 struct
type ans350 (line 22) | type ans350 struct
function Test_Problem350 (line 26) | func Test_Problem350(t *testing.T) {
FILE: leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals.go
type SummaryRanges (line 5) | type SummaryRanges struct
method AddNum (line 17) | func (this *SummaryRanges) AddNum(val int) {
method GetIntervals (line 25) | func (this *SummaryRanges) GetIntervals() [][]int {
function Constructor (line 10) | func Constructor() SummaryRanges {
FILE: leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals_test.go
type question352 (line 8) | type question352 struct
type para352 (line 14) | type para352 struct
type ans352 (line 20) | type ans352 struct
function Test_Problem352 (line 24) | func Test_Problem352(t *testing.T) {
FILE: leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go
type sortEnvelopes (line 7) | type sortEnvelopes
method Len (line 9) | func (s sortEnvelopes) Len() int {
method Less (line 12) | func (s sortEnvelopes) Less(i, j int) bool {
method Swap (line 18) | func (s sortEnvelopes) Swap(i, j int) {
function maxEnvelopes (line 22) | func maxEnvelopes(envelopes [][]int) int {
FILE: leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go
type question354 (line 8) | type question354 struct
type para354 (line 15) | type para354 struct
type ans354 (line 21) | type ans354 struct
function Test_Problem354 (line 25) | func Test_Problem354(t *testing.T) {
FILE: leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go
function countNumbersWithUniqueDigits1 (line 4) | func countNumbersWithUniqueDigits1(n int) int {
function countNumbersWithUniqueDigits (line 13) | func countNumbersWithUniqueDigits(n int) int {
FILE: leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go
type question357 (line 8) | type question357 struct
type para357 (line 15) | type para357 struct
type ans357 (line 21) | type ans357 struct
function Test_Problem357 (line 25) | func Test_Problem357(t *testing.T) {
FILE: leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square.go
function isPerfectSquare (line 3) | func isPerfectSquare(num int) bool {
FILE: leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go
type question367 (line 8) | type question367 struct
type para367 (line 15) | type para367 struct
type ans367 (line 21) | type ans367 struct
function Test_Problem367 (line 25) | func Test_Problem367(t *testing.T) {
FILE: leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset.go
function largestDivisibleSubset (line 5) | func largestDivisibleSubset(nums []int) []int {
FILE: leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset_test.go
type question368 (line 8) | type question368 struct
type para368 (line 15) | type para368 struct
type ans368 (line 21) | type ans368 struct
function Test_Problem368 (line 25) | func Test_Problem368(t *testing.T) {
FILE: leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go
function getSum (line 3) | func getSum(a int, b int) int {
FILE: leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go
type question371 (line 8) | type question371 struct
type para371 (line 15) | type para371 struct
type ans371 (line 22) | type ans371 struct
function Test_Problem371 (line 26) | func Test_Problem371(t *testing.T) {
FILE: leetcode/0372.Super-Pow/372. Super Pow.go
function superPow (line 16) | func superPow(a int, b []int) int {
function qpow (line 25) | func qpow(x, n int) int {
function superPow1 (line 40) | func superPow1(a int, b []int) int {
FILE: leetcode/0372.Super-Pow/372. Super Pow_test.go
type question372 (line 8) | type question372 struct
type para372 (line 15) | type para372 struct
type ans372 (line 22) | type ans372 struct
function Test_Problem372 (line 26) | func Test_Problem372(t *testing.T) {
FILE: leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go
function kSmallestPairs (line 9) | func kSmallestPairs(nums1 []int, nums2 []int, k int) [][]int {
type minHeap (line 31) | type minHeap
method Len (line 33) | func (h minHeap) Len() int { return len(h) }
method Less (line 34) | func (h minHeap) Less(i, j int) bool { return h[i][0]+h[i][1] < h[j][0...
method Swap (line 35) | func (h minHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
method Push (line 37) | func (h *minHeap) Push(x interface{}) {
method Pop (line 41) | func (h *minHeap) Pop() interface{} {
function kSmallestPairs1 (line 50) | func kSmallestPairs1(nums1 []int, nums2 []int, k int) [][]int {
FILE: leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go
type question373 (line 8) | type question373 struct
type para373 (line 15) | type para373 struct
type ans373 (line 23) | type ans373 struct
function Test_Problem373 (line 27) | func Test_Problem373(t *testing.T) {
FILE: leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower.go
function guessNumber (line 14) | func guessNumber(n int) int {
function guess (line 18) | func guess(num int) int {
FILE: leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower_test.go
type question374 (line 8) | type question374 struct
type para374 (line 15) | type para374 struct
type ans374 (line 21) | type ans374 struct
function Test_Problem374 (line 25) | func Test_Problem374(t *testing.T) {
FILE: leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence.go
function wiggleMaxLength (line 3) | func wiggleMaxLength(nums []int) int {
FILE: leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence_test.go
type question376 (line 8) | type question376 struct
type para376 (line 15) | type para376 struct
type ans376 (line 21) | type ans376 struct
function Test_Problem376 (line 25) | func Test_Problem376(t *testing.T) {
FILE: leetcode/0377.Combination-Sum-IV/377. Combination Sum IV.go
function combinationSum4 (line 3) | func combinationSum4(nums []int, target int) int {
function combinationSum41 (line 17) | func combinationSum41(nums []int, target int) int {
function findcombinationSum4 (line 26) | func findcombinationSum4(nums []int, target, index int, c []int, res *in...
FILE: leetcode/0377.Combination-Sum-IV/377. Combination Sum IV_test.go
type question377 (line 8) | type question377 struct
type para377 (line 15) | type para377 struct
type ans377 (line 22) | type ans377 struct
function Test_Problem377 (line 26) | func Test_Problem377(t *testing.T) {
FILE: leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go
function kthSmallest378 (line 8) | func kthSmallest378(matrix [][]int, k int) int {
function counterKthSmall (line 23) | func counterKthSmall(m, n, mid int, matrix [][]int) int {
function kthSmallest3781 (line 37) | func kthSmallest3781(matrix [][]int, k int) int {
type pq (line 58) | type pq struct
method Len (line 63) | func (p *pq) Len() int {
method Less (line 67) | func (p *pq) Less(a, b int) bool {
method Swap (line 71) | func (p *pq) Swap(a, b int) {
method Push (line 75) | func (p *pq) Push(o interface{}) {
method Head (line 80) | func (p *pq) Head() interface{} {
method Pop (line 84) | func (p *pq) Pop() interface{} {
FILE: leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go
type question378 (line 8) | type question378 struct
type para378 (line 15) | type para378 struct
type ans378 (line 22) | type ans378 struct
function Test_Problem378 (line 26) | func Test_Problem378(t *testing.T) {
FILE: leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node.go
type Solution (line 19) | type Solution struct
method GetRandom (line 32) | func (this *Solution) GetRandom() int {
function Constructor (line 27) | func Constructor(head *ListNode) Solution {
FILE: leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node_test.go
function Test_Problem382 (line 10) | func Test_Problem382(t *testing.T) {
FILE: leetcode/0383.Ransom-Note/383.Ransom Note.go
function canConstruct (line 3) | func canConstruct(ransomNote string, magazine string) bool {
FILE: leetcode/0383.Ransom-Note/383.Ransom Note_test.go
type question383 (line 8) | type question383 struct
type para383 (line 14) | type para383 struct
type ans383 (line 20) | type ans383 struct
function Test_Problem383 (line 24) | func Test_Problem383(t *testing.T) {
FILE: leetcode/0384.Shuffle-an-Array/384.Shuffle an Array.go
type Solution (line 5) | type Solution struct
method Reset (line 16) | func (this *Solution) Reset() []int {
method Shuffle (line 21) | func (this *Solution) Shuffle() []int {
function Constructor (line 9) | func Constructor(nums []int) Solution {
FILE: leetcode/0384.Shuffle-an-Array/384.Shuffle an Array_test.go
type question384 (line 8) | type question384 struct
type para384 (line 14) | type para384 struct
type ans384 (line 20) | type ans384 struct
function Test_Problem384 (line 24) | func Test_Problem384(t *testing.T) {
FILE: leetcode/0385.Mini-Parser/385. Mini Parser.go
type NestedInteger (line 35) | type NestedInteger struct
method IsInteger (line 41) | func (n NestedInteger) IsInteger() bool {
method GetInteger (line 49) | func (n NestedInteger) GetInteger() int {
method SetInteger (line 54) | func (n *NestedInteger) SetInteger(value int) {
method Add (line 59) | func (n *NestedInteger) Add(elem NestedInteger) {
method GetList (line 64) | func (n NestedInteger) GetList() []*NestedInteger {
method Print (line 69) | func (n NestedInteger) Print() {
function deserialize (line 84) | func deserialize(s string) *NestedInteger {
function isDigital (line 119) | func isDigital(v byte) bool {
FILE: leetcode/0385.Mini-Parser/385. Mini Parser_test.go
type question385 (line 8) | type question385 struct
type para385 (line 15) | type para385 struct
type ans385 (line 21) | type ans385 struct
function Test_Problem385 (line 25) | func Test_Problem385(t *testing.T) {
FILE: leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go
function lexicalOrder (line 3) | func lexicalOrder(n int) []int {
function dfs386 (line 9) | func dfs386(x, n int, res *[]int) {
FILE: leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go
type question386 (line 8) | type question386 struct
type para386 (line 15) | type para386 struct
type ans386 (line 21) | type ans386 struct
function Test_Problem386 (line 25) | func Test_Problem386(t *testing.T) {
FILE: leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go
function firstUniqChar (line 4) | func firstUniqChar(s string) int {
function firstUniqChar1 (line 20) | func firstUniqChar1(s string) int {
FILE: leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go
type question387 (line 8) | type question387 struct
type para387 (line 15) | type para387 struct
type ans387 (line 21) | type ans387 struct
function Test_Problem387 (line 25) | func Test_Problem387(t *testing.T) {
FILE: leetcode/0389.Find-the-Difference/389. Find the Difference.go
function findTheDifference (line 3) | func findTheDifference(s string, t string) byte {
FILE: leetcode/0389.Find-the-Difference/389. Find the Difference_test.go
type question389 (line 8) | type question389 struct
type para389 (line 15) | type para389 struct
type ans389 (line 22) | type ans389 struct
function Test_Problem389 (line 26) | func Test_Problem389(t *testing.T) {
FILE: leetcode/0390.Elimination-Game/390. Elimination Game.go
function lastRemaining (line 3) | func lastRemaining(n int) int {
FILE: leetcode/0390.Elimination-Game/390. Elimination Game_test.go
type question390 (line 8) | type question390 struct
type para390 (line 15) | type para390 struct
type ans390 (line 21) | type ans390 struct
function Test_Problem390 (line 25) | func Test_Problem390(t *testing.T) {
FILE: leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle.go
type point (line 3) | type point struct
function isRectangleCover (line 8) | func isRectangleCover(rectangles [][]int) bool {
function min (line 41) | func min(a, b int) int {
function max (line 48) | func max(a, b int) int {
FILE: leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle_test.go
type question391 (line 8) | type question391 struct
type para391 (line 14) | type para391 struct
type ans391 (line 19) | type ans391 struct
function Test_Problem391 (line 23) | func Test_Problem391(t *testing.T) {
FILE: leetcode/0392.Is-Subsequence/392. Is Subsequence.go
function isSubsequence (line 4) | func isSubsequence(s string, t string) bool {
function isSubsequence1 (line 25) | func isSubsequence1(s string, t string) bool {
FILE: leetcode/0392.Is-Subsequence/392. Is Subsequence_test.go
type question392 (line 8) | type question392 struct
type para392 (line 15) | type para392 struct
type ans392 (line 22) | type ans392 struct
function Test_Problem392 (line 26) | func Test_Problem392(t *testing.T) {
FILE: leetcode/0393.UTF-8-Validation/393. UTF-8 Validation.go
function validUtf8 (line 3) | func validUtf8(data []int) bool {
FILE: leetcode/0393.UTF-8-Validation/393. UTF-8 Validation_test.go
type question393 (line 8) | type question393 struct
type para393 (line 15) | type para393 struct
type ans393 (line 21) | type ans393 struct
function Test_Problem393 (line 25) | func Test_Problem393(t *testing.T) {
FILE: leetcode/0394.Decode-String/394. Decode String.go
function decodeString (line 7) | func decodeString(s string) string {
FILE: leetcode/0394.Decode-String/394. Decode String_test.go
type question394 (line 8) | type question394 struct
type para394 (line 15) | type para394 struct
type ans394 (line 21) | type ans394 struct
function Test_Problem394 (line 25) | func Test_Problem394(t *testing.T) {
FILE: leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters.go
function longestSubstring (line 6) | func longestSubstring(s string, k int) int {
function max (line 41) | func max(a, b int) int {
function longestSubstring1 (line 49) | func longestSubstring1(s string, k int) int {
FILE: leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters_test.go
type question395 (line 8) | type question395 struct
type para395 (line 15) | type para395 struct
type ans395 (line 22) | type ans395 struct
function Test_Problem395 (line 26) | func Test_Problem395(t *testing.T) {
FILE: leetcode/0396.Rotate-Function/396. Rotate Function.go
function maxRotateFunction (line 3) | func maxRotateFunction(nums []int) int {
FILE: leetcode/0396.Rotate-Function/396. Rotate Function_test.go
type question396 (line 8) | type question396 struct
type para396 (line 15) | type para396 struct
type ans396 (line 21) | type ans396 struct
function Test_Problem396 (line 25) | func Test_Problem396(t *testing.T) {
FILE: leetcode/0397.Integer-Replacement/397. Integer Replacement.go
function integerReplacement (line 3) | func integerReplacement(n int) int {
FILE: leetcode/0397.Integer-Replacement/397. Integer Replacement_test.go
type question397 (line 8) | type question397 struct
type para397 (line 15) | type para397 struct
type ans397 (line 21) | type ans397 struct
function Test_Problem397 (line 25) | func Test_Problem397(t *testing.T) {
FILE: leetcode/0399.Evaluate-Division/399. Evaluate Division.go
type stringUnionFind (line 3) | type stringUnionFind struct
method add (line 8) | func (suf stringUnionFind) add(x string) {
method find (line 16) | func (suf stringUnionFind) find(x string) string {
method union (line 34) | func (suf stringUnionFind) union(x, y string, v float64) {
function calcEquation (line 45) | func calcEquation(equations [][]string, values []float64, queries [][]st...
FILE: leetcode/0399.Evaluate-Division/399. Evaluate Division_test.go
type question399 (line 8) | type question399 struct
type para399 (line 15) | type para399 struct
type ans399 (line 23) | type ans399 struct
function Test_Problem399 (line 27) | func Test_Problem399(t *testing.T) {
FILE: leetcode/0400.Nth-Digit/400.Nth Digit.go
function findNthDigit (line 5) | func findNthDigit(n int) int {
FILE: leetcode/0400.Nth-Digit/400.Nth Digit_test.go
type question400 (line 8) | type question400 struct
type para400 (line 14) | type para400 struct
type ans400 (line 19) | type ans400 struct
function Test_Problem400 (line 23) | func Test_Problem400(t *testing.T) {
FILE: leetcode/0401.Binary-Watch/401. Binary Watch.go
function readBinaryWatch (line 9) | func readBinaryWatch(num int) []string {
function readBinaryWatch1 (line 64) | func readBinaryWatch1(num int) []string {
function findReadBinaryWatchMinute (line 86) | func findReadBinaryWatchMinute(target, index int, c []int, res *[]string) {
function findReadBinaryWatchHour (line 110) | func findReadBinaryWatchHour(target, index int, c []int, res *[]string) {
FILE: leetcode/0401.Binary-Watch/401. Binary Watch_test.go
type question401 (line 8) | type question401 struct
type para401 (line 15) | type para401 struct
type ans401 (line 21) | type ans401 struct
function Test_Problem401 (line 25) | func Test_Problem401(t *testing.T) {
FILE: leetcode/0402.Remove-K-Digits/402. Remove K Digits.go
function removeKdigits (line 3) | func removeKdigits(num string, k int) string {
FILE: leetcode/0402.Remove-K-Digits/402. Remove K Digits_test.go
type question402 (line 8) | type question402 struct
type para402 (line 15) | type para402 struct
type ans402 (line 22) | type ans402 struct
function Test_Problem402 (line 26) | func Test_Problem402(t *testing.T) {
FILE: leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go
function sumOfLeftLeaves (line 19) | func sumOfLeftLeaves(root *TreeNode) int {
FILE: leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go
type question404 (line 10) | type question404 struct
type para404 (line 17) | type para404 struct
type ans404 (line 23) | type ans404 struct
function Test_Problem404 (line 27) | func Test_Problem404(t *testing.T) {
FILE: leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go
function toHex (line 3) | func toHex(num int) string {
FILE: leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go
type question405 (line 8) | type question405 struct
type para405 (line 15) | type para405 struct
type ans405 (line 21) | type ans405 struct
function Test_Problem405 (line 25) | func Test_Problem405(t *testing.T) {
FILE: leetcode/0409.Longest-Palindrome/409. Longest Palindrome.go
function longestPalindrome (line 3) | func longestPalindrome(s string) int {
FILE: leetcode/0409.Longest-Palindrome/409. Longest Palindrome_test.go
type question409 (line 8) | type question409 struct
type para409 (line 15) | type para409 struct
type ans409 (line 21) | type ans409 struct
function Test_Problem409 (line 25) | func Test_Problem409(t *testing.T) {
FILE: leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go
function splitArray (line 3) | func splitArray(nums []int, m int) int {
function calSum (line 26) | func calSum(mid, m int, nums []int) bool {
FILE: leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go
type question410 (line 8) | type question410 struct
type para410 (line 15) | type para410 struct
type ans410 (line 22) | type ans410 struct
function Test_Problem410 (line 26) | func Test_Problem410(t *testing.T) {
FILE: leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go
function fizzBuzz (line 5) | func fizzBuzz(n int) []string {
FILE: leetcode/0412.Fizz-Buzz/412. Fizz Buzz_test.go
function Test_fizzBuzz (line 35) | func Test_fizzBuzz(t *testing.T) {
function Benchmark_fizzBuzz (line 43) | func Benchmark_fizzBuzz(b *testing.B) {
FILE: leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices.go
function numberOfArithmeticSlices (line 3) | func numberOfArithmeticSlices(A []int) int {
FILE: leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices_test.go
type question413 (line 8) | type question413 struct
type para413 (line 15) | type para413 struct
type ans413 (line 21) | type ans413 struct
function Test_Problem413 (line 25) | func Test_Problem413(t *testing.T) {
FILE: leetcode/0414.Third-Maximum-Number/414. Third Maximum Number.go
function thirdMax (line 7) | func thirdMax(nums []int) int {
FILE: leetcode/0414.Third-Maximum-Number/414. Third Maximum Number_test.go
type question414 (line 8) | type question414 struct
type para414 (line 15) | type para414 struct
type ans414 (line 21) | type ans414 struct
function Test_Problem414 (line 25) | func Test_Problem414(t *testing.T) {
FILE: leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go
function canPartition (line 3) | func canPartition(nums []int) bool {
FILE: leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go
type question416 (line 8) | type question416 struct
type para416 (line 15) | type para416 struct
type ans416 (line 21) | type ans416 struct
function Test_Problem416 (line 25) | func Test_Problem416(t *testing.T) {
FILE: leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow.go
function pacificAtlantic (line 5) | func pacificAtlantic(matrix [][]int) [][]int {
function dfs (line 33) | func dfs(matrix [][]int, row, col int, visited *[][]bool, height int) {
FILE: leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow_test.go
type question417 (line 8) | type question417 struct
type para417 (line 15) | type para417 struct
type ans417 (line 21) | type ans417 struct
function Test_Problem417 (line 25) | func Test_Problem417(t *testing.T) {
FILE: leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board.go
function countBattleships (line 3) | func countBattleships(board [][]byte) (ans int) {
FILE: leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board_test.go
type question419 (line 9) | type question419 struct
type para419 (line 16) | type para419 struct
type ans419 (line 22) | type ans419 struct
function Test_Problem419 (line 26) | func Test_Problem419(t *testing.T) {
function bytesArrayToStringArray (line 53) | func bytesArrayToStringArray(b [][]byte) []string {
FILE: leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go
function findMaximumXOR (line 4) | func findMaximumXOR(nums []int) int {
function findMaximumXOR1 (line 44) | func findMaximumXOR1(nums []int) int {
FILE: leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go
type question421 (line 8) | type question421 struct
type para421 (line 15) | type para421 struct
type ans421 (line 21) | type ans421 struct
function Test_Problem421 (line 25) | func Test_Problem421(t *testing.T) {
FILE: leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English.go
function originalDigits (line 7) | func originalDigits(s string) string {
function convert (line 26) | func convert(b byte, digits []int, s string, num string) string {
FILE: leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English_test.go
type question423 (line 8) | type question423 struct
type para423 (line 15) | type para423 struct
type ans423 (line 21) | type ans423 struct
function Test_Problem423 (line 25) | func Test_Problem423(t *testing.T) {
FILE: leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go
function characterReplacement (line 3) | func characterReplacement(s string, k int) int {
function max (line 17) | func max(a int, b int) int {
FILE: leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go
type question424 (line 8) | type question424 struct
type para424 (line 15) | type para424 struct
type ans424 (line 22) | type ans424 struct
function Test_Problem424 (line 26) | func Test_Problem424(t *testing.T) {
FILE: leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal.go
type Node (line 11) | type Node struct
function levelOrder (line 16) | func levelOrder(root *Node) [][]int {
FILE: leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal_test.go
function Test_Problem429 (line 8) | func Test_Problem429(t *testing.T) {
FILE: leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go
function minMutation (line 4) | func minMutation(start string, end string, bank []string) int {
function getWordMap (line 27) | func getWordMap(wordList []string, beginWord string) map[string]int {
function getCandidates433 (line 39) | func getCandidates433(word string) []string {
function minMutation1 (line 52) | func minMutation1(start string, end string, bank []string) int {
function dfsMutation (line 71) | func dfsMutation(start uint32, m map[uint32]struct{}, step map[uint32]in...
function check (line 91) | func check(val uint32) bool {
function convert (line 110) | func convert(gene string) uint32 {
FILE: leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go
type question433 (line 8) | type question433 struct
type para433 (line 15) | type para433 struct
type ans433 (line 23) | type ans433 struct
function Test_Problem433 (line 27) | func Test_Problem433(t *testing.T) {
FILE: leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String.go
function countSegments (line 3) | func countSegments(s string) int {
FILE: leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String_test.go
type question434 (line 8) | type question434 struct
type para434 (line 14) | type para434 struct
type ans434 (line 19) | type ans434 struct
function Test_Problem434 (line 23) | func Test_Problem434(t *testing.T) {
FILE: leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go
function eraseOverlapIntervals (line 8) | func eraseOverlapIntervals(intervals [][]int) int {
function max (line 30) | func max(a int, b int) int {
type Intervals (line 38) | type Intervals
method Len (line 40) | func (a Intervals) Len() int {
method Swap (line 43) | func (a Intervals) Swap(i, j int) {
method Less (line 46) | func (a Intervals) Less(i, j int) bool {
function eraseOverlapIntervals1 (line 60) | func eraseOverlapIntervals1(intervals [][]int) int {
FILE: leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go
type question435 (line 8) | type question435 struct
type para435 (line 15) | type para435 struct
type ans435 (line 21) | type ans435 struct
function Test_Problem435 (line 25) | func Test_Problem435(t *testing.T) {
FILE: leetcode/0436.Find-Right-Interval/436. Find Right Interval.go
function findRightInterval (line 13) | func findRightInterval(intervals [][]int) []int {
type interval (line 32) | type interval struct
type intervalList (line 37) | type intervalList
method Len (line 39) | func (in intervalList) Len() int { return len(in) }
method Less (line 40) | func (in intervalList) Less(i, j int) bool {
method Swap (line 43) | func (in intervalList) Swap(i, j int) { in[i], in[j] = in[j], in[i] }
function findRightInterval1 (line 46) | func findRightInterval1(intervals [][]int) []int {
function searchFirstGreaterInterval (line 66) | func searchFirstGreaterInterval(nums []Interval, target int) int {
FILE: leetcode/0436.Find-Right-Interval/436. Find Right Interval_test.go
type question436 (line 8) | type question436 struct
type para436 (line 15) | type para436 struct
type ans436 (line 21) | type ans436 struct
function Test_Problem436 (line 25) | func Test_Problem436(t *testing.T) {
FILE: leetcode/0437.Path-Sum-III/437. Path Sum III.go
function pathSum (line 20) | func pathSum(root *TreeNode, targetSum int) int {
function dfs (line 26) | func dfs(root *TreeNode, prefixSum map[int]int, cur, sum int) int {
function pathSumIII (line 43) | func pathSumIII(root *TreeNode, sum int) int {
function findPath437 (line 54) | func findPath437(root *TreeNode, sum int) int {
FILE: leetcode/0437.Path-Sum-III/437. Path Sum III_test.go
type question437 (line 10) | type question437 struct
type para437 (line 17) | type para437 struct
type ans437 (line 24) | type ans437 struct
function Test_Problem437 (line 28) | func Test_Problem437(t *testing.T) {
FILE: leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go
function findAnagrams (line 3) | func findAnagrams(s string, p string) []int {
FILE: leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go
type question438 (line 8) | type question438 struct
type para438 (line 15) | type para438 struct
type ans438 (line 22) | type ans438 struct
function Test_Problem438 (line 26) | func Test_Problem438(t *testing.T) {
FILE: leetcode/0441.Arranging-Coins/441. Arranging Coins.go
function arrangeCoins (line 6) | func arrangeCoins(n int) int {
function arrangeCoins1 (line 15) | func arrangeCoins1(n int) int {
FILE: leetcode/0441.Arranging-Coins/441. Arranging Coins_test.go
type question441 (line 8) | type question441 struct
type para441 (line 15) | type para441 struct
type ans441 (line 21) | type ans441 struct
function Test_Problem441 (line 25) | func Test_Problem441(t *testing.T) {
FILE: leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go
function addTwoNumbers445 (line 17) | func addTwoNumbers445(l1 *ListNode, l2 *ListNode) *ListNode {
function addNode (line 39) | func addNode(l1 *ListNode, l2 *ListNode, offset int) *ListNode {
function getLength (line 61) | func getLength(l *ListNode) int {
function addTwoNumbers1 (line 71) | func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode {
function reverseList (line 95) | func reverseList(head *ListNode) *ListNode {
function addTwoNumbers (line 107) | func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
function pushStack (line 131) | func pushStack(l *ListNode) []int {
FILE: leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go
type question445 (line 10) | type question445 struct
type para445 (line 17) | type para445 struct
type ans445 (line 24) | type ans445 struct
function Test_Problem445 (line 28) | func Test_Problem445(t *testing.T) {
FILE: leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs.go
function numberOfBoomerangs (line 3) | func numberOfBoomerangs(points [][]int) int {
function dis (line 19) | func dis(pa, pb []int) int {
FILE: leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go
type question447 (line 8) | type question447 struct
type para447 (line 15) | type para447 struct
type ans447 (line 21) | type ans447 struct
function Test_Problem447 (line 25) | func Test_Problem447(t *testing.T) {
FILE: leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array/448. Find All Numbers Disappeared in an Array.go
function findDisappearedNumbers (line 3) | func findDisappearedNumbers(nums []int) []int {
FILE: leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array/448. Find All Numbers Disappeared in an Array_test.go
type question448 (line 8) | type question448 struct
type para448 (line 15) | type para448 struct
type ans448 (line 21) | type ans448 struct
function Test_Problem448 (line 25) | func Test_Problem448(t *testing.T) {
FILE: leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go
function frequencySort (line 7) | func frequencySort(s string) string {
FILE: leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go
type question451 (line 8) | type question451 struct
type para451 (line 15) | type para451 struct
type ans451 (line 21) | type ans451 struct
function Test_Problem451 (line 25) | func Test_Problem451(t *testing.T) {
FILE: leetcode/0453.Minimum-Moves-to-Equal-Array-Elements/453. Minimum Moves to Equal Array Elements.go
function minMoves (line 5) | func minMoves(nums []int) int {
FILE: leetcode/0453.Minimum-Moves-to-Equal-Array-Elements/453. Minimum Moves to Equal Array Elements_test.go
type question453 (line 8) | type question453 struct
type para453 (line 15) | type para453 struct
type ans453 (line 21) | type ans453 struct
function Test_Problem453 (line 25) | func Test_Problem453(t *testing.T) {
FILE: leetcode/0454.4Sum-II/454. 4Sum II.go
function fourSumCount (line 3) | func fourSumCount(A []int, B []int, C []int, D []int) int {
FILE: leetcode/0454.4Sum-II/454. 4Sum II_test.go
type question454 (line 8) | type question454 struct
type para454 (line 15) | type para454 struct
type ans454 (line 24) | type ans454 struct
function Test_Problem454 (line 28) | func Test_Problem454(t *testing.T) {
FILE: leetcode/0455.Assign-Cookies/455. Assign Cookies.go
function findContentChildren (line 5) | func findContentChildren(g []int, s []int) int {
FILE: leetcode/0455.Assign-Cookies/455. Assign Cookies_test.go
type question455 (line 8) | type question455 struct
type para455 (line 15) | type para455 struct
type ans455 (line 22) | type ans455 struct
function Test_Problem455 (line 26) | func Test_Problem455(t *testing.T) {
FILE: leetcode/0456.132-Pattern/456. 132 Pattern.go
function find132pattern (line 8) | func find132pattern(nums []int) bool {
function find132pattern1 (line 27) | func find132pattern1(nums []int) bool {
FILE: leetcode/0456.132-Pattern/456. 132 Pattern_test.go
type question456 (line 8) | type question456 struct
type para456 (line 15) | type para456 struct
type ans456 (line 21) | type ans456 struct
function Test_Problem456 (line 25) | func Test_Problem456(t *testing.T) {
FILE: leetcode/0457.Circular-Array-Loop/457. Circular Array Loop.go
function circularArrayLoop (line 3) | func circularArrayLoop(nums []int) bool {
function getNextIndex (line 35) | func getNextIndex(nums []int, index int) int {
FILE: leetcode/0457.Circular-Array-Loop/457. Circular Array Loop_test.go
type question457 (line 8) | type question457 struct
type para457 (line 15) | type para457 struct
type ans457 (line 21) | type ans457 struct
function Test_Problem457 (line 25) | func Test_Problem457(t *testing.T) {
FILE: leetcode/0458.Poor-Pigs/458.Poor Pigs.go
function poorPigs (line 5) | func poorPigs(buckets int, minutesToDie int, minutesToTest int) int {
FILE: leetcode/0458.Poor-Pigs/458.Poor Pigs_test.go
type question458 (line 8) | type question458 struct
type para458 (line 14) | type para458 struct
type ans458 (line 21) | type ans458 struct
function Test_Problem458 (line 25) | func Test_Problem458(t *testing.T) {
FILE: leetcode/0460.LFU-Cache/460. LFU Cache.go
type LFUCache (line 5) | type LFUCache struct
method Get (line 26) | func (this *LFUCache) Get(key int) int {
method Put (line 46) | func (this *LFUCache) Put(key int, value int) {
type node (line 12) | type node struct
function Constructor (line 18) | func Constructor(capacity int) LFUCache {
FILE: leetcode/0460.LFU-Cache/460. LFU Cache_test.go
function Test_Problem460 (line 8) | func Test_Problem460(t *testing.T) {
function MList2Ints (line 42) | func MList2Ints(lfu *LFUCache) map[int][][]int {
function MLists2Ints (line 54) | func MLists2Ints(lfu *LFUCache) map[int][]int {
FILE: leetcode/0461.Hamming-Distance/461. Hamming Distance.go
function hammingDistance (line 3) | func hammingDistance(x int, y int) int {
FILE: leetcode/0461.Hamming-Distance/461. Hamming Distance_test.go
type question461 (line 8) | type question461 struct
type para461 (line 15) | type para461 struct
type ans461 (line 22) | type ans461 struct
function Test_Problem461 (line 26) | func Test_Problem461(t *testing.T) {
FILE: leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II.go
function minMoves2 (line 8) | func minMoves2(nums []int) int {
FILE: leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II_test.go
type question462 (line 8) | type question462 struct
type para462 (line 15) | type para462 struct
type ans462 (line 21) | type ans462 struct
function Test_Problem462 (line 25) | func Test_Problem462(t *testing.T) {
FILE: leetcode/0463.Island-Perimeter/463. Island Perimeter.go
function islandPerimeter (line 3) | func islandPerimeter(grid [][]int) int {
FILE: leetcode/0463.Island-Perimeter/463. Island Perimeter_test.go
type question463 (line 8) | type question463 struct
type para463 (line 15) | type para463 struct
type ans463 (line 21) | type ans463 struct
function Test_Problem463 (line 25) | func Test_Problem463(t *testing.T) {
FILE: leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go
function rand10 (line 5) | func rand10() int {
function rand7 (line 13) | func rand7() int {
function rand101 (line 17) | func rand101() int {
FILE: leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go
type question470 (line 8) | type question470 struct
type para470 (line 15) | type para470 struct
type ans470 (line 20) | type ans470 struct
function Test_Problem470 (line 24) | func Test_Problem470(t *testing.T) {
FILE: leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square.go
function makesquare (line 5) | func makesquare(matchsticks []int) bool {
function dfs (line 23) | func dfs(matchsticks []int, cur, group, sum, total int, visited *[]bool)...
FILE: leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square_test.go
type question473 (line 8) | type question473 struct
type para473 (line 15) | type para473 struct
type ans473 (line 21) | type ans473 struct
function Test_Problem473 (line 25) | func Test_Problem473(t *testing.T) {
FILE: leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes.go
function findMaxForm (line 5) | func findMaxForm(strs []string, m int, n int) int {
function max (line 25) | func max(a int, b int) int {
FILE: leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go
type question474 (line 8) | type question474 struct
type para474 (line 15) | type para474 struct
type ans474 (line 23) | type ans474 struct
function Test_Problem474 (line 27) | func Test_Problem474(t *testing.T) {
FILE: leetcode/0475.Heaters/475. Heaters.go
function findRadius (line 8) | func findRadius(houses []int, heaters []int) int {
function findClosestHeater (line 27) | func findClosestHeater(pos int, heaters []int) int {
function findRadius1 (line 53) | func findRadius1(houses []int, heaters []int) int {
function max (line 65) | func max(a int, b int) int {
function min (line 72) | func min(a int, b int) int {
function abs (line 79) | func abs(a int) int {
FILE: leetcode/0475.Heaters/475. Heaters_test.go
type question475 (line 8) | type question475 struct
type para475 (line 15) | type para475 struct
type ans475 (line 22) | type ans475 struct
function Test_Problem475 (line 26) | func Test_Problem475(t *testing.T) {
FILE: leetcode/0476.Number-Complement/476. Number Complement.go
function findComplement (line 4) | func findComplement(num int) int {
function findComplement1 (line 13) | func findComplement1(num int) int {
FILE: leetcode/0476.Number-Complement/476. Number Complement_test.go
type question476 (line 8) | type question476 struct
type para476 (line 15) | type para476 struct
type ans476 (line 21) | type ans476 struct
function Test_Problem476 (line 25) | func Test_Problem476(t *testing.T) {
FILE: leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance.go
function totalHammingDistance (line 3) | func totalHammingDistance(nums []int) int {
function totalHammingDistance1 (line 16) | func totalHammingDistance1(nums []int) int {
function hammingDistance (line 26) | func hammingDistance(x int, y int) int {
FILE: leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go
type question477 (line 8) | type question477 struct
type para477 (line 15) | type para477 struct
type ans477 (line 21) | type ans477 struct
function Test_Problem477 (line 25) | func Test_Problem477(t *testing.T) {
FILE: leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle.go
type Solution (line 9) | type Solution struct
method RandPoint (line 20) | func (this *Solution) RandPoint() []float64 {
function Constructor (line 15) | func Constructor(radius float64, x_center float64, y_center float64) Sol...
function angle (line 38) | func angle() float64 {
FILE: leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle_test.go
function Test_Problem478 (line 8) | func Test_Problem478(t *testing.T) {
FILE: leetcode/0480.Sliding-Window-Median/480. Sliding Window Median.go
function medianSlidingWindow (line 10) | func medianSlidingWindow(nums []int, k int) []float64 {
function getWindowList (line 23) | func getWindowList(nums []int, k int) *list.List {
function removeFromWindow (line 34) | func removeFromWindow(w *list.List, n int) *list.List {
function insertInWindow (line 44) | func insertInWindow(w *list.List, n int) *list.List {
function getMedian (line 55) | func getMedian(w *list.List, k int) float64 {
function medianSlidingWindow1 (line 72) | func medianSlidingWindow1(nums []int, k int) []float64 {
type IntHeap (line 112) | type IntHeap struct
method Len (line 117) | func (h IntHeap) Len() int { return len(h.data) }
method Swap (line 120) | func (h IntHeap) Swap(i, j int) { h.data[i], h.data[j] = h.data[j], h....
method Push (line 123) | func (h *IntHeap) Push(x interface{}) { h.data = append(h.data, x.(int...
method Pop (line 126) | func (h *IntHeap) Pop() interface{} {
method Top (line 133) | func (h IntHeap) Top() int {
type MinHeap (line 138) | type MinHeap struct
method Less (line 143) | func (h MinHeap) Less(i, j int) bool { return h.data[i] < h.data[j] }
type MaxHeap (line 146) | type MaxHeap struct
method Less (line 151) | func (h MaxHeap) Less(i, j int) bool { return h.data[i] > h.data[j] }
type MinHeapR (line 154) | type MinHeapR struct
method Len (line 159) | func (h MinHeapR) Len() int { return h.hp.Len() - h.hpDel.Len() }
method Top (line 162) | func (h *MinHeapR) Top() int {
method Pop (line 171) | func (h *MinHeapR) Pop() int {
method Push (line 178) | func (h *MinHeapR) Push(x int) { heap.Push(&h.hp, x) }
method Remove (line 181) | func (h *MinHeapR) Remove(x int) { heap.Push(&h.hpDel, x) }
type MaxHeapR (line 184) | type MaxHeapR struct
method Len (line 189) | func (h MaxHeapR) Len() int { return h.hp.Len() - h.hpDel.Len() }
method Top (line 192) | func (h *MaxHeapR) Top() int {
method Pop (line 201) | func (h *MaxHeapR) Pop() int {
method Push (line 208) | func (h *MaxHeapR) Push(x int) { heap.Push(&h.hp, x) }
method Remove (line 211) | func (h *MaxHeapR) Remove(x int) { heap.Push(&h.hpDel, x) }
FILE: leetcode/0480.Sliding-Window-Median/480. Sliding Window Median_test.go
type question480 (line 8) | type question480 struct
type para480 (line 15) | type para480 struct
type ans480 (line 22) | type ans480 struct
function Test_Problem480 (line 26) | func Test_Problem480(t *testing.T) {
FILE: leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go
function smallestGoodBase (line 9) | func smallestGoodBase(n string) string {
FILE: leetcode/0483.Smallest-Good-Base/483. Smallest Good Base_test.go
type question483 (line 8) | type question483 struct
type para483 (line 15) | type para483 struct
type ans483 (line 21) | type ans483 struct
function Test_Problem483 (line 25) | func Test_Problem483(t *testing.T) {
FILE: leetcode/0485.Max-Consecutive-Ones/485. Max Consecutive Ones.go
function findMaxConsecutiveOnes (line 3) | func findMaxConsecutiveOnes(nums []int) int {
FILE: leetcode/0485.Max-Consecutive-Ones/485. Max Consecutive Ones_test.go
type question485 (line 8) | type question485 struct
type para485 (line 15) | type para485 struct
type ans485 (line 21) | type ans485 struct
function Test_Problem485 (line 25) | func Test_Problem485(t *testing.T) {
FILE: leetcode/0488.Zuma-Game/488.Zuma Game.go
function findMinStep (line 3) | func findMinStep(board string, hand string) int {
function del3 (line 34) | func del3(str string) string {
FILE: leetcode/0488.Zuma-Game/488.Zuma Game_test.go
type question488 (line 8) | type question488 struct
type para488 (line 14) | type para488 struct
type ans488 (line 20) | type ans488 struct
function Test_Problem488 (line 24) | func Test_Problem488(t *testing.T) {
FILE: leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences.go
function findSubsequences (line 3) | func findSubsequences(nums []int) [][]int {
function generateIncSubsets (line 16) | func generateIncSubsets(nums []int, current int, c []int, res *[][]int) {
FILE: leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences_test.go
type question491 (line 8) | type question491 struct
type para491 (line 15) | type para491 struct
type ans491 (line 21) | type ans491 struct
function Test_Problem491 (line 25) | func Test_Problem491(t *testing.T) {
FILE: leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle.go
function constructRectangle (line 5) | func constructRectangle(area int) []int {
FILE: leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle_test.go
type question492 (line 8) | type question492 struct
type para492 (line 14) | type para492 struct
type ans492 (line 19) | type ans492 struct
function Test_Problem492 (line 23) | func Test_Problem492(t *testing.T) {
FILE: leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go
function reversePairs (line 10) | func reversePairs(nums []int) int {
function mergesortCount (line 15) | func mergesortCount(nums, buf []int) int {
function reversePairs1 (line 42) | func reversePairs1(nums []int) (cnt int) {
function reversePairs2 (line 71) | func reversePairs2(nums []int) int {
FILE: leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go
type question493 (line 8) | type question493 struct
type para493 (line 15) | type para493 struct
type ans493 (line 21) | type ans493 struct
function Test_Problem493 (line 25) | func Test_Problem493(t *testing.T) {
FILE: leetcode/0494.Target-Sum/494. Target Sum.go
function findTargetSumWays (line 4) | func findTargetSumWays(nums []int, S int) int {
function findTargetSumWays1 (line 24) | func findTargetSumWays1(nums []int, S int) int {
function dfsFindTargetSumWays (line 36) | func dfsFindTargetSumWays(nums []int, index int, curSum int, S int, res ...
FILE: leetcode/0494.Target-Sum/494. Target Sum_test.go
type question494 (line 8) | type question494 struct
type para494 (line 15) | type para494 struct
type ans494 (line 22) | type ans494 struct
function Test_Problem494 (line 26) | func Test_Problem494(t *testing.T) {
FILE: leetcode/0495.Teemo-Attacking/495.Teemo Attacking.go
function findPoisonedDuration (line 3) | func findPoisonedDuration(timeSeries []int, duration int) int {
FILE: leetcode/0495.Teemo-Attacking/495.Teemo Attacking_test.go
type question495 (line 8) | type question495 struct
type para495 (line 14) | type para495 struct
type ans495 (line 20) | type ans495 struct
function Test_Problem495 (line 24) | func Test_Problem495(t *testing.T) {
FILE: leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I.go
function nextGreaterElement (line 3) | func nextGreaterElement(nums1 []int, nums2 []int) []int {
FILE: leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go
type question496 (line 8) | type question496 struct
type para496 (line 15) | type para496 struct
type ans496 (line 22) | type ans496 struct
function Test_Problem496 (line 26) | func Test_Problem496(t *testing.T) {
FILE: leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go
type Solution497 (line 6) | type Solution497 struct
method Pick (line 33) | func (so *Solution497) Pick() []int {
function Constructor497 (line 12) | func Constructor497(rects [][]int) Solution497 {
FILE: leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go
function Test_Problem497 (line 8) | func Test_Problem497(t *testing.T) {
FILE: leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse.go
function findDiagonalOrder1 (line 4) | func findDiagonalOrder1(matrix [][]int) []int {
function findDiagonalOrder (line 41) | func findDiagonalOrder(matrix [][]int) []int {
function addTraverse (line 133) | func addTraverse(matrix [][]int, i, j int, res *[]int) {
FILE: leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go
type question498 (line 8) | type question498 struct
type para498 (line 15) | type para498 struct
type ans498 (line 21) | type ans498 struct
function Test_Problem498 (line 25) | func Test_Problem498(t *testing.T) {
FILE: leetcode/0500.Keyboard-Row/500. Keyboard Row.go
function findWords500 (line 5) | func findWords500(words []string) []string {
FILE: leetcode/0500.Keyboard-Row/500. Keyboard Row_test.go
type question500 (line 8) | type question500 struct
type para500 (line 15) | type para500 struct
type ans500 (line 21) | type ans500 struct
function Test_Problem500 (line 25) | func Test_Problem500(t *testing.T) {
FILE: leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II.go
function nextGreaterElements (line 4) | func nextGreaterElements(nums []int) []int {
function nextGreaterElements1 (line 23) | func nextGreaterElements1(nums []int) []int {
FILE: leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go
type question503 (line 8) | type question503 struct
type para503 (line 15) | type para503 struct
type ans503 (line 21) | type ans503 struct
function Test_Problem503 (line 25) | func Test_Problem503(t *testing.T) {
FILE: leetcode/0504.Base-7/504.Base 7.go
function convertToBase7 (line 5) | func convertToBase7(num int) string {
FILE: leetcode/0504.Base-7/504.Base 7_test.go
type question504 (line 8) | type question504 struct
type para504 (line 14) | type para504 struct
type ans504 (line 19) | type ans504 struct
function Test_Problem504 (line 23) | func Test_Problem504(t *testing.T) {
FILE: leetcode/0506.Relative-Ranks/506.Relative Ranks.go
function findRelativeRanks (line 8) | func findRelativeRanks(score []int) []string {
FILE: leetcode/0506.Relative-Ranks/506.Relative Ranks_test.go
type question506 (line 8) | type question506 struct
type para506 (line 14) | type para506 struct
type ans506 (line 19) | type ans506 struct
function Test_Problem506 (line 23) | func Test_Problem506(t *testing.T) {
FILE: leetcode/0507.Perfect-Number/507. Perfect Number.go
function checkPerfectNumber (line 6) | func checkPerfectNumber(num int) bool {
function checkPerfectNumber_ (line 22) | func checkPerfectNumber_(num int) bool {
FILE: leetcode/0507.Perfect-Number/507. Perfect Number_test.go
type question507 (line 8) | type question507 struct
type para507 (line 15) | type para507 struct
type ans507 (line 21) | type ans507 struct
function Test_Problem507 (line 25) | func Test_Problem507(t *testing.T) {
FILE: leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go
function findFrequentTreeSum (line 22) | func findFrequentTreeSum(root *TreeNode) []int {
function collectSum (line 38) | func collectSum(root *TreeNode, memo map[int]int) int {
function findFrequentTreeSum1 (line 52) | func findFrequentTreeSum1(root *TreeNode) []int {
function findTreeSum (line 70) | func findTreeSum(root *TreeNode, fre map[int]int) int {
FILE: leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go
type question508 (line 10) | type question508 struct
type para508 (line 17) | type para508 struct
type ans508 (line 23) | type ans508 struct
function Test_Problem508 (line 27) | func Test_Problem508(t *testing.T) {
FILE: leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go
function fib (line 6) | func fib(N int) int {
function fib1 (line 14) | func fib1(N int) int {
function fib2 (line 26) | func fib2(N int) int {
function memoize (line 33) | func memoize(N int, cache map[int]int) int {
function fib3 (line 42) | func fib3(N int) int {
function fib4 (line 61) | func fib4(N int) int {
function matrixPower (line 73) | func matrixPower(A [2][2]int, N int) [2][2]int {
function multiply (line 91) | func multiply(A [2][2]int, B [2][2]int) [2][2]int {
function fib5 (line 107) | func fib5(N int) int {
function fib6 (line 113) | func fib6(N int) int {
function fibb (line 117) | func fibb(n int) <-chan int {
FILE: leetcode/0509.Fibonacci-Number/509. Fibonacci Number_test.go
type question509 (line 8) | type question509 struct
type para509 (line 15) | type para509 struct
type ans509 (line 21) | type ans509 struct
function Test_Problem509 (line 25) | func Test_Problem509(t *testing.T) {
FILE: leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go
function findBottomLeftValue (line 20) | func findBottomLeftValue(root *TreeNode) int {
function findBottomLeftValueDFS (line 29) | func findBottomLeftValueDFS(root *TreeNode, curHeight int, res, maxHeigh...
function findBottomLeftValue1 (line 43) | func findBottomLeftValue1(root *TreeNode) int {
FILE: leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go
type question513 (line 10) | type question513 struct
type para513 (line 17) | type para513 struct
type ans513 (line 23) | type ans513 struct
function Test_Problem513 (line 27) | func Test_Problem513(t *testing.T) {
FILE: leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go
function largestValues (line 23) | func largestValues(root *TreeNode) []int {
function levelOrder (line 34) | func levelOrder(root *TreeNode) [][]int {
function largestValues1 (line 67) | func largestValues1(root *TreeNode) []int {
function largestValues3 (line 95) | func largestValues3(root *TreeNode) []int {
FILE: leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go
type question515 (line 10) | type question515 struct
type para515 (line 17) | type para515 struct
type ans515 (line 23) | type ans515 struct
function Test_Problem515 (line 27) | func Test_Problem515(t *testing.T) {
FILE: leetcode/0518.Coin-Change-II/518. Coin Change II.go
function change (line 3) | func change(amount int, coins []int) int {
FILE: leetcode/0518.Coin-Change-II/518. Coin Change II_test.go
type question518 (line 8) | type question518 struct
type para518 (line 15) | type para518 struct
type ans518 (line 22) | type ans518 struct
function Test_Problem518 (line 26) | func Test_Problem518(t *testing.T) {
FILE: leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix.go
type Solution (line 7) | type Solution struct
method Flip (line 23) | func (this *Solution) Flip() []int {
method Reset (line 40) | func (this *Solution) Reset() {
function Constructor (line 14) | func Constructor(m int, n int) Solution {
FILE: leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix_test.go
type question519 (line 8) | type question519 struct
type para519 (line 14) | type para519 struct
type ans519 (line 20) | type ans519 struct
function Test_Problem519 (line 24) | func Test_Problem519(t *testing.T) {
FILE: leetcode/0520.Detect-Capital/520.Detect Capital.go
function detectCapitalUse (line 5) | func detectCapitalUse(word string) bool {
FILE: leetcode/0520.Detect-Capital/520.Detect Capital_test.go
type question520 (line 8) | type question520 struct
type para520 (line 14) | type para520 struct
type ans520 (line 19) | type ans520 struct
function Test_Problem520 (line 23) | func Test_Problem520(t *testing.T) {
FILE: leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum.go
function checkSubarraySum (line 3) | func checkSubarraySum(nums []int, k int) bool {
FILE: leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum_test.go
type question523 (line 8) | type question523 struct
type para523 (line 15) | type para523 struct
type ans523 (line 22) | type ans523 struct
function Test_Problem523 (line 26) | func Test_Problem523(t *testing.T) {
FILE: leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go
function findLongestWord (line 3) | func findLongestWord(s string, d []string) string {
FILE: leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go
type question524 (line 8) | type question524 struct
type para524 (line 15) | type para524 struct
type ans524 (line 22) | type ans524 struct
function Test_Problem524 (line 26) | func Test_Problem524(t *testing.T) {
FILE: leetcode/0525.Contiguous-Array/525. Contiguous Array.go
function findMaxLength (line 3) | func findMaxLength(nums []int) int {
function max (line 22) | func max(a, b int) int {
FILE: leetcode/0525.Contiguous-Array/525. Contiguous Array_test.go
type question525 (line 8) | type question525 struct
type para525 (line 15) | type para525 struct
type ans525 (line 21) | type ans525 struct
function Test_Problem525 (line 25) | func Test_Problem525(t *testing.T) {
FILE: leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go
function countArrangement1 (line 4) | func countArrangement1(N int) int {
function countArrangement (line 10) | func countArrangement(N int) int {
function generatePermutation526 (line 22) | func generatePermutation526(nums []int, index int, p []int, res *[][]int...
function checkDivisible (line 44) | func checkDivisible(num, d int) bool {
FILE: leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go
type question526 (line 8) | type question526 struct
type para526 (line 15) | type para526 struct
type ans526 (line 21) | type ans526 struct
function Test_Problem526 (line 25) | func Test_Problem526(t *testing.T) {
FILE: leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go
typ
Condensed preview — 3479 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (6,867K chars).
[
{
"path": ".github/FUNDING.yml",
"chars": 736,
"preview": "# These are supported funding model platforms\n\ngithub: [halfrost]\npatreon: # Replace with a single Patreon username\nopen"
},
{
"path": ".github/workflows/deploy.yml",
"chars": 985,
"preview": "name: Deploy《LeetCode-Cookbook》\n\non:\n push:\n branches:\n - master # 只在master上push触发部署\n - add_hugo\n path"
},
{
"path": ".gitignore",
"chars": 13,
"preview": "*.toml\n.idea\n"
},
{
"path": ".travis.yml",
"chars": 201,
"preview": "language: go\n\ngo:\n - master\n\n# whitelist\nbranches:\n only:\n - master\n\nscript:\n - go get -t -v ./...\n - go vet ./...\n"
},
{
"path": ".vscode/launch.json",
"chars": 401,
"preview": "{\n // 使用 IntelliSense 了解相关属性。 \n // 悬停以查看现有属性的描述。\n // 欲了解更多信息，请访问: https://go.microsoft.com/fwlink/?linkid=83038"
},
{
"path": ".vscode/settings.json",
"chars": 310,
"preview": "{\n \"go.formatTool\": \"gofmt\",\n \"go.formatFlags\": [\n \"-s\"\n ],\n \"go.autocompleteUnimportedPackages\": tru"
},
{
"path": "LICENSE",
"chars": 1065,
"preview": "MIT License\n\nCopyright (c) 2017 halfrost\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\no"
},
{
"path": "README.md",
"chars": 224388,
"preview": "\n# LeetCode in Go\n[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. M"
},
{
"path": "README_old.md",
"chars": 111915,
"preview": "\n# LeetCode by Go\n[LeetCode Online Judge] (https://leetcode.com/) is a website containing many **algorithm questions**. "
},
{
"path": "ctl/README.md",
"chars": 537,
"preview": "# LeetCode-Go ctl\n\n## 配置方法\n\n1. 在`.gitignore`中，添加一行`*.toml`\n2. 在`LeetCode-Go`目录下，添加文本文件`config.toml`。\n3. 把以下内容复制到`config."
},
{
"path": "ctl/command.go",
"chars": 409,
"preview": "package main\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\n\t\"github.com/spf13/cobra\"\n)\n\nvar rootCmd = &cobra.Command{\n\tUse: \"leetcode-go\",\n\t"
},
{
"path": "ctl/config.go",
"chars": 507,
"preview": "package main\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\n\t\"github.com/BurntSushi/toml\"\n)\n\nconst (\n\tconfigTOML = \"config.toml\"\n)\n\ntype confi"
},
{
"path": "ctl/error.go",
"chars": 285,
"preview": "package main\n\nimport (\n\t\"fmt\"\n\t\"os\"\n)\n\nconst (\n\t// ExitSuccess define\n\tExitSuccess = iota\n\t// ExitError define\n\tExitErro"
},
{
"path": "ctl/label.go",
"chars": 13070,
"preview": "package main\n\nimport (\n\t\"bufio\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"regexp\"\n\t\"strings\"\n\n\t\"github.com/halfrost/Le"
},
{
"path": "ctl/main.go",
"chars": 41,
"preview": "package main\n\nfunc main() {\n\texecute()\n}\n"
},
{
"path": "ctl/meta/Array",
"chars": 6063,
"preview": "|1. Two Sum| [Go]({{< relref \"/ChapterFour/0001.Two-Sum.md\" >}})| Easy | O(n)| O(n)||\n|11. Container With Most Water| [G"
},
{
"path": "ctl/meta/Backtracking",
"chars": 3508,
"preview": "|17. Letter Combinations of a Phone Number | [Go]({{< relref \"/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md"
},
{
"path": "ctl/meta/Binary_Indexed_Tree",
"chars": 0,
"preview": ""
},
{
"path": "ctl/meta/Binary_Search",
"chars": 1586,
"preview": "|50. Pow(x, n) | [Go]({{< relref \"/ChapterFour/0050.Powx-n.md\" >}})| Medium | O(log n)| O(1)||\n|69. Sqrt(x) | [Go]({{< "
},
{
"path": "ctl/meta/Bit_Manipulation",
"chars": 3435,
"preview": "|78. Subsets | [Go]({{< relref \"/ChapterFour/0078.Subsets.md\" >}})| Medium | O(n^2)| O(n)|❤️|\n|136. Single Number | [Go]"
},
{
"path": "ctl/meta/Breadth_First_Search",
"chars": 1725,
"preview": "|101. Symmetric Tree | [Go]({{< relref \"/ChapterFour/0101.Symmetric-Tree.md\" >}})| Easy | O(n)| O(1)||\n|102. Binary Tree"
},
{
"path": "ctl/meta/Depth_First_Search",
"chars": 2783,
"preview": "|98. Validate Binary Search Tree | [Go]({{< relref \"/ChapterFour/0098.Validate-Binary-Search-Tree.md\" >}})| Medium | O(n"
},
{
"path": "ctl/meta/Dynamic_Programming",
"chars": 3062,
"preview": "|53. Maximum Subarray| [Go]({{< relref \"/ChapterFour/0053.Maximum-Subarray.md\" >}})| Easy | O(n)| O(n)||\n|62. Unique Pat"
},
{
"path": "ctl/meta/Hash_Table",
"chars": 3891,
"preview": "|1. Two Sum | [Go]({{< relref \"/ChapterFour/0001.Two-Sum.md\" >}})| Easy | O(n)| O(n)||\n|3. Longest Substring Without Rep"
},
{
"path": "ctl/meta/Linked_List",
"chars": 3560,
"preview": "|2. Add Two Numbers | [Go]({{< relref \"/ChapterFour/0002.Add-Two-Numbers.md\" >}})| Medium | O(n)| O(1)||\n|19. Remove Nth"
},
{
"path": "ctl/meta/Math",
"chars": 2041,
"preview": "|2. Add Two Numbers | [Go]({{< relref \"/ChapterFour/0002.Add-Two-Numbers.md\" >}})| Medium | O(n)| O(1)||\n|50. Pow(x, n)"
},
{
"path": "ctl/meta/PDFPreface",
"chars": 509,
"preview": "<img src=\"https://books.halfrost.com/leetcode/logo.png\" alt=\"logo\" heigth=\"1300px\" align=\"center\"/>\n\n\n# 说明\n\n此版本是 https:/"
},
{
"path": "ctl/meta/Segment_Tree",
"chars": 1222,
"preview": "|218. The Skyline Problem | [Go]({{< relref \"/ChapterFour/0218.The-Skyline-Problem.md\" >}})| Hard | O(n log n)| O(n)|❤️|"
},
{
"path": "ctl/meta/Sliding_Window",
"chars": 1831,
"preview": "|3. Longest Substring Without Repeating Characters | [Go]({{< relref \"/ChapterFour/0003.Longest-Substring-Without-Repeat"
},
{
"path": "ctl/meta/Sorting",
"chars": 2786,
"preview": "|56. Merge Intervals | [Go]({{< relref \"/ChapterFour/0056.Merge-Intervals.md\" >}})| Medium | O(n log n)| O(log n)||\n|57."
},
{
"path": "ctl/meta/Stack",
"chars": 4658,
"preview": "|20. Valid Parentheses | [Go]({{< relref \"/ChapterFour/0020.Valid-Parentheses.md\" >}})| Easy | O(log n)| O(1)||\n|42. Tra"
},
{
"path": "ctl/meta/String",
"chars": 2484,
"preview": "|3. Longest Substring Without Repeating Characters | [Go]({{< relref \"/ChapterFour/0003.Longest-Substring-Without-Repeat"
},
{
"path": "ctl/meta/Tree",
"chars": 4250,
"preview": "|94. Binary Tree Inorder Traversal | [Go]({{< relref \"/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md\" >}})| Medium |"
},
{
"path": "ctl/meta/Two_Pointers",
"chars": 6259,
"preview": "|3. Longest Substring Without Repeating Characters | [Go]({{< relref \"/ChapterFour/0003.Longest-Substring-Without-Repeat"
},
{
"path": "ctl/meta/Union_Find",
"chars": 2282,
"preview": "|128. Longest Consecutive Sequence | [Go]({{< relref \"/ChapterFour/0128.Longest-Consecutive-Sequence.md\" >}})| Hard | O("
},
{
"path": "ctl/meta/meta",
"chars": 119,
"preview": "| Title | Solution | Difficulty | Time | Space |收藏| \n| ----- | :--------: | :----------: | :----: | :-----: | :-----: |"
},
{
"path": "ctl/models/go.mod",
"chars": 207,
"preview": "module github.com/halfrost/LeetCode-Go/ctl/models\n\ngo 1.19\n\nreplace github.com/halfrost/LeetCode-Go/ctl/models => ../uti"
},
{
"path": "ctl/models/go.sum",
"chars": 255,
"preview": "github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20220910225043-e3bb5aff34d0 h1:WAOAj59szR52uAnEQljAt7ucpbGGOsy0xgR/NeP4X"
},
{
"path": "ctl/models/lcproblems.go",
"chars": 3347,
"preview": "package models\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n)\n\n// LeetCodeProblemAll define\ntype LeetCodeProblemAll struct {\n\tUserName "
},
{
"path": "ctl/models/mdrow.go",
"chars": 3388,
"preview": "package models\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n)\n\n// Mdrow define\ntype Mdrow struct {\n\tFrontendQuestionID int32 `json:\"ques"
},
{
"path": "ctl/models/tagproblem.go",
"chars": 10180,
"preview": "package models\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/halfrost/LeetCode-Go/ctl/util\"\n)\n\n/"
},
{
"path": "ctl/models/user.go",
"chars": 2333,
"preview": "package models\n\nimport (\n\t\"fmt\"\n)\n\n// UserInfo define\ntype UserInfo struct {\n\tUserName string `json:\"user_name\"`"
},
{
"path": "ctl/pdf.go",
"chars": 6575,
"preview": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/halfrost/L"
},
{
"path": "ctl/rangking.go",
"chars": 757,
"preview": "package main\n\nimport (\n\t\"fmt\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// getRanking 让这个方法优雅一点\nfunc getRanking() int {\n\t// 获取网页数据\n\tURL :"
},
{
"path": "ctl/refresh.go",
"chars": 481,
"preview": "package main\n\nimport (\n\t\"github.com/spf13/cobra\"\n)\n\nfunc newRefresh() *cobra.Command {\n\tcmd := &cobra.Command{\n\t\tUse: "
},
{
"path": "ctl/render.go",
"chars": 11365,
"preview": "package main\n\nimport (\n\t\"bufio\"\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"regexp\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\n\tm \"github."
},
{
"path": "ctl/request.go",
"chars": 3096,
"preview": "package main\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"net/http\"\n\n\t\"github.com/mozillazg/request\"\n)\n\nconst (\n\t// AllProbl"
},
{
"path": "ctl/statistic.go",
"chars": 1403,
"preview": "package main\n\nimport (\n\t\"sort\"\n\n\tm \"github.com/halfrost/LeetCode-Go/ctl/models\"\n\t\"github.com/halfrost/LeetCode-Go/ctl/ut"
},
{
"path": "ctl/template/Array.md",
"chars": 79,
"preview": "---\ntitle: 2.01 Array\ntype: docs\nweight: 1\n---\n\n# Array\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Backtracking.md",
"chars": 2128,
"preview": "---\ntitle: 2.08 ✅ Backtracking\ntype: docs\nweight: 8\n---\n\n# Backtracking\n\n![](https://img.halfrost.com/Leetcode/Backtrack"
},
{
"path": "ctl/template/Binary_Indexed_Tree.md",
"chars": 174,
"preview": "---\ntitle: 2.19 ✅ Binary Indexed Tree\ntype: docs\nweight: 19\n---\n\n# Binary Indexed Tree\n\n![](https://img.halfrost.com/Lee"
},
{
"path": "ctl/template/Binary_Search.md",
"chars": 2769,
"preview": "---\ntitle: 2.11 Binary Search\ntype: docs\nweight: 11\n---\n\n# Binary Search\n\n- 二分搜索的经典写法。需要注意的三点：\n\t1. 循环退出条件，注意是 low <= hig"
},
{
"path": "ctl/template/Bit_Manipulation.md",
"chars": 817,
"preview": "---\ntitle: 2.15 ✅ Bit Manipulation\ntype: docs\nweight: 15\n---\n\n# Bit Manipulation\n\n![](https://img.halfrost.com/Leetcode/"
},
{
"path": "ctl/template/Breadth_First_Search.md",
"chars": 111,
"preview": "---\ntitle: 2.10 Breadth First Search\ntype: docs\nweight: 10\n---\n\n# Breadth First Search\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Depth_First_Search.md",
"chars": 106,
"preview": "---\ntitle: 2.09 Depth First Search\ntype: docs\nweight: 9\n---\n\n# Depth First Search\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Dynamic_Programming.md",
"chars": 108,
"preview": "---\ntitle: 2.07 Dynamic Programming\ntype: docs\nweight: 7\n---\n\n# Dynamic Programming\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Hash_Table.md",
"chars": 91,
"preview": "---\ntitle: 2.13 Hash Table\ntype: docs\nweight: 13\n---\n\n# Hash Table\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Linked_List.md",
"chars": 518,
"preview": "---\ntitle: 2.04 ✅ Linked List\ntype: docs\nweight: 4\n---\n\n# Linked List\n\n![](https://img.halfrost.com/Leetcode/Linked_List"
},
{
"path": "ctl/template/Math.md",
"chars": 79,
"preview": "---\ntitle: 2.12 Math\ntype: docs\nweight: 12\n---\n\n# Math\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Segment_Tree.md",
"chars": 2022,
"preview": "---\ntitle: 2.18 ✅ Segment Tree\ntype: docs\nweight: 18\n---\n\n# Segment Tree\n\n![](https://img.halfrost.com/Leetcode/Segment_"
},
{
"path": "ctl/template/Sliding_Window.md",
"chars": 624,
"preview": "---\ntitle: 2.17 ✅ Sliding Window\ntype: docs\nweight: 17\n---\n\n# Sliding Window\n\n![](https://img.halfrost.com/Leetcode/Slid"
},
{
"path": "ctl/template/Sorting.md",
"chars": 278,
"preview": "---\ntitle: 2.14 ✅ Sorting\ntype: docs\nweight: 14\n---\n\n# Sorting\n\n\n\n- 深刻的理解"
},
{
"path": "ctl/template/Stack.md",
"chars": 404,
"preview": "---\ntitle: 2.05 ✅ Stack\ntype: docs\nweight: 5\n---\n\n# Stack\n\n\n\n- 括号匹配问题及类似"
},
{
"path": "ctl/template/String.md",
"chars": 82,
"preview": "---\ntitle: 2.02 String\ntype: docs\nweight: 2\n---\n\n# String\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Tree.md",
"chars": 78,
"preview": "---\ntitle: 2.06 Tree\ntype: docs\nweight: 6\n---\n\n# Tree\n\n\n{{.AvailableTagTable}}"
},
{
"path": "ctl/template/Two_Pointers.md",
"chars": 722,
"preview": "---\ntitle: 2.03 ✅ Two Pointers\ntype: docs\nweight: 3\n---\n\n# Two Pointers\n\n![](https://img.halfrost.com/Leetcode/Two_point"
},
{
"path": "ctl/template/Union_Find.md",
"chars": 898,
"preview": "---\ntitle: 2.16 ✅ Union Find\ntype: docs\nweight: 16\n---\n\n# Union Find\n\n![](https://img.halfrost.com/Leetcode/Union_Find.p"
},
{
"path": "ctl/template/collapseSection.md",
"chars": 45,
"preview": "---\nbookCollapseSection: true\nweight: 20\n---\n"
},
{
"path": "ctl/template/menu.md",
"chars": 52,
"preview": "---\nheadless: true\n---\n\n<hr>\n\n{{.BookMenu}}\n\n<br />\n"
},
{
"path": "ctl/template/template.markdown",
"chars": 22047,
"preview": "\n# LeetCode in Go\n[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. M"
},
{
"path": "ctl/template_render.go",
"chars": 703,
"preview": "package main\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"html/template\"\n\t\"io/ioutil\"\n\t\"os\"\n\n\tm \"github.com/halfrost/LeetCode-Go/ctl/mode"
},
{
"path": "ctl/util/go.mod",
"chars": 57,
"preview": "module github.com/halfrost/LeetCode-Go/ctl/util\n\ngo 1.19\n"
},
{
"path": "ctl/util/util.go",
"chars": 4227,
"preview": "package util\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Loa"
},
{
"path": "ctl/version.go",
"chars": 282,
"preview": "package main\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/spf13/cobra\"\n)\n\nvar (\n\tversion = \"v1.0\"\n\tversionCmd = &cobra.Command{\n\t\tU"
},
{
"path": "go.mod",
"chars": 1058,
"preview": "module github.com/halfrost/LeetCode-Go\n\ngo 1.19\n\nreplace github.com/halfrost/LeetCode-Go/structures => ./structures\n\nrep"
},
{
"path": "go.sum",
"chars": 3134,
"preview": "github.com/BurntSushi/toml v1.2.0 h1:Rt8g24XnyGTyglgET/PRUNlrUeu9F5L+7FilkXfZgs0=\ngithub.com/BurntSushi/toml v1.2.0/go.m"
},
{
"path": "gotest.sh",
"chars": 286,
"preview": "#!/usr/bin/env bash\n\nset -e\necho \"\" > coverage.txt\n\nfor d in $(go list ./leetcode/... | grep -v vendor); do\n echo $d\n"
},
{
"path": "leetcode/0001.Two-Sum/1. Two Sum.go",
"chars": 202,
"preview": "package leetcode\n\nfunc twoSum(nums []int, target int) []int {\n\tm := make(map[int]int)\n\tfor k, v := range nums {\n\t\tif idx"
},
{
"path": "leetcode/0001.Two-Sum/1. Two Sum_test.go",
"chars": 850,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question1 struct {\n\tpara1\n\tans1\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0001.Two-Sum/README.md",
"chars": 580,
"preview": "# [1. Two Sum](https://leetcode.com/problems/two-sum/)\n\n## 题目\n\nGiven an array of integers, return indices of the two num"
},
{
"path": "leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go",
"chars": 701,
"preview": "package leetcode\n\nimport (\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\n// ListNode define\ntype ListNode = structure"
},
{
"path": "leetcode/0002.Add-Two-Numbers/2. Add Two Numbers_test.go",
"chars": 1289,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\ntype question2 struct {\n\t"
},
{
"path": "leetcode/0002.Add-Two-Numbers/README.md",
"chars": 811,
"preview": "# [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)\n\n## 题目\n\nYou are given two non-empty linked lists "
},
{
"path": "leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go",
"chars": 1230,
"preview": "package leetcode\n\n// 解法一 位图\nfunc lengthOfLongestSubstring(s string) int {\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tvar bitSet [2"
},
{
"path": "leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go",
"chars": 671,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question3 struct {\n\tpara3\n\tans3\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md",
"chars": 882,
"preview": "# [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-"
},
{
"path": "leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go",
"chars": 1434,
"preview": "package leetcode\n\nfunc findMedianSortedArrays(nums1 []int, nums2 []int) float64 {\n\t// 假设 nums1 的长度小\n\tif len(nums1) > len"
},
{
"path": "leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go",
"chars": 656,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question4 struct {\n\tpara4\n\tans4\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0004.Median-of-Two-Sorted-Arrays/README.md",
"chars": 1646,
"preview": "# [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)\n\n\n## 题目\n\nThere are two so"
},
{
"path": "leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring.go",
"chars": 2499,
"preview": "package leetcode\n\n// 解法一 Manacher's algorithm，时间复杂度 O(n)，空间复杂度 O(n)\nfunc longestPalindrome(s string) string {\n\tif len(s)"
},
{
"path": "leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go",
"chars": 2457,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question5 struct {\n\tpara5\n\tans5\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0005.Longest-Palindromic-Substring/README.md",
"chars": 5137,
"preview": "# [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)\n\n\n## 题目\n\nGiven a stri"
},
{
"path": "leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion.go",
"chars": 550,
"preview": "package leetcode\n\nfunc convert(s string, numRows int) string {\n\tmatrix, down, up := make([][]byte, numRows, numRows), 0,"
},
{
"path": "leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion_test.go",
"chars": 702,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question6 struct {\n\tpara6\n\tans6\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0006.ZigZag-Conversion/README.md",
"chars": 1888,
"preview": "# [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)\n\n\n## 题目\n\nThe string `\"PAYPALISHIRING\"` is wri"
},
{
"path": "leetcode/0007.Reverse-Integer/7. Reverse Integer.go",
"chars": 173,
"preview": "package leetcode\n\nfunc reverse7(x int) int {\n\ttmp := 0\n\tfor x != 0 {\n\t\ttmp = tmp*10 + x%10\n\t\tx = x / 10\n\t}\n\tif tmp > 1<<"
},
{
"path": "leetcode/0007.Reverse-Integer/7. Reverse Integer_test.go",
"chars": 656,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question7 struct {\n\tpara7\n\tans7\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0007.Reverse-Integer/README.md",
"chars": 775,
"preview": "# [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/)\n\n\n## 题目\n\nGiven a 32-bit signed integer, reverse d"
},
{
"path": "leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go",
"chars": 1119,
"preview": "package leetcode\n\nfunc myAtoi(s string) int {\n\tmaxInt, signAllowed, whitespaceAllowed, sign, digits := int64(2<<30), tru"
},
{
"path": "leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go",
"chars": 739,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question8 struct {\n\tpara8\n\tans8\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0008.String-to-Integer-atoi/README.md",
"chars": 5711,
"preview": "# [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)\n\n\n## 题目\n\nImplement the `myAtoi(st"
},
{
"path": "leetcode/0009.Palindrome-Number/9. Palindrome Number.go",
"chars": 626,
"preview": "package leetcode\n\nimport \"strconv\"\n\n// 解法一\nfunc isPalindrome(x int) bool {\n\tif x < 0 {\n\t\treturn false\n\t}\n\tif x == 0 {\n\t\t"
},
{
"path": "leetcode/0009.Palindrome-Number/9. Palindrome Number_test.go",
"chars": 793,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question9 struct {\n\tpara9\n\tans9\n}\n\n// para 是参数\n// one 代表第一个参数\ntype "
},
{
"path": "leetcode/0009.Palindrome-Number/README.md",
"chars": 1401,
"preview": "# [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/)\n\n\n## 题目\n\nDetermine whether an integer is a pa"
},
{
"path": "leetcode/0011.Container-With-Most-Water/11. Container With Most Water.go",
"chars": 338,
"preview": "package leetcode\n\nfunc maxArea(height []int) int {\n\tmax, start, end := 0, 0, len(height)-1\n\tfor start < end {\n\t\twidth :="
},
{
"path": "leetcode/0011.Container-With-Most-Water/11. Container With Most Water_test.go",
"chars": 621,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question11 struct {\n\tpara11\n\tans11\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0011.Container-With-Most-Water/README.md",
"chars": 911,
"preview": "# [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)\n\n## 题目\n\nGiven n non-negative"
},
{
"path": "leetcode/0012.Integer-to-Roman/12. Integer to Roman.go",
"chars": 339,
"preview": "package leetcode\n\nfunc intToRoman(num int) string {\n\tvalues := []int{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, "
},
{
"path": "leetcode/0012.Integer-to-Roman/12. Integer to Roman_test.go",
"chars": 810,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question12 struct {\n\tpara12\n\tans12\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0012.Integer-to-Roman/README.md",
"chars": 2295,
"preview": "# [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman/)\n\n\n## 题目\n\nRoman numerals are represented by sev"
},
{
"path": "leetcode/0013.Roman-to-Integer/13. Roman to Integer.go",
"chars": 418,
"preview": "package leetcode\n\nvar roman = map[string]int{\n\t\"I\": 1,\n\t\"V\": 5,\n\t\"X\": 10,\n\t\"L\": 50,\n\t\"C\": 100,\n\t\"D\": 500,\n\t\"M\": 1000,\n}\n"
},
{
"path": "leetcode/0013.Roman-to-Integer/13. Roman to Integer_test.go",
"chars": 772,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question13 struct {\n\tpara13\n\tans13\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0013.Roman-to-Integer/README.md",
"chars": 2655,
"preview": "# [13. Roman to Integer](https://leetcode.com/problems/roman-to-integer/)\n\n\n## 题目\n\nRoman numerals are represented by sev"
},
{
"path": "leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go",
"chars": 276,
"preview": "package leetcode\n\nfunc longestCommonPrefix(strs []string) string {\n\tprefix := strs[0]\n\n\tfor i := 1; i < len(strs); i++ {"
},
{
"path": "leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go",
"chars": 698,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question14 struct {\n\tpara14\n\tans14\n}\n\n// para 是参数\ntype para14 struc"
},
{
"path": "leetcode/0014.Longest-Common-Prefix/README.md",
"chars": 1067,
"preview": "# [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)\n\n## 题目\n\nWrite a function to find the"
},
{
"path": "leetcode/0015.3Sum/15. 3Sum.go",
"chars": 1699,
"preview": "package leetcode\n\nimport (\n\t\"sort\"\n)\n\n// 解法一 最优解，双指针 + 排序\nfunc threeSum(nums []int) [][]int {\n\tsort.Ints(nums)\n\tresult, "
},
{
"path": "leetcode/0015.3Sum/15. 3Sum_test.go",
"chars": 1307,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question15 struct {\n\tpara15\n\tans15\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0015.3Sum/README.md",
"chars": 755,
"preview": "# [15. 3Sum](https://leetcode.com/problems/3sum/)\n\n## 题目\n\nGiven an array nums of n integers, are there elements a, b, c "
},
{
"path": "leetcode/0016.3Sum-Closest/16. 3Sum Closest.go",
"chars": 1024,
"preview": "package leetcode\n\nimport (\n\t\"math\"\n\t\"sort\"\n)\n\n// 解法一 O(n^2)\nfunc threeSumClosest(nums []int, target int) int {\n\tn, res, "
},
{
"path": "leetcode/0016.3Sum-Closest/16. 3Sum Closest_test.go",
"chars": 819,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question16 struct {\n\tpara16\n\tans16\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0016.3Sum-Closest/README.md",
"chars": 837,
"preview": "# [16. 3Sum Closest](https://leetcode.com/problems/3sum-closest/)\n\n## 题目\n\nGiven an array nums of n integers and an integ"
},
{
"path": "leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go",
"chars": 1843,
"preview": "package leetcode\n\nvar (\n\tletterMap = []string{\n\t\t\" \", //0\n\t\t\"\", //1\n\t\t\"abc\", //2\n\t\t\"def\", //3\n\t\t\"ghi\", //4\n\t\t\""
},
{
"path": "leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go",
"chars": 618,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question17 struct {\n\tpara17\n\tans17\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md",
"chars": 808,
"preview": "# [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)\n\n\n##"
},
{
"path": "leetcode/0018.4Sum/18. 4Sum.go",
"chars": 4028,
"preview": "package leetcode\n\nimport \"sort\"\n\n// 解法一 双指针\nfunc fourSum(nums []int, target int) (quadruplets [][]int) {\n\tsort.Ints(nums"
},
{
"path": "leetcode/0018.4Sum/18. 4Sum_test.go",
"chars": 1081,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question18 struct {\n\tpara18\n\tans18\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0018.4Sum/README.md",
"chars": 903,
"preview": "# [18. 4Sum](https://leetcode.com/problems/4sum/)\n\n## 题目\n\nGiven an array nums of n integers and an integer target, are t"
},
{
"path": "leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go",
"chars": 1102,
"preview": "package leetcode\n\nimport (\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\n// ListNode define\ntype ListNode = structure"
},
{
"path": "leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go",
"chars": 1237,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\ntype question19 struct {\n"
},
{
"path": "leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md",
"chars": 869,
"preview": "# [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n\n## 题目\n\nGiven "
},
{
"path": "leetcode/0020.Valid-Parentheses/20. Valid Parentheses.go",
"chars": 525,
"preview": "package leetcode\n\nfunc isValid(s string) bool {\n\t// 空字符串直接返回 true\n\tif len(s) == 0 {\n\t\treturn true\n\t}\n\tstack := make([]ru"
},
{
"path": "leetcode/0020.Valid-Parentheses/20. Valid Parentheses_test.go",
"chars": 851,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question20 struct {\n\tpara20\n\tans20\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0020.Valid-Parentheses/README.md",
"chars": 773,
"preview": "# [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/description/)\n\n## 题目\n\nGiven a string containin"
},
{
"path": "leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go",
"chars": 494,
"preview": "package leetcode\n\nimport (\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\n// ListNode define\ntype ListNode = structure"
},
{
"path": "leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go",
"chars": 1357,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\ntype question21 struct {\n"
},
{
"path": "leetcode/0021.Merge-Two-Sorted-Lists/README.md",
"chars": 345,
"preview": "# [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)\n\n## 题目\n\nMerge two sorted linked li"
},
{
"path": "leetcode/0022.Generate-Parentheses/22. Generate Parentheses.go",
"chars": 499,
"preview": "package leetcode\n\nfunc generateParenthesis(n int) []string {\n\tif n == 0 {\n\t\treturn []string{}\n\t}\n\tres := []string{}\n\tfin"
},
{
"path": "leetcode/0022.Generate-Parentheses/22. Generate Parentheses_test.go",
"chars": 661,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question22 struct {\n\tpara22\n\tans22\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0022.Generate-Parentheses/README.md",
"chars": 535,
"preview": "# [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)\n\n\n## 题目\n\nGiven n pairs of parentheses,"
},
{
"path": "leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go",
"chars": 766,
"preview": "package leetcode\n\nimport (\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\n// ListNode define\ntype ListNode = structure"
},
{
"path": "leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go",
"chars": 1453,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\ntype question23 struct {\n"
},
{
"path": "leetcode/0023.Merge-k-Sorted-Lists/README.md",
"chars": 353,
"preview": "# [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)\n\n## 题目\n\nMerge k sorted linked lists an"
},
{
"path": "leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go",
"chars": 517,
"preview": "package leetcode\n\nimport (\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\n// ListNode define\ntype ListNode = structure"
},
{
"path": "leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go",
"chars": 866,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\ntype question24 struct {\n"
},
{
"path": "leetcode/0024.Swap-Nodes-in-Pairs/README.md",
"chars": 381,
"preview": "# [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/)\n\n## 题目\n\nGiven a linked list,"
},
{
"path": "leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go",
"chars": 667,
"preview": "package leetcode\n\nimport (\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\n// ListNode define\ntype ListNode = structure"
},
{
"path": "leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go",
"chars": 803,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n\n\t\"github.com/halfrost/LeetCode-Go/structures\"\n)\n\ntype question25 struct {\n"
},
{
"path": "leetcode/0025.Reverse-Nodes-in-k-Group/README.md",
"chars": 841,
"preview": "# [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/description/)\n\n## 题目\n\nGiven a li"
},
{
"path": "leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go",
"chars": 942,
"preview": "package leetcode\n\n// 解法一\nfunc removeDuplicates(nums []int) int {\n\tif len(nums) == 0 {\n\t\treturn 0\n\t}\n\tlast, finder := 0, "
},
{
"path": "leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go",
"chars": 735,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question26 struct {\n\tpara26\n\tans26\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0026.Remove-Duplicates-from-Sorted-Array/README.md",
"chars": 1658,
"preview": "# [26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)\n\n## 题目\n\n"
},
{
"path": "leetcode/0027.Remove-Element/27. Remove Element.go",
"chars": 249,
"preview": "package leetcode\n\nfunc removeElement(nums []int, val int) int {\n\tif len(nums) == 0 {\n\t\treturn 0\n\t}\n\tj := 0\n\tfor i := 0; "
},
{
"path": "leetcode/0027.Remove-Element/27. Remove Element_test.go",
"chars": 892,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question27 struct {\n\tpara27\n\tans27\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0027.Remove-Element/README.md",
"chars": 1713,
"preview": "# [27. Remove Element](https://leetcode.com/problems/remove-element/)\n\n## 题目\n\nGiven an array nums and a value val, remov"
},
{
"path": "leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String.go",
"chars": 387,
"preview": "package leetcode\n\nimport \"strings\"\n\n// 解法一\nfunc strStr(haystack string, needle string) int {\n\tfor i := 0; ; i++ {\n\t\tfor "
},
{
"path": "leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String_test.go",
"chars": 815,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question28 struct {\n\tpara28\n\tans28\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/README.md",
"chars": 816,
"preview": "# [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occ"
},
{
"path": "leetcode/0029.Divide-Two-Integers/29. Divide Two Integers.go",
"chars": 2383,
"preview": "package leetcode\n\nimport (\n\t\"math\"\n)\n\n// 解法一 递归版的二分搜索\nfunc divide(dividend int, divisor int) int {\n\tsign, res := -1, 0\n\t"
},
{
"path": "leetcode/0029.Divide-Two-Integers/29. Divide Two Integers_test.go",
"chars": 757,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question29 struct {\n\tpara29\n\tans29\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0029.Divide-Two-Integers/README.md",
"chars": 1471,
"preview": "# [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)\n\n\n## 题目\n\nGiven two integers `dividend` a"
},
{
"path": "leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go",
"chars": 1219,
"preview": "package leetcode\n\nfunc findSubstring(s string, words []string) []int {\n\tif len(words) == 0 {\n\t\treturn []int{}\n\t}\n\tres :="
},
{
"path": "leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go",
"chars": 1448,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question30 struct {\n\tpara30\n\tans30\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0030.Substring-with-Concatenation-of-All-Words/README.md",
"chars": 1081,
"preview": "# [30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-word"
},
{
"path": "leetcode/0031.Next-Permutation/31. Next Permutation.go",
"chars": 1458,
"preview": "package leetcode\n\n// 解法一\nfunc nextPermutation(nums []int) {\n\ti, j := 0, 0\n\tfor i = len(nums) - 2; i >= 0; i-- {\n\t\tif num"
},
{
"path": "leetcode/0031.Next-Permutation/31. Next Permutation_test.go",
"chars": 781,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question31 struct {\n\tpara31\n\tans31\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0031.Next-Permutation/README.md",
"chars": 2063,
"preview": "# [31. Next Permutation](https://leetcode.com/problems/next-permutation/)\n\n\n## 题目\n\nImplement **next permutation**, which"
},
{
"path": "leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses.go",
"chars": 984,
"preview": "package leetcode\n\n// 解法一 栈\nfunc longestValidParentheses(s string) int {\n\tstack, res := []int{}, 0\n\tstack = append(stack,"
},
{
"path": "leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses_test.go",
"chars": 731,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question32 struct {\n\tpara32\n\tans32\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0032.Longest-Valid-Parentheses/README.md",
"chars": 2871,
"preview": "# [32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)\n\n\n## 题目\n\nGiven a string cont"
},
{
"path": "leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go",
"chars": 653,
"preview": "package leetcode\n\nfunc search33(nums []int, target int) int {\n\tif len(nums) == 0 {\n\t\treturn -1\n\t}\n\tlow, high := 0, len(n"
},
{
"path": "leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go",
"chars": 709,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question33 struct {\n\tpara33\n\tans33\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0033.Search-in-Rotated-Sorted-Array/README.md",
"chars": 1325,
"preview": "# [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n\n## 题目\n\nSuppose an"
},
{
"path": "leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go",
"chars": 1741,
"preview": "package leetcode\n\nfunc searchRange(nums []int, target int) []int {\n\treturn []int{searchFirstEqualElement(nums, target), "
},
{
"path": "leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go",
"chars": 683,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question34 struct {\n\tpara34\n\tans34\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md",
"chars": 1054,
"preview": "# [34. Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-positi"
},
{
"path": "leetcode/0035.Search-Insert-Position/35. Search Insert Position.go",
"chars": 315,
"preview": "package leetcode\n\nfunc searchInsert(nums []int, target int) int {\n\tlow, high := 0, len(nums)-1\n\tfor low <= high {\n\t\tmid "
},
{
"path": "leetcode/0035.Search-Insert-Position/35. Search Insert Position_test.go",
"chars": 759,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question35 struct {\n\tpara35\n\tans35\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0035.Search-Insert-Position/README.md",
"chars": 701,
"preview": "# [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/)\n\n\n## 题目\n\nGiven a sorted array and "
},
{
"path": "leetcode/0036.Valid-Sudoku/36. Valid Sudoku.go",
"chars": 1783,
"preview": "package leetcode\n\nimport \"strconv\"\n\n// 解法一 暴力遍历，时间复杂度 O(n^3)\nfunc isValidSudoku(board [][]byte) bool {\n\t// 判断行 row\n\tfor "
},
{
"path": "leetcode/0036.Valid-Sudoku/36. Valid Sudoku_test.go",
"chars": 2031,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question36 struct {\n\tpara36\n\tans36\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0036.Valid-Sudoku/README.md",
"chars": 2372,
"preview": "# [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)\n\n\n## 题目\n\nDetermine if a 9x9 Sudoku board is valid. Onl"
},
{
"path": "leetcode/0037.Sudoku-Solver/37. Sudoku Solver.go",
"chars": 1346,
"preview": "package leetcode\n\ntype position struct {\n\tx int\n\ty int\n}\n\nfunc solveSudoku(board [][]byte) {\n\tpos, find := []position{},"
},
{
"path": "leetcode/0037.Sudoku-Solver/37. Sudoku Solver_test.go",
"chars": 1503,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question37 struct {\n\tpara37\n\tans37\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0037.Sudoku-Solver/README.md",
"chars": 1325,
"preview": "# [37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)\n\n\n\n## 题目\n\nWrite a program to solve a Sudoku puzzle b"
},
{
"path": "leetcode/0039.Combination-Sum/39. Combination Sum.go",
"chars": 689,
"preview": "package leetcode\n\nimport \"sort\"\n\nfunc combinationSum(candidates []int, target int) [][]int {\n\tif len(candidates) == 0 {\n"
},
{
"path": "leetcode/0039.Combination-Sum/39. Combination Sum_test.go",
"chars": 693,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question39 struct {\n\tpara39\n\tans39\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0039.Combination-Sum/README.md",
"chars": 955,
"preview": "# [39. Combination Sum](https://leetcode.com/problems/combination-sum/)\n\n\n## 题目\n\nGiven a **set** of candidate numbers (`"
},
{
"path": "leetcode/0040.Combination-Sum-II/40. Combination Sum II.go",
"chars": 728,
"preview": "package leetcode\n\nimport (\n\t\"sort\"\n)\n\nfunc combinationSum2(candidates []int, target int) [][]int {\n\tif len(candidates) ="
},
{
"path": "leetcode/0040.Combination-Sum-II/40. Combination Sum II_test.go",
"chars": 715,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question40 struct {\n\tpara40\n\tans40\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0040.Combination-Sum-II/README.md",
"chars": 1030,
"preview": "# [40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)\n\n\n## 题目\n\nGiven a collection of candidate n"
},
{
"path": "leetcode/0041.First-Missing-Positive/41. First Missing Positive.go",
"chars": 277,
"preview": "package leetcode\n\nfunc firstMissingPositive(nums []int) int {\n\tnumMap := make(map[int]int, len(nums))\n\tfor _, v := range"
},
{
"path": "leetcode/0041.First-Missing-Positive/41. First Missing Positive_test.go",
"chars": 942,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question41 struct {\n\tpara41\n\tans41\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0041.First-Missing-Positive/README.md",
"chars": 545,
"preview": "# [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/)\n\n## 题目\n\nGiven an unsor"
},
{
"path": "leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water.go",
"chars": 450,
"preview": "package leetcode\n\nfunc trap(height []int) int {\n\tres, left, right, maxLeft, maxRight := 0, 0, len(height)-1, 0, 0\n\tfor l"
},
{
"path": "leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go",
"chars": 578,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question42 struct {\n\tpara42\n\tans42\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0042.Trapping-Rain-Water/README.md",
"chars": 1496,
"preview": "# [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)\n\n## 题目\n\nGiven n non-negative integers re"
},
{
"path": "leetcode/0043.Multiply-Strings/43. Multiply Strings.go",
"chars": 559,
"preview": "package leetcode\n\nfunc multiply(num1 string, num2 string) string {\n\tif num1 == \"0\" || num2 == \"0\" {\n\t\treturn \"0\"\n\t}\n\tb1,"
},
{
"path": "leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go",
"chars": 632,
"preview": "package leetcode\n\nimport (\n\t\"fmt\"\n\t\"testing\"\n)\n\ntype question43 struct {\n\tpara43\n\tans43\n}\n\n// para 是参数\n// one 代表第一个参数\nty"
},
{
"path": "leetcode/0043.Multiply-Strings/README.md",
"chars": 1539,
"preview": "# [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/)\n\n\n## 题目\n\nGiven two non-negative integers `num1"
}
]
// ... and 3279 more files (download for full content)
About this extraction
This page contains the full source code of the halfrost/LeetCode-Go GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 3479 files (5.8 MB), approximately 1.7M tokens, and a symbol index with 5343 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.