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