From 4e11f4028ab6add9bfbb64d541dd5d961c3a7ed5 Mon Sep 17 00:00:00 2001 From: YDZ Date: Fri, 7 Aug 2020 15:50:06 +0800 Subject: [PATCH] =?UTF-8?q?=E8=A7=84=E8=8C=83=E6=A0=BC=E5=BC=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 1813 ++++++++--------- gotest.sh | 2 +- .../0001.Two-Sum/1. Two Sum.go | 0 .../0001.Two-Sum/1. Two Sum_test.go | 0 .../0001.Two-Sum/README.md | 0 .../2. Add Two Numbers.go | 0 .../2. Add Two Numbers_test.go | 0 .../0002.Add-Two-Numbers/README.md | 0 ... Substring Without Repeating Characters.go | 0 ...tring Without Repeating Characters_test.go | 0 .../README.md | 0 .../4. Median of Two Sorted Arrays.go | 0 .../4. Median of Two Sorted Arrays_test.go | 0 .../README.md | 0 .../7. Reverse Integer.go | 0 .../7. Reverse Integer_test.go | 0 .../0007.Reverse-Integer/README.md | 0 .../11. Container With Most Water.go | 0 .../11. Container With Most Water_test.go | 0 .../0011.Container-With-Most-Water/README.md | 0 .../0015.3Sum/15. 3Sum.go | 0 .../0015.3Sum/15. 3Sum_test.go | 0 {Algorithms => leetcode}/0015.3Sum/README.md | 0 .../0016.3Sum-Closest/16. 3Sum Closest.go | 0 .../16. 3Sum Closest_test.go | 0 .../0016.3Sum-Closest/README.md | 0 .... Letter Combinations of a Phone Number.go | 0 ...ter Combinations of a Phone Number_test.go | 0 .../README.md | 0 .../0018.4Sum/18. 4Sum.go | 0 .../0018.4Sum/18. 4Sum_test.go | 0 {Algorithms => leetcode}/0018.4Sum/README.md | 0 .../19. Remove Nth Node From End of List.go | 0 .... Remove Nth Node From End of List_test.go | 0 .../README.md | 0 .../20. Valid Parentheses.go | 0 .../20. Valid Parentheses_test.go | 0 .../0020.Valid-Parentheses/README.md | 0 .../21. Merge Two Sorted Lists.go | 0 .../21. Merge Two Sorted Lists_test.go | 0 .../0021.Merge-Two-Sorted-Lists/README.md | 0 .../22. Generate Parentheses.go | 0 .../22. Generate Parentheses_test.go | 0 .../0022.Generate-Parentheses/README.md | 0 .../23. Merge k Sorted Lists.go | 0 .../23. Merge k Sorted Lists_test.go | 0 .../0023.Merge-k-Sorted-Lists/README.md | 0 .../24. Swap Nodes in Pairs.go | 0 .../24. Swap Nodes in Pairs_test.go | 0 .../0024.Swap-Nodes-in-Pairs/README.md | 0 .../25. Reverse Nodes in k Group.go | 0 .../25. Reverse Nodes in k Group_test.go | 0 .../0025.Reverse-Nodes-in-k-Group/README.md | 0 ...26. Remove Duplicates from Sorted Array.go | 0 ...emove Duplicates from Sorted Array_test.go | 0 .../README.md | 0 .../0027.Remove-Element/27. Remove Element.go | 0 .../27. Remove Element_test.go | 0 .../0027.Remove-Element/README.md | 0 .../28. Implement strStr().go | 0 .../28. Implement strStr()_test.go | 0 .../0028.Implement-strStr/README.md | 0 .../29. Divide Two Integers.go | 0 .../29. Divide Two Integers_test.go | 0 .../0029.Divide-Two-Integers/README.md | 0 ...bstring with Concatenation of All Words.go | 0 ...ng with Concatenation of All Words_test.go | 0 .../README.md | 0 .../33. Search in Rotated Sorted Array.go | 0 ...33. Search in Rotated Sorted Array_test.go | 0 .../README.md | 0 ...ast Position of Element in Sorted Array.go | 0 ...osition of Element in Sorted Array_test.go | 0 .../README.md | 0 .../35. Search Insert Position.go | 0 .../35. Search Insert Position_test.go | 0 .../0035.Search-Insert-Position/README.md | 0 .../0036.Valid-Sudoku/36. Valid Sudoku.go | 0 .../36. Valid Sudoku_test.go | 0 .../0036.Valid-Sudoku/README.md | 0 .../0037.Sudoku-Solver/37. Sudoku Solver.go | 0 .../37. Sudoku Solver_test.go | 0 .../0037.Sudoku-Solver/README.md | 0 .../39. Combination Sum.go | 0 .../39. Combination Sum_test.go | 0 .../0039.Combination-Sum/README.md | 0 .../40. Combination Sum II.go | 0 .../40. Combination Sum II_test.go | 0 .../0040.Combination-Sum-II/README.md | 0 .../41. First Missing Positive.go | 0 .../41. First Missing Positive_test.go | 0 .../0041.First-Missing-Positive/README.md | 0 .../42. Trapping Rain Water.go | 0 .../42. Trapping Rain Water_test.go | 0 .../0042.Trapping-Rain-Water/README.md | 0 .../0046.Permutations/46. Permutations.go | 0 .../46. Permutations_test.go | 0 .../0046.Permutations/README.md | 0 .../47. Permutations II.go | 0 .../47. Permutations II_test.go | 0 .../0047.Permutations-II/README.md | 0 .../0048.Rotate-Image/48. Rotate Image.go | 0 .../48. Rotate Image_test.go | 0 .../0048.Rotate-Image/README.md | 0 .../0049.Group-Anagrams/49. Group Anagrams.go | 0 .../49. Group Anagrams_test.go | 0 .../0049.Group-Anagrams/README.md | 0 .../0050.Powx-n/50. Pow(x, n).go | 0 .../0050.Powx-n/50. Pow(x, n)_test.go | 0 .../0050.Powx-n/README.md | 0 .../0051.N-Queens/51. N-Queens.go | 0 .../0051.N-Queens/51. N-Queens_test.go | 0 .../0051.N-Queens/README.md | 0 .../0052.N-Queens-II/52. N-Queens II.go | 0 .../0052.N-Queens-II/52. N-Queens II_test.go | 0 .../0052.N-Queens-II/README.md | 0 .../53. Maximum Subarray.go | 0 .../53. Maximum Subarray_test.go | 0 .../0053.Maximum-Subarray/README.md | 0 .../0054.Spiral-Matrix/54. Spiral Matrix.go | 0 .../54. Spiral Matrix_test.go | 0 .../0054.Spiral-Matrix/README.md | 0 .../0055.Jump-Game/55. Jump Game.go | 0 .../0055.Jump-Game/55. Jump Game_test.go | 0 .../0055.Jump-Game/README.md | 0 .../56. Merge Intervals.go | 0 .../56. Merge Intervals_test.go | 0 .../0056.Merge-Intervals/README.md | 0 .../57. Insert Interval.go | 0 .../57. Insert Interval_test.go | 0 .../0057.Insert-Interval/README.md | 0 .../59. Spiral Matrix II.go | 0 .../59. Spiral Matrix II_test.go | 0 .../0059.Spiral-Matrix-II/README.md | 0 .../60. Permutation Sequence.go | 0 .../60. Permutation Sequence_test.go | 0 .../0060.Permutation-Sequence/README.md | 0 .../0061.Rotate-List/61. Rotate List.go | 0 .../0061.Rotate-List/61. Rotate List_test.go | 0 .../0061.Rotate-List/README.md | 0 .../0062.Unique-Paths/62. Unique Paths.go | 0 .../62. Unique Paths_test.go | 0 .../0062.Unique-Paths/README.md | 0 .../63. Unique Paths II.go | 0 .../63. Unique Paths II_test.go | 0 .../0063.Unique-Paths-II/README.md | 0 .../64. Minimum Path Sum.go | 0 .../64. Minimum Path Sum_test.go | 0 .../0064.Minimum-Path-Sum/README.md | 0 .../0066.Plus-One/66. Plus One.go | 0 .../0066.Plus-One/66. Plus One_test.go | 0 .../0066.Plus-One/README.md | 0 .../0069.Sqrtx/69. Sqrt(x).go | 0 .../0069.Sqrtx/69. Sqrt(x)_test.go | 0 {Algorithms => leetcode}/0069.Sqrtx/README.md | 0 .../70. Climbing Stairs.go | 0 .../70. Climbing Stairs_test.go | 0 .../0070.Climbing-Stairs/README.md | 0 .../0071.Simplify-Path/71. Simplify Path.go | 0 .../71. Simplify Path_test.go | 0 .../0071.Simplify-Path/README.md | 0 .../74. Search a 2D Matrix.go | 0 .../74. Search a 2D Matrix_test.go | 0 .../0074.Search-a-2D-Matrix/README.md | 0 .../0075.Sort-Colors/75. Sort Colors.go | 0 .../0075.Sort-Colors/75. Sort Colors_test.go | 0 .../0075.Sort-Colors/README.md | 0 .../76. Minimum Window Substring.go | 0 .../76. Minimum Window Substring_test.go | 0 .../0076.Minimum-Window-Substring/README.md | 0 .../0077.Combinations/77. Combinations.go | 0 .../77. Combinations_test.go | 0 .../0077.Combinations/README.md | 0 .../0078.Subsets/78. Subsets.go | 0 .../0078.Subsets/78. Subsets_test.go | 0 .../0078.Subsets/README.md | 0 .../0079.Word-Search/79. Word Search.go | 0 .../0079.Word-Search/79. Word Search_test.go | 0 .../0079.Word-Search/README.md | 0 ... Remove Duplicates from Sorted Array II.go | 0 ...ve Duplicates from Sorted Array II_test.go | 0 .../README.md | 0 .../81. Search in Rotated Sorted Array II.go | 0 ... Search in Rotated Sorted Array II_test.go | 0 .../README.md | 0 .... Remove Duplicates from Sorted List II.go | 0 ...ove Duplicates from Sorted List II_test.go | 0 .../README.md | 0 .../83. Remove Duplicates from Sorted List.go | 0 ...Remove Duplicates from Sorted List_test.go | 0 .../README.md | 0 .../84. Largest Rectangle in Histogram.go | 0 ...84. Largest Rectangle in Histogram_test.go | 0 .../README.md | 0 .../0086.Partition-List/86. Partition List.go | 0 .../86. Partition List_test.go | 0 .../0086.Partition-List/README.md | 0 .../88. Merge Sorted Array.go | 0 .../88. Merge Sorted Array_test.go | 0 .../0088.Merge-Sorted-Array/README.md | 0 .../0089.Gray-Code/89. Gray Code.go | 0 .../0089.Gray-Code/89. Gray Code_test.go | 0 .../0089.Gray-Code/README.md | 0 .../0090.Subsets-II/90. Subsets II.go | 0 .../0090.Subsets-II/90. Subsets II_test.go | 0 .../0090.Subsets-II/README.md | 0 .../0091.Decode-Ways/91. Decode Ways.go | 0 .../0091.Decode-Ways/91. Decode Ways_test.go | 0 .../0091.Decode-Ways/README.md | 0 .../92. Reverse Linked List II.go | 0 .../92. Reverse Linked List II_test.go | 0 .../0092.Reverse-Linked-List-II/README.md | 0 .../93. Restore IP Addresses.go | 0 .../93. Restore IP Addresses_test.go | 0 .../0093.Restore-IP-Addresses/README.md | 0 .../94. Binary Tree Inorder Traversal.go | 0 .../94. Binary Tree Inorder Traversal_test.go | 0 .../README.md | 0 .../95. Unique Binary Search Trees II.go | 0 .../95. Unique Binary Search Trees II_test.go | 0 .../README.md | 0 .../96. Unique Binary Search Trees.go | 0 .../96. Unique Binary Search Trees_test.go | 0 .../0096.Unique-Binary-Search-Trees/README.md | 0 .../98. Validate Binary Search Tree.go | 0 .../98. Validate Binary Search Tree_test.go | 0 .../README.md | 0 .../99. Recover Binary Search Tree.go | 0 .../99. Recover Binary Search Tree_test.go | 0 .../0099.Recover-Binary-Search-Tree/README.md | 0 .../0100.Same-Tree/100. Same Tree.go | 0 .../0100.Same-Tree/100. Same Tree_test.go | 0 .../0100.Same-Tree/README.md | 0 .../101. Symmetric Tree.go | 0 .../101. Symmetric Tree_test.go | 0 .../0101.Symmetric-Tree/README.md | 0 .../102. Binary Tree Level Order Traversal.go | 0 ... Binary Tree Level Order Traversal_test.go | 0 .../README.md | 0 ...inary Tree Zigzag Level Order Traversal.go | 0 ... Tree Zigzag Level Order Traversal_test.go | 0 .../README.md | 0 .../104. Maximum Depth of Binary Tree.go | 0 .../104. Maximum Depth of Binary Tree_test.go | 0 .../README.md | 0 ...ree from Preorder and Inorder Traversal.go | 0 ...rom Preorder and Inorder Traversal_test.go | 0 .../README.md | 0 ...ee from Inorder and Postorder Traversal.go | 0 ...om Inorder and Postorder Traversal_test.go | 0 .../README.md | 0 ...7. Binary Tree Level Order Traversal II.go | 0 ...nary Tree Level Order Traversal II_test.go | 0 .../README.md | 0 ...vert Sorted Array to Binary Search Tree.go | 0 ...Sorted Array to Binary Search Tree_test.go | 0 .../README.md | 0 ...nvert Sorted List to Binary Search Tree.go | 0 ... Sorted List to Binary Search Tree_test.go | 0 .../README.md | 0 .../110. Balanced Binary Tree.go | 0 .../110. Balanced Binary Tree_test.go | 0 .../0110.Balanced-Binary-Tree/README.md | 0 .../111. Minimum Depth of Binary Tree.go | 0 .../111. Minimum Depth of Binary Tree_test.go | 0 .../README.md | 0 .../0112.Path-Sum/112. Path Sum.go | 0 .../0112.Path-Sum/112. Path Sum_test.go | 0 .../0112.Path-Sum/README.md | 0 .../0113.Path-Sum-II/113. Path Sum II.go | 0 .../0113.Path-Sum-II/113. Path Sum II_test.go | 0 .../0113.Path-Sum-II/README.md | 0 ...114. Flatten Binary Tree to Linked List.go | 0 ...Flatten Binary Tree to Linked List_test.go | 0 .../README.md | 0 .../0120.Triangle/120. Triangle.go | 0 .../0120.Triangle/120. Triangle_test.go | 0 .../0120.Triangle/README.md | 0 .../121. Best Time to Buy and Sell Stock.go | 0 ...1. Best Time to Buy and Sell Stock_test.go | 0 .../README.md | 0 ...122. Best Time to Buy and Sell Stock II.go | 0 ...Best Time to Buy and Sell Stock II_test.go | 0 .../README.md | 0 .../124. Binary Tree Maximum Path Sum.go | 0 .../124. Binary Tree Maximum Path Sum_test.go | 0 .../README.md | 0 .../125. Valid Palindrome.go | 0 .../125. Valid Palindrome_test.go | 0 .../0125.Valid-Palindrome/README.md | 0 .../126. Word Ladder II.go | 0 .../126. Word Ladder II_test.go | 0 .../0126.Word-Ladder-II/README.md | 0 .../0127.Word-Ladder/127. Word Ladder.go | 0 .../0127.Word-Ladder/127. Word Ladder_test.go | 0 .../0127.Word-Ladder/README.md | 0 .../128. Longest Consecutive Sequence.go | 0 .../128. Longest Consecutive Sequence_test.go | 0 .../README.md | 0 .../129. Sum Root to Leaf Numbers.go | 0 .../129. Sum Root to Leaf Numbers_test.go | 0 .../0129.Sum-Root-to-Leaf-Numbers/README.md | 0 .../130. Surrounded Regions.go | 0 .../130. Surrounded Regions_test.go | 0 .../0130.Surrounded-Regions/README.md | 0 .../131. Palindrome Partitioning.go | 0 .../131. Palindrome Partitioning_test.go | 0 .../0131.Palindrome-Partitioning/README.md | 0 .../0136.Single-Number/136. Single Number.go | 0 .../136. Single Number_test.go | 0 .../0136.Single-Number/README.md | 0 .../137. Single Number II.go | 0 .../137. Single Number II_test.go | 0 .../0137.Single-Number-II/README.md | 0 .../141. Linked List Cycle.go | 0 .../141. Linked List Cycle_test.go | 0 .../0141.Linked-List-Cycle/README.md | 0 .../142. Linked List Cycle II.go | 0 .../142. Linked List Cycle II_test.go | 0 .../0142.Linked-List-Cycle-II/README.md | 0 .../0143.Reorder-List/143. Reorder List.go | 0 .../143. Reorder List_test.go | 0 .../0143.Reorder-List/README.md | 2 +- .../144. Binary Tree Preorder Traversal.go | 0 ...44. Binary Tree Preorder Traversal_test.go | 0 .../README.md | 0 .../145. Binary Tree Postorder Traversal.go | 0 ...5. Binary Tree Postorder Traversal_test.go | 0 .../README.md | 0 .../147. Insertion Sort List.go | 0 .../147. Insertion Sort List_test.go | 0 .../0147.Insertion-Sort-List/README.md | 0 .../0148.Sort-List/148. Sort List.go | 0 .../0148.Sort-List/148. Sort List_test.go | 0 .../0148.Sort-List/README.md | 0 .../150. Evaluate Reverse Polish Notation.go | 0 .... Evaluate Reverse Polish Notation_test.go | 0 .../README.md | 0 .../151. Reverse Words in a String.go | 0 .../151. Reverse Words in a String_test.go | 0 .../0151.Reverse-Words-in-a-String/README.md | 0 .../152. Maximum Product Subarray.go | 0 .../152. Maximum Product Subarray_test.go | 0 .../0152.Maximum-Product-Subarray/README.md | 0 ...3. Find Minimum in Rotated Sorted Array.go | 0 ...nd Minimum in Rotated Sorted Array_test.go | 0 .../README.md | 0 ...Find Minimum in Rotated Sorted Array II.go | 0 ...Minimum in Rotated Sorted Array II_test.go | 0 .../README.md | 0 .../0155.Min-Stack/155. Min Stack.go | 0 .../0155.Min-Stack/155. Min Stack_test.go | 0 .../0155.Min-Stack/README.md | 0 .../160. Intersection of Two Linked Lists.go | 0 .... Intersection of Two Linked Lists_test.go | 0 .../README.md | 0 .../162. Find Peak Element.go | 0 .../162. Find Peak Element_test.go | 0 .../0162.Find-Peak-Element/README.md | 0 .../0164.Maximum-Gap/164. Maximum Gap.go | 0 .../0164.Maximum-Gap/164. Maximum Gap_test.go | 0 .../0164.Maximum-Gap/README.md | 0 ...167. Two Sum II - Input array is sorted.go | 0 ...Two Sum II - Input array is sorted_test.go | 0 .../README.md | 0 .../169. Majority Element.go | 0 .../169. Majority Element_test.go | 0 .../0169.Majority-Element/README.md | 0 .../172. Factorial Trailing Zeroes.go | 0 .../172. Factorial Trailing Zeroes_test.go | 0 .../0172.Factorial-Trailing-Zeroes/README.md | 0 .../173. Binary Search Tree Iterator.go | 0 .../173. Binary Search Tree Iterator_test.go | 0 .../README.md | 0 .../0174.Dungeon-Game/174. Dungeon Game.go | 0 .../174. Dungeon Game_test.go | 0 .../0174.Dungeon-Game/README.md | 0 .../179. Largest Number.go | 0 .../179. Largest Number_test.go | 0 .../0179.Largest-Number/README.md | 0 .../187. Repeated DNA Sequences.go | 0 .../187. Repeated DNA Sequences_test.go | 0 .../0187.Repeated-DNA-Sequences/README.md | 0 .../0190.Reverse-Bits/190. Reverse Bits.go | 0 .../190. Reverse Bits_test.go | 0 .../0190.Reverse-Bits/README.md | 0 .../191. Number of 1 Bits.go | 0 .../191. Number of 1 Bits_test.go | 0 .../0191.Number-of-1-Bits/README.md | 0 .../0198.House-Robber/198. House Robber.go | 0 .../198. House Robber_test.go | 0 .../0198.House-Robber/README.md | 0 .../199. Binary Tree Right Side View.go | 0 .../199. Binary Tree Right Side View_test.go | 0 .../README.md | 0 .../200. Number of Islands.go | 0 .../200. Number of Islands_test.go | 0 .../0200.Number-of-Islands/README.md | 0 .../201. Bitwise AND of Numbers Range.go | 0 .../201. Bitwise AND of Numbers Range_test.go | 0 .../README.md | 0 .../0202.Happy-Number/202. Happy Number.go | 0 .../202. Happy Number_test.go | 0 .../0202.Happy-Number/README.md | 0 .../203. Remove Linked List Elements.go | 0 .../203. Remove Linked List Elements_test.go | 0 .../README.md | 0 .../0204.Count-Primes/204. Count Primes.go | 0 .../204. Count Primes_test.go | 0 .../0204.Count-Primes/README.md | 0 .../205. Isomorphic Strings.go | 0 .../205. Isomorphic Strings_test.go | 0 .../0205.Isomorphic-Strings/README.md | 0 .../206. Reverse Linked List.go | 0 .../206. Reverse Linked List_test.go | 0 .../0206.Reverse-Linked-List/README.md | 0 .../207. Course Schedule.go | 0 .../207. Course Schedule_test.go | 0 .../0207.Course-Schedule/README.md | 0 .../208. Implement Trie (Prefix Tree).go | 0 .../208. Implement Trie (Prefix Tree)_test.go | 0 .../0208.Implement-Trie-Prefix-Tree/README.md | 0 .../209. Minimum Size Subarray Sum.go | 0 .../209. Minimum Size Subarray Sum_test.go | 0 .../0209.Minimum-Size-Subarray-Sum/README.md | 0 .../210. Course Schedule II.go | 0 .../210. Course Schedule II_test.go | 0 .../0210.Course-Schedule-II/README.md | 0 ...and Search Word - Data structure design.go | 0 ...earch Word - Data structure design_test.go | 0 .../README.md | 0 .../212. Word Search II.go | 0 .../212. Word Search II_test.go | 0 .../0212.Word-Search-II/README.md | 0 .../213. House Robber II.go | 0 .../213. House Robber II_test.go | 0 .../0213.House-Robber-II/README.md | 0 .../215. Kth Largest Element in an Array.go | 0 ...5. Kth Largest Element in an Array_test.go | 0 .../README.md | 0 .../216. Combination Sum III.go | 0 .../216. Combination Sum III_test.go | 0 .../0216.Combination-Sum-III/README.md | 0 .../217. Contains Duplicate.go | 0 .../217. Contains Duplicate_test.go | 0 .../0217.Contains-Duplicate/README.md | 0 .../218. The Skyline Problem.go | 0 .../218. The Skyline Problem_test.go | 0 .../0218.The-Skyline-Problem/README.md | 0 .../219. Contains Duplicate II.go | 0 .../219. Contains Duplicate II_test.go | 0 .../0219.Contains-Duplicate-II/README.md | 0 .../220. Contains Duplicate III.go | 0 .../220. Contains Duplicate III_test.go | 0 .../0220.Contains-Duplicate-III/README.md | 0 .../222. Count Complete Tree Nodes.go | 0 .../222. Count Complete Tree Nodes_test.go | 0 .../0222.Count-Complete-Tree-Nodes/README.md | 0 .../223. Rectangle Area.go | 0 .../223. Rectangle Area_test.go | 0 .../0223.Rectangle-Area/README.md | 0 .../224. Basic Calculator.go | 0 .../224. Basic Calculator_test.go | 0 .../0224.Basic-Calculator/README.md | 0 .../225. Implement Stack using Queues.go | 0 .../225. Implement Stack using Queues_test.go | 0 .../README.md | 0 .../226. Invert Binary Tree.go | 0 .../226. Invert Binary Tree_test.go | 0 .../0226.Invert-Binary-Tree/README.md | 0 .../229. Majority Element II.go | 0 .../229. Majority Element II_test.go | 0 .../0229.Majority-Element-II/README.md | 0 .../230. Kth Smallest Element in a BST.go | 0 ...230. Kth Smallest Element in a BST_test.go | 0 .../README.md | 0 .../0231.Power-of-Two/231. Power of Two.go | 0 .../231. Power of Two_test.go | 0 .../0231.Power-of-Two/README.md | 0 .../232. Implement Queue using Stacks.go | 0 .../232. Implement Queue using Stacks_test.go | 0 .../README.md | 0 .../234. Palindrome Linked List.go | 0 .../234. Palindrome Linked List_test.go | 0 .../0234.Palindrome-Linked-List/README.md | 0 ...Common Ancestor of a Binary Search Tree.go | 0 ...n Ancestor of a Binary Search Tree_test.go | 0 .../README.md | 0 ...Lowest Common Ancestor of a Binary Tree.go | 0 ...t Common Ancestor of a Binary Tree_test.go | 0 .../README.md | 0 .../237. Delete Node in a Linked List.go | 0 .../237. Delete Node in a Linked List_test.go | 0 .../README.md | 0 .../239. Sliding Window Maximum.go | 0 .../239. Sliding Window Maximum_test.go | 0 .../0239.Sliding-Window-Maximum/README.md | 0 .../240. Search a 2D Matrix II.go | 0 .../240. Search a 2D Matrix II_test.go | 0 .../0240.Search-a-2D-Matrix-II/README.md | 0 .../0242.Valid-Anagram/242. Valid Anagram.go | 0 .../242. Valid Anagram_test.go | 0 .../0242.Valid-Anagram/README.md | 0 .../257. Binary Tree Paths.go | 0 .../257. Binary Tree Paths_test.go | 0 .../0257.Binary-Tree-Paths/README.md | 0 .../260. Single Number III.go | 0 .../260. Single Number III_test.go | 0 .../0260.Single-Number-III/README.md | 0 .../0263.Ugly-Number/263. Ugly Number.go | 0 .../0263.Ugly-Number/263. Ugly Number_test.go | 0 .../0263.Ugly-Number/README.md | 0 .../268. Missing Number.go | 0 .../268. Missing Number_test.go | 0 .../0268.Missing-Number/README.md | 0 .../0274.H-Index/274. H-Index.go | 0 .../0274.H-Index/274. H-Index_test.go | 0 .../0274.H-Index/README.md | 0 .../0275.H-Index-II/275. H-Index II.go | 0 .../0275.H-Index-II/275. H-Index II_test.go | 0 .../0275.H-Index-II/README.md | 0 .../0283.Move-Zeroes/283. Move Zeroes.go | 0 .../0283.Move-Zeroes/283. Move Zeroes_test.go | 0 .../0283.Move-Zeroes/README.md | 0 .../287. Find the Duplicate Number.go | 0 .../287. Find the Duplicate Number_test.go | 0 .../0287.Find-the-Duplicate-Number/README.md | 0 .../0290.Word-Pattern/290. Word Pattern.go | 0 .../290. Word Pattern_test.go | 0 .../0290.Word-Pattern/README.md | 0 .../300. Longest Increasing Subsequence.go | 0 ...00. Longest Increasing Subsequence_test.go | 0 .../README.md | 0 .../303. Range Sum Query - Immutable.go | 0 .../303. Range Sum Query - Immutable_test.go | 0 .../README.md | 0 .../306. Additive Number.go | 0 .../306. Additive Number_test.go | 0 .../0306.Additive-Number/README.md | 0 .../307. Range Sum Query - Mutable.go | 0 .../307. Range Sum Query - Mutable_test.go | 0 .../0307.Range-Sum-Query---Mutable/README.md | 0 ...ime to Buy and Sell Stock with Cooldown.go | 0 ...o Buy and Sell Stock with Cooldown_test.go | 0 .../README.md | 0 ...15. Count of Smaller Numbers After Self.go | 0 ...ount of Smaller Numbers After Self_test.go | 0 .../README.md | 0 .../318. Maximum Product of Word Lengths.go | 0 ...8. Maximum Product of Word Lengths_test.go | 0 .../README.md | 0 .../0322.Coin-Change/322. Coin Change.go | 0 .../0322.Coin-Change/322. Coin Change_test.go | 0 .../0322.Coin-Change/README.md | 0 .../324. Wiggle Sort II.go | 0 .../324. Wiggle Sort II_test.go | 0 .../0324.Wiggle-Sort-II/README.md | 0 .../326. Power of Three.go | 0 .../326. Power of Three_test.go | 0 .../0326.Power-of-Three/README.md | 0 .../327. Count of Range Sum.go | 0 .../327. Count of Range Sum_test.go | 0 .../0327.Count-of-Range-Sum/README.md | 0 .../328. Odd Even Linked List.go | 0 .../328. Odd Even Linked List_test.go | 0 .../0328.Odd-Even-Linked-List/README.md | 0 ...29. Longest Increasing Path in a Matrix.go | 0 ...ongest Increasing Path in a Matrix_test.go | 0 .../README.md | 0 ...Preorder Serialization of a Binary Tree.go | 0 ...der Serialization of a Binary Tree_test.go | 0 .../README.md | 0 .../337. House Robber III.go | 0 .../337. House Robber III_test.go | 0 .../0337.House-Robber-III/README.md | 0 .../0338.Counting-Bits/338. Counting Bits.go | 0 .../338. Counting Bits_test.go | 0 .../0338.Counting-Bits/README.md | 0 .../0342.Power-of-Four/342. Power of Four.go | 0 .../342. Power of Four_test.go | 0 .../0342.Power-of-Four/README.md | 0 .../0343.Integer-Break/343. Integer Break.go | 0 .../343. Integer Break_test.go | 0 .../0343.Integer-Break/README.md | 0 .../344. Reverse String.go | 0 .../344. Reverse String_test.go | 0 .../0344.Reverse-String/README.md | 0 .../345. Reverse Vowels of a String.go | 0 .../345. Reverse Vowels of a String_test.go | 0 .../0345.Reverse-Vowels-of-a-String/README.md | 0 .../347. Top K Frequent Elements.go | 0 .../347. Top K Frequent Elements_test.go | 0 .../0347.Top-K-Frequent-Elements/README.md | 0 .../349. Intersection of Two Arrays.go | 0 .../349. Intersection of Two Arrays_test.go | 0 .../0349.Intersection-of-Two-Arrays/README.md | 0 .../350. Intersection of Two Arrays II.go | 0 ...350. Intersection of Two Arrays II_test.go | 0 .../README.md | 0 .../354. Russian Doll Envelopes.go | 0 .../354. Russian Doll Envelopes_test.go | 0 .../0354.Russian-Doll-Envelopes/README.md | 0 .../357. Count Numbers with Unique Digits.go | 0 .... Count Numbers with Unique Digits_test.go | 0 .../README.md | 0 .../367. Valid Perfect Square.go | 0 .../367. Valid Perfect Square_test.go | 0 .../0367.Valid-Perfect-Square/README.md | 0 .../371. Sum of Two Integers.go | 0 .../371. Sum of Two Integers_test.go | 0 .../0371.Sum-of-Two-Integers/README.md | 0 .../0372.Super-Pow/372. Super Pow.go | 0 .../0372.Super-Pow/372. Super Pow_test.go | 0 .../0372.Super-Pow/README.md | 0 .../373. Find K Pairs with Smallest Sums.go | 0 ...3. Find K Pairs with Smallest Sums_test.go | 0 .../README.md | 0 ...Kth Smallest Element in a Sorted Matrix.go | 0 ...mallest Element in a Sorted Matrix_test.go | 0 .../README.md | 0 .../0385.Mini-Parser/385. Mini Parser.go | 0 .../0385.Mini-Parser/385. Mini Parser_test.go | 0 .../0385.Mini-Parser/README.md | 0 .../386. Lexicographical Numbers.go | 0 .../386. Lexicographical Numbers_test.go | 0 .../0386.Lexicographical-Numbers/README.md | 0 ...387. First Unique Character in a String.go | 0 ...First Unique Character in a String_test.go | 0 .../README.md | 0 .../389. Find the Difference.go | 0 .../389. Find the Difference_test.go | 0 .../0389.Find-the-Difference/README.md | 0 .../392. Is Subsequence.go | 0 .../392. Is Subsequence_test.go | 0 .../0392.Is-Subsequence/README.md | 0 .../393. UTF-8 Validation.go | 0 .../393. UTF-8 Validation_test.go | 0 .../0393.UTF-8-Validation/README.md | 0 .../0394.Decode-String/394. Decode String.go | 0 .../394. Decode String_test.go | 0 .../0394.Decode-String/README.md | 0 .../397. Integer Replacement.go | 0 .../397. Integer Replacement_test.go | 0 .../0397.Integer-Replacement/README.md | 0 .../399. Evaluate Division.go | 0 .../399. Evaluate Division_test.go | 0 .../0399.Evaluate-Division/README.md | 0 .../0401.Binary-Watch/401. Binary Watch.go | 0 .../401. Binary Watch_test.go | 0 .../0401.Binary-Watch/README.md | 0 .../402. Remove K Digits.go | 0 .../402. Remove K Digits_test.go | 0 .../0402.Remove-K-Digits/README.md | 0 .../404. Sum of Left Leaves.go | 0 .../404. Sum of Left Leaves_test.go | 0 .../0404.Sum-of-Left-Leaves/README.md | 0 .../405. Convert a Number to Hexadecimal.go | 0 ...5. Convert a Number to Hexadecimal_test.go | 0 .../README.md | 0 .../409. Longest Palindrome.go | 0 .../409. Longest Palindrome_test.go | 0 .../0409.Longest-Palindrome/README.md | 0 .../410. Split Array Largest Sum.go | 0 .../410. Split Array Largest Sum_test.go | 0 .../0410.Split-Array-Largest-Sum/README.md | 0 .../0412.Fizz-Buzz/412. Fizz Buzz.go | 0 .../0412.Fizz-Buzz/412. Fizz Buzz_test.go | 0 .../0412.Fizz-Buzz/README.md | 0 .../414. Third Maximum Number.go | 0 .../414. Third Maximum Number_test.go | 0 .../0414.Third-Maximum-Number/README.md | 0 .../416. Partition Equal Subset Sum.go | 0 .../416. Partition Equal Subset Sum_test.go | 0 .../0416.Partition-Equal-Subset-Sum/README.md | 0 ... Maximum XOR of Two Numbers in an Array.go | 0 ...mum XOR of Two Numbers in an Array_test.go | 0 .../README.md | 0 ...Longest Repeating Character Replacement.go | 0 ...st Repeating Character Replacement_test.go | 0 .../README.md | 0 .../433. Minimum Genetic Mutation.go | 0 .../433. Minimum Genetic Mutation_test.go | 0 .../0433.Minimum-Genetic-Mutation/README.md | 0 .../435. Non-overlapping Intervals.go | 0 .../435. Non-overlapping Intervals_test.go | 0 .../0435.Non-overlapping-Intervals/README.md | 0 .../436. Find Right Interval.go | 0 .../436. Find Right Interval_test.go | 0 .../0436.Find-Right-Interval/README.md | 0 .../0437.Path-Sum-III/437. Path Sum III.go | 0 .../437. Path Sum III_test.go | 0 .../0437.Path-Sum-III/README.md | 0 .../438. Find All Anagrams in a String.go | 0 ...438. Find All Anagrams in a String_test.go | 0 .../README.md | 0 .../441. Arranging Coins.go | 0 .../441. Arranging Coins_test.go | 0 .../0441.Arranging-Coins/README.md | 0 .../445. Add Two Numbers II.go | 0 .../445. Add Two Numbers II_test.go | 0 .../0445.Add-Two-Numbers-II/README.md | 0 .../447. Number of Boomerangs.go | 0 .../447. Number of Boomerangs_test.go | 0 .../0447.Number-of-Boomerangs/README.md | 0 .../451. Sort Characters By Frequency.go | 0 .../451. Sort Characters By Frequency_test.go | 0 .../README.md | 0 .../0454.4Sum-II/454. 4Sum II.go | 0 .../0454.4Sum-II/454. 4Sum II_test.go | 0 .../0454.4Sum-II/README.md | 0 .../455. Assign Cookies.go | 0 .../455. Assign Cookies_test.go | 0 .../0455.Assign-Cookies/README.md | 0 .../0456.132-Pattern/456. 132 Pattern.go | 0 .../0456.132-Pattern/456. 132 Pattern_test.go | 0 .../0456.132-Pattern/README.md | 0 .../457. Circular Array Loop.go | 0 .../457. Circular Array Loop_test.go | 0 .../0457.Circular-Array-Loop/README.md | 0 .../461. Hamming Distance.go | 0 .../461. Hamming Distance_test.go | 0 .../0461.Hamming-Distance/README.md | 0 .../463. Island Perimeter.go | 0 .../463. Island Perimeter_test.go | 0 .../0463.Island-Perimeter/README.md | 0 .../470. Implement Rand10() Using Rand7().go | 0 .... Implement Rand10() Using Rand7()_test.go | 0 .../README.md | 0 .../474. Ones and Zeroes.go | 0 .../474. Ones and Zeroes_test.go | 0 .../0474.Ones-and-Zeroes/README.md | 0 .../0475.Heaters/475. Heaters.go | 0 .../0475.Heaters/475. Heaters_test.go | 0 .../0475.Heaters/README.md | 0 .../476. Number Complement.go | 0 .../476. Number Complement_test.go | 0 .../0476.Number-Complement/README.md | 0 .../477. Total Hamming Distance.go | 0 .../477. Total Hamming Distance_test.go | 0 .../0477.Total-Hamming-Distance/README.md | 0 .../480. Sliding Window Median.go | 0 .../480. Sliding Window Median_test.go | 0 .../0480.Sliding-Window-Median/README.md | 0 .../483. Smallest Good Base.go | 0 .../483. Smallest Good Base_test.go | 0 .../0483.Smallest-Good-Base/README.md | 0 .../491. Increasing Subsequences.go | 0 .../491. Increasing Subsequences_test.go | 0 .../0491.Increasing-Subsequences/README.md | 0 .../0493.Reverse-Pairs/493. Reverse Pairs.go | 0 .../493. Reverse Pairs_test.go | 0 .../0493.Reverse-Pairs/README.md | 0 .../0494.Target-Sum/494. Target Sum.go | 0 .../0494.Target-Sum/494. Target Sum_test.go | 0 .../0494.Target-Sum/README.md | 0 .../496. Next Greater Element I.go | 0 .../496. Next Greater Element I_test.go | 0 .../0496.Next-Greater-Element-I/README.md | 0 ...dom Point in Non-overlapping Rectangles.go | 0 ...oint in Non-overlapping Rectangles_test.go | 0 .../README.md | 0 .../498. Diagonal Traverse.go | 0 .../498. Diagonal Traverse_test.go | 0 .../0498.Diagonal-Traverse/README.md | 0 .../0500.Keyboard-Row/500. Keyboard Row.go | 0 .../500. Keyboard Row_test.go | 0 .../0500.Keyboard-Row/README.md | 0 .../503. Next Greater Element II.go | 0 .../503. Next Greater Element II_test.go | 0 .../0503.Next-Greater-Element-II/README.md | 0 .../508. Most Frequent Subtree Sum.go | 0 .../508. Most Frequent Subtree Sum_test.go | 0 .../0508.Most-Frequent-Subtree-Sum/README.md | 0 .../509. Fibonacci Number.go | 0 .../509. Fibonacci Number_test.go | 0 .../0509.Fibonacci-Number/README.md | 0 .../513. Find Bottom Left Tree Value.go | 0 .../513. Find Bottom Left Tree Value_test.go | 0 .../README.md | 0 ...15. Find Largest Value in Each Tree Row.go | 0 ...ind Largest Value in Each Tree Row_test.go | 0 .../README.md | 0 ...est Word in Dictionary through Deleting.go | 0 ...ord in Dictionary through Deleting_test.go | 0 .../README.md | 0 .../526. Beautiful Arrangement.go | 0 .../526. Beautiful Arrangement_test.go | 0 .../0526.Beautiful-Arrangement/README.md | 0 .../528. Random Pick with Weight.go | 0 .../528. Random Pick with Weight_test.go | 0 .../0528.Random-Pick-with-Weight/README.md | 0 .../0529.Minesweeper/529. Minesweeper.go | 0 .../0529.Minesweeper/529. Minesweeper_test.go | 0 .../0529.Minesweeper/README.md | 0 .../532. K-diff Pairs in an Array.go | 0 .../532. K-diff Pairs in an Array_test.go | 0 .../0532.K-diff-Pairs-in-an-Array/README.md | 0 .../541. Reverse String II.go | 0 .../541. Reverse String II_test.go | 0 .../0541.Reverse-String-II/README.md | 0 .../0542.01-Matrix/542. 01 Matrix.go | 0 .../0542.01-Matrix/542. 01 Matrix_test.go | 0 .../0542.01-Matrix/README.md | 0 .../547. Friend Circles.go | 0 .../547. Friend Circles_test.go | 0 .../0547.Friend-Circles/README.md | 0 .../557. Reverse Words in a String III.go | 0 ...557. Reverse Words in a String III_test.go | 0 .../README.md | 0 .../563. Binary Tree Tilt.go | 0 .../563. Binary Tree Tilt_test.go | 0 .../0563.Binary-Tree-Tilt/README.md | 0 .../566. Reshape the Matrix.go | 0 .../566. Reshape the Matrix_test.go | 0 .../0566.Reshape-the-Matrix/README.md | 0 .../567. Permutation in String.go | 0 .../567. Permutation in String_test.go | 0 .../0567.Permutation-in-String/README.md | 0 .../572. Subtree of Another Tree.go | 0 .../572. Subtree of Another Tree_test.go | 0 .../0572.Subtree-of-Another-Tree/README.md | 0 .../575. Distribute Candies.go | 0 .../575. Distribute Candies_test.go | 0 .../0575.Distribute-Candies/README.md | 0 .../594. Longest Harmonious Subsequence.go | 0 ...94. Longest Harmonious Subsequence_test.go | 0 .../README.md | 0 .../599. Minimum Index Sum of Two Lists.go | 0 ...99. Minimum Index Sum of Two Lists_test.go | 0 .../README.md | 0 .../628. Maximum Product of Three Numbers.go | 0 .... Maximum Product of Three Numbers_test.go | 0 .../README.md | 0 ...st Range Covering Elements from K Lists.go | 0 ...nge Covering Elements from K Lists_test.go | 0 .../README.md | 0 .../633. Sum of Square Numbers.go | 0 .../633. Sum of Square Numbers_test.go | 0 .../0633.Sum-of-Square-Numbers/README.md | 0 .../636. Exclusive Time of Functions.go | 0 .../636. Exclusive Time of Functions_test.go | 0 .../README.md | 0 .../637. Average of Levels in Binary Tree.go | 0 .... Average of Levels in Binary Tree_test.go | 0 .../README.md | 0 .../638. Shopping Offers.go | 0 .../638. Shopping Offers_test.go | 0 .../0638.Shopping-Offers/README.md | 0 .../0645.Set-Mismatch/645. Set Mismatch.go | 0 .../645. Set Mismatch_test.go | 0 .../0645.Set-Mismatch/README.md | 0 .../0648.Replace-Words/648. Replace Words.go | 0 .../648. Replace Words_test.go | 0 .../0648.Replace-Words/README.md | 0 .../653. Two Sum IV - Input is a BST.go | 0 .../653. Two Sum IV - Input is a BST_test.go | 0 .../README.md | 0 .../658. Find K Closest Elements.go | 0 .../658. Find K Closest Elements_test.go | 0 .../0658.Find-K-Closest-Elements/README.md | 0 .../662. Maximum Width of Binary Tree.go | 0 .../662. Maximum Width of Binary Tree_test.go | 0 .../README.md | 0 ...Smallest Number in Multiplication Table.go | 0 ...est Number in Multiplication Table_test.go | 0 .../README.md | 0 .../676. Implement Magic Dictionary.go | 0 .../676. Implement Magic Dictionary_test.go | 0 .../0676.Implement-Magic-Dictionary/README.md | 0 .../0682.Baseball-Game/682. Baseball Game.go | 0 .../682. Baseball Game_test.go | 0 .../0682.Baseball-Game/README.md | 0 .../684. Redundant Connection.go | 0 .../684. Redundant Connection_test.go | 0 .../0684.Redundant-Connection/README.md | 0 .../685. Redundant Connection II.go | 0 .../685. Redundant Connection II_test.go | 0 .../0685.Redundant-Connection-II/README.md | 0 ...93. Binary Number with Alternating Bits.go | 0 ...inary Number with Alternating Bits_test.go | 0 .../README.md | 0 .../695. Max Area of Island.go | 0 .../695. Max Area of Island_test.go | 0 .../0695.Max-Area-of-Island/README.md | 0 .../699. Falling Squares.go | 0 .../699. Falling Squares_test.go | 0 .../0699.Falling-Squares/README.md | 0 .../0704.Binary-Search/704. Binary Search.go | 0 .../704. Binary Search_test.go | 0 .../0704.Binary-Search/README.md | 0 .../705. Design HashSet.go | 0 .../705. Design HashSet_test.go | 0 .../0705.Design-HashSet/README.md | 0 .../706. Design HashMap.go | 0 .../706. Design HashMap_test.go | 0 .../0706.Design-HashMap/README.md | 0 .../707. Design Linked List.go | 0 .../707. Design Linked List_test.go | 0 .../0707.Design-Linked-List/README.md | 0 .../710. Random Pick with Blacklist.go | 0 .../710. Random Pick with Blacklist_test.go | 0 .../0710.Random-Pick-with-Blacklist/README.md | 0 .../713. Subarray Product Less Than K.go | 0 .../713. Subarray Product Less Than K_test.go | 0 .../README.md | 0 ...Buy and Sell Stock with Transaction Fee.go | 0 ...nd Sell Stock with Transaction Fee_test.go | 0 .../README.md | 0 .../0715.Range-Module/715. Range Module.go | 0 .../715. Range Module_test.go | 0 .../0715.Range-Module/README.md | 0 .../717. 1-bit and 2-bit Characters.go | 0 .../717. 1-bit and 2-bit Characters_test.go | 0 .../0717.1-bit-and-2-bit-Characters/README.md | 6 +- ...18. Maximum Length of Repeated Subarray.go | 0 ...aximum Length of Repeated Subarray_test.go | 0 .../README.md | 0 .../719. Find K-th Smallest Pair Distance.go | 0 .... Find K-th Smallest Pair Distance_test.go | 0 .../README.md | 0 .../720. Longest Word in Dictionary.go | 0 .../720. Longest Word in Dictionary_test.go | 0 .../0720.Longest-Word-in-Dictionary/README.md | 0 .../721. Accounts Merge.go | 0 .../721. Accounts Merge_test.go | 0 .../0721.Accounts-Merge/README.md | 0 .../725. Split Linked List in Parts.go | 0 .../725. Split Linked List in Parts_test.go | 0 .../0725.Split-Linked-List-in-Parts/README.md | 0 .../726. Number of Atoms.go | 0 .../726. Number of Atoms_test.go | 0 .../0726.Number-of-Atoms/README.md | 0 .../0729.My-Calendar-I/729. My Calendar I.go | 0 .../729. My Calendar I_test.go | 0 .../0729.My-Calendar-I/README.md | 0 .../732. My Calendar III.go | 0 .../732. My Calendar III_test.go | 0 .../0732.My-Calendar-III/README.md | 0 .../0733.Flood-Fill/733. Flood Fill.go | 0 .../0733.Flood-Fill/733. Flood Fill_test.go | 0 .../0733.Flood-Fill/README.md | 0 .../735. Asteroid Collision.go | 0 .../735. Asteroid Collision_test.go | 0 .../0735.Asteroid-Collision/README.md | 0 .../739. Daily Temperatures.go | 0 .../739. Daily Temperatures_test.go | 0 .../0739.Daily-Temperatures/README.md | 0 ...ind Smallest Letter Greater Than Target.go | 0 ...mallest Letter Greater Than Target_test.go | 0 .../README.md | 0 .../745. Prefix and Suffix Search.go | 0 .../745. Prefix and Suffix Search_test.go | 0 .../0745.Prefix-and-Suffix-Search/README.md | 0 .../746. Min Cost Climbing Stairs.go | 0 .../746. Min Cost Climbing Stairs_test.go | 0 .../0746.Min-Cost-Climbing-Stairs/README.md | 0 .../748. Shortest Completing Word.go | 0 .../748. Shortest Completing Word_test.go | 0 .../0748.Shortest-Completing-Word/README.md | 0 .../753. Cracking the Safe.go | 0 .../753. Cracking the Safe_test.go | 0 .../0753.Cracking-the-Safe/README.md | 0 .../756. Pyramid Transition Matrix.go | 0 .../756. Pyramid Transition Matrix_test.go | 0 .../0756.Pyramid-Transition-Matrix/README.md | 0 ...er of Set Bits in Binary Representation.go | 0 ... Set Bits in Binary Representation_test.go | 0 .../README.md | 0 .../763. Partition Labels.go | 0 .../763. Partition Labels_test.go | 0 .../0763.Partition-Labels/README.md | 0 .../765. Couples Holding Hands.go | 0 .../765. Couples Holding Hands_test.go | 0 .../0765.Couples-Holding-Hands/README.md | 0 .../766. Toeplitz Matrix.go | 0 .../766. Toeplitz Matrix_test.go | 0 .../0766.Toeplitz-Matrix/README.md | 0 .../767. Reorganize String.go | 0 .../767. Reorganize String_test.go | 0 .../0767.Reorganize-String/README.md | 0 .../771. Jewels and Stones.go | 0 .../771. Jewels and Stones_test.go | 0 .../0771.Jewels-and-Stones/README.md | 0 .../778. Swim in Rising Water.go | 0 .../778. Swim in Rising Water_test.go | 0 .../0778.Swim-in-Rising-Water/README.md | 0 .../781. Rabbits in Forest.go | 0 .../781. Rabbits in Forest_test.go | 0 .../0781.Rabbits-in-Forest/README.md | 0 .../784. Letter Case Permutation.go | 0 .../784. Letter Case Permutation_test.go | 0 .../0784.Letter-Case-Permutation/README.md | 0 .../786. K-th Smallest Prime Fraction.go | 0 .../786. K-th Smallest Prime Fraction_test.go | 0 .../README.md | 0 ...image Size of Factorial Zeroes Function.go | 0 ... Size of Factorial Zeroes Function_test.go | 0 .../README.md | 0 .../802. Find Eventual Safe States.go | 0 .../802. Find Eventual Safe States_test.go | 0 .../0802.Find-Eventual-Safe-States/README.md | 0 .../803. Bricks Falling When Hit.go | 0 .../803. Bricks Falling When Hit_test.go | 0 .../0803.Bricks-Falling-When-Hit/README.md | 0 .../811. Subdomain Visit Count.go | 0 .../811. Subdomain Visit Count_test.go | 0 .../0811.Subdomain-Visit-Count/README.md | 0 .../0815.Bus-Routes/815. Bus Routes.go | 0 .../0815.Bus-Routes/815. Bus Routes_test.go | 0 .../0815.Bus-Routes/README.md | 0 .../817. Linked List Components.go | 0 .../817. Linked List Components_test.go | 0 .../0817.Linked-List-Components/README.md | 0 .../819. Most Common Word.go | 0 .../819. Most Common Word_test.go | 0 .../0819.Most-Common-Word/README.md | 0 .../826. Most Profit Assigning Work.go | 0 .../826. Most Profit Assigning Work_test.go | 0 .../0826.Most-Profit-Assigning-Work/README.md | 0 .../828. Unique Letter String.go | 0 .../828. Unique Letter String_test.go | 0 .../0828.COPYRIGHT-PROBLEM-XXX/README.md | 0 .../834. Sum of Distances in Tree.go | 0 .../834. Sum of Distances in Tree_test.go | 0 .../0834.Sum-of-Distances-in-Tree/README.md | 0 .../836. Rectangle Overlap.go | 0 .../836. Rectangle Overlap_test.go | 0 .../0836.Rectangle-Overlap/README.md | 0 .../0838.Push-Dominoes/838. Push Dominoes.go | 0 .../838. Push Dominoes_test.go | 0 .../0838.Push-Dominoes/README.md | 0 .../839. Similar String Groups.go | 0 .../839. Similar String Groups_test.go | 0 .../0839.Similar-String-Groups/README.md | 0 .../841. Keys and Rooms.go | 0 .../841. Keys and Rooms_test.go | 0 .../0841.Keys-and-Rooms/README.md | 0 ...42. Split Array into Fibonacci Sequence.go | 0 ...plit Array into Fibonacci Sequence_test.go | 0 .../README.md | 0 .../844. Backspace String Compare.go | 0 .../844. Backspace String Compare_test.go | 0 .../0844.Backspace-String-Compare/README.md | 0 .../845. Longest Mountain in Array.go | 0 .../845. Longest Mountain in Array_test.go | 0 .../0845.Longest-Mountain-in-Array/README.md | 0 .../850. Rectangle Area II.go | 0 .../850. Rectangle Area II_test.go | 0 .../0850.Rectangle-Area-II/README.md | 0 .../0851.Loud-and-Rich/851. Loud and Rich.go | 0 .../851. Loud and Rich_test.go | 0 .../0851.Loud-and-Rich/README.md | 0 .../852. Peak Index in a Mountain Array.go | 0 ...52. Peak Index in a Mountain Array_test.go | 0 .../README.md | 0 .../0853.Car-Fleet/853. Car Fleet.go | 0 .../0853.Car-Fleet/853. Car Fleet_test.go | 0 .../0853.Car-Fleet/README.md | 0 .../856. Score of Parentheses.go | 0 .../856. Score of Parentheses_test.go | 0 .../0856.Score-of-Parentheses/README.md | 0 .... Shortest Subarray with Sum at Least K.go | 0 ...rtest Subarray with Sum at Least K_test.go | 0 .../README.md | 0 ...63. All Nodes Distance K in Binary Tree.go | 0 ...ll Nodes Distance K in Binary Tree_test.go | 0 .../README.md | 0 .../864. Shortest Path to Get All Keys.go | 0 ...864. Shortest Path to Get All Keys_test.go | 0 .../README.md | 0 .../867. Transpose Matrix.go | 0 .../867. Transpose Matrix_test.go | 0 .../0867.Transpose-Matrix/README.md | 0 .../872. Leaf-Similar Trees.go | 0 .../872. Leaf-Similar Trees_test.go | 0 .../0872.Leaf-Similar-Trees/README.md | 0 .../875. Koko Eating Bananas.go | 0 .../875. Koko Eating Bananas_test.go | 0 .../0875.Koko-Eating-Bananas/README.md | 0 .../876. Middle of the Linked List.go | 0 .../876. Middle of the Linked List_test.go | 0 .../0876.Middle-of-the-Linked-List/README.md | 0 .../878. Nth Magical Number.go | 0 .../878. Nth Magical Number_test.go | 0 .../0878.Nth-Magical-Number/README.md | 0 .../880. Decoded String at Index.go | 0 .../880. Decoded String at Index_test.go | 0 .../0880.Decoded-String-at-Index/README.md | 0 .../881. Boats to Save People.go | 0 .../881. Boats to Save People_test.go | 0 .../0881.Boats-to-Save-People/README.md | 0 .../884. Uncommon Words from Two Sentences.go | 0 ... Uncommon Words from Two Sentences_test.go | 0 .../README.md | 0 .../885. Spiral Matrix III.go | 0 .../885. Spiral Matrix III_test.go | 0 .../0885.Spiral-Matrix-III/README.md | 0 .../887. Super Egg Drop.go | 0 .../887. Super Egg Drop_test.go | 0 .../0887.Super-Egg-Drop/README.md | 0 .../891. Sum of Subsequence Widths.go | 0 .../891. Sum of Subsequence Widths_test.go | 0 .../0891.Sum-of-Subsequence-Widths/README.md | 0 .../895. Maximum Frequency Stack.go | 0 .../895. Maximum Frequency Stack_test.go | 0 .../0895.Maximum-Frequency-Stack/README.md | 0 .../897. Increasing Order Search Tree.go | 0 .../897. Increasing Order Search Tree_test.go | 0 .../README.md | 0 .../898. Bitwise ORs of Subarrays.go | 0 .../898. Bitwise ORs of Subarrays_test.go | 0 .../0898.Bitwise-ORs-of-Subarrays/README.md | 0 .../901. Online Stock Span.go | 0 .../901. Online Stock Span_test.go | 0 .../0901.Online-Stock-Span/README.md | 0 .../904. Fruit Into Baskets.go | 0 .../904. Fruit Into Baskets_test.go | 0 .../0904.Fruit-Into-Baskets/README.md | 0 .../907. Sum of Subarray Minimums.go | 0 .../907. Sum of Subarray Minimums_test.go | 0 .../0907.Sum-of-Subarray-Minimums/README.md | 0 .../911. Online Election.go | 0 .../911. Online Election_test.go | 0 .../0911.Online-Election/README.md | 0 .../918. Maximum Sum Circular Subarray.go | 0 ...918. Maximum Sum Circular Subarray_test.go | 0 .../README.md | 0 .../920. Number of Music Playlists.go | 0 .../920. Number of Music Playlists_test.go | 0 .../0920.Number-of-Music-Playlists/README.md | 0 .... Minimum Add to Make Parentheses Valid.go | 0 ...imum Add to Make Parentheses Valid_test.go | 0 .../README.md | 0 .../922. Sort Array By Parity II.go | 0 .../922. Sort Array By Parity II_test.go | 0 .../0922.Sort-Array-By-Parity-II/README.md | 0 .../923. 3Sum With Multiplicity.go | 0 .../923. 3Sum With Multiplicity_test.go | 0 .../0923.3Sum-With-Multiplicity/README.md | 0 .../924. Minimize Malware Spread.go | 0 .../924. Minimize Malware Spread_test.go | 0 .../0924.Minimize-Malware-Spread/README.md | 0 .../925. Long Pressed Name.go | 0 .../925. Long Pressed Name_test.go | 0 .../0925.Long-Pressed-Name/README.md | 0 .../927. Three Equal Parts.go | 0 .../927. Three Equal Parts_test.go | 0 .../0927.Three-Equal-Parts/README.md | 0 .../928. Minimize Malware Spread II.go | 0 .../928. Minimize Malware Spread II_test.go | 0 .../0928.Minimize-Malware-Spread-II/README.md | 0 .../930. Binary Subarrays With Sum.go | 0 .../930. Binary Subarrays With Sum_test.go | 0 .../0930.Binary-Subarrays-With-Sum/README.md | 0 .../933. Number of Recent Calls.go | 0 .../933. Number of Recent Calls_test.go | 0 .../0933.Number-of-Recent-Calls/README.md | 0 .../942. DI String Match.go | 0 .../942. DI String Match_test.go | 0 .../0942.DI-String-Match/README.md | 0 .../946. Validate Stack Sequences.go | 0 .../946. Validate Stack Sequences_test.go | 0 .../0946.Validate-Stack-Sequences/README.md | 0 ... Stones Removed with Same Row or Column.go | 0 ...es Removed with Same Row or Column_test.go | 0 .../README.md | 0 ...Largest Component Size by Common Factor.go | 0 ...st Component Size by Common Factor_test.go | 0 .../README.md | 0 .../953. Verifying an Alien Dictionary.go | 0 ...953. Verifying an Alien Dictionary_test.go | 0 .../README.md | 0 .../959. Regions Cut By Slashes.go | 0 .../959. Regions Cut By Slashes_test.go | 0 .../0959.Regions-Cut-By-Slashes/README.md | 0 ...61. N-Repeated Element in Size 2N Array.go | 0 ...-Repeated Element in Size 2N Array_test.go | 0 .../README.md | 0 .../968. Binary Tree Cameras.go | 0 .../968. Binary Tree Cameras_test.go | 0 .../0968.Binary-Tree-Cameras/README.md | 0 .../969. Pancake Sorting.go | 0 .../969. Pancake Sorting_test.go | 0 .../0969.Pancake-Sorting/README.md | 0 .../970. Powerful Integers.go | 0 .../970. Powerful Integers_test.go | 0 .../0970.Powerful-Integers/README.md | 0 .../973. K Closest Points to Origin.go | 0 .../973. K Closest Points to Origin_test.go | 0 .../0973.K-Closest-Points-to-Origin/README.md | 0 .../976. Largest Perimeter Triangle.go | 0 .../976. Largest Perimeter Triangle_test.go | 0 .../0976.Largest-Perimeter-Triangle/README.md | 0 .../977. Squares of a Sorted Array.go | 0 .../977. Squares of a Sorted Array_test.go | 0 .../0977.Squares-of-a-Sorted-Array/README.md | 0 .../978. Longest Turbulent Subarray.go | 0 .../978. Longest Turbulent Subarray_test.go | 0 .../0978.Longest-Turbulent-Subarray/README.md | 0 .../979. Distribute Coins in Binary Tree.go | 0 ...9. Distribute Coins in Binary Tree_test.go | 0 .../README.md | 0 .../980. Unique Paths III.go | 0 .../980. Unique Paths III_test.go | 0 .../0980.Unique-Paths-III/README.md | 0 .../981. Time Based Key-Value Store.go | 0 .../981. Time Based Key-Value Store_test.go | 0 .../0981.Time-Based-Key-Value-Store/README.md | 0 .../984. String Without AAA or BBB.go | 0 .../984. String Without AAA or BBB_test.go | 0 .../0984.String-Without-AAA-or-BBB/README.md | 0 .../986. Interval List Intersections.go | 0 .../986. Interval List Intersections_test.go | 0 .../README.md | 0 ...0. Satisfiability of Equality Equations.go | 0 ...tisfiability of Equality Equations_test.go | 0 .../README.md | 0 ...92. Subarrays with K Different Integers.go | 0 ...ubarrays with K Different Integers_test.go | 0 .../README.md | 0 .../993. Cousins in Binary Tree.go | 0 .../993. Cousins in Binary Tree_test.go | 0 .../0993.Cousins-in-Binary-Tree/README.md | 0 ...nimum Number of K Consecutive Bit Flips.go | 0 ... Number of K Consecutive Bit Flips_test.go | 0 .../README.md | 0 .../996. Number of Squareful Arrays.go | 0 .../996. Number of Squareful Arrays_test.go | 0 .../0996.Number-of-Squareful-Arrays/README.md | 0 .../1002. Find Common Characters.go | 0 .../1002. Find Common Characters_test.go | 0 .../1002.Find-Common-Characters/README.md | 0 ...ck If Word Is Valid After Substitutions.go | 0 ... Word Is Valid After Substitutions_test.go | 0 .../README.md | 0 .../1004. Max Consecutive Ones III.go | 0 .../1004. Max Consecutive Ones III_test.go | 0 .../1004.Max-Consecutive-Ones-III/README.md | 0 ...Maximize Sum Of Array After K Negations.go | 0 ...ize Sum Of Array After K Negations_test.go | 0 .../README.md | 0 ...Capacity To Ship Packages Within D Days.go | 0 ...ity To Ship Packages Within D Days_test.go | 0 .../README.md | 0 .../1017. Convert to Base -2.go | 0 .../1017. Convert to Base -2_test.go | 0 .../1017.Convert-to-Base--2/README.md | 0 .../1019. Next Greater Node In Linked List.go | 0 .... Next Greater Node In Linked List_test.go | 0 .../README.md | 0 .../1020. Number of Enclaves.go | 0 .../1020. Number of Enclaves_test.go | 0 .../1020.Number-of-Enclaves/README.md | 0 .../1021. Remove Outermost Parentheses.go | 0 ...1021. Remove Outermost Parentheses_test.go | 0 .../README.md | 0 .../1025.Divisor-Game/1025. Divisor Game.go | 0 .../1025. Divisor Game_test.go | 0 .../1025.Divisor-Game/README.md | 0 ...um Difference Between Node and Ancestor.go | 0 ...fference Between Node and Ancestor_test.go | 0 .../README.md | 0 ... Recover a Tree From Preorder Traversal.go | 0 ...ver a Tree From Preorder Traversal_test.go | 0 .../README.md | 0 .../1030. Matrix Cells in Distance Order.go | 0 ...30. Matrix Cells in Distance Order_test.go | 0 .../README.md | 0 ...040. Moving Stones Until Consecutive II.go | 0 ...Moving Stones Until Consecutive II_test.go | 0 .../README.md | 0 ...emove All Adjacent Duplicates In String.go | 0 ... All Adjacent Duplicates In String_test.go | 0 .../README.md | 0 .../1049. Last Stone Weight II.go | 0 .../1049. Last Stone Weight II_test.go | 0 .../1049.Last-Stone-Weight-II/README.md | 0 .../1052. Grumpy Bookstore Owner.go | 0 .../1052. Grumpy Bookstore Owner_test.go | 0 .../1052.Grumpy-Bookstore-Owner/README.md | 0 .../1054. Distant Barcodes.go | 0 .../1054. Distant Barcodes_test.go | 0 .../1054.Distant-Barcodes/README.md | 0 .../1073. Adding Two Negabinary Numbers.go | 0 ...073. Adding Two Negabinary Numbers_test.go | 0 .../README.md | 0 ...umber of Submatrices That Sum to Target.go | 0 ... of Submatrices That Sum to Target_test.go | 0 .../README.md | 0 .../1078. Occurrences After Bigram.go | 0 .../1078. Occurrences After Bigram_test.go | 0 .../1078.Occurrences-After-Bigram/README.md | 0 .../1079. Letter Tile Possibilities.go | 0 .../1079. Letter Tile Possibilities_test.go | 0 .../1079.Letter-Tile-Possibilities/README.md | 0 .../1093. Statistics from a Large Sample.go | 0 ...93. Statistics from a Large Sample_test.go | 0 .../README.md | 0 .../1105. Filling Bookcase Shelves.go | 0 .../1105. Filling Bookcase Shelves_test.go | 0 .../1105.Filling-Bookcase-Shelves/README.md | 0 .../1108. Defanging an IP Address.go | 0 .../1108. Defanging an IP Address_test.go | 0 .../1108.Defanging-an-IP-Address/README.md | 0 .../1110. Delete Nodes And Return Forest.go | 0 ...10. Delete Nodes And Return Forest_test.go | 0 .../README.md | 0 ... Depth of Two Valid Parentheses Strings.go | 0 ...h of Two Valid Parentheses Strings_test.go | 0 .../README.md | 0 .../1122. Relative Sort Array.go | 0 .../1122. Relative Sort Array_test.go | 0 .../1122.Relative-Sort-Array/README.md | 0 ...owest Common Ancestor of Deepest Leaves.go | 0 ... Common Ancestor of Deepest Leaves_test.go | 0 .../README.md | 0 ...1128. Number of Equivalent Domino Pairs.go | 0 ... Number of Equivalent Domino Pairs_test.go | 0 .../README.md | 0 .../1137. N-th Tribonacci Number.go | 0 .../1137. N-th Tribonacci Number_test.go | 0 .../1137.N-th-Tribonacci-Number/README.md | 0 .../1145. Binary Tree Coloring Game.go | 0 .../1145. Binary Tree Coloring Game_test.go | 0 .../1145.Binary-Tree-Coloring-Game/README.md | 0 .../1154. Day of the Year.go | 0 .../1154. Day of the Year_test.go | 0 .../1154.Day-of-the-Year/README.md | 0 ...57. Online Majority Element In Subarray.go | 0 ...nline Majority Element In Subarray_test.go | 0 .../README.md | 0 ... Words That Can Be Formed by Characters.go | 0 ...s That Can Be Formed by Characters_test.go | 0 .../README.md | 0 ... by Frequency of the Smallest Character.go | 0 ...requency of the Smallest Character_test.go | 0 .../README.md | 0 ... Sum Consecutive Nodes from Linked List.go | 0 ...Consecutive Nodes from Linked List_test.go | 0 .../README.md | 0 .../1175. Prime Arrangements.go | 0 .../1175. Prime Arrangements_test.go | 0 .../1175.Prime-Arrangements/README.md | 0 .../1184. Distance Between Bus Stops.go | 0 .../1184. Distance Between Bus Stops_test.go | 0 .../1184.Distance-Between-Bus-Stops/README.md | 0 .../1185. Day of the Week.go | 0 .../1185. Day of the Week_test.go | 0 .../1185.Day-of-the-Week/README.md | 0 .../1189. Maximum Number of Balloons.go | 0 .../1189. Maximum Number of Balloons_test.go | 0 .../1189.Maximum-Number-of-Balloons/README.md | 0 .../1200. Minimum Absolute Difference.go | 0 .../1200. Minimum Absolute Difference_test.go | 0 .../README.md | 0 .../1201. Ugly Number III.go | 0 .../1201. Ugly Number III_test.go | 0 .../1201.Ugly-Number-III/README.md | 0 .../1202. Smallest String With Swaps.go | 0 .../1202. Smallest String With Swaps_test.go | 0 .../1202.Smallest-String-With-Swaps/README.md | 0 .../1207. Unique Number of Occurrences.go | 0 ...1207. Unique Number of Occurrences_test.go | 0 .../README.md | 0 ...208. Get Equal Substrings Within Budget.go | 0 ...Get Equal Substrings Within Budget_test.go | 0 .../README.md | 0 .../1217. Play with Chips.go | 0 .../1217. Play with Chips_test.go | 0 .../1217.Play-with-Chips/README.md | 0 ...221. Split a String in Balanced Strings.go | 0 ...Split a String in Balanced Strings_test.go | 0 .../README.md | 0 .../1232. Check If It Is a Straight Line.go | 0 ...32. Check If It Is a Straight Line_test.go | 0 .../README.md | 0 ...place the Substring for Balanced String.go | 0 ... the Substring for Balanced String_test.go | 0 .../README.md | 0 .../1235. Maximum Profit in Job Scheduling.go | 0 .... Maximum Profit in Job Scheduling_test.go | 0 .../README.md | 0 ...1252. Cells with Odd Values in a Matrix.go | 0 ... Cells with Odd Values in a Matrix_test.go | 0 .../README.md | 0 .../1254. Number of Closed Islands.go | 0 .../1254. Number of Closed Islands_test.go | 0 .../1254.Number-of-Closed-Islands/README.md | 0 .../1266. Minimum Time Visiting All Points.go | 0 .... Minimum Time Visiting All Points_test.go | 0 .../README.md | 0 ...Product and Sum of Digits of an Integer.go | 0 ...ct and Sum of Digits of an Integer_test.go | 0 .../README.md | 0 ... the Smallest Divisor Given a Threshold.go | 0 ...Smallest Divisor Given a Threshold_test.go | 0 .../README.md | 0 ...Appearing More Than 25% In Sorted Array.go | 0 ...ring More Than 25% In Sorted Array_test.go | 0 .../README.md | 0 ...nary Number in a Linked List to Integer.go | 0 ...Number in a Linked List to Integer_test.go | 0 .../README.md | 0 ...Find Numbers with Even Number of Digits.go | 0 ...Numbers with Even Number of Digits_test.go | 0 .../README.md | 0 ...nts with Greatest Element on Right Side.go | 0 ...ith Greatest Element on Right Side_test.go | 0 .../README.md | 0 ... Sum of Mutated Array Closest to Target.go | 0 ...of Mutated Array Closest to Target_test.go | 0 .../README.md | 0 .../1302. Deepest Leaves Sum.go | 0 .../1302. Deepest Leaves Sum_test.go | 0 .../1302.Deepest-Leaves-Sum/README.md | 0 .... Find N Unique Integers Sum up to Zero.go | 0 ...d N Unique Integers Sum up to Zero_test.go | 0 .../README.md | 0 ...All Elements in Two Binary Search Trees.go | 0 ...lements in Two Binary Search Trees_test.go | 0 .../README.md | 0 .../1306.Jump-Game-III/1306. Jump Game III.go | 0 .../1306. Jump Game III_test.go | 0 .../1306.Jump-Game-III/README.md | 0 {Topics => topic}/Backtracking.png | Bin {Topics => topic}/Binary_Indexed_Tree.png | Bin {Topics => topic}/Bit_Manipulation.png | Bin {Topics => topic}/Linked_List.png | Bin {Topics => topic}/Segment_Tree.png | Bin {Topics => topic}/Sliding_Window.png | Bin {Topics => topic}/Sort.png | Bin {Topics => topic}/Stack.png | Bin {Topics => topic}/Two_pointers.png | Bin {Topics => topic}/Union_Find.png | Bin .../content/ChapterFour/0143. Reorder List.md | 2 +- .../0717. 1-bit and 2-bit Characters.md | 2 +- website/content/ChapterOne/_index.md | 2 +- website/content/_index.md | 2 +- 1438 files changed, 907 insertions(+), 924 deletions(-) rename {Algorithms => leetcode}/0001.Two-Sum/1. Two Sum.go (100%) rename {Algorithms => leetcode}/0001.Two-Sum/1. Two Sum_test.go (100%) rename {Algorithms => leetcode}/0001.Two-Sum/README.md (100%) rename {Algorithms => leetcode}/0002.Add-Two-Numbers/2. Add Two Numbers.go (100%) rename {Algorithms => leetcode}/0002.Add-Two-Numbers/2. Add Two Numbers_test.go (100%) rename {Algorithms => leetcode}/0002.Add-Two-Numbers/README.md (100%) rename {Algorithms => leetcode}/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go (100%) rename {Algorithms => leetcode}/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go (100%) rename {Algorithms => leetcode}/0003.Longest-Substring-Without-Repeating-Characters/README.md (100%) rename {Algorithms => leetcode}/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go (100%) rename {Algorithms => leetcode}/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go (100%) rename {Algorithms => leetcode}/0004.Median-of-Two-Sorted-Arrays/README.md (100%) rename {Algorithms => leetcode}/0007.Reverse-Integer/7. Reverse Integer.go (100%) rename {Algorithms => leetcode}/0007.Reverse-Integer/7. Reverse Integer_test.go (100%) rename {Algorithms => leetcode}/0007.Reverse-Integer/README.md (100%) rename {Algorithms => leetcode}/0011.Container-With-Most-Water/11. Container With Most Water.go (100%) rename {Algorithms => leetcode}/0011.Container-With-Most-Water/11. Container With Most Water_test.go (100%) rename {Algorithms => leetcode}/0011.Container-With-Most-Water/README.md (100%) rename {Algorithms => leetcode}/0015.3Sum/15. 3Sum.go (100%) rename {Algorithms => leetcode}/0015.3Sum/15. 3Sum_test.go (100%) rename {Algorithms => leetcode}/0015.3Sum/README.md (100%) rename {Algorithms => leetcode}/0016.3Sum-Closest/16. 3Sum Closest.go (100%) rename {Algorithms => leetcode}/0016.3Sum-Closest/16. 3Sum Closest_test.go (100%) rename {Algorithms => leetcode}/0016.3Sum-Closest/README.md (100%) rename {Algorithms => leetcode}/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go (100%) rename {Algorithms => leetcode}/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go (100%) rename {Algorithms => leetcode}/0017.Letter-Combinations-of-a-Phone-Number/README.md (100%) rename {Algorithms => leetcode}/0018.4Sum/18. 4Sum.go (100%) rename {Algorithms => leetcode}/0018.4Sum/18. 4Sum_test.go (100%) rename {Algorithms => leetcode}/0018.4Sum/README.md (100%) rename {Algorithms => leetcode}/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go (100%) rename {Algorithms => leetcode}/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go (100%) rename {Algorithms => leetcode}/0019.Remove-Nth-Node-From-End-of-List/README.md (100%) rename {Algorithms => leetcode}/0020.Valid-Parentheses/20. Valid Parentheses.go (100%) rename {Algorithms => leetcode}/0020.Valid-Parentheses/20. Valid Parentheses_test.go (100%) rename {Algorithms => leetcode}/0020.Valid-Parentheses/README.md (100%) rename {Algorithms => leetcode}/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go (100%) rename {Algorithms => leetcode}/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go (100%) rename {Algorithms => leetcode}/0021.Merge-Two-Sorted-Lists/README.md (100%) rename {Algorithms => leetcode}/0022.Generate-Parentheses/22. Generate Parentheses.go (100%) rename {Algorithms => leetcode}/0022.Generate-Parentheses/22. Generate Parentheses_test.go (100%) rename {Algorithms => leetcode}/0022.Generate-Parentheses/README.md (100%) rename {Algorithms => leetcode}/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go (100%) rename {Algorithms => leetcode}/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go (100%) rename {Algorithms => leetcode}/0023.Merge-k-Sorted-Lists/README.md (100%) rename {Algorithms => leetcode}/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go (100%) rename {Algorithms => leetcode}/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go (100%) rename {Algorithms => leetcode}/0024.Swap-Nodes-in-Pairs/README.md (100%) rename {Algorithms => leetcode}/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go (100%) rename {Algorithms => leetcode}/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go (100%) rename {Algorithms => leetcode}/0025.Reverse-Nodes-in-k-Group/README.md (100%) rename {Algorithms => leetcode}/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go (100%) rename {Algorithms => leetcode}/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go (100%) rename {Algorithms => leetcode}/0026.Remove-Duplicates-from-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/0027.Remove-Element/27. Remove Element.go (100%) rename {Algorithms => leetcode}/0027.Remove-Element/27. Remove Element_test.go (100%) rename {Algorithms => leetcode}/0027.Remove-Element/README.md (100%) rename {Algorithms => leetcode}/0028.Implement-strStr/28. Implement strStr().go (100%) rename {Algorithms => leetcode}/0028.Implement-strStr/28. Implement strStr()_test.go (100%) rename {Algorithms => leetcode}/0028.Implement-strStr/README.md (100%) rename {Algorithms => leetcode}/0029.Divide-Two-Integers/29. Divide Two Integers.go (100%) rename {Algorithms => leetcode}/0029.Divide-Two-Integers/29. Divide Two Integers_test.go (100%) rename {Algorithms => leetcode}/0029.Divide-Two-Integers/README.md (100%) rename {Algorithms => leetcode}/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go (100%) rename {Algorithms => leetcode}/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go (100%) rename {Algorithms => leetcode}/0030.Substring-with-Concatenation-of-All-Words/README.md (100%) rename {Algorithms => leetcode}/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go (100%) rename {Algorithms => leetcode}/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go (100%) rename {Algorithms => leetcode}/0033.Search-in-Rotated-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go (100%) rename {Algorithms => leetcode}/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go (100%) rename {Algorithms => leetcode}/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/0035.Search-Insert-Position/35. Search Insert Position.go (100%) rename {Algorithms => leetcode}/0035.Search-Insert-Position/35. Search Insert Position_test.go (100%) rename {Algorithms => leetcode}/0035.Search-Insert-Position/README.md (100%) rename {Algorithms => leetcode}/0036.Valid-Sudoku/36. Valid Sudoku.go (100%) rename {Algorithms => leetcode}/0036.Valid-Sudoku/36. Valid Sudoku_test.go (100%) rename {Algorithms => leetcode}/0036.Valid-Sudoku/README.md (100%) rename {Algorithms => leetcode}/0037.Sudoku-Solver/37. Sudoku Solver.go (100%) rename {Algorithms => leetcode}/0037.Sudoku-Solver/37. Sudoku Solver_test.go (100%) rename {Algorithms => leetcode}/0037.Sudoku-Solver/README.md (100%) rename {Algorithms => leetcode}/0039.Combination-Sum/39. Combination Sum.go (100%) rename {Algorithms => leetcode}/0039.Combination-Sum/39. Combination Sum_test.go (100%) rename {Algorithms => leetcode}/0039.Combination-Sum/README.md (100%) rename {Algorithms => leetcode}/0040.Combination-Sum-II/40. Combination Sum II.go (100%) rename {Algorithms => leetcode}/0040.Combination-Sum-II/40. Combination Sum II_test.go (100%) rename {Algorithms => leetcode}/0040.Combination-Sum-II/README.md (100%) rename {Algorithms => leetcode}/0041.First-Missing-Positive/41. First Missing Positive.go (100%) rename {Algorithms => leetcode}/0041.First-Missing-Positive/41. First Missing Positive_test.go (100%) rename {Algorithms => leetcode}/0041.First-Missing-Positive/README.md (100%) rename {Algorithms => leetcode}/0042.Trapping-Rain-Water/42. Trapping Rain Water.go (100%) rename {Algorithms => leetcode}/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go (100%) rename {Algorithms => leetcode}/0042.Trapping-Rain-Water/README.md (100%) rename {Algorithms => leetcode}/0046.Permutations/46. Permutations.go (100%) rename {Algorithms => leetcode}/0046.Permutations/46. Permutations_test.go (100%) rename {Algorithms => leetcode}/0046.Permutations/README.md (100%) rename {Algorithms => leetcode}/0047.Permutations-II/47. Permutations II.go (100%) rename {Algorithms => leetcode}/0047.Permutations-II/47. Permutations II_test.go (100%) rename {Algorithms => leetcode}/0047.Permutations-II/README.md (100%) rename {Algorithms => leetcode}/0048.Rotate-Image/48. Rotate Image.go (100%) rename {Algorithms => leetcode}/0048.Rotate-Image/48. Rotate Image_test.go (100%) rename {Algorithms => leetcode}/0048.Rotate-Image/README.md (100%) rename {Algorithms => leetcode}/0049.Group-Anagrams/49. Group Anagrams.go (100%) rename {Algorithms => leetcode}/0049.Group-Anagrams/49. Group Anagrams_test.go (100%) rename {Algorithms => leetcode}/0049.Group-Anagrams/README.md (100%) rename {Algorithms => leetcode}/0050.Powx-n/50. Pow(x, n).go (100%) rename {Algorithms => leetcode}/0050.Powx-n/50. Pow(x, n)_test.go (100%) rename {Algorithms => leetcode}/0050.Powx-n/README.md (100%) rename {Algorithms => leetcode}/0051.N-Queens/51. N-Queens.go (100%) rename {Algorithms => leetcode}/0051.N-Queens/51. N-Queens_test.go (100%) rename {Algorithms => leetcode}/0051.N-Queens/README.md (100%) rename {Algorithms => leetcode}/0052.N-Queens-II/52. N-Queens II.go (100%) rename {Algorithms => leetcode}/0052.N-Queens-II/52. N-Queens II_test.go (100%) rename {Algorithms => leetcode}/0052.N-Queens-II/README.md (100%) rename {Algorithms => leetcode}/0053.Maximum-Subarray/53. Maximum Subarray.go (100%) rename {Algorithms => leetcode}/0053.Maximum-Subarray/53. Maximum Subarray_test.go (100%) rename {Algorithms => leetcode}/0053.Maximum-Subarray/README.md (100%) rename {Algorithms => leetcode}/0054.Spiral-Matrix/54. Spiral Matrix.go (100%) rename {Algorithms => leetcode}/0054.Spiral-Matrix/54. Spiral Matrix_test.go (100%) rename {Algorithms => leetcode}/0054.Spiral-Matrix/README.md (100%) rename {Algorithms => leetcode}/0055.Jump-Game/55. Jump Game.go (100%) rename {Algorithms => leetcode}/0055.Jump-Game/55. Jump Game_test.go (100%) rename {Algorithms => leetcode}/0055.Jump-Game/README.md (100%) rename {Algorithms => leetcode}/0056.Merge-Intervals/56. Merge Intervals.go (100%) rename {Algorithms => leetcode}/0056.Merge-Intervals/56. Merge Intervals_test.go (100%) rename {Algorithms => leetcode}/0056.Merge-Intervals/README.md (100%) rename {Algorithms => leetcode}/0057.Insert-Interval/57. Insert Interval.go (100%) rename {Algorithms => leetcode}/0057.Insert-Interval/57. Insert Interval_test.go (100%) rename {Algorithms => leetcode}/0057.Insert-Interval/README.md (100%) rename {Algorithms => leetcode}/0059.Spiral-Matrix-II/59. Spiral Matrix II.go (100%) rename {Algorithms => leetcode}/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go (100%) rename {Algorithms => leetcode}/0059.Spiral-Matrix-II/README.md (100%) rename {Algorithms => leetcode}/0060.Permutation-Sequence/60. Permutation Sequence.go (100%) rename {Algorithms => leetcode}/0060.Permutation-Sequence/60. Permutation Sequence_test.go (100%) rename {Algorithms => leetcode}/0060.Permutation-Sequence/README.md (100%) rename {Algorithms => leetcode}/0061.Rotate-List/61. Rotate List.go (100%) rename {Algorithms => leetcode}/0061.Rotate-List/61. Rotate List_test.go (100%) rename {Algorithms => leetcode}/0061.Rotate-List/README.md (100%) rename {Algorithms => leetcode}/0062.Unique-Paths/62. Unique Paths.go (100%) rename {Algorithms => leetcode}/0062.Unique-Paths/62. Unique Paths_test.go (100%) rename {Algorithms => leetcode}/0062.Unique-Paths/README.md (100%) rename {Algorithms => leetcode}/0063.Unique-Paths-II/63. Unique Paths II.go (100%) rename {Algorithms => leetcode}/0063.Unique-Paths-II/63. Unique Paths II_test.go (100%) rename {Algorithms => leetcode}/0063.Unique-Paths-II/README.md (100%) rename {Algorithms => leetcode}/0064.Minimum-Path-Sum/64. Minimum Path Sum.go (100%) rename {Algorithms => leetcode}/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go (100%) rename {Algorithms => leetcode}/0064.Minimum-Path-Sum/README.md (100%) rename {Algorithms => leetcode}/0066.Plus-One/66. Plus One.go (100%) rename {Algorithms => leetcode}/0066.Plus-One/66. Plus One_test.go (100%) rename {Algorithms => leetcode}/0066.Plus-One/README.md (100%) rename {Algorithms => leetcode}/0069.Sqrtx/69. Sqrt(x).go (100%) rename {Algorithms => leetcode}/0069.Sqrtx/69. Sqrt(x)_test.go (100%) rename {Algorithms => leetcode}/0069.Sqrtx/README.md (100%) rename {Algorithms => leetcode}/0070.Climbing-Stairs/70. Climbing Stairs.go (100%) rename {Algorithms => leetcode}/0070.Climbing-Stairs/70. Climbing Stairs_test.go (100%) rename {Algorithms => leetcode}/0070.Climbing-Stairs/README.md (100%) rename {Algorithms => leetcode}/0071.Simplify-Path/71. Simplify Path.go (100%) rename {Algorithms => leetcode}/0071.Simplify-Path/71. Simplify Path_test.go (100%) rename {Algorithms => leetcode}/0071.Simplify-Path/README.md (100%) rename {Algorithms => leetcode}/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go (100%) rename {Algorithms => leetcode}/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go (100%) rename {Algorithms => leetcode}/0074.Search-a-2D-Matrix/README.md (100%) rename {Algorithms => leetcode}/0075.Sort-Colors/75. Sort Colors.go (100%) rename {Algorithms => leetcode}/0075.Sort-Colors/75. Sort Colors_test.go (100%) rename {Algorithms => leetcode}/0075.Sort-Colors/README.md (100%) rename {Algorithms => leetcode}/0076.Minimum-Window-Substring/76. Minimum Window Substring.go (100%) rename {Algorithms => leetcode}/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go (100%) rename {Algorithms => leetcode}/0076.Minimum-Window-Substring/README.md (100%) rename {Algorithms => leetcode}/0077.Combinations/77. Combinations.go (100%) rename {Algorithms => leetcode}/0077.Combinations/77. Combinations_test.go (100%) rename {Algorithms => leetcode}/0077.Combinations/README.md (100%) rename {Algorithms => leetcode}/0078.Subsets/78. Subsets.go (100%) rename {Algorithms => leetcode}/0078.Subsets/78. Subsets_test.go (100%) rename {Algorithms => leetcode}/0078.Subsets/README.md (100%) rename {Algorithms => leetcode}/0079.Word-Search/79. Word Search.go (100%) rename {Algorithms => leetcode}/0079.Word-Search/79. Word Search_test.go (100%) rename {Algorithms => leetcode}/0079.Word-Search/README.md (100%) rename {Algorithms => leetcode}/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go (100%) rename {Algorithms => leetcode}/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go (100%) rename {Algorithms => leetcode}/0080.Remove-Duplicates-from-Sorted-Array-II/README.md (100%) rename {Algorithms => leetcode}/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go (100%) rename {Algorithms => leetcode}/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go (100%) rename {Algorithms => leetcode}/0081.Search-in-Rotated-Sorted-Array-II/README.md (100%) rename {Algorithms => leetcode}/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go (100%) rename {Algorithms => leetcode}/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go (100%) rename {Algorithms => leetcode}/0082.Remove-Duplicates-from-Sorted-List-II/README.md (100%) rename {Algorithms => leetcode}/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go (100%) rename {Algorithms => leetcode}/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go (100%) rename {Algorithms => leetcode}/0083.Remove-Duplicates-from-Sorted-List/README.md (100%) rename {Algorithms => leetcode}/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go (100%) rename {Algorithms => leetcode}/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go (100%) rename {Algorithms => leetcode}/0084.Largest-Rectangle-in-Histogram/README.md (100%) rename {Algorithms => leetcode}/0086.Partition-List/86. Partition List.go (100%) rename {Algorithms => leetcode}/0086.Partition-List/86. Partition List_test.go (100%) rename {Algorithms => leetcode}/0086.Partition-List/README.md (100%) rename {Algorithms => leetcode}/0088.Merge-Sorted-Array/88. Merge Sorted Array.go (100%) rename {Algorithms => leetcode}/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go (100%) rename {Algorithms => leetcode}/0088.Merge-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/0089.Gray-Code/89. Gray Code.go (100%) rename {Algorithms => leetcode}/0089.Gray-Code/89. Gray Code_test.go (100%) rename {Algorithms => leetcode}/0089.Gray-Code/README.md (100%) rename {Algorithms => leetcode}/0090.Subsets-II/90. Subsets II.go (100%) rename {Algorithms => leetcode}/0090.Subsets-II/90. Subsets II_test.go (100%) rename {Algorithms => leetcode}/0090.Subsets-II/README.md (100%) rename {Algorithms => leetcode}/0091.Decode-Ways/91. Decode Ways.go (100%) rename {Algorithms => leetcode}/0091.Decode-Ways/91. Decode Ways_test.go (100%) rename {Algorithms => leetcode}/0091.Decode-Ways/README.md (100%) rename {Algorithms => leetcode}/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go (100%) rename {Algorithms => leetcode}/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go (100%) rename {Algorithms => leetcode}/0092.Reverse-Linked-List-II/README.md (100%) rename {Algorithms => leetcode}/0093.Restore-IP-Addresses/93. Restore IP Addresses.go (100%) rename {Algorithms => leetcode}/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go (100%) rename {Algorithms => leetcode}/0093.Restore-IP-Addresses/README.md (100%) rename {Algorithms => leetcode}/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go (100%) rename {Algorithms => leetcode}/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go (100%) rename {Algorithms => leetcode}/0094.Binary-Tree-Inorder-Traversal/README.md (100%) rename {Algorithms => leetcode}/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go (100%) rename {Algorithms => leetcode}/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go (100%) rename {Algorithms => leetcode}/0095.Unique-Binary-Search-Trees-II/README.md (100%) rename {Algorithms => leetcode}/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go (100%) rename {Algorithms => leetcode}/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go (100%) rename {Algorithms => leetcode}/0096.Unique-Binary-Search-Trees/README.md (100%) rename {Algorithms => leetcode}/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go (100%) rename {Algorithms => leetcode}/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go (100%) rename {Algorithms => leetcode}/0098.Validate-Binary-Search-Tree/README.md (100%) rename {Algorithms => leetcode}/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go (100%) rename {Algorithms => leetcode}/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go (100%) rename {Algorithms => leetcode}/0099.Recover-Binary-Search-Tree/README.md (100%) rename {Algorithms => leetcode}/0100.Same-Tree/100. Same Tree.go (100%) rename {Algorithms => leetcode}/0100.Same-Tree/100. Same Tree_test.go (100%) rename {Algorithms => leetcode}/0100.Same-Tree/README.md (100%) rename {Algorithms => leetcode}/0101.Symmetric-Tree/101. Symmetric Tree.go (100%) rename {Algorithms => leetcode}/0101.Symmetric-Tree/101. Symmetric Tree_test.go (100%) rename {Algorithms => leetcode}/0101.Symmetric-Tree/README.md (100%) rename {Algorithms => leetcode}/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go (100%) rename {Algorithms => leetcode}/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go (100%) rename {Algorithms => leetcode}/0102.Binary-Tree-Level-Order-Traversal/README.md (100%) rename {Algorithms => leetcode}/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go (100%) rename {Algorithms => leetcode}/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go (100%) rename {Algorithms => leetcode}/0103.Binary-Tree-Zigzag-Level-Order-Traversal/README.md (100%) rename {Algorithms => leetcode}/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go (100%) rename {Algorithms => leetcode}/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0104.Maximum-Depth-of-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go (100%) rename {Algorithms => leetcode}/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go (100%) rename {Algorithms => leetcode}/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md (100%) rename {Algorithms => leetcode}/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go (100%) rename {Algorithms => leetcode}/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go (100%) rename {Algorithms => leetcode}/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md (100%) rename {Algorithms => leetcode}/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go (100%) rename {Algorithms => leetcode}/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go (100%) rename {Algorithms => leetcode}/0107.Binary-Tree-Level-Order-Traversal-II/README.md (100%) rename {Algorithms => leetcode}/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go (100%) rename {Algorithms => leetcode}/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go (100%) rename {Algorithms => leetcode}/0108.Convert-Sorted-Array-to-Binary-Search-Tree/README.md (100%) rename {Algorithms => leetcode}/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go (100%) rename {Algorithms => leetcode}/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go (100%) rename {Algorithms => leetcode}/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md (100%) rename {Algorithms => leetcode}/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go (100%) rename {Algorithms => leetcode}/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0110.Balanced-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go (100%) rename {Algorithms => leetcode}/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0111.Minimum-Depth-of-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0112.Path-Sum/112. Path Sum.go (100%) rename {Algorithms => leetcode}/0112.Path-Sum/112. Path Sum_test.go (100%) rename {Algorithms => leetcode}/0112.Path-Sum/README.md (100%) rename {Algorithms => leetcode}/0113.Path-Sum-II/113. Path Sum II.go (100%) rename {Algorithms => leetcode}/0113.Path-Sum-II/113. Path Sum II_test.go (100%) rename {Algorithms => leetcode}/0113.Path-Sum-II/README.md (100%) rename {Algorithms => leetcode}/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go (100%) rename {Algorithms => leetcode}/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go (100%) rename {Algorithms => leetcode}/0114.Flatten-Binary-Tree-to-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0120.Triangle/120. Triangle.go (100%) rename {Algorithms => leetcode}/0120.Triangle/120. Triangle_test.go (100%) rename {Algorithms => leetcode}/0120.Triangle/README.md (100%) rename {Algorithms => leetcode}/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go (100%) rename {Algorithms => leetcode}/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go (100%) rename {Algorithms => leetcode}/0121.Best-Time-to-Buy-and-Sell-Stock/README.md (100%) rename {Algorithms => leetcode}/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go (100%) rename {Algorithms => leetcode}/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go (100%) rename {Algorithms => leetcode}/0122.Best-Time-to-Buy-and-Sell-Stock-II/README.md (100%) rename {Algorithms => leetcode}/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go (100%) rename {Algorithms => leetcode}/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go (100%) rename {Algorithms => leetcode}/0124.Binary-Tree-Maximum-Path-Sum/README.md (100%) rename {Algorithms => leetcode}/0125.Valid-Palindrome/125. Valid Palindrome.go (100%) rename {Algorithms => leetcode}/0125.Valid-Palindrome/125. Valid Palindrome_test.go (100%) rename {Algorithms => leetcode}/0125.Valid-Palindrome/README.md (100%) rename {Algorithms => leetcode}/0126.Word-Ladder-II/126. Word Ladder II.go (100%) rename {Algorithms => leetcode}/0126.Word-Ladder-II/126. Word Ladder II_test.go (100%) rename {Algorithms => leetcode}/0126.Word-Ladder-II/README.md (100%) rename {Algorithms => leetcode}/0127.Word-Ladder/127. Word Ladder.go (100%) rename {Algorithms => leetcode}/0127.Word-Ladder/127. Word Ladder_test.go (100%) rename {Algorithms => leetcode}/0127.Word-Ladder/README.md (100%) rename {Algorithms => leetcode}/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go (100%) rename {Algorithms => leetcode}/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go (100%) rename {Algorithms => leetcode}/0128.Longest-Consecutive-Sequence/README.md (100%) rename {Algorithms => leetcode}/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go (100%) rename {Algorithms => leetcode}/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go (100%) rename {Algorithms => leetcode}/0129.Sum-Root-to-Leaf-Numbers/README.md (100%) rename {Algorithms => leetcode}/0130.Surrounded-Regions/130. Surrounded Regions.go (100%) rename {Algorithms => leetcode}/0130.Surrounded-Regions/130. Surrounded Regions_test.go (100%) rename {Algorithms => leetcode}/0130.Surrounded-Regions/README.md (100%) rename {Algorithms => leetcode}/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go (100%) rename {Algorithms => leetcode}/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go (100%) rename {Algorithms => leetcode}/0131.Palindrome-Partitioning/README.md (100%) rename {Algorithms => leetcode}/0136.Single-Number/136. Single Number.go (100%) rename {Algorithms => leetcode}/0136.Single-Number/136. Single Number_test.go (100%) rename {Algorithms => leetcode}/0136.Single-Number/README.md (100%) rename {Algorithms => leetcode}/0137.Single-Number-II/137. Single Number II.go (100%) rename {Algorithms => leetcode}/0137.Single-Number-II/137. Single Number II_test.go (100%) rename {Algorithms => leetcode}/0137.Single-Number-II/README.md (100%) rename {Algorithms => leetcode}/0141.Linked-List-Cycle/141. Linked List Cycle.go (100%) rename {Algorithms => leetcode}/0141.Linked-List-Cycle/141. Linked List Cycle_test.go (100%) rename {Algorithms => leetcode}/0141.Linked-List-Cycle/README.md (100%) rename {Algorithms => leetcode}/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go (100%) rename {Algorithms => leetcode}/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go (100%) rename {Algorithms => leetcode}/0142.Linked-List-Cycle-II/README.md (100%) rename {Algorithms => leetcode}/0143.Reorder-List/143. Reorder List.go (100%) rename {Algorithms => leetcode}/0143.Reorder-List/143. Reorder List_test.go (100%) rename {Algorithms => leetcode}/0143.Reorder-List/README.md (76%) rename {Algorithms => leetcode}/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go (100%) rename {Algorithms => leetcode}/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go (100%) rename {Algorithms => leetcode}/0144.Binary-Tree-Preorder-Traversal/README.md (100%) rename {Algorithms => leetcode}/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go (100%) rename {Algorithms => leetcode}/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go (100%) rename {Algorithms => leetcode}/0145.Binary-Tree-Postorder-Traversal/README.md (100%) rename {Algorithms => leetcode}/0147.Insertion-Sort-List/147. Insertion Sort List.go (100%) rename {Algorithms => leetcode}/0147.Insertion-Sort-List/147. Insertion Sort List_test.go (100%) rename {Algorithms => leetcode}/0147.Insertion-Sort-List/README.md (100%) rename {Algorithms => leetcode}/0148.Sort-List/148. Sort List.go (100%) rename {Algorithms => leetcode}/0148.Sort-List/148. Sort List_test.go (100%) rename {Algorithms => leetcode}/0148.Sort-List/README.md (100%) rename {Algorithms => leetcode}/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go (100%) rename {Algorithms => leetcode}/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go (100%) rename {Algorithms => leetcode}/0150.Evaluate-Reverse-Polish-Notation/README.md (100%) rename {Algorithms => leetcode}/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go (100%) rename {Algorithms => leetcode}/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go (100%) rename {Algorithms => leetcode}/0151.Reverse-Words-in-a-String/README.md (100%) rename {Algorithms => leetcode}/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go (100%) rename {Algorithms => leetcode}/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go (100%) rename {Algorithms => leetcode}/0152.Maximum-Product-Subarray/README.md (100%) rename {Algorithms => leetcode}/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go (100%) rename {Algorithms => leetcode}/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go (100%) rename {Algorithms => leetcode}/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go (100%) rename {Algorithms => leetcode}/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go (100%) rename {Algorithms => leetcode}/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md (100%) rename {Algorithms => leetcode}/0155.Min-Stack/155. Min Stack.go (100%) rename {Algorithms => leetcode}/0155.Min-Stack/155. Min Stack_test.go (100%) rename {Algorithms => leetcode}/0155.Min-Stack/README.md (100%) rename {Algorithms => leetcode}/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go (100%) rename {Algorithms => leetcode}/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go (100%) rename {Algorithms => leetcode}/0160.Intersection-of-Two-Linked-Lists/README.md (100%) rename {Algorithms => leetcode}/0162.Find-Peak-Element/162. Find Peak Element.go (100%) rename {Algorithms => leetcode}/0162.Find-Peak-Element/162. Find Peak Element_test.go (100%) rename {Algorithms => leetcode}/0162.Find-Peak-Element/README.md (100%) rename {Algorithms => leetcode}/0164.Maximum-Gap/164. Maximum Gap.go (100%) rename {Algorithms => leetcode}/0164.Maximum-Gap/164. Maximum Gap_test.go (100%) rename {Algorithms => leetcode}/0164.Maximum-Gap/README.md (100%) rename {Algorithms => leetcode}/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go (100%) rename {Algorithms => leetcode}/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go (100%) rename {Algorithms => leetcode}/0167.Two-Sum-II---Input-array-is-sorted/README.md (100%) rename {Algorithms => leetcode}/0169.Majority-Element/169. Majority Element.go (100%) rename {Algorithms => leetcode}/0169.Majority-Element/169. Majority Element_test.go (100%) rename {Algorithms => leetcode}/0169.Majority-Element/README.md (100%) rename {Algorithms => leetcode}/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go (100%) rename {Algorithms => leetcode}/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go (100%) rename {Algorithms => leetcode}/0172.Factorial-Trailing-Zeroes/README.md (100%) rename {Algorithms => leetcode}/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go (100%) rename {Algorithms => leetcode}/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go (100%) rename {Algorithms => leetcode}/0173.Binary-Search-Tree-Iterator/README.md (100%) rename {Algorithms => leetcode}/0174.Dungeon-Game/174. Dungeon Game.go (100%) rename {Algorithms => leetcode}/0174.Dungeon-Game/174. Dungeon Game_test.go (100%) rename {Algorithms => leetcode}/0174.Dungeon-Game/README.md (100%) rename {Algorithms => leetcode}/0179.Largest-Number/179. Largest Number.go (100%) rename {Algorithms => leetcode}/0179.Largest-Number/179. Largest Number_test.go (100%) rename {Algorithms => leetcode}/0179.Largest-Number/README.md (100%) rename {Algorithms => leetcode}/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go (100%) rename {Algorithms => leetcode}/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go (100%) rename {Algorithms => leetcode}/0187.Repeated-DNA-Sequences/README.md (100%) rename {Algorithms => leetcode}/0190.Reverse-Bits/190. Reverse Bits.go (100%) rename {Algorithms => leetcode}/0190.Reverse-Bits/190. Reverse Bits_test.go (100%) rename {Algorithms => leetcode}/0190.Reverse-Bits/README.md (100%) rename {Algorithms => leetcode}/0191.Number-of-1-Bits/191. Number of 1 Bits.go (100%) rename {Algorithms => leetcode}/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go (100%) rename {Algorithms => leetcode}/0191.Number-of-1-Bits/README.md (100%) rename {Algorithms => leetcode}/0198.House-Robber/198. House Robber.go (100%) rename {Algorithms => leetcode}/0198.House-Robber/198. House Robber_test.go (100%) rename {Algorithms => leetcode}/0198.House-Robber/README.md (100%) rename {Algorithms => leetcode}/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go (100%) rename {Algorithms => leetcode}/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go (100%) rename {Algorithms => leetcode}/0199.Binary-Tree-Right-Side-View/README.md (100%) rename {Algorithms => leetcode}/0200.Number-of-Islands/200. Number of Islands.go (100%) rename {Algorithms => leetcode}/0200.Number-of-Islands/200. Number of Islands_test.go (100%) rename {Algorithms => leetcode}/0200.Number-of-Islands/README.md (100%) rename {Algorithms => leetcode}/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go (100%) rename {Algorithms => leetcode}/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go (100%) rename {Algorithms => leetcode}/0201.Bitwise-AND-of-Numbers-Range/README.md (100%) rename {Algorithms => leetcode}/0202.Happy-Number/202. Happy Number.go (100%) rename {Algorithms => leetcode}/0202.Happy-Number/202. Happy Number_test.go (100%) rename {Algorithms => leetcode}/0202.Happy-Number/README.md (100%) rename {Algorithms => leetcode}/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go (100%) rename {Algorithms => leetcode}/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go (100%) rename {Algorithms => leetcode}/0203.Remove-Linked-List-Elements/README.md (100%) rename {Algorithms => leetcode}/0204.Count-Primes/204. Count Primes.go (100%) rename {Algorithms => leetcode}/0204.Count-Primes/204. Count Primes_test.go (100%) rename {Algorithms => leetcode}/0204.Count-Primes/README.md (100%) rename {Algorithms => leetcode}/0205.Isomorphic-Strings/205. Isomorphic Strings.go (100%) rename {Algorithms => leetcode}/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go (100%) rename {Algorithms => leetcode}/0205.Isomorphic-Strings/README.md (100%) rename {Algorithms => leetcode}/0206.Reverse-Linked-List/206. Reverse Linked List.go (100%) rename {Algorithms => leetcode}/0206.Reverse-Linked-List/206. Reverse Linked List_test.go (100%) rename {Algorithms => leetcode}/0206.Reverse-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0207.Course-Schedule/207. Course Schedule.go (100%) rename {Algorithms => leetcode}/0207.Course-Schedule/207. Course Schedule_test.go (100%) rename {Algorithms => leetcode}/0207.Course-Schedule/README.md (100%) rename {Algorithms => leetcode}/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go (100%) rename {Algorithms => leetcode}/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go (100%) rename {Algorithms => leetcode}/0208.Implement-Trie-Prefix-Tree/README.md (100%) rename {Algorithms => leetcode}/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go (100%) rename {Algorithms => leetcode}/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go (100%) rename {Algorithms => leetcode}/0209.Minimum-Size-Subarray-Sum/README.md (100%) rename {Algorithms => leetcode}/0210.Course-Schedule-II/210. Course Schedule II.go (100%) rename {Algorithms => leetcode}/0210.Course-Schedule-II/210. Course Schedule II_test.go (100%) rename {Algorithms => leetcode}/0210.Course-Schedule-II/README.md (100%) rename {Algorithms => leetcode}/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go (100%) rename {Algorithms => leetcode}/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go (100%) rename {Algorithms => leetcode}/0211.Add-and-Search-Word---Data-structure-design/README.md (100%) rename {Algorithms => leetcode}/0212.Word-Search-II/212. Word Search II.go (100%) rename {Algorithms => leetcode}/0212.Word-Search-II/212. Word Search II_test.go (100%) rename {Algorithms => leetcode}/0212.Word-Search-II/README.md (100%) rename {Algorithms => leetcode}/0213.House-Robber-II/213. House Robber II.go (100%) rename {Algorithms => leetcode}/0213.House-Robber-II/213. House Robber II_test.go (100%) rename {Algorithms => leetcode}/0213.House-Robber-II/README.md (100%) rename {Algorithms => leetcode}/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go (100%) rename {Algorithms => leetcode}/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go (100%) rename {Algorithms => leetcode}/0215.Kth-Largest-Element-in-an-Array/README.md (100%) rename {Algorithms => leetcode}/0216.Combination-Sum-III/216. Combination Sum III.go (100%) rename {Algorithms => leetcode}/0216.Combination-Sum-III/216. Combination Sum III_test.go (100%) rename {Algorithms => leetcode}/0216.Combination-Sum-III/README.md (100%) rename {Algorithms => leetcode}/0217.Contains-Duplicate/217. Contains Duplicate.go (100%) rename {Algorithms => leetcode}/0217.Contains-Duplicate/217. Contains Duplicate_test.go (100%) rename {Algorithms => leetcode}/0217.Contains-Duplicate/README.md (100%) rename {Algorithms => leetcode}/0218.The-Skyline-Problem/218. The Skyline Problem.go (100%) rename {Algorithms => leetcode}/0218.The-Skyline-Problem/218. The Skyline Problem_test.go (100%) rename {Algorithms => leetcode}/0218.The-Skyline-Problem/README.md (100%) rename {Algorithms => leetcode}/0219.Contains-Duplicate-II/219. Contains Duplicate II.go (100%) rename {Algorithms => leetcode}/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go (100%) rename {Algorithms => leetcode}/0219.Contains-Duplicate-II/README.md (100%) rename {Algorithms => leetcode}/0220.Contains-Duplicate-III/220. Contains Duplicate III.go (100%) rename {Algorithms => leetcode}/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go (100%) rename {Algorithms => leetcode}/0220.Contains-Duplicate-III/README.md (100%) rename {Algorithms => leetcode}/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go (100%) rename {Algorithms => leetcode}/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go (100%) rename {Algorithms => leetcode}/0222.Count-Complete-Tree-Nodes/README.md (100%) rename {Algorithms => leetcode}/0223.Rectangle-Area/223. Rectangle Area.go (100%) rename {Algorithms => leetcode}/0223.Rectangle-Area/223. Rectangle Area_test.go (100%) rename {Algorithms => leetcode}/0223.Rectangle-Area/README.md (100%) rename {Algorithms => leetcode}/0224.Basic-Calculator/224. Basic Calculator.go (100%) rename {Algorithms => leetcode}/0224.Basic-Calculator/224. Basic Calculator_test.go (100%) rename {Algorithms => leetcode}/0224.Basic-Calculator/README.md (100%) rename {Algorithms => leetcode}/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go (100%) rename {Algorithms => leetcode}/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go (100%) rename {Algorithms => leetcode}/0225.Implement-Stack-using-Queues/README.md (100%) rename {Algorithms => leetcode}/0226.Invert-Binary-Tree/226. Invert Binary Tree.go (100%) rename {Algorithms => leetcode}/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0226.Invert-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0229.Majority-Element-II/229. Majority Element II.go (100%) rename {Algorithms => leetcode}/0229.Majority-Element-II/229. Majority Element II_test.go (100%) rename {Algorithms => leetcode}/0229.Majority-Element-II/README.md (100%) rename {Algorithms => leetcode}/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go (100%) rename {Algorithms => leetcode}/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go (100%) rename {Algorithms => leetcode}/0230.Kth-Smallest-Element-in-a-BST/README.md (100%) rename {Algorithms => leetcode}/0231.Power-of-Two/231. Power of Two.go (100%) rename {Algorithms => leetcode}/0231.Power-of-Two/231. Power of Two_test.go (100%) rename {Algorithms => leetcode}/0231.Power-of-Two/README.md (100%) rename {Algorithms => leetcode}/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go (100%) rename {Algorithms => leetcode}/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go (100%) rename {Algorithms => leetcode}/0232.Implement-Queue-using-Stacks/README.md (100%) rename {Algorithms => leetcode}/0234.Palindrome-Linked-List/234. Palindrome Linked List.go (100%) rename {Algorithms => leetcode}/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go (100%) rename {Algorithms => leetcode}/0234.Palindrome-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go (100%) rename {Algorithms => leetcode}/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go (100%) rename {Algorithms => leetcode}/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/README.md (100%) rename {Algorithms => leetcode}/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go (100%) rename {Algorithms => leetcode}/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go (100%) rename {Algorithms => leetcode}/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go (100%) rename {Algorithms => leetcode}/0237.Delete-Node-in-a-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go (100%) rename {Algorithms => leetcode}/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go (100%) rename {Algorithms => leetcode}/0239.Sliding-Window-Maximum/README.md (100%) rename {Algorithms => leetcode}/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go (100%) rename {Algorithms => leetcode}/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go (100%) rename {Algorithms => leetcode}/0240.Search-a-2D-Matrix-II/README.md (100%) rename {Algorithms => leetcode}/0242.Valid-Anagram/242. Valid Anagram.go (100%) rename {Algorithms => leetcode}/0242.Valid-Anagram/242. Valid Anagram_test.go (100%) rename {Algorithms => leetcode}/0242.Valid-Anagram/README.md (100%) rename {Algorithms => leetcode}/0257.Binary-Tree-Paths/257. Binary Tree Paths.go (100%) rename {Algorithms => leetcode}/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go (100%) rename {Algorithms => leetcode}/0257.Binary-Tree-Paths/README.md (100%) rename {Algorithms => leetcode}/0260.Single-Number-III/260. Single Number III.go (100%) rename {Algorithms => leetcode}/0260.Single-Number-III/260. Single Number III_test.go (100%) rename {Algorithms => leetcode}/0260.Single-Number-III/README.md (100%) rename {Algorithms => leetcode}/0263.Ugly-Number/263. Ugly Number.go (100%) rename {Algorithms => leetcode}/0263.Ugly-Number/263. Ugly Number_test.go (100%) rename {Algorithms => leetcode}/0263.Ugly-Number/README.md (100%) rename {Algorithms => leetcode}/0268.Missing-Number/268. Missing Number.go (100%) rename {Algorithms => leetcode}/0268.Missing-Number/268. Missing Number_test.go (100%) rename {Algorithms => leetcode}/0268.Missing-Number/README.md (100%) rename {Algorithms => leetcode}/0274.H-Index/274. H-Index.go (100%) rename {Algorithms => leetcode}/0274.H-Index/274. H-Index_test.go (100%) rename {Algorithms => leetcode}/0274.H-Index/README.md (100%) rename {Algorithms => leetcode}/0275.H-Index-II/275. H-Index II.go (100%) rename {Algorithms => leetcode}/0275.H-Index-II/275. H-Index II_test.go (100%) rename {Algorithms => leetcode}/0275.H-Index-II/README.md (100%) rename {Algorithms => leetcode}/0283.Move-Zeroes/283. Move Zeroes.go (100%) rename {Algorithms => leetcode}/0283.Move-Zeroes/283. Move Zeroes_test.go (100%) rename {Algorithms => leetcode}/0283.Move-Zeroes/README.md (100%) rename {Algorithms => leetcode}/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go (100%) rename {Algorithms => leetcode}/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go (100%) rename {Algorithms => leetcode}/0287.Find-the-Duplicate-Number/README.md (100%) rename {Algorithms => leetcode}/0290.Word-Pattern/290. Word Pattern.go (100%) rename {Algorithms => leetcode}/0290.Word-Pattern/290. Word Pattern_test.go (100%) rename {Algorithms => leetcode}/0290.Word-Pattern/README.md (100%) rename {Algorithms => leetcode}/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go (100%) rename {Algorithms => leetcode}/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go (100%) rename {Algorithms => leetcode}/0300.Longest-Increasing-Subsequence/README.md (100%) rename {Algorithms => leetcode}/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go (100%) rename {Algorithms => leetcode}/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go (100%) rename {Algorithms => leetcode}/0303.Range-Sum-Query---Immutable/README.md (100%) rename {Algorithms => leetcode}/0306.Additive-Number/306. Additive Number.go (100%) rename {Algorithms => leetcode}/0306.Additive-Number/306. Additive Number_test.go (100%) rename {Algorithms => leetcode}/0306.Additive-Number/README.md (100%) rename {Algorithms => leetcode}/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go (100%) rename {Algorithms => leetcode}/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go (100%) rename {Algorithms => leetcode}/0307.Range-Sum-Query---Mutable/README.md (100%) rename {Algorithms => leetcode}/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go (100%) rename {Algorithms => leetcode}/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go (100%) rename {Algorithms => leetcode}/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/README.md (100%) rename {Algorithms => leetcode}/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go (100%) rename {Algorithms => leetcode}/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go (100%) rename {Algorithms => leetcode}/0315.Count-of-Smaller-Numbers-After-Self/README.md (100%) rename {Algorithms => leetcode}/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go (100%) rename {Algorithms => leetcode}/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go (100%) rename {Algorithms => leetcode}/0318.Maximum-Product-of-Word-Lengths/README.md (100%) rename {Algorithms => leetcode}/0322.Coin-Change/322. Coin Change.go (100%) rename {Algorithms => leetcode}/0322.Coin-Change/322. Coin Change_test.go (100%) rename {Algorithms => leetcode}/0322.Coin-Change/README.md (100%) rename {Algorithms => leetcode}/0324.Wiggle-Sort-II/324. Wiggle Sort II.go (100%) rename {Algorithms => leetcode}/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go (100%) rename {Algorithms => leetcode}/0324.Wiggle-Sort-II/README.md (100%) rename {Algorithms => leetcode}/0326.Power-of-Three/326. Power of Three.go (100%) rename {Algorithms => leetcode}/0326.Power-of-Three/326. Power of Three_test.go (100%) rename {Algorithms => leetcode}/0326.Power-of-Three/README.md (100%) rename {Algorithms => leetcode}/0327.Count-of-Range-Sum/327. Count of Range Sum.go (100%) rename {Algorithms => leetcode}/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go (100%) rename {Algorithms => leetcode}/0327.Count-of-Range-Sum/README.md (100%) rename {Algorithms => leetcode}/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go (100%) rename {Algorithms => leetcode}/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go (100%) rename {Algorithms => leetcode}/0328.Odd-Even-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go (100%) rename {Algorithms => leetcode}/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go (100%) rename {Algorithms => leetcode}/0329.Longest-Increasing-Path-in-a-Matrix/README.md (100%) rename {Algorithms => leetcode}/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go (100%) rename {Algorithms => leetcode}/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0337.House-Robber-III/337. House Robber III.go (100%) rename {Algorithms => leetcode}/0337.House-Robber-III/337. House Robber III_test.go (100%) rename {Algorithms => leetcode}/0337.House-Robber-III/README.md (100%) rename {Algorithms => leetcode}/0338.Counting-Bits/338. Counting Bits.go (100%) rename {Algorithms => leetcode}/0338.Counting-Bits/338. Counting Bits_test.go (100%) rename {Algorithms => leetcode}/0338.Counting-Bits/README.md (100%) rename {Algorithms => leetcode}/0342.Power-of-Four/342. Power of Four.go (100%) rename {Algorithms => leetcode}/0342.Power-of-Four/342. Power of Four_test.go (100%) rename {Algorithms => leetcode}/0342.Power-of-Four/README.md (100%) rename {Algorithms => leetcode}/0343.Integer-Break/343. Integer Break.go (100%) rename {Algorithms => leetcode}/0343.Integer-Break/343. Integer Break_test.go (100%) rename {Algorithms => leetcode}/0343.Integer-Break/README.md (100%) rename {Algorithms => leetcode}/0344.Reverse-String/344. Reverse String.go (100%) rename {Algorithms => leetcode}/0344.Reverse-String/344. Reverse String_test.go (100%) rename {Algorithms => leetcode}/0344.Reverse-String/README.md (100%) rename {Algorithms => leetcode}/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go (100%) rename {Algorithms => leetcode}/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go (100%) rename {Algorithms => leetcode}/0345.Reverse-Vowels-of-a-String/README.md (100%) rename {Algorithms => leetcode}/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go (100%) rename {Algorithms => leetcode}/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go (100%) rename {Algorithms => leetcode}/0347.Top-K-Frequent-Elements/README.md (100%) rename {Algorithms => leetcode}/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go (100%) rename {Algorithms => leetcode}/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go (100%) rename {Algorithms => leetcode}/0349.Intersection-of-Two-Arrays/README.md (100%) rename {Algorithms => leetcode}/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go (100%) rename {Algorithms => leetcode}/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go (100%) rename {Algorithms => leetcode}/0350.Intersection-of-Two-Arrays-II/README.md (100%) rename {Algorithms => leetcode}/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go (100%) rename {Algorithms => leetcode}/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go (100%) rename {Algorithms => leetcode}/0354.Russian-Doll-Envelopes/README.md (100%) rename {Algorithms => leetcode}/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go (100%) rename {Algorithms => leetcode}/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go (100%) rename {Algorithms => leetcode}/0357.Count-Numbers-with-Unique-Digits/README.md (100%) rename {Algorithms => leetcode}/0367.Valid-Perfect-Square/367. Valid Perfect Square.go (100%) rename {Algorithms => leetcode}/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go (100%) rename {Algorithms => leetcode}/0367.Valid-Perfect-Square/README.md (100%) rename {Algorithms => leetcode}/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go (100%) rename {Algorithms => leetcode}/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go (100%) rename {Algorithms => leetcode}/0371.Sum-of-Two-Integers/README.md (100%) rename {Algorithms => leetcode}/0372.Super-Pow/372. Super Pow.go (100%) rename {Algorithms => leetcode}/0372.Super-Pow/372. Super Pow_test.go (100%) rename {Algorithms => leetcode}/0372.Super-Pow/README.md (100%) rename {Algorithms => leetcode}/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go (100%) rename {Algorithms => leetcode}/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go (100%) rename {Algorithms => leetcode}/0373.Find-K-Pairs-with-Smallest-Sums/README.md (100%) rename {Algorithms => leetcode}/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go (100%) rename {Algorithms => leetcode}/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go (100%) rename {Algorithms => leetcode}/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md (100%) rename {Algorithms => leetcode}/0385.Mini-Parser/385. Mini Parser.go (100%) rename {Algorithms => leetcode}/0385.Mini-Parser/385. Mini Parser_test.go (100%) rename {Algorithms => leetcode}/0385.Mini-Parser/README.md (100%) rename {Algorithms => leetcode}/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go (100%) rename {Algorithms => leetcode}/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go (100%) rename {Algorithms => leetcode}/0386.Lexicographical-Numbers/README.md (100%) rename {Algorithms => leetcode}/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go (100%) rename {Algorithms => leetcode}/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go (100%) rename {Algorithms => leetcode}/0387.First-Unique-Character-in-a-String/README.md (100%) rename {Algorithms => leetcode}/0389.Find-the-Difference/389. Find the Difference.go (100%) rename {Algorithms => leetcode}/0389.Find-the-Difference/389. Find the Difference_test.go (100%) rename {Algorithms => leetcode}/0389.Find-the-Difference/README.md (100%) rename {Algorithms => leetcode}/0392.Is-Subsequence/392. Is Subsequence.go (100%) rename {Algorithms => leetcode}/0392.Is-Subsequence/392. Is Subsequence_test.go (100%) rename {Algorithms => leetcode}/0392.Is-Subsequence/README.md (100%) rename {Algorithms => leetcode}/0393.UTF-8-Validation/393. UTF-8 Validation.go (100%) rename {Algorithms => leetcode}/0393.UTF-8-Validation/393. UTF-8 Validation_test.go (100%) rename {Algorithms => leetcode}/0393.UTF-8-Validation/README.md (100%) rename {Algorithms => leetcode}/0394.Decode-String/394. Decode String.go (100%) rename {Algorithms => leetcode}/0394.Decode-String/394. Decode String_test.go (100%) rename {Algorithms => leetcode}/0394.Decode-String/README.md (100%) rename {Algorithms => leetcode}/0397.Integer-Replacement/397. Integer Replacement.go (100%) rename {Algorithms => leetcode}/0397.Integer-Replacement/397. Integer Replacement_test.go (100%) rename {Algorithms => leetcode}/0397.Integer-Replacement/README.md (100%) rename {Algorithms => leetcode}/0399.Evaluate-Division/399. Evaluate Division.go (100%) rename {Algorithms => leetcode}/0399.Evaluate-Division/399. Evaluate Division_test.go (100%) rename {Algorithms => leetcode}/0399.Evaluate-Division/README.md (100%) rename {Algorithms => leetcode}/0401.Binary-Watch/401. Binary Watch.go (100%) rename {Algorithms => leetcode}/0401.Binary-Watch/401. Binary Watch_test.go (100%) rename {Algorithms => leetcode}/0401.Binary-Watch/README.md (100%) rename {Algorithms => leetcode}/0402.Remove-K-Digits/402. Remove K Digits.go (100%) rename {Algorithms => leetcode}/0402.Remove-K-Digits/402. Remove K Digits_test.go (100%) rename {Algorithms => leetcode}/0402.Remove-K-Digits/README.md (100%) rename {Algorithms => leetcode}/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go (100%) rename {Algorithms => leetcode}/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go (100%) rename {Algorithms => leetcode}/0404.Sum-of-Left-Leaves/README.md (100%) rename {Algorithms => leetcode}/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go (100%) rename {Algorithms => leetcode}/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go (100%) rename {Algorithms => leetcode}/0405.Convert-a-Number-to-Hexadecimal/README.md (100%) rename {Algorithms => leetcode}/0409.Longest-Palindrome/409. Longest Palindrome.go (100%) rename {Algorithms => leetcode}/0409.Longest-Palindrome/409. Longest Palindrome_test.go (100%) rename {Algorithms => leetcode}/0409.Longest-Palindrome/README.md (100%) rename {Algorithms => leetcode}/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go (100%) rename {Algorithms => leetcode}/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go (100%) rename {Algorithms => leetcode}/0410.Split-Array-Largest-Sum/README.md (100%) rename {Algorithms => leetcode}/0412.Fizz-Buzz/412. Fizz Buzz.go (100%) rename {Algorithms => leetcode}/0412.Fizz-Buzz/412. Fizz Buzz_test.go (100%) rename {Algorithms => leetcode}/0412.Fizz-Buzz/README.md (100%) rename {Algorithms => leetcode}/0414.Third-Maximum-Number/414. Third Maximum Number.go (100%) rename {Algorithms => leetcode}/0414.Third-Maximum-Number/414. Third Maximum Number_test.go (100%) rename {Algorithms => leetcode}/0414.Third-Maximum-Number/README.md (100%) rename {Algorithms => leetcode}/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go (100%) rename {Algorithms => leetcode}/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go (100%) rename {Algorithms => leetcode}/0416.Partition-Equal-Subset-Sum/README.md (100%) rename {Algorithms => leetcode}/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go (100%) rename {Algorithms => leetcode}/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go (100%) rename {Algorithms => leetcode}/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md (100%) rename {Algorithms => leetcode}/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go (100%) rename {Algorithms => leetcode}/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go (100%) rename {Algorithms => leetcode}/0424.Longest-Repeating-Character-Replacement/README.md (100%) rename {Algorithms => leetcode}/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go (100%) rename {Algorithms => leetcode}/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go (100%) rename {Algorithms => leetcode}/0433.Minimum-Genetic-Mutation/README.md (100%) rename {Algorithms => leetcode}/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go (100%) rename {Algorithms => leetcode}/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go (100%) rename {Algorithms => leetcode}/0435.Non-overlapping-Intervals/README.md (100%) rename {Algorithms => leetcode}/0436.Find-Right-Interval/436. Find Right Interval.go (100%) rename {Algorithms => leetcode}/0436.Find-Right-Interval/436. Find Right Interval_test.go (100%) rename {Algorithms => leetcode}/0436.Find-Right-Interval/README.md (100%) rename {Algorithms => leetcode}/0437.Path-Sum-III/437. Path Sum III.go (100%) rename {Algorithms => leetcode}/0437.Path-Sum-III/437. Path Sum III_test.go (100%) rename {Algorithms => leetcode}/0437.Path-Sum-III/README.md (100%) rename {Algorithms => leetcode}/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go (100%) rename {Algorithms => leetcode}/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go (100%) rename {Algorithms => leetcode}/0438.Find-All-Anagrams-in-a-String/README.md (100%) rename {Algorithms => leetcode}/0441.Arranging-Coins/441. Arranging Coins.go (100%) rename {Algorithms => leetcode}/0441.Arranging-Coins/441. Arranging Coins_test.go (100%) rename {Algorithms => leetcode}/0441.Arranging-Coins/README.md (100%) rename {Algorithms => leetcode}/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go (100%) rename {Algorithms => leetcode}/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go (100%) rename {Algorithms => leetcode}/0445.Add-Two-Numbers-II/README.md (100%) rename {Algorithms => leetcode}/0447.Number-of-Boomerangs/447. Number of Boomerangs.go (100%) rename {Algorithms => leetcode}/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go (100%) rename {Algorithms => leetcode}/0447.Number-of-Boomerangs/README.md (100%) rename {Algorithms => leetcode}/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go (100%) rename {Algorithms => leetcode}/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go (100%) rename {Algorithms => leetcode}/0451.Sort-Characters-By-Frequency/README.md (100%) rename {Algorithms => leetcode}/0454.4Sum-II/454. 4Sum II.go (100%) rename {Algorithms => leetcode}/0454.4Sum-II/454. 4Sum II_test.go (100%) rename {Algorithms => leetcode}/0454.4Sum-II/README.md (100%) rename {Algorithms => leetcode}/0455.Assign-Cookies/455. Assign Cookies.go (100%) rename {Algorithms => leetcode}/0455.Assign-Cookies/455. Assign Cookies_test.go (100%) rename {Algorithms => leetcode}/0455.Assign-Cookies/README.md (100%) rename {Algorithms => leetcode}/0456.132-Pattern/456. 132 Pattern.go (100%) rename {Algorithms => leetcode}/0456.132-Pattern/456. 132 Pattern_test.go (100%) rename {Algorithms => leetcode}/0456.132-Pattern/README.md (100%) rename {Algorithms => leetcode}/0457.Circular-Array-Loop/457. Circular Array Loop.go (100%) rename {Algorithms => leetcode}/0457.Circular-Array-Loop/457. Circular Array Loop_test.go (100%) rename {Algorithms => leetcode}/0457.Circular-Array-Loop/README.md (100%) rename {Algorithms => leetcode}/0461.Hamming-Distance/461. Hamming Distance.go (100%) rename {Algorithms => leetcode}/0461.Hamming-Distance/461. Hamming Distance_test.go (100%) rename {Algorithms => leetcode}/0461.Hamming-Distance/README.md (100%) rename {Algorithms => leetcode}/0463.Island-Perimeter/463. Island Perimeter.go (100%) rename {Algorithms => leetcode}/0463.Island-Perimeter/463. Island Perimeter_test.go (100%) rename {Algorithms => leetcode}/0463.Island-Perimeter/README.md (100%) rename {Algorithms => leetcode}/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go (100%) rename {Algorithms => leetcode}/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go (100%) rename {Algorithms => leetcode}/0470.Implement-Rand10-Using-Rand7/README.md (100%) rename {Algorithms => leetcode}/0474.Ones-and-Zeroes/474. Ones and Zeroes.go (100%) rename {Algorithms => leetcode}/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go (100%) rename {Algorithms => leetcode}/0474.Ones-and-Zeroes/README.md (100%) rename {Algorithms => leetcode}/0475.Heaters/475. Heaters.go (100%) rename {Algorithms => leetcode}/0475.Heaters/475. Heaters_test.go (100%) rename {Algorithms => leetcode}/0475.Heaters/README.md (100%) rename {Algorithms => leetcode}/0476.Number-Complement/476. Number Complement.go (100%) rename {Algorithms => leetcode}/0476.Number-Complement/476. Number Complement_test.go (100%) rename {Algorithms => leetcode}/0476.Number-Complement/README.md (100%) rename {Algorithms => leetcode}/0477.Total-Hamming-Distance/477. Total Hamming Distance.go (100%) rename {Algorithms => leetcode}/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go (100%) rename {Algorithms => leetcode}/0477.Total-Hamming-Distance/README.md (100%) rename {Algorithms => leetcode}/0480.Sliding-Window-Median/480. Sliding Window Median.go (100%) rename {Algorithms => leetcode}/0480.Sliding-Window-Median/480. Sliding Window Median_test.go (100%) rename {Algorithms => leetcode}/0480.Sliding-Window-Median/README.md (100%) rename {Algorithms => leetcode}/0483.Smallest-Good-Base/483. Smallest Good Base.go (100%) rename {Algorithms => leetcode}/0483.Smallest-Good-Base/483. Smallest Good Base_test.go (100%) rename {Algorithms => leetcode}/0483.Smallest-Good-Base/README.md (100%) rename {Algorithms => leetcode}/0491.Increasing-Subsequences/491. Increasing Subsequences.go (100%) rename {Algorithms => leetcode}/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go (100%) rename {Algorithms => leetcode}/0491.Increasing-Subsequences/README.md (100%) rename {Algorithms => leetcode}/0493.Reverse-Pairs/493. Reverse Pairs.go (100%) rename {Algorithms => leetcode}/0493.Reverse-Pairs/493. Reverse Pairs_test.go (100%) rename {Algorithms => leetcode}/0493.Reverse-Pairs/README.md (100%) rename {Algorithms => leetcode}/0494.Target-Sum/494. Target Sum.go (100%) rename {Algorithms => leetcode}/0494.Target-Sum/494. Target Sum_test.go (100%) rename {Algorithms => leetcode}/0494.Target-Sum/README.md (100%) rename {Algorithms => leetcode}/0496.Next-Greater-Element-I/496. Next Greater Element I.go (100%) rename {Algorithms => leetcode}/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go (100%) rename {Algorithms => leetcode}/0496.Next-Greater-Element-I/README.md (100%) rename {Algorithms => leetcode}/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go (100%) rename {Algorithms => leetcode}/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go (100%) rename {Algorithms => leetcode}/0497.Random-Point-in-Non-overlapping-Rectangles/README.md (100%) rename {Algorithms => leetcode}/0498.Diagonal-Traverse/498. Diagonal Traverse.go (100%) rename {Algorithms => leetcode}/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go (100%) rename {Algorithms => leetcode}/0498.Diagonal-Traverse/README.md (100%) rename {Algorithms => leetcode}/0500.Keyboard-Row/500. Keyboard Row.go (100%) rename {Algorithms => leetcode}/0500.Keyboard-Row/500. Keyboard Row_test.go (100%) rename {Algorithms => leetcode}/0500.Keyboard-Row/README.md (100%) rename {Algorithms => leetcode}/0503.Next-Greater-Element-II/503. Next Greater Element II.go (100%) rename {Algorithms => leetcode}/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go (100%) rename {Algorithms => leetcode}/0503.Next-Greater-Element-II/README.md (100%) rename {Algorithms => leetcode}/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go (100%) rename {Algorithms => leetcode}/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go (100%) rename {Algorithms => leetcode}/0508.Most-Frequent-Subtree-Sum/README.md (100%) rename {Algorithms => leetcode}/0509.Fibonacci-Number/509. Fibonacci Number.go (100%) rename {Algorithms => leetcode}/0509.Fibonacci-Number/509. Fibonacci Number_test.go (100%) rename {Algorithms => leetcode}/0509.Fibonacci-Number/README.md (100%) rename {Algorithms => leetcode}/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go (100%) rename {Algorithms => leetcode}/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go (100%) rename {Algorithms => leetcode}/0513.Find-Bottom-Left-Tree-Value/README.md (100%) rename {Algorithms => leetcode}/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go (100%) rename {Algorithms => leetcode}/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go (100%) rename {Algorithms => leetcode}/0515.Find-Largest-Value-in-Each-Tree-Row/README.md (100%) rename {Algorithms => leetcode}/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go (100%) rename {Algorithms => leetcode}/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go (100%) rename {Algorithms => leetcode}/0524.Longest-Word-in-Dictionary-through-Deleting/README.md (100%) rename {Algorithms => leetcode}/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go (100%) rename {Algorithms => leetcode}/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go (100%) rename {Algorithms => leetcode}/0526.Beautiful-Arrangement/README.md (100%) rename {Algorithms => leetcode}/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go (100%) rename {Algorithms => leetcode}/0528.Random-Pick-with-Weight/528. Random Pick with Weight_test.go (100%) rename {Algorithms => leetcode}/0528.Random-Pick-with-Weight/README.md (100%) rename {Algorithms => leetcode}/0529.Minesweeper/529. Minesweeper.go (100%) rename {Algorithms => leetcode}/0529.Minesweeper/529. Minesweeper_test.go (100%) rename {Algorithms => leetcode}/0529.Minesweeper/README.md (100%) rename {Algorithms => leetcode}/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array.go (100%) rename {Algorithms => leetcode}/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array_test.go (100%) rename {Algorithms => leetcode}/0532.K-diff-Pairs-in-an-Array/README.md (100%) rename {Algorithms => leetcode}/0541.Reverse-String-II/541. Reverse String II.go (100%) rename {Algorithms => leetcode}/0541.Reverse-String-II/541. Reverse String II_test.go (100%) rename {Algorithms => leetcode}/0541.Reverse-String-II/README.md (100%) rename {Algorithms => leetcode}/0542.01-Matrix/542. 01 Matrix.go (100%) rename {Algorithms => leetcode}/0542.01-Matrix/542. 01 Matrix_test.go (100%) rename {Algorithms => leetcode}/0542.01-Matrix/README.md (100%) rename {Algorithms => leetcode}/0547.Friend-Circles/547. Friend Circles.go (100%) rename {Algorithms => leetcode}/0547.Friend-Circles/547. Friend Circles_test.go (100%) rename {Algorithms => leetcode}/0547.Friend-Circles/README.md (100%) rename {Algorithms => leetcode}/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III.go (100%) rename {Algorithms => leetcode}/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III_test.go (100%) rename {Algorithms => leetcode}/0557.Reverse-Words-in-a-String-III/README.md (100%) rename {Algorithms => leetcode}/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go (100%) rename {Algorithms => leetcode}/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go (100%) rename {Algorithms => leetcode}/0563.Binary-Tree-Tilt/README.md (100%) rename {Algorithms => leetcode}/0566.Reshape-the-Matrix/566. Reshape the Matrix.go (100%) rename {Algorithms => leetcode}/0566.Reshape-the-Matrix/566. Reshape the Matrix_test.go (100%) rename {Algorithms => leetcode}/0566.Reshape-the-Matrix/README.md (100%) rename {Algorithms => leetcode}/0567.Permutation-in-String/567. Permutation in String.go (100%) rename {Algorithms => leetcode}/0567.Permutation-in-String/567. Permutation in String_test.go (100%) rename {Algorithms => leetcode}/0567.Permutation-in-String/README.md (100%) rename {Algorithms => leetcode}/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go (100%) rename {Algorithms => leetcode}/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go (100%) rename {Algorithms => leetcode}/0572.Subtree-of-Another-Tree/README.md (100%) rename {Algorithms => leetcode}/0575.Distribute-Candies/575. Distribute Candies.go (100%) rename {Algorithms => leetcode}/0575.Distribute-Candies/575. Distribute Candies_test.go (100%) rename {Algorithms => leetcode}/0575.Distribute-Candies/README.md (100%) rename {Algorithms => leetcode}/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence.go (100%) rename {Algorithms => leetcode}/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go (100%) rename {Algorithms => leetcode}/0594.Longest-Harmonious-Subsequence/README.md (100%) rename {Algorithms => leetcode}/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists.go (100%) rename {Algorithms => leetcode}/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists_test.go (100%) rename {Algorithms => leetcode}/0599.Minimum-Index-Sum-of-Two-Lists/README.md (100%) rename {Algorithms => leetcode}/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go (100%) rename {Algorithms => leetcode}/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers_test.go (100%) rename {Algorithms => leetcode}/0628.Maximum-Product-of-Three-Numbers/README.md (100%) rename {Algorithms => leetcode}/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists.go (100%) rename {Algorithms => leetcode}/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists_test.go (100%) rename {Algorithms => leetcode}/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md (100%) rename {Algorithms => leetcode}/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers.go (100%) rename {Algorithms => leetcode}/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers_test.go (100%) rename {Algorithms => leetcode}/0633.Sum-of-Square-Numbers/README.md (100%) rename {Algorithms => leetcode}/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions.go (100%) rename {Algorithms => leetcode}/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions_test.go (100%) rename {Algorithms => leetcode}/0636.Exclusive-Time-of-Functions/README.md (100%) rename {Algorithms => leetcode}/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree.go (100%) rename {Algorithms => leetcode}/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0637.Average-of-Levels-in-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0638.Shopping-Offers/638. Shopping Offers.go (100%) rename {Algorithms => leetcode}/0638.Shopping-Offers/638. Shopping Offers_test.go (100%) rename {Algorithms => leetcode}/0638.Shopping-Offers/README.md (100%) rename {Algorithms => leetcode}/0645.Set-Mismatch/645. Set Mismatch.go (100%) rename {Algorithms => leetcode}/0645.Set-Mismatch/645. Set Mismatch_test.go (100%) rename {Algorithms => leetcode}/0645.Set-Mismatch/README.md (100%) rename {Algorithms => leetcode}/0648.Replace-Words/648. Replace Words.go (100%) rename {Algorithms => leetcode}/0648.Replace-Words/648. Replace Words_test.go (100%) rename {Algorithms => leetcode}/0648.Replace-Words/README.md (100%) rename {Algorithms => leetcode}/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go (100%) rename {Algorithms => leetcode}/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go (100%) rename {Algorithms => leetcode}/0653.Two-Sum-IV---Input-is-a-BST/README.md (100%) rename {Algorithms => leetcode}/0658.Find-K-Closest-Elements/658. Find K Closest Elements.go (100%) rename {Algorithms => leetcode}/0658.Find-K-Closest-Elements/658. Find K Closest Elements_test.go (100%) rename {Algorithms => leetcode}/0658.Find-K-Closest-Elements/README.md (100%) rename {Algorithms => leetcode}/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree.go (100%) rename {Algorithms => leetcode}/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0662.Maximum-Width-of-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table.go (100%) rename {Algorithms => leetcode}/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table_test.go (100%) rename {Algorithms => leetcode}/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md (100%) rename {Algorithms => leetcode}/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary.go (100%) rename {Algorithms => leetcode}/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary_test.go (100%) rename {Algorithms => leetcode}/0676.Implement-Magic-Dictionary/README.md (100%) rename {Algorithms => leetcode}/0682.Baseball-Game/682. Baseball Game.go (100%) rename {Algorithms => leetcode}/0682.Baseball-Game/682. Baseball Game_test.go (100%) rename {Algorithms => leetcode}/0682.Baseball-Game/README.md (100%) rename {Algorithms => leetcode}/0684.Redundant-Connection/684. Redundant Connection.go (100%) rename {Algorithms => leetcode}/0684.Redundant-Connection/684. Redundant Connection_test.go (100%) rename {Algorithms => leetcode}/0684.Redundant-Connection/README.md (100%) rename {Algorithms => leetcode}/0685.Redundant-Connection-II/685. Redundant Connection II.go (100%) rename {Algorithms => leetcode}/0685.Redundant-Connection-II/685. Redundant Connection II_test.go (100%) rename {Algorithms => leetcode}/0685.Redundant-Connection-II/README.md (100%) rename {Algorithms => leetcode}/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits.go (100%) rename {Algorithms => leetcode}/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits_test.go (100%) rename {Algorithms => leetcode}/0693.Binary-Number-with-Alternating-Bits/README.md (100%) rename {Algorithms => leetcode}/0695.Max-Area-of-Island/695. Max Area of Island.go (100%) rename {Algorithms => leetcode}/0695.Max-Area-of-Island/695. Max Area of Island_test.go (100%) rename {Algorithms => leetcode}/0695.Max-Area-of-Island/README.md (100%) rename {Algorithms => leetcode}/0699.Falling-Squares/699. Falling Squares.go (100%) rename {Algorithms => leetcode}/0699.Falling-Squares/699. Falling Squares_test.go (100%) rename {Algorithms => leetcode}/0699.Falling-Squares/README.md (100%) rename {Algorithms => leetcode}/0704.Binary-Search/704. Binary Search.go (100%) rename {Algorithms => leetcode}/0704.Binary-Search/704. Binary Search_test.go (100%) rename {Algorithms => leetcode}/0704.Binary-Search/README.md (100%) rename {Algorithms => leetcode}/0705.Design-HashSet/705. Design HashSet.go (100%) rename {Algorithms => leetcode}/0705.Design-HashSet/705. Design HashSet_test.go (100%) rename {Algorithms => leetcode}/0705.Design-HashSet/README.md (100%) rename {Algorithms => leetcode}/0706.Design-HashMap/706. Design HashMap.go (100%) rename {Algorithms => leetcode}/0706.Design-HashMap/706. Design HashMap_test.go (100%) rename {Algorithms => leetcode}/0706.Design-HashMap/README.md (100%) rename {Algorithms => leetcode}/0707.Design-Linked-List/707. Design Linked List.go (100%) rename {Algorithms => leetcode}/0707.Design-Linked-List/707. Design Linked List_test.go (100%) rename {Algorithms => leetcode}/0707.Design-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist.go (100%) rename {Algorithms => leetcode}/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist_test.go (100%) rename {Algorithms => leetcode}/0710.Random-Pick-with-Blacklist/README.md (100%) rename {Algorithms => leetcode}/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K.go (100%) rename {Algorithms => leetcode}/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K_test.go (100%) rename {Algorithms => leetcode}/0713.Subarray-Product-Less-Than-K/README.md (100%) rename {Algorithms => leetcode}/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee.go (100%) rename {Algorithms => leetcode}/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee_test.go (100%) rename {Algorithms => leetcode}/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/README.md (100%) rename {Algorithms => leetcode}/0715.Range-Module/715. Range Module.go (100%) rename {Algorithms => leetcode}/0715.Range-Module/715. Range Module_test.go (100%) rename {Algorithms => leetcode}/0715.Range-Module/README.md (100%) rename {Algorithms => leetcode}/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters.go (100%) rename {Algorithms => leetcode}/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters_test.go (100%) rename {Algorithms => leetcode}/0717.1-bit-and-2-bit-Characters/README.md (93%) rename {Algorithms => leetcode}/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray.go (100%) rename {Algorithms => leetcode}/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray_test.go (100%) rename {Algorithms => leetcode}/0718.Maximum-Length-of-Repeated-Subarray/README.md (100%) rename {Algorithms => leetcode}/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance.go (100%) rename {Algorithms => leetcode}/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance_test.go (100%) rename {Algorithms => leetcode}/0719.Find-K-th-Smallest-Pair-Distance/README.md (100%) rename {Algorithms => leetcode}/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary.go (100%) rename {Algorithms => leetcode}/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary_test.go (100%) rename {Algorithms => leetcode}/0720.Longest-Word-in-Dictionary/README.md (100%) rename {Algorithms => leetcode}/0721.Accounts-Merge/721. Accounts Merge.go (100%) rename {Algorithms => leetcode}/0721.Accounts-Merge/721. Accounts Merge_test.go (100%) rename {Algorithms => leetcode}/0721.Accounts-Merge/README.md (100%) rename {Algorithms => leetcode}/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go (100%) rename {Algorithms => leetcode}/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go (100%) rename {Algorithms => leetcode}/0725.Split-Linked-List-in-Parts/README.md (100%) rename {Algorithms => leetcode}/0726.Number-of-Atoms/726. Number of Atoms.go (100%) rename {Algorithms => leetcode}/0726.Number-of-Atoms/726. Number of Atoms_test.go (100%) rename {Algorithms => leetcode}/0726.Number-of-Atoms/README.md (100%) rename {Algorithms => leetcode}/0729.My-Calendar-I/729. My Calendar I.go (100%) rename {Algorithms => leetcode}/0729.My-Calendar-I/729. My Calendar I_test.go (100%) rename {Algorithms => leetcode}/0729.My-Calendar-I/README.md (100%) rename {Algorithms => leetcode}/0732.My-Calendar-III/732. My Calendar III.go (100%) rename {Algorithms => leetcode}/0732.My-Calendar-III/732. My Calendar III_test.go (100%) rename {Algorithms => leetcode}/0732.My-Calendar-III/README.md (100%) rename {Algorithms => leetcode}/0733.Flood-Fill/733. Flood Fill.go (100%) rename {Algorithms => leetcode}/0733.Flood-Fill/733. Flood Fill_test.go (100%) rename {Algorithms => leetcode}/0733.Flood-Fill/README.md (100%) rename {Algorithms => leetcode}/0735.Asteroid-Collision/735. Asteroid Collision.go (100%) rename {Algorithms => leetcode}/0735.Asteroid-Collision/735. Asteroid Collision_test.go (100%) rename {Algorithms => leetcode}/0735.Asteroid-Collision/README.md (100%) rename {Algorithms => leetcode}/0739.Daily-Temperatures/739. Daily Temperatures.go (100%) rename {Algorithms => leetcode}/0739.Daily-Temperatures/739. Daily Temperatures_test.go (100%) rename {Algorithms => leetcode}/0739.Daily-Temperatures/README.md (100%) rename {Algorithms => leetcode}/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target.go (100%) rename {Algorithms => leetcode}/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target_test.go (100%) rename {Algorithms => leetcode}/0744.Find-Smallest-Letter-Greater-Than-Target/README.md (100%) rename {Algorithms => leetcode}/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search.go (100%) rename {Algorithms => leetcode}/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search_test.go (100%) rename {Algorithms => leetcode}/0745.Prefix-and-Suffix-Search/README.md (100%) rename {Algorithms => leetcode}/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs.go (100%) rename {Algorithms => leetcode}/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs_test.go (100%) rename {Algorithms => leetcode}/0746.Min-Cost-Climbing-Stairs/README.md (100%) rename {Algorithms => leetcode}/0748.Shortest-Completing-Word/748. Shortest Completing Word.go (100%) rename {Algorithms => leetcode}/0748.Shortest-Completing-Word/748. Shortest Completing Word_test.go (100%) rename {Algorithms => leetcode}/0748.Shortest-Completing-Word/README.md (100%) rename {Algorithms => leetcode}/0753.Cracking-the-Safe/753. Cracking the Safe.go (100%) rename {Algorithms => leetcode}/0753.Cracking-the-Safe/753. Cracking the Safe_test.go (100%) rename {Algorithms => leetcode}/0753.Cracking-the-Safe/README.md (100%) rename {Algorithms => leetcode}/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix.go (100%) rename {Algorithms => leetcode}/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix_test.go (100%) rename {Algorithms => leetcode}/0756.Pyramid-Transition-Matrix/README.md (100%) rename {Algorithms => leetcode}/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation.go (100%) rename {Algorithms => leetcode}/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation_test.go (100%) rename {Algorithms => leetcode}/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md (100%) rename {Algorithms => leetcode}/0763.Partition-Labels/763. Partition Labels.go (100%) rename {Algorithms => leetcode}/0763.Partition-Labels/763. Partition Labels_test.go (100%) rename {Algorithms => leetcode}/0763.Partition-Labels/README.md (100%) rename {Algorithms => leetcode}/0765.Couples-Holding-Hands/765. Couples Holding Hands.go (100%) rename {Algorithms => leetcode}/0765.Couples-Holding-Hands/765. Couples Holding Hands_test.go (100%) rename {Algorithms => leetcode}/0765.Couples-Holding-Hands/README.md (100%) rename {Algorithms => leetcode}/0766.Toeplitz-Matrix/766. Toeplitz Matrix.go (100%) rename {Algorithms => leetcode}/0766.Toeplitz-Matrix/766. Toeplitz Matrix_test.go (100%) rename {Algorithms => leetcode}/0766.Toeplitz-Matrix/README.md (100%) rename {Algorithms => leetcode}/0767.Reorganize-String/767. Reorganize String.go (100%) rename {Algorithms => leetcode}/0767.Reorganize-String/767. Reorganize String_test.go (100%) rename {Algorithms => leetcode}/0767.Reorganize-String/README.md (100%) rename {Algorithms => leetcode}/0771.Jewels-and-Stones/771. Jewels and Stones.go (100%) rename {Algorithms => leetcode}/0771.Jewels-and-Stones/771. Jewels and Stones_test.go (100%) rename {Algorithms => leetcode}/0771.Jewels-and-Stones/README.md (100%) rename {Algorithms => leetcode}/0778.Swim-in-Rising-Water/778. Swim in Rising Water.go (100%) rename {Algorithms => leetcode}/0778.Swim-in-Rising-Water/778. Swim in Rising Water_test.go (100%) rename {Algorithms => leetcode}/0778.Swim-in-Rising-Water/README.md (100%) rename {Algorithms => leetcode}/0781.Rabbits-in-Forest/781. Rabbits in Forest.go (100%) rename {Algorithms => leetcode}/0781.Rabbits-in-Forest/781. Rabbits in Forest_test.go (100%) rename {Algorithms => leetcode}/0781.Rabbits-in-Forest/README.md (100%) rename {Algorithms => leetcode}/0784.Letter-Case-Permutation/784. Letter Case Permutation.go (100%) rename {Algorithms => leetcode}/0784.Letter-Case-Permutation/784. Letter Case Permutation_test.go (100%) rename {Algorithms => leetcode}/0784.Letter-Case-Permutation/README.md (100%) rename {Algorithms => leetcode}/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction.go (100%) rename {Algorithms => leetcode}/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction_test.go (100%) rename {Algorithms => leetcode}/0786.K-th-Smallest-Prime-Fraction/README.md (100%) rename {Algorithms => leetcode}/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function.go (100%) rename {Algorithms => leetcode}/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function_test.go (100%) rename {Algorithms => leetcode}/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md (100%) rename {Algorithms => leetcode}/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States.go (100%) rename {Algorithms => leetcode}/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States_test.go (100%) rename {Algorithms => leetcode}/0802.Find-Eventual-Safe-States/README.md (100%) rename {Algorithms => leetcode}/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit.go (100%) rename {Algorithms => leetcode}/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit_test.go (100%) rename {Algorithms => leetcode}/0803.Bricks-Falling-When-Hit/README.md (100%) rename {Algorithms => leetcode}/0811.Subdomain-Visit-Count/811. Subdomain Visit Count.go (100%) rename {Algorithms => leetcode}/0811.Subdomain-Visit-Count/811. Subdomain Visit Count_test.go (100%) rename {Algorithms => leetcode}/0811.Subdomain-Visit-Count/README.md (100%) rename {Algorithms => leetcode}/0815.Bus-Routes/815. Bus Routes.go (100%) rename {Algorithms => leetcode}/0815.Bus-Routes/815. Bus Routes_test.go (100%) rename {Algorithms => leetcode}/0815.Bus-Routes/README.md (100%) rename {Algorithms => leetcode}/0817.Linked-List-Components/817. Linked List Components.go (100%) rename {Algorithms => leetcode}/0817.Linked-List-Components/817. Linked List Components_test.go (100%) rename {Algorithms => leetcode}/0817.Linked-List-Components/README.md (100%) rename {Algorithms => leetcode}/0819.Most-Common-Word/819. Most Common Word.go (100%) rename {Algorithms => leetcode}/0819.Most-Common-Word/819. Most Common Word_test.go (100%) rename {Algorithms => leetcode}/0819.Most-Common-Word/README.md (100%) rename {Algorithms => leetcode}/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work.go (100%) rename {Algorithms => leetcode}/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work_test.go (100%) rename {Algorithms => leetcode}/0826.Most-Profit-Assigning-Work/README.md (100%) rename {Algorithms => leetcode}/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go (100%) rename {Algorithms => leetcode}/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go (100%) rename {Algorithms => leetcode}/0828.COPYRIGHT-PROBLEM-XXX/README.md (100%) rename {Algorithms => leetcode}/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree.go (100%) rename {Algorithms => leetcode}/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree_test.go (100%) rename {Algorithms => leetcode}/0834.Sum-of-Distances-in-Tree/README.md (100%) rename {Algorithms => leetcode}/0836.Rectangle-Overlap/836. Rectangle Overlap.go (100%) rename {Algorithms => leetcode}/0836.Rectangle-Overlap/836. Rectangle Overlap_test.go (100%) rename {Algorithms => leetcode}/0836.Rectangle-Overlap/README.md (100%) rename {Algorithms => leetcode}/0838.Push-Dominoes/838. Push Dominoes.go (100%) rename {Algorithms => leetcode}/0838.Push-Dominoes/838. Push Dominoes_test.go (100%) rename {Algorithms => leetcode}/0838.Push-Dominoes/README.md (100%) rename {Algorithms => leetcode}/0839.Similar-String-Groups/839. Similar String Groups.go (100%) rename {Algorithms => leetcode}/0839.Similar-String-Groups/839. Similar String Groups_test.go (100%) rename {Algorithms => leetcode}/0839.Similar-String-Groups/README.md (100%) rename {Algorithms => leetcode}/0841.Keys-and-Rooms/841. Keys and Rooms.go (100%) rename {Algorithms => leetcode}/0841.Keys-and-Rooms/841. Keys and Rooms_test.go (100%) rename {Algorithms => leetcode}/0841.Keys-and-Rooms/README.md (100%) rename {Algorithms => leetcode}/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go (100%) rename {Algorithms => leetcode}/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence_test.go (100%) rename {Algorithms => leetcode}/0842.Split-Array-into-Fibonacci-Sequence/README.md (100%) rename {Algorithms => leetcode}/0844.Backspace-String-Compare/844. Backspace String Compare.go (100%) rename {Algorithms => leetcode}/0844.Backspace-String-Compare/844. Backspace String Compare_test.go (100%) rename {Algorithms => leetcode}/0844.Backspace-String-Compare/README.md (100%) rename {Algorithms => leetcode}/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array.go (100%) rename {Algorithms => leetcode}/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array_test.go (100%) rename {Algorithms => leetcode}/0845.Longest-Mountain-in-Array/README.md (100%) rename {Algorithms => leetcode}/0850.Rectangle-Area-II/850. Rectangle Area II.go (100%) rename {Algorithms => leetcode}/0850.Rectangle-Area-II/850. Rectangle Area II_test.go (100%) rename {Algorithms => leetcode}/0850.Rectangle-Area-II/README.md (100%) rename {Algorithms => leetcode}/0851.Loud-and-Rich/851. Loud and Rich.go (100%) rename {Algorithms => leetcode}/0851.Loud-and-Rich/851. Loud and Rich_test.go (100%) rename {Algorithms => leetcode}/0851.Loud-and-Rich/README.md (100%) rename {Algorithms => leetcode}/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array.go (100%) rename {Algorithms => leetcode}/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array_test.go (100%) rename {Algorithms => leetcode}/0852.Peak-Index-in-a-Mountain-Array/README.md (100%) rename {Algorithms => leetcode}/0853.Car-Fleet/853. Car Fleet.go (100%) rename {Algorithms => leetcode}/0853.Car-Fleet/853. Car Fleet_test.go (100%) rename {Algorithms => leetcode}/0853.Car-Fleet/README.md (100%) rename {Algorithms => leetcode}/0856.Score-of-Parentheses/856. Score of Parentheses.go (100%) rename {Algorithms => leetcode}/0856.Score-of-Parentheses/856. Score of Parentheses_test.go (100%) rename {Algorithms => leetcode}/0856.Score-of-Parentheses/README.md (100%) rename {Algorithms => leetcode}/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K.go (100%) rename {Algorithms => leetcode}/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K_test.go (100%) rename {Algorithms => leetcode}/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md (100%) rename {Algorithms => leetcode}/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree.go (100%) rename {Algorithms => leetcode}/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys.go (100%) rename {Algorithms => leetcode}/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys_test.go (100%) rename {Algorithms => leetcode}/0864.Shortest-Path-to-Get-All-Keys/README.md (100%) rename {Algorithms => leetcode}/0867.Transpose-Matrix/867. Transpose Matrix.go (100%) rename {Algorithms => leetcode}/0867.Transpose-Matrix/867. Transpose Matrix_test.go (100%) rename {Algorithms => leetcode}/0867.Transpose-Matrix/README.md (100%) rename {Algorithms => leetcode}/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees.go (100%) rename {Algorithms => leetcode}/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees_test.go (100%) rename {Algorithms => leetcode}/0872.Leaf-Similar-Trees/README.md (100%) rename {Algorithms => leetcode}/0875.Koko-Eating-Bananas/875. Koko Eating Bananas.go (100%) rename {Algorithms => leetcode}/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go (100%) rename {Algorithms => leetcode}/0875.Koko-Eating-Bananas/README.md (100%) rename {Algorithms => leetcode}/0876.Middle-of-the-Linked-List/876. Middle of the Linked List.go (100%) rename {Algorithms => leetcode}/0876.Middle-of-the-Linked-List/876. Middle of the Linked List_test.go (100%) rename {Algorithms => leetcode}/0876.Middle-of-the-Linked-List/README.md (100%) rename {Algorithms => leetcode}/0878.Nth-Magical-Number/878. Nth Magical Number.go (100%) rename {Algorithms => leetcode}/0878.Nth-Magical-Number/878. Nth Magical Number_test.go (100%) rename {Algorithms => leetcode}/0878.Nth-Magical-Number/README.md (100%) rename {Algorithms => leetcode}/0880.Decoded-String-at-Index/880. Decoded String at Index.go (100%) rename {Algorithms => leetcode}/0880.Decoded-String-at-Index/880. Decoded String at Index_test.go (100%) rename {Algorithms => leetcode}/0880.Decoded-String-at-Index/README.md (100%) rename {Algorithms => leetcode}/0881.Boats-to-Save-People/881. Boats to Save People.go (100%) rename {Algorithms => leetcode}/0881.Boats-to-Save-People/881. Boats to Save People_test.go (100%) rename {Algorithms => leetcode}/0881.Boats-to-Save-People/README.md (100%) rename {Algorithms => leetcode}/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences.go (100%) rename {Algorithms => leetcode}/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences_test.go (100%) rename {Algorithms => leetcode}/0884.Uncommon-Words-from-Two-Sentences/README.md (100%) rename {Algorithms => leetcode}/0885.Spiral-Matrix-III/885. Spiral Matrix III.go (100%) rename {Algorithms => leetcode}/0885.Spiral-Matrix-III/885. Spiral Matrix III_test.go (100%) rename {Algorithms => leetcode}/0885.Spiral-Matrix-III/README.md (100%) rename {Algorithms => leetcode}/0887.Super-Egg-Drop/887. Super Egg Drop.go (100%) rename {Algorithms => leetcode}/0887.Super-Egg-Drop/887. Super Egg Drop_test.go (100%) rename {Algorithms => leetcode}/0887.Super-Egg-Drop/README.md (100%) rename {Algorithms => leetcode}/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go (100%) rename {Algorithms => leetcode}/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths_test.go (100%) rename {Algorithms => leetcode}/0891.Sum-of-Subsequence-Widths/README.md (100%) rename {Algorithms => leetcode}/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack.go (100%) rename {Algorithms => leetcode}/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack_test.go (100%) rename {Algorithms => leetcode}/0895.Maximum-Frequency-Stack/README.md (100%) rename {Algorithms => leetcode}/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree.go (100%) rename {Algorithms => leetcode}/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree_test.go (100%) rename {Algorithms => leetcode}/0897.Increasing-Order-Search-Tree/README.md (100%) rename {Algorithms => leetcode}/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays.go (100%) rename {Algorithms => leetcode}/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays_test.go (100%) rename {Algorithms => leetcode}/0898.Bitwise-ORs-of-Subarrays/README.md (100%) rename {Algorithms => leetcode}/0901.Online-Stock-Span/901. Online Stock Span.go (100%) rename {Algorithms => leetcode}/0901.Online-Stock-Span/901. Online Stock Span_test.go (100%) rename {Algorithms => leetcode}/0901.Online-Stock-Span/README.md (100%) rename {Algorithms => leetcode}/0904.Fruit-Into-Baskets/904. Fruit Into Baskets.go (100%) rename {Algorithms => leetcode}/0904.Fruit-Into-Baskets/904. Fruit Into Baskets_test.go (100%) rename {Algorithms => leetcode}/0904.Fruit-Into-Baskets/README.md (100%) rename {Algorithms => leetcode}/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums.go (100%) rename {Algorithms => leetcode}/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums_test.go (100%) rename {Algorithms => leetcode}/0907.Sum-of-Subarray-Minimums/README.md (100%) rename {Algorithms => leetcode}/0911.Online-Election/911. Online Election.go (100%) rename {Algorithms => leetcode}/0911.Online-Election/911. Online Election_test.go (100%) rename {Algorithms => leetcode}/0911.Online-Election/README.md (100%) rename {Algorithms => leetcode}/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go (100%) rename {Algorithms => leetcode}/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray_test.go (100%) rename {Algorithms => leetcode}/0918.Maximum-Sum-Circular-Subarray/README.md (100%) rename {Algorithms => leetcode}/0920.Number-of-Music-Playlists/920. Number of Music Playlists.go (100%) rename {Algorithms => leetcode}/0920.Number-of-Music-Playlists/920. Number of Music Playlists_test.go (100%) rename {Algorithms => leetcode}/0920.Number-of-Music-Playlists/README.md (100%) rename {Algorithms => leetcode}/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid.go (100%) rename {Algorithms => leetcode}/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid_test.go (100%) rename {Algorithms => leetcode}/0921.Minimum-Add-to-Make-Parentheses-Valid/README.md (100%) rename {Algorithms => leetcode}/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II.go (100%) rename {Algorithms => leetcode}/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II_test.go (100%) rename {Algorithms => leetcode}/0922.Sort-Array-By-Parity-II/README.md (100%) rename {Algorithms => leetcode}/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity.go (100%) rename {Algorithms => leetcode}/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity_test.go (100%) rename {Algorithms => leetcode}/0923.3Sum-With-Multiplicity/README.md (100%) rename {Algorithms => leetcode}/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go (100%) rename {Algorithms => leetcode}/0924.Minimize-Malware-Spread/924. Minimize Malware Spread_test.go (100%) rename {Algorithms => leetcode}/0924.Minimize-Malware-Spread/README.md (100%) rename {Algorithms => leetcode}/0925.Long-Pressed-Name/925. Long Pressed Name.go (100%) rename {Algorithms => leetcode}/0925.Long-Pressed-Name/925. Long Pressed Name_test.go (100%) rename {Algorithms => leetcode}/0925.Long-Pressed-Name/README.md (100%) rename {Algorithms => leetcode}/0927.Three-Equal-Parts/927. Three Equal Parts.go (100%) rename {Algorithms => leetcode}/0927.Three-Equal-Parts/927. Three Equal Parts_test.go (100%) rename {Algorithms => leetcode}/0927.Three-Equal-Parts/README.md (100%) rename {Algorithms => leetcode}/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II.go (100%) rename {Algorithms => leetcode}/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II_test.go (100%) rename {Algorithms => leetcode}/0928.Minimize-Malware-Spread-II/README.md (100%) rename {Algorithms => leetcode}/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum.go (100%) rename {Algorithms => leetcode}/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum_test.go (100%) rename {Algorithms => leetcode}/0930.Binary-Subarrays-With-Sum/README.md (100%) rename {Algorithms => leetcode}/0933.Number-of-Recent-Calls/933. Number of Recent Calls.go (100%) rename {Algorithms => leetcode}/0933.Number-of-Recent-Calls/933. Number of Recent Calls_test.go (100%) rename {Algorithms => leetcode}/0933.Number-of-Recent-Calls/README.md (100%) rename {Algorithms => leetcode}/0942.DI-String-Match/942. DI String Match.go (100%) rename {Algorithms => leetcode}/0942.DI-String-Match/942. DI String Match_test.go (100%) rename {Algorithms => leetcode}/0942.DI-String-Match/README.md (100%) rename {Algorithms => leetcode}/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go (100%) rename {Algorithms => leetcode}/0946.Validate-Stack-Sequences/946. Validate Stack Sequences_test.go (100%) rename {Algorithms => leetcode}/0946.Validate-Stack-Sequences/README.md (100%) rename {Algorithms => leetcode}/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column.go (100%) rename {Algorithms => leetcode}/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column_test.go (100%) rename {Algorithms => leetcode}/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md (100%) rename {Algorithms => leetcode}/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor.go (100%) rename {Algorithms => leetcode}/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor_test.go (100%) rename {Algorithms => leetcode}/0952.Largest-Component-Size-by-Common-Factor/README.md (100%) rename {Algorithms => leetcode}/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary.go (100%) rename {Algorithms => leetcode}/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary_test.go (100%) rename {Algorithms => leetcode}/0953.Verifying-an-Alien-Dictionary/README.md (100%) rename {Algorithms => leetcode}/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes.go (100%) rename {Algorithms => leetcode}/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes_test.go (100%) rename {Algorithms => leetcode}/0959.Regions-Cut-By-Slashes/README.md (100%) rename {Algorithms => leetcode}/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array.go (100%) rename {Algorithms => leetcode}/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array_test.go (100%) rename {Algorithms => leetcode}/0961.N-Repeated-Element-in-Size-2N-Array/README.md (100%) rename {Algorithms => leetcode}/0968.Binary-Tree-Cameras/968. Binary Tree Cameras.go (100%) rename {Algorithms => leetcode}/0968.Binary-Tree-Cameras/968. Binary Tree Cameras_test.go (100%) rename {Algorithms => leetcode}/0968.Binary-Tree-Cameras/README.md (100%) rename {Algorithms => leetcode}/0969.Pancake-Sorting/969. Pancake Sorting.go (100%) rename {Algorithms => leetcode}/0969.Pancake-Sorting/969. Pancake Sorting_test.go (100%) rename {Algorithms => leetcode}/0969.Pancake-Sorting/README.md (100%) rename {Algorithms => leetcode}/0970.Powerful-Integers/970. Powerful Integers.go (100%) rename {Algorithms => leetcode}/0970.Powerful-Integers/970. Powerful Integers_test.go (100%) rename {Algorithms => leetcode}/0970.Powerful-Integers/README.md (100%) rename {Algorithms => leetcode}/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin.go (100%) rename {Algorithms => leetcode}/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin_test.go (100%) rename {Algorithms => leetcode}/0973.K-Closest-Points-to-Origin/README.md (100%) rename {Algorithms => leetcode}/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle.go (100%) rename {Algorithms => leetcode}/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle_test.go (100%) rename {Algorithms => leetcode}/0976.Largest-Perimeter-Triangle/README.md (100%) rename {Algorithms => leetcode}/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array.go (100%) rename {Algorithms => leetcode}/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array_test.go (100%) rename {Algorithms => leetcode}/0977.Squares-of-a-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go (100%) rename {Algorithms => leetcode}/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray_test.go (100%) rename {Algorithms => leetcode}/0978.Longest-Turbulent-Subarray/README.md (100%) rename {Algorithms => leetcode}/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree.go (100%) rename {Algorithms => leetcode}/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0979.Distribute-Coins-in-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0980.Unique-Paths-III/980. Unique Paths III.go (100%) rename {Algorithms => leetcode}/0980.Unique-Paths-III/980. Unique Paths III_test.go (100%) rename {Algorithms => leetcode}/0980.Unique-Paths-III/README.md (100%) rename {Algorithms => leetcode}/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store.go (100%) rename {Algorithms => leetcode}/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store_test.go (100%) rename {Algorithms => leetcode}/0981.Time-Based-Key-Value-Store/README.md (100%) rename {Algorithms => leetcode}/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB.go (100%) rename {Algorithms => leetcode}/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB_test.go (100%) rename {Algorithms => leetcode}/0984.String-Without-AAA-or-BBB/README.md (100%) rename {Algorithms => leetcode}/0986.Interval-List-Intersections/986. Interval List Intersections.go (100%) rename {Algorithms => leetcode}/0986.Interval-List-Intersections/986. Interval List Intersections_test.go (100%) rename {Algorithms => leetcode}/0986.Interval-List-Intersections/README.md (100%) rename {Algorithms => leetcode}/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations.go (100%) rename {Algorithms => leetcode}/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations_test.go (100%) rename {Algorithms => leetcode}/0990.Satisfiability-of-Equality-Equations/README.md (100%) rename {Algorithms => leetcode}/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers.go (100%) rename {Algorithms => leetcode}/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers_test.go (100%) rename {Algorithms => leetcode}/0992.Subarrays-with-K-Different-Integers/README.md (100%) rename {Algorithms => leetcode}/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree.go (100%) rename {Algorithms => leetcode}/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree_test.go (100%) rename {Algorithms => leetcode}/0993.Cousins-in-Binary-Tree/README.md (100%) rename {Algorithms => leetcode}/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips.go (100%) rename {Algorithms => leetcode}/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips_test.go (100%) rename {Algorithms => leetcode}/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md (100%) rename {Algorithms => leetcode}/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays.go (100%) rename {Algorithms => leetcode}/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays_test.go (100%) rename {Algorithms => leetcode}/0996.Number-of-Squareful-Arrays/README.md (100%) rename {Algorithms => leetcode}/1002.Find-Common-Characters/1002. Find Common Characters.go (100%) rename {Algorithms => leetcode}/1002.Find-Common-Characters/1002. Find Common Characters_test.go (100%) rename {Algorithms => leetcode}/1002.Find-Common-Characters/README.md (100%) rename {Algorithms => leetcode}/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions.go (100%) rename {Algorithms => leetcode}/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions_test.go (100%) rename {Algorithms => leetcode}/1003.Check-If-Word-Is-Valid-After-Substitutions/README.md (100%) rename {Algorithms => leetcode}/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III.go (100%) rename {Algorithms => leetcode}/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III_test.go (100%) rename {Algorithms => leetcode}/1004.Max-Consecutive-Ones-III/README.md (100%) rename {Algorithms => leetcode}/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations.go (100%) rename {Algorithms => leetcode}/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations_test.go (100%) rename {Algorithms => leetcode}/1005.Maximize-Sum-Of-Array-After-K-Negations/README.md (100%) rename {Algorithms => leetcode}/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days.go (100%) rename {Algorithms => leetcode}/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days_test.go (100%) rename {Algorithms => leetcode}/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md (100%) rename {Algorithms => leetcode}/1017.Convert-to-Base--2/1017. Convert to Base -2.go (100%) rename {Algorithms => leetcode}/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go (100%) rename {Algorithms => leetcode}/1017.Convert-to-Base--2/README.md (100%) rename {Algorithms => leetcode}/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go (100%) rename {Algorithms => leetcode}/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List_test.go (100%) rename {Algorithms => leetcode}/1019.Next-Greater-Node-In-Linked-List/README.md (100%) rename {Algorithms => leetcode}/1020.Number-of-Enclaves/1020. Number of Enclaves.go (100%) rename {Algorithms => leetcode}/1020.Number-of-Enclaves/1020. Number of Enclaves_test.go (100%) rename {Algorithms => leetcode}/1020.Number-of-Enclaves/README.md (100%) rename {Algorithms => leetcode}/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses.go (100%) rename {Algorithms => leetcode}/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses_test.go (100%) rename {Algorithms => leetcode}/1021.Remove-Outermost-Parentheses/README.md (100%) rename {Algorithms => leetcode}/1025.Divisor-Game/1025. Divisor Game.go (100%) rename {Algorithms => leetcode}/1025.Divisor-Game/1025. Divisor Game_test.go (100%) rename {Algorithms => leetcode}/1025.Divisor-Game/README.md (100%) rename {Algorithms => leetcode}/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor.go (100%) rename {Algorithms => leetcode}/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor_test.go (100%) rename {Algorithms => leetcode}/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md (100%) rename {Algorithms => leetcode}/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go (100%) rename {Algorithms => leetcode}/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal_test.go (100%) rename {Algorithms => leetcode}/1028.Recover-a-Tree-From-Preorder-Traversal/README.md (100%) rename {Algorithms => leetcode}/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order.go (100%) rename {Algorithms => leetcode}/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order_test.go (100%) rename {Algorithms => leetcode}/1030.Matrix-Cells-in-Distance-Order/README.md (100%) rename {Algorithms => leetcode}/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II.go (100%) rename {Algorithms => leetcode}/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II_test.go (100%) rename {Algorithms => leetcode}/1040.Moving-Stones-Until-Consecutive-II/README.md (100%) rename {Algorithms => leetcode}/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String.go (100%) rename {Algorithms => leetcode}/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String_test.go (100%) rename {Algorithms => leetcode}/1047.Remove-All-Adjacent-Duplicates-In-String/README.md (100%) rename {Algorithms => leetcode}/1049.Last-Stone-Weight-II/1049. Last Stone Weight II.go (100%) rename {Algorithms => leetcode}/1049.Last-Stone-Weight-II/1049. Last Stone Weight II_test.go (100%) rename {Algorithms => leetcode}/1049.Last-Stone-Weight-II/README.md (100%) rename {Algorithms => leetcode}/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner.go (100%) rename {Algorithms => leetcode}/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner_test.go (100%) rename {Algorithms => leetcode}/1052.Grumpy-Bookstore-Owner/README.md (100%) rename {Algorithms => leetcode}/1054.Distant-Barcodes/1054. Distant Barcodes.go (100%) rename {Algorithms => leetcode}/1054.Distant-Barcodes/1054. Distant Barcodes_test.go (100%) rename {Algorithms => leetcode}/1054.Distant-Barcodes/README.md (100%) rename {Algorithms => leetcode}/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers.go (100%) rename {Algorithms => leetcode}/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers_test.go (100%) rename {Algorithms => leetcode}/1073.Adding-Two-Negabinary-Numbers/README.md (100%) rename {Algorithms => leetcode}/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target.go (100%) rename {Algorithms => leetcode}/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target_test.go (100%) rename {Algorithms => leetcode}/1074.Number-of-Submatrices-That-Sum-to-Target/README.md (100%) rename {Algorithms => leetcode}/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram.go (100%) rename {Algorithms => leetcode}/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram_test.go (100%) rename {Algorithms => leetcode}/1078.Occurrences-After-Bigram/README.md (100%) rename {Algorithms => leetcode}/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities.go (100%) rename {Algorithms => leetcode}/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities_test.go (100%) rename {Algorithms => leetcode}/1079.Letter-Tile-Possibilities/README.md (100%) rename {Algorithms => leetcode}/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample.go (100%) rename {Algorithms => leetcode}/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample_test.go (100%) rename {Algorithms => leetcode}/1093.Statistics-from-a-Large-Sample/README.md (100%) rename {Algorithms => leetcode}/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves.go (100%) rename {Algorithms => leetcode}/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves_test.go (100%) rename {Algorithms => leetcode}/1105.Filling-Bookcase-Shelves/README.md (100%) rename {Algorithms => leetcode}/1108.Defanging-an-IP-Address/1108. Defanging an IP Address.go (100%) rename {Algorithms => leetcode}/1108.Defanging-an-IP-Address/1108. Defanging an IP Address_test.go (100%) rename {Algorithms => leetcode}/1108.Defanging-an-IP-Address/README.md (100%) rename {Algorithms => leetcode}/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest.go (100%) rename {Algorithms => leetcode}/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest_test.go (100%) rename {Algorithms => leetcode}/1110.Delete-Nodes-And-Return-Forest/README.md (100%) rename {Algorithms => leetcode}/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go (100%) rename {Algorithms => leetcode}/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go (100%) rename {Algorithms => leetcode}/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md (100%) rename {Algorithms => leetcode}/1122.Relative-Sort-Array/1122. Relative Sort Array.go (100%) rename {Algorithms => leetcode}/1122.Relative-Sort-Array/1122. Relative Sort Array_test.go (100%) rename {Algorithms => leetcode}/1122.Relative-Sort-Array/README.md (100%) rename {Algorithms => leetcode}/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves.go (100%) rename {Algorithms => leetcode}/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves_test.go (100%) rename {Algorithms => leetcode}/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md (100%) rename {Algorithms => leetcode}/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs.go (100%) rename {Algorithms => leetcode}/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs_test.go (100%) rename {Algorithms => leetcode}/1128.Number-of-Equivalent-Domino-Pairs/README.md (100%) rename {Algorithms => leetcode}/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number.go (100%) rename {Algorithms => leetcode}/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number_test.go (100%) rename {Algorithms => leetcode}/1137.N-th-Tribonacci-Number/README.md (100%) rename {Algorithms => leetcode}/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game.go (100%) rename {Algorithms => leetcode}/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game_test.go (100%) rename {Algorithms => leetcode}/1145.Binary-Tree-Coloring-Game/README.md (100%) rename {Algorithms => leetcode}/1154.Day-of-the-Year/1154. Day of the Year.go (100%) rename {Algorithms => leetcode}/1154.Day-of-the-Year/1154. Day of the Year_test.go (100%) rename {Algorithms => leetcode}/1154.Day-of-the-Year/README.md (100%) rename {Algorithms => leetcode}/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray.go (100%) rename {Algorithms => leetcode}/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray_test.go (100%) rename {Algorithms => leetcode}/1157.Online-Majority-Element-In-Subarray/README.md (100%) rename {Algorithms => leetcode}/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters.go (100%) rename {Algorithms => leetcode}/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters_test.go (100%) rename {Algorithms => leetcode}/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md (100%) rename {Algorithms => leetcode}/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character.go (100%) rename {Algorithms => leetcode}/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character_test.go (100%) rename {Algorithms => leetcode}/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md (100%) rename {Algorithms => leetcode}/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List.go (100%) rename {Algorithms => leetcode}/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go (100%) rename {Algorithms => leetcode}/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md (100%) rename {Algorithms => leetcode}/1175.Prime-Arrangements/1175. Prime Arrangements.go (100%) rename {Algorithms => leetcode}/1175.Prime-Arrangements/1175. Prime Arrangements_test.go (100%) rename {Algorithms => leetcode}/1175.Prime-Arrangements/README.md (100%) rename {Algorithms => leetcode}/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops.go (100%) rename {Algorithms => leetcode}/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops_test.go (100%) rename {Algorithms => leetcode}/1184.Distance-Between-Bus-Stops/README.md (100%) rename {Algorithms => leetcode}/1185.Day-of-the-Week/1185. Day of the Week.go (100%) rename {Algorithms => leetcode}/1185.Day-of-the-Week/1185. Day of the Week_test.go (100%) rename {Algorithms => leetcode}/1185.Day-of-the-Week/README.md (100%) rename {Algorithms => leetcode}/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons.go (100%) rename {Algorithms => leetcode}/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons_test.go (100%) rename {Algorithms => leetcode}/1189.Maximum-Number-of-Balloons/README.md (100%) rename {Algorithms => leetcode}/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference.go (100%) rename {Algorithms => leetcode}/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference_test.go (100%) rename {Algorithms => leetcode}/1200.Minimum-Absolute-Difference/README.md (100%) rename {Algorithms => leetcode}/1201.Ugly-Number-III/1201. Ugly Number III.go (100%) rename {Algorithms => leetcode}/1201.Ugly-Number-III/1201. Ugly Number III_test.go (100%) rename {Algorithms => leetcode}/1201.Ugly-Number-III/README.md (100%) rename {Algorithms => leetcode}/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps.go (100%) rename {Algorithms => leetcode}/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps_test.go (100%) rename {Algorithms => leetcode}/1202.Smallest-String-With-Swaps/README.md (100%) rename {Algorithms => leetcode}/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences.go (100%) rename {Algorithms => leetcode}/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences_test.go (100%) rename {Algorithms => leetcode}/1207.Unique-Number-of-Occurrences/README.md (100%) rename {Algorithms => leetcode}/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget.go (100%) rename {Algorithms => leetcode}/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget_test.go (100%) rename {Algorithms => leetcode}/1208.Get-Equal-Substrings-Within-Budget/README.md (100%) rename {Algorithms => leetcode}/1217.Play-with-Chips/1217. Play with Chips.go (100%) rename {Algorithms => leetcode}/1217.Play-with-Chips/1217. Play with Chips_test.go (100%) rename {Algorithms => leetcode}/1217.Play-with-Chips/README.md (100%) rename {Algorithms => leetcode}/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings.go (100%) rename {Algorithms => leetcode}/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings_test.go (100%) rename {Algorithms => leetcode}/1221.Split-a-String-in-Balanced-Strings/README.md (100%) rename {Algorithms => leetcode}/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line.go (100%) rename {Algorithms => leetcode}/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line_test.go (100%) rename {Algorithms => leetcode}/1232.Check-If-It-Is-a-Straight-Line/README.md (100%) rename {Algorithms => leetcode}/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String.go (100%) rename {Algorithms => leetcode}/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String_test.go (100%) rename {Algorithms => leetcode}/1234.Replace-the-Substring-for-Balanced-String/README.md (100%) rename {Algorithms => leetcode}/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling.go (100%) rename {Algorithms => leetcode}/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling_test.go (100%) rename {Algorithms => leetcode}/1235.Maximum-Profit-in-Job-Scheduling/README.md (100%) rename {Algorithms => leetcode}/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix.go (100%) rename {Algorithms => leetcode}/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix_test.go (100%) rename {Algorithms => leetcode}/1252.Cells-with-Odd-Values-in-a-Matrix/README.md (100%) rename {Algorithms => leetcode}/1254.Number-of-Closed-Islands/1254. Number of Closed Islands.go (100%) rename {Algorithms => leetcode}/1254.Number-of-Closed-Islands/1254. Number of Closed Islands_test.go (100%) rename {Algorithms => leetcode}/1254.Number-of-Closed-Islands/README.md (100%) rename {Algorithms => leetcode}/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points.go (100%) rename {Algorithms => leetcode}/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points_test.go (100%) rename {Algorithms => leetcode}/1266.Minimum-Time-Visiting-All-Points/README.md (100%) rename {Algorithms => leetcode}/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer.go (100%) rename {Algorithms => leetcode}/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer_test.go (100%) rename {Algorithms => leetcode}/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md (100%) rename {Algorithms => leetcode}/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold.go (100%) rename {Algorithms => leetcode}/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold_test.go (100%) rename {Algorithms => leetcode}/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md (100%) rename {Algorithms => leetcode}/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array.go (100%) rename {Algorithms => leetcode}/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array_test.go (100%) rename {Algorithms => leetcode}/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md (100%) rename {Algorithms => leetcode}/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer.go (100%) rename {Algorithms => leetcode}/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer_test.go (100%) rename {Algorithms => leetcode}/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md (100%) rename {Algorithms => leetcode}/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits.go (100%) rename {Algorithms => leetcode}/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits_test.go (100%) rename {Algorithms => leetcode}/1295.Find-Numbers-with-Even-Number-of-Digits/README.md (100%) rename {Algorithms => leetcode}/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side.go (100%) rename {Algorithms => leetcode}/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side_test.go (100%) rename {Algorithms => leetcode}/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md (100%) rename {Algorithms => leetcode}/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target.go (100%) rename {Algorithms => leetcode}/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target_test.go (100%) rename {Algorithms => leetcode}/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md (100%) rename {Algorithms => leetcode}/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum.go (100%) rename {Algorithms => leetcode}/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum_test.go (100%) rename {Algorithms => leetcode}/1302.Deepest-Leaves-Sum/README.md (100%) rename {Algorithms => leetcode}/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero.go (100%) rename {Algorithms => leetcode}/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero_test.go (100%) rename {Algorithms => leetcode}/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md (100%) rename {Algorithms => leetcode}/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go (100%) rename {Algorithms => leetcode}/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go (100%) rename {Algorithms => leetcode}/1305.All-Elements-in-Two-Binary-Search-Trees/README.md (100%) rename {Algorithms => leetcode}/1306.Jump-Game-III/1306. Jump Game III.go (100%) rename {Algorithms => leetcode}/1306.Jump-Game-III/1306. Jump Game III_test.go (100%) rename {Algorithms => leetcode}/1306.Jump-Game-III/README.md (100%) rename {Topics => topic}/Backtracking.png (100%) rename {Topics => topic}/Binary_Indexed_Tree.png (100%) rename {Topics => topic}/Bit_Manipulation.png (100%) rename {Topics => topic}/Linked_List.png (100%) rename {Topics => topic}/Segment_Tree.png (100%) rename {Topics => topic}/Sliding_Window.png (100%) rename {Topics => topic}/Sort.png (100%) rename {Topics => topic}/Stack.png (100%) rename {Topics => topic}/Two_pointers.png (100%) rename {Topics => topic}/Union_Find.png (100%) diff --git a/README.md b/README.md index 19d28d780..7c54e8252 100644 --- a/README.md +++ b/README.md @@ -70,185 +70,185 @@ | # | Title | Solution | Acceptance | Difficulty | Frequency | |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:| -| 0001 | Two Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0001.%20Two%20Sum) | 44.30% | Easy | | -| 0002 | Add Two Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0002.%20Add%20Two%20Numbers) | 31.30% | Medium | | -| 0003 | Longest Substring Without Repeating Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters) | 28.50% | Medium | | -| 0004 | Median of Two Sorted Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0004.%20Median%20of%20Two%20Sorted%20Arrays) | 26.60% | Hard | | +| 0001 | Two Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum) | 44.30% | Easy | | +| 0002 | Add Two Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers) | 31.30% | Medium | | +| 0003 | Longest Substring Without Repeating Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters) | 28.50% | Medium | | +| 0004 | Median of Two Sorted Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays) | 26.60% | Hard | | | 0005 | Longest Palindromic Substring | | 27.50% | Medium | | | 0006 | ZigZag Conversion | | 32.20% | Medium | | -| 0007 | Reverse Integer |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0007.%20Reverse%20Integer) | 25.40% | Easy | | +| 0007 | Reverse Integer |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer) | 25.40% | Easy | | | 0008 | String to Integer (atoi) | | 14.70% | Medium | | | 0009 | Palindrome Number | | 43.70% | Easy | | | 0010 | Regular Expression Matching | | 25.40% | Hard | | -| 0011 | Container With Most Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0011.%20Container%20With%20Most%20Water) | 45.10% | Medium | | +| 0011 | Container With Most Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water) | 45.10% | Medium | | | 0012 | Integer to Roman | | 51.30% | Medium | | | 0013 | Roman to Integer | | 52.60% | Easy | | | 0014 | Longest Common Prefix | | 33.70% | Easy | | -| 0015 | 3Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0015.%203Sum) | 24.20% | Medium | | -| 0016 | 3Sum Closest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0016.%203Sum%20Closest) | 45.80% | Medium | | -| 0017 | Letter Combinations of a Phone Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0017.%20Letter%20Combinations%20of%20a%20Phone%20Number) | 41.90% | Medium | | -| 0018 | 4Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0018.%204Sum) | 30.80% | Medium | | -| 0019 | Remove Nth Node From End of List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0019.%20Remove%20Nth%20Node%20From%20End%20of%20List) | 34.30% | Medium | | -| 0020 | Valid Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0020.%20Valid-Parentheses) | 36.70% | Easy | | -| 0021 | Merge Two Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0021.%20Merge%20Two%20Sorted%20Lists) | 47.70% | Easy | | -| 0022 | Generate Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0022.%20Generate%20Parentheses) | 55.50% | Medium | | -| 0023 | Merge k Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0023.%20Merge%20k%20Sorted%20Lists) | 34.90% | Hard | | -| 0024 | Swap Nodes in Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0024.%20Swap%20Nodes%20in%20Pairs) | 45.10% | Medium | | -| 0025 | Reverse Nodes in k-Group | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0025.%20Reverse%20Nodes%20in%20k%20Group) | 36.80% | Hard | | -| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0026.%20Remove%20Duplicates%20from%20Sorted%20Array) | 41.00% | Easy | | -| 0027 | Remove Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0027.%20Remove%20Element) | 44.80% | Easy | | -| 0028 | Implement strStr() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0028.%20Implement%20strStr()) | 32.20% | Easy | | -| 0029 | Divide Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0029.%20Divide%20Two%20Integers) | 16.10% | Medium | | -| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0030.%20Substring%20with%20Concatenation%20of%20All%20Words)(是否还有更优解) | 23.70% | Hard | | +| 0015 | 3Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum) | 24.20% | Medium | | +| 0016 | 3Sum Closest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest) | 45.80% | Medium | | +| 0017 | Letter Combinations of a Phone Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number) | 41.90% | Medium | | +| 0018 | 4Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum) | 30.80% | Medium | | +| 0019 | Remove Nth Node From End of List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List) | 34.30% | Medium | | +| 0020 | Valid Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses) | 36.70% | Easy | | +| 0021 | Merge Two Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists) | 47.70% | Easy | | +| 0022 | Generate Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses) | 55.50% | Medium | | +| 0023 | Merge k Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists) | 34.90% | Hard | | +| 0024 | Swap Nodes in Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs) | 45.10% | Medium | | +| 0025 | Reverse Nodes in k-Group | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group) | 36.80% | Hard | | +| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array) | 41.00% | Easy | | +| 0027 | Remove Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element) | 44.80% | Easy | | +| 0028 | Implement strStr() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr) | 32.20% | Easy | | +| 0029 | Divide Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers) | 16.10% | Medium | | +| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)(是否还有更优解) | 23.70% | Hard | | | 0031 | Next Permutation | | 30.60% | Medium | | | 0032 | Longest Valid Parentheses | | 25.70% | Hard | | -| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0033.%20Search%20in%20Rotated%20Sorted%20Array) | 33.00% | Medium | | -| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array) | 33.70% | Medium | | +| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array) | 33.00% | Medium | | +| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array) | 33.70% | Medium | | | 0035 | Search Insert Position | | 40.90% | Easy | | -| 0036 | Valid Sudoku | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0036.%20Valid%20Sudoku) | 43.50% | Medium | | -| 0037 | Sudoku Solver | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0037.%20Sudoku%20Solver) | 37.40% | Hard | | +| 0036 | Valid Sudoku | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku) | 43.50% | Medium | | +| 0037 | Sudoku Solver | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver) | 37.40% | Hard | | | 0038 | Count and Say | | 40.80% | Easy | | -| 0039 | Combination Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0039.%20Combination%20Sum) | 49.10% | Medium | | -| 0040 | Combination Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0040.%20Combination%20Sum%20II) | 42.10% | Medium | | -| 0041 | First Missing Positive | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0041.%20First-Missing-Positive) | 29.10% | Hard | | -| 0042 | Trapping Rain Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0042.%20Trapping%20Rain%20Water) | 43.50% | Hard | | +| 0039 | Combination Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum) | 49.10% | Medium | | +| 0040 | Combination Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II) | 42.10% | Medium | | +| 0041 | First Missing Positive | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive) | 29.10% | Hard | | +| 0042 | Trapping Rain Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water) | 43.50% | Hard | | | 0043 | Multiply Strings | | 30.90% | Medium | | | 0044 | Wildcard Matching | | 23.00% | Hard | | | 0045 | Jump Game II | | 28.20% | Hard | | -| 0046 | Permutations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0046.%20Permutations) | 55.70% | Medium | | -| 0047 | Permutations II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0047.%20Permutations%20II) | 40.90% | Medium | | -| 0048 | Rotate Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0048.%20Rotate%20Image) | 49.00% | Medium | | -| 0049 | Group Anagrams | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0049.%20Group%20Anagrams) | 47.40% | Medium | | -| 0050 | Pow(x, n) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0050.%20Pow(x%2C%20n)) | 28.10% | Medium | -| 0051 | N-Queens | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0051.%20N-Queens) | 39.80% | Hard | | -| 0052 | N-Queens II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0052.%20N-Queens%20II) | 52.40% | Hard | | -| 0053 | Maximum Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0053.%20Maximum%20Subarray) | 43.80% | Easy | | -| 0054 | Spiral Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0054.%20Spiral%20Matrix) | 30.70% | Medium | | +| 0046 | Permutations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations) | 55.70% | Medium | | +| 0047 | Permutations II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II) | 40.90% | Medium | | +| 0048 | Rotate Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image) | 49.00% | Medium | | +| 0049 | Group Anagrams | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams) | 47.40% | Medium | | +| 0050 | Pow(x, n) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n) | 28.10% | Medium | +| 0051 | N-Queens | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens) | 39.80% | Hard | | +| 0052 | N-Queens II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II) | 52.40% | Hard | | +| 0053 | Maximum Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray) | 43.80% | Easy | | +| 0054 | Spiral Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix) | 30.70% | Medium | | | 0055 | Jump Game | | 32.10% | Medium | | -| 0056 | Merge Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0056.%20Merge%20Intervals) | 35.90% | Medium | | -| 0057 | Insert Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0057.%20Insert%20Interval) | 31.40% | Hard | | +| 0056 | Merge Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals) | 35.90% | Medium | | +| 0057 | Insert Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval) | 31.40% | Hard | | | 0058 | Length of Last Word | | 32.30% | Easy | | -| 0059 | Spiral Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0059.%20Spiral%20Matrix%20II) | 47.00% | Medium | | -| 0060 | Permutation Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0060.%20Permutation%20Sequence) | 33.40% | Medium | | -| 0061 | Rotate List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0061.%20Rotate%20List) | 27.30% | Medium | | -| 0062 | Unique Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0062.%20Unique%20Paths) | 48.00% | Medium | | -| 0063 | Unique Paths II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0063.%20Unique%20Paths%20II) | 33.50% | Medium | | -| 0064 | Minimum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0064.%20Minimum%20Path%20Sum) | 47.30% | Medium | | +| 0059 | Spiral Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II) | 47.00% | Medium | | +| 0060 | Permutation Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence) | 33.40% | Medium | | +| 0061 | Rotate List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List) | 27.30% | Medium | | +| 0062 | Unique Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths) | 48.00% | Medium | | +| 0063 | Unique Paths II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II) | 33.50% | Medium | | +| 0064 | Minimum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum) | 47.30% | Medium | | | 0065 | Valid Number | | 14.10% | Hard | | -| 0066 | Plus One | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0066.%20Plus%20One) | 41.40% | Easy | | +| 0066 | Plus One | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One) | 41.40% | Easy | | | 0067 | Add Binary | | 39.50% | Easy | | | 0068 | Text Justification | | 23.50% | Hard | | -| 0069 | Sqrt(x) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0069.%20Sqrt(x)) | 31.50% | Easy | | -| 0070 | Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0070.%20Climbing%20Stairs) | 44.40% | Easy | | -| 0071 | Simplify Path | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0071.%20Simplify%20Path) | 29.00% | Medium | | +| 0069 | Sqrt(x) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx) | 31.50% | Easy | | +| 0070 | Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs) | 44.40% | Easy | | +| 0071 | Simplify Path | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path) | 29.00% | Medium | | | 0072 | Edit Distance | | 38.20% | Hard | | | 0073 | Set Matrix Zeroes | | 40.10% | Medium | | | 0074 | Search a 2D Matrix | | 35.00% | Medium | | -| 0075 | Sort Colors | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0075.%20Sort%20Colors) | 42.40% | Medium | | -| 0076 | Minimum Window Substring | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0076.%20Minimum%20Window%20Substring) | 31.10% | Hard | | -| 0077 | Combinations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0077.%20Combinations) | 48.20% | Medium | | -| 0078 | Subsets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0078.%20Subsets) | 53.40% | Medium | | -| 0079 | Word Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0079.%20Word%20Search) | 31.50% | Medium | | -| 0080 | Remove Duplicates from Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II) | 40.60% | Medium | | +| 0075 | Sort Colors | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors) | 42.40% | Medium | | +| 0076 | Minimum Window Substring | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring) | 31.10% | Hard | | +| 0077 | Combinations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations) | 48.20% | Medium | | +| 0078 | Subsets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets) | 53.40% | Medium | | +| 0079 | Word Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search) | 31.50% | Medium | | +| 0080 | Remove Duplicates from Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II) | 40.60% | Medium | | | 0081 | Search in Rotated Sorted Array II | | 32.70% | Medium | | -| 0082 | Remove Duplicates from Sorted List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0082.%20Remove%20Duplicates%20from%20Sorted%20List%20II) | 33.30% | Medium | | -| 0083 | Remove Duplicates from Sorted List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0083.%20Remove%20Duplicates%20from%20Sorted%20List) | 42.80% | Easy | | -| 0084 | Largest Rectangle in Histogram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0084.%20Largest%20Rectangle%20in%20Histogram) | 31.40% | Hard | | +| 0082 | Remove Duplicates from Sorted List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II) | 33.30% | Medium | | +| 0083 | Remove Duplicates from Sorted List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List) | 42.80% | Easy | | +| 0084 | Largest Rectangle in Histogram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram) | 31.40% | Hard | | | 0085 | Maximal Rectangle | | 33.60% | Hard | | -| 0086 | Partition List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0086.%20Partition%20List) | 37.60% | Medium | | +| 0086 | Partition List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List) | 37.60% | Medium | | | 0087 | Scramble String | | 31.70% | Hard | | -| 0088 | Merge Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0088.%20Merge-Sorted-Array) | 36.00% | Easy | | -| 0089 | Gray Code | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0089.%20Gray%20Code) | 46.00% | Medium | | -| 0090 | Subsets II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0090.%20Subsets%20II) | 42.70% | Medium | | -| 0091 | Decode Ways | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0091.%20Decode%20Ways) | 22.50% | Medium | | -| 0092 | Reverse Linked List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0092.%20Reverse%20Linked%20List%20II) | 35.20% | Medium | | -| 0093 | Restore IP Addresses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0093.%20Restore%20IP%20Addresses) | 31.70% | Medium | | -| 0094 | Binary Tree Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0094.%20Binary%20Tree%20Inorder%20Traversal) | 57.10% | Medium | | -| 0095 | Unique Binary Search Trees II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0095.%20Unique%20Binary%20Search%20Trees%20II) | 36.00% | Medium | | -| 0096 | Unique Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0096.%20Unique%20Binary%20Search%20Trees) | 46.60% | Medium | | +| 0088 | Merge Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array) | 36.00% | Easy | | +| 0089 | Gray Code | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code) | 46.00% | Medium | | +| 0090 | Subsets II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II) | 42.70% | Medium | | +| 0091 | Decode Ways | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways) | 22.50% | Medium | | +| 0092 | Reverse Linked List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) | 35.20% | Medium | | +| 0093 | Restore IP Addresses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses) | 31.70% | Medium | | +| 0094 | Binary Tree Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal) | 57.10% | Medium | | +| 0095 | Unique Binary Search Trees II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II) | 36.00% | Medium | | +| 0096 | Unique Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees) | 46.60% | Medium | | | 0097 | Interleaving String | | 28.20% | Hard | | -| 0098 | Validate Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0098.%20Validate%20Binary%20Search%20Tree) | 25.90% | Medium | | -| 0099 | Recover Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0099.%20Recover%20Binary%20Search%20Tree) | 34.90% | Hard | | -| 0100 | Same Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0100.%20Same%20Tree) | 50.20% | Easy | | -| 0101 | Symmetric Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0101.%20Symmetric%20Tree) | 43.70% | Easy | | -| 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0102.%20Binary%20Tree%20Level%20Order%20Traversal) | 48.90% | Medium | | -| 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal) | 42.10% | Medium | | -| 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0104.%20Maximum%20Depth%20of%20Binary%20Tree) | 60.90% | Easy | | -| 0105 | Construct Binary Tree from Preorder and Inorder Traversal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal) | 41.60% | Medium | | -| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal) | 39.70% | Medium | | -| 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0107.%20Binary%20Tree%20Level%20Order%20Traversal%20II) | 47.20% | Easy | | -| 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree) | 51.20% | Easy | | -| 0109 | Convert Sorted List to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree) | 41.20% | Medium | | -| 0110 | Balanced Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0110.%20Balanced%20Binary%20Tree) | 41.20% | Easy | | -| 0111 | Minimum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0111.%20Minimum%20Depth%20of%20Binary%20Tree) | 35.40% | Easy | | -| 0112 | Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0112.%20Path%20Sum) | 38.00% | Easy | | -| 0113 | Path Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0113.%20Path%20Sum%20II) | 41.00% | Medium | | -| 0114 | Flatten Binary Tree to Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0114.%20Flatten%20Binary%20Tree%20to%20Linked%20List) | 42.80% | Medium | | +| 0098 | Validate Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree) | 25.90% | Medium | | +| 0099 | Recover Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree) | 34.90% | Hard | | +| 0100 | Same Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree) | 50.20% | Easy | | +| 0101 | Symmetric Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree) | 43.70% | Easy | | +| 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal) | 48.90% | Medium | | +| 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal) | 42.10% | Medium | | +| 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree) | 60.90% | Easy | | +| 0105 | Construct Binary Tree from Preorder and Inorder Traversal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal) | 41.60% | Medium | | +| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal) | 39.70% | Medium | | +| 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II) | 47.20% | Easy | | +| 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree) | 51.20% | Easy | | +| 0109 | Convert Sorted List to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree) | 41.20% | Medium | | +| 0110 | Balanced Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree) | 41.20% | Easy | | +| 0111 | Minimum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree) | 35.40% | Easy | | +| 0112 | Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum) | 38.00% | Easy | | +| 0113 | Path Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II) | 41.00% | Medium | | +| 0114 | Flatten Binary Tree to Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List) | 42.80% | Medium | | | 0115 | Distinct Subsequences | | 35.20% | Hard | | | 0116 | Populating Next Right Pointers in Each Node | | 38.20% | Medium | | | 0117 | Populating Next Right Pointers in Each Node II | | 34.70% | Medium | | | 0118 | Pascal's Triangle | | 46.50% | Easy | | | 0119 | Pascal's Triangle II | | 44.00% | Easy | | -| 0120 | Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0120.%20Triangle) | 39.70% | Medium | | -| 0121 | Best Time to Buy and Sell Stock | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock) | 47.50% | Easy | | -| 0122 | Best Time to Buy and Sell Stock II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II) | 52.20% | Easy | | +| 0120 | Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle) | 39.70% | Medium | | +| 0121 | Best Time to Buy and Sell Stock | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock) | 47.50% | Easy | | +| 0122 | Best Time to Buy and Sell Stock II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II) | 52.20% | Easy | | | 0123 | Best Time to Buy and Sell Stock III | | 33.90% | Hard | | -| 0124 | Binary Tree Maximum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0124.%20Binary%20Tree%20Maximum%20Path%20Sum) | 30.20% | Hard | | -| 0125 | Valid Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0125.%20Valid-Palindrome) | 31.40% | Easy | | -| 0126 | Word Ladder II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0126.%20Word%20Ladder%20II) | 18.00% | Hard | | -| 0127 | Word Ladder | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0127.%20Word%20Ladder) | 24.40% | Medium | | -| 0128 | Longest Consecutive Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0128.%20Longest%20Consecutive%20Sequence) | 41.90% | Hard | | -| 0129 | Sum Root to Leaf Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0129.%20Sum%20Root%20to%20Leaf%20Numbers) | 42.80% | Medium | | -| 0130 | Surrounded Regions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0130.%20Surrounded%20Regions) | 23.10% | Medium | | -| 0131 | Palindrome Partitioning | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0131.%20Palindrome%20Partitioning) | 41.30% | Medium | | +| 0124 | Binary Tree Maximum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum) | 30.20% | Hard | | +| 0125 | Valid Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome) | 31.40% | Easy | | +| 0126 | Word Ladder II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II) | 18.00% | Hard | | +| 0127 | Word Ladder | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder) | 24.40% | Medium | | +| 0128 | Longest Consecutive Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence) | 41.90% | Hard | | +| 0129 | Sum Root to Leaf Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers) | 42.80% | Medium | | +| 0130 | Surrounded Regions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions) | 23.10% | Medium | | +| 0131 | Palindrome Partitioning | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning) | 41.30% | Medium | | | 0132 | Palindrome Partitioning II | | 27.60% | Hard | | | 0133 | Clone Graph | | 27.00% | Medium | | | 0134 | Gas Station | | 34.10% | Medium | | | 0135 | Candy | | 28.60% | Hard | | -| 0136 | Single Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0136.%20Single%20Number) | 60.50% | Easy | | -| 0137 | Single Number II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0137.%20Single%20Number%20II) | 46.20% | Medium | | +| 0136 | Single Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number) | 60.50% | Easy | | +| 0137 | Single Number II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II) | 46.20% | Medium | | | 0138 | Copy List with Random Pointer | | 27.50% | Medium | | | 0139 | Word Break | | 35.60% | Medium | | | 0140 | Word Break II | | 27.50% | Hard | | -| 0141 | Linked List Cycle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0141.%20Linked%20List%20Cycle) | 37.20% | Easy | | -| 0142 | Linked List Cycle II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0142.%20Linked%20List%20Cycle%20II) | 32.40% | Medium | | -| 0143 | Reorder List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0143.%20Reorder%20List) | 31.20% | Medium | | -| 0144 | Binary Tree Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0144.%20Binary%20Tree%20Preorder%20Traversal) | 51.70% | Medium | | -| 0145 | Binary Tree Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0145.%20Binary%20Tree%20Postorder%20Traversal) | 48.90% | Hard | | +| 0141 | Linked List Cycle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle) | 37.20% | Easy | | +| 0142 | Linked List Cycle II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II) | 32.40% | Medium | | +| 0143 | Reorder List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List) | 31.20% | Medium | | +| 0144 | Binary Tree Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal) | 51.70% | Medium | | +| 0145 | Binary Tree Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal) | 48.90% | Hard | | | 0146 | LRU Cache | | 25.90% | Medium | | -| 0147 | Insertion Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0147.%20Insertion%20Sort%20List) | 37.60% | Medium | | -| 0148 | Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0148.%20Sort%20List) | 35.80% | Medium | | +| 0147 | Insertion Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List) | 37.60% | Medium | | +| 0148 | Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List) | 35.80% | Medium | | | 0149 | Max Points on a Line | | 15.80% | Hard | | -| 0150 | Evaluate Reverse Polish Notation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0150.%20Evaluate%20Reverse%20Polish%20Notation) | 32.50% | Medium | | +| 0150 | Evaluate Reverse Polish Notation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation) | 32.50% | Medium | | | 0151 | Reverse Words in a String | | 17.00% | Medium | | -| 0152 | Maximum Product Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0152.%20Maximum%20Product%20Subarray) | 29.40% | Medium | | +| 0152 | Maximum Product Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray) | 29.40% | Medium | | | 0153 | Find Minimum in Rotated Sorted Array | | 43.10% | Medium | | | 0154 | Find Minimum in Rotated Sorted Array II | | 39.40% | Hard | | -| 0155 | Min Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0155.%20Min%20Stack) | 37.50% | Easy | | +| 0155 | Min Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack) | 37.50% | Easy | | | 0156 | Binary Tree Upside Down | | 51.10% | Medium | | | 0157 | Read N Characters Given Read4 | | 29.70% | Easy | | | 0158 | Read N Characters Given Read4 II - Call multiple times | | 26.60% | Hard | | | 0159 | Longest Substring with At Most Two Distinct Characters | | 47.20% | Hard | | -| 0160 | Intersection of Two Linked Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0160.%20Intersection%20of%20Two%20Linked%20Lists) | 34.30% | Easy | | +| 0160 | Intersection of Two Linked Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists) | 34.30% | Easy | | | 0161 | One Edit Distance | | 31.70% | Medium | | | 0162 | Find Peak Element | | 41.40% | Medium | | | 0163 | Missing Ranges | | 23.30% | Medium | | -| 0164 | Maximum Gap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0164.%20Maximum%20Gap) | 32.70% | Hard | | +| 0164 | Maximum Gap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap) | 32.70% | Hard | | | 0165 | Compare Version Numbers | | 23.80% | Medium | | | 0166 | Fraction to Recurring Decimal | | 19.60% | Medium | | -| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted) | 50.60% | Easy | | +| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted) | 50.60% | Easy | | | 0168 | Excel Sheet Column Title | | 29.10% | Easy | | -| 0169 | Majority Element |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0169.%20Majority%20Element) | 53.00% | Easy | | +| 0169 | Majority Element |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element) | 53.00% | Easy | | | 0170 | Two Sum III - Data structure design | | 30.60% | Easy | | | 0171 | Excel Sheet Column Number | | 51.70% | Easy | | -| 0172 | Factorial Trailing Zeroes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0172.%20Factorial%20Trailing%20Zeroes) | 37.40% | Easy | | -| 0173 | Binary Search Tree Iterator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0173.%20Binary%20Search%20Tree%20Iterator) | 49.00% | Medium | | +| 0172 | Factorial Trailing Zeroes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes) | 37.40% | Easy | | +| 0173 | Binary Search Tree Iterator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator) | 49.00% | Medium | | | 0174 | Dungeon Game | | 27.30% | Hard | | | 0175 | Combine Two Tables | | 52.40% | Easy | | | 0176 | Second Highest Salary | | 27.50% | Easy | | | 0177 | Nth Highest Salary | | 26.60% | Medium | | | 0178 | Rank Scores | | 37.10% | Medium | | -| 0179 | Largest Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0179.%20Largest%20Number) | 26.00% | Medium | | +| 0179 | Largest Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number) | 26.00% | Medium | | | 0180 | Consecutive Numbers | | 34.00% | Medium | | | 0181 | Employees Earning More Than Their Managers | | 48.90% | Easy | | | 0182 | Duplicate Emails | | 55.20% | Easy | | @@ -256,62 +256,62 @@ | 0184 | Department Highest Salary | | 29.40% | Medium | | | 0185 | Department Top Three Salaries | | 26.50% | Hard | | | 0186 | Reverse Words in a String II | | 38.10% | Medium | | -| 0187 | Repeated DNA Sequences |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0187.%20Repeated%20DNA%20Sequences) | 36.30% | Medium | | +| 0187 | Repeated DNA Sequences |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences) | 36.30% | Medium | | | 0188 | Best Time to Buy and Sell Stock IV | | 26.40% | Hard | | | 0189 | Rotate Array | | 30.50% | Easy | | -| 0190 | Reverse Bits |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0190.%20Reverse%20Bits) | 31.70% | Easy | | -| 0191 | Number of 1 Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0191.%20Number%20of%201%20Bits) | 43.60% | Easy | | +| 0190 | Reverse Bits |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits) | 31.70% | Easy | | +| 0191 | Number of 1 Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits) | 43.60% | Easy | | | 0192 | Word Frequency | | 26.80% | Medium | | | 0193 | Valid Phone Numbers | | 25.20% | Easy | | | 0194 | Transpose File | | 22.90% | Medium | | | 0195 | Tenth Line | | 33.90% | Easy | | | 0196 | Delete Duplicate Emails | | 33.40% | Easy | | | 0197 | Rising Temperature | | 35.10% | Easy | | -| 0198 | House Robber | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0198.%20House%20Robber) | 41.10% | Easy | | -| 0199 | Binary Tree Right Side View | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0199.%20Binary%20Tree%20Right%20Side%20View) | 48.30% | Medium | | -| 0200 | Number of Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0200.%20Number%20of%20Islands) | 41.90% | Medium | | -| 0201 | Bitwise AND of Numbers Range |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0201.%20Bitwise%20AND%20of%20Numbers%20Range) | 36.10% | Medium | | -| 0202 | Happy Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0202.%20Happy%20Number) | 45.60% | Easy | | -| 0203 | Remove Linked List Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0203.%20Remove%20Linked%20List%20Elements) | 35.90% | Easy | | -| 0204 | Count Primes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0204.%20Count%20Primes) | 29.20% | Easy | | -| 0205 | Isomorphic Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0205.%20Isomorphic%20Strings) | 37.60% | Easy | | -| 0206 | Reverse Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0206.%20Reverse-Linked-List) | 55.30% | Easy | | -| 0207 | Course Schedule | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0207.%20Course%20Schedule) | 38.20% | Medium | | -| 0208 | Implement Trie (Prefix Tree) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0208.%20Implement%20Trie%20(Prefix%20Tree)) | 39.00% | Medium | | -| 0209 | Minimum Size Subarray Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0209.%20Minimum%20Size%20Subarray%20Sum) | 35.10% | Medium | | -| 0210 | Course Schedule II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0210.%20Course%20Schedule%20II) | 35.20% | Medium | | -| 0211 | Add and Search Word - Data structure design | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0211.%20Add%20and%20Search%20Word%20-%20Data%20structure%20design) | 30.70% | Medium | | -| 0212 | Word Search II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0212.%20Word%20Search%20II) | 29.00% | Hard | | -| 0213 | House Robber II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0213.%20House%20Robber%20II) | 35.40% | Medium | | +| 0198 | House Robber | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber) | 41.10% | Easy | | +| 0199 | Binary Tree Right Side View | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View) | 48.30% | Medium | | +| 0200 | Number of Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands) | 41.90% | Medium | | +| 0201 | Bitwise AND of Numbers Range |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range) | 36.10% | Medium | | +| 0202 | Happy Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number) | 45.60% | Easy | | +| 0203 | Remove Linked List Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements) | 35.90% | Easy | | +| 0204 | Count Primes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes) | 29.20% | Easy | | +| 0205 | Isomorphic Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings) | 37.60% | Easy | | +| 0206 | Reverse Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List) | 55.30% | Easy | | +| 0207 | Course Schedule | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule) | 38.20% | Medium | | +| 0208 | Implement Trie (Prefix Tree) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree) | 39.00% | Medium | | +| 0209 | Minimum Size Subarray Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum) | 35.10% | Medium | | +| 0210 | Course Schedule II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II) | 35.20% | Medium | | +| 0211 | Add and Search Word - Data structure design | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Add-and-Search-Word---Data-structure-design) | 30.70% | Medium | | +| 0212 | Word Search II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II) | 29.00% | Hard | | +| 0213 | House Robber II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II) | 35.40% | Medium | | | 0214 | Shortest Palindrome | | 27.70% | Hard | | -| 0215 | Kth Largest Element in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0215.%20Kth%20Largest%20Element%20in%20an%20Array) | 48.30% | Medium | | -| 0216 | Combination Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0216.%20Combination%20Sum%20III) | 51.90% | Medium | | -| 0217 | Contains Duplicate | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0217.%20Contains%20Duplicate) | 52.30% | Easy | | -| 0218 | The Skyline Problem | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0218.%20The%20Skyline%20Problem) | 31.80% | Hard | | -| 0219 | Contains Duplicate II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0219.%20Contains%20Duplicate%20II) | 35.50% | Easy | | -| 0220 | Contains Duplicate III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0220.%20Contains%20Duplicate%20III) | 19.80% | Medium | | +| 0215 | Kth Largest Element in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array) | 48.30% | Medium | | +| 0216 | Combination Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III) | 51.90% | Medium | | +| 0217 | Contains Duplicate | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate) | 52.30% | Easy | | +| 0218 | The Skyline Problem | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem) | 31.80% | Hard | | +| 0219 | Contains Duplicate II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II) | 35.50% | Easy | | +| 0220 | Contains Duplicate III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III) | 19.80% | Medium | | | 0221 | Maximal Square | | 33.30% | Medium | | -| 0222 | Count Complete Tree Nodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0222.%20Count%20Complete%20Tree%20Nodes) | 34.40% | Medium | | +| 0222 | Count Complete Tree Nodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes) | 34.40% | Medium | | | 0223 | Rectangle Area | | 36.00% | Medium | | -| 0224 | Basic Calculator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0224.%20Basic%20Calculator) | 33.00% | Hard | | -| 0225 | Implement Stack using Queues | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0225.%20Implement%20Stack%20using%20Queues) | 39.60% | Easy | | -| 0226 | Invert Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0226.%20Invert%20Binary%20Tree) | 58.50% | Easy | | +| 0224 | Basic Calculator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator) | 33.00% | Hard | | +| 0225 | Implement Stack using Queues | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues) | 39.60% | Easy | | +| 0226 | Invert Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree) | 58.50% | Easy | | | 0227 | Basic Calculator II | | 33.70% | Medium | | | 0228 | Summary Ranges | | 36.20% | Medium | | -| 0229 | Majority Element II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0229.%20Majority%20Element%20II) | 32.30% | Medium | | -| 0230 | Kth Smallest Element in a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0230.%20Kth%20Smallest%20Element%20in%20a%20BST) | 51.90% | Medium | | -| 0231 | Power of Two | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0231.%20Power%20of%20Two) | 42.10% | Easy | | -| 0232 | Implement Queue using Stacks | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0232.%20Implement%20Queue%20using%20Stacks) | 43.70% | Easy | | +| 0229 | Majority Element II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II) | 32.30% | Medium | | +| 0230 | Kth Smallest Element in a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST) | 51.90% | Medium | | +| 0231 | Power of Two | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two) | 42.10% | Easy | | +| 0232 | Implement Queue using Stacks | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks) | 43.70% | Easy | | | 0233 | Number of Digit One | | 30.30% | Hard | | -| 0234 | Palindrome Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0234.%20Palindrome%20Linked%20List) | 36.30% | Easy | | -| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree) | 45.10% | Easy | | -| 0236 | Lowest Common Ancestor of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree) | 37.90% | Medium | | -| 0237 | Delete Node in a Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0237.%20Delete%20Node%20in%20a%20Linked%20List) | 54.00% | Easy | | +| 0234 | Palindrome Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List) | 36.30% | Easy | | +| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree) | 45.10% | Easy | | +| 0236 | Lowest Common Ancestor of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree) | 37.90% | Medium | | +| 0237 | Delete Node in a Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List) | 54.00% | Easy | | | 0238 | Product of Array Except Self | | 55.40% | Medium | | -| 0239 | Sliding Window Maximum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0239.%20Sliding%20Window%20Maximum) | 38.40% | Hard | | +| 0239 | Sliding Window Maximum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum) | 38.40% | Hard | | | 0240 | Search a 2D Matrix II | | 41.00% | Medium | | | 0241 | Different Ways to Add Parentheses | | 50.30% | Medium | | -| 0242 | Valid Anagram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0242.%20Valid%20Anagram) | 52.50% | Easy | | +| 0242 | Valid Anagram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram) | 52.50% | Easy | | | 0243 | Shortest Word Distance | | 57.60% | Easy | | | 0244 | Shortest Word Distance II | | 47.60% | Medium | | | 0245 | Shortest Word Distance III | | 53.60% | Medium | | @@ -326,24 +326,24 @@ | 0254 | Factor Combinations | | 44.50% | Medium | | | 0255 | Verify Preorder Sequence in Binary Search Tree | | 43.70% | Medium | | | 0256 | Paint House | | 49.10% | Easy | | -| 0257 | Binary Tree Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0257.%20Binary%20Tree%20Paths) | 46.30% | Easy | | +| 0257 | Binary Tree Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths) | 46.30% | Easy | | | 0258 | Add Digits | | 54.30% | Easy | | | 0259 | 3Sum Smaller | | 45.10% | Medium | | -| 0260 | Single Number III |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0260.%20Single%20Number%20III) | 57.30% | Medium | | +| 0260 | Single Number III |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III) | 57.30% | Medium | | | 0261 | Graph Valid Tree | | 40.00% | Medium | | | 0262 | Trips and Users | | 25.40% | Hard | | -| 0263 | Ugly Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0263.%20Ugly%20Number) | 40.70% | Easy | | +| 0263 | Ugly Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number) | 40.70% | Easy | | | 0264 | Ugly Number II | | 36.60% | Medium | | | 0265 | Paint House II | | 41.70% | Hard | | | 0266 | Palindrome Permutation | | 60.20% | Easy | | | 0267 | Palindrome Permutation II | | 33.90% | Medium | | -| 0268 | Missing Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0268.%20Missing%20Number) | 48.60% | Easy | | +| 0268 | Missing Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number) | 48.60% | Easy | | | 0269 | Alien Dictionary | | 31.30% | Hard | | | 0270 | Closest Binary Search Tree Value | | 44.00% | Easy | | | 0271 | Encode and Decode Strings | | 27.00% | Medium | | | 0272 | Closest Binary Search Tree Value II | | 45.40% | Hard | | | 0273 | Integer to English Words | | 24.50% | Hard | | -| 0274 | H-Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0274.%20H-Index) | 34.70% | Medium | | +| 0274 | H-Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index) | 34.70% | Medium | | | 0275 | H-Index II | | 35.50% | Medium | | | 0276 | Paint Fence | | 36.60% | Easy | | | 0277 | Find the Celebrity | | 37.10% | Medium | | @@ -352,14 +352,14 @@ | 0280 | Wiggle Sort | | 61.20% | Medium | | | 0281 | Zigzag Iterator | | 56.10% | Medium | | | 0282 | Expression Add Operators | | 32.90% | Hard | | -| 0283 | Move Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0283.%20Move%20Zeroes) | 54.50% | Easy | | +| 0283 | Move Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes) | 54.50% | Easy | | | 0284 | Peeking Iterator | | 40.90% | Medium | | | 0285 | Inorder Successor in BST | | 35.10% | Medium | | | 0286 | Walls and Gates | | 49.80% | Medium | | -| 0287 | Find the Duplicate Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0287.%20Find%20the%20Duplicate%20Number) | 50.00% | Medium | | +| 0287 | Find the Duplicate Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number) | 50.00% | Medium | | | 0288 | Unique Word Abbreviation | | 20.10% | Medium | | | 0289 | Game of Life | | 45.90% | Medium | | -| 0290 | Word Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0290.%20Word%20Pattern) | 35.20% | Easy | | +| 0290 | Word Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern) | 35.20% | Easy | | | 0291 | Word Pattern II | | 41.10% | Hard | | | 0292 | Nim Game | | 55.70% | Easy | | | 0293 | Flip Game | | 59.00% | Easy | | @@ -369,64 +369,64 @@ | 0297 | Serialize and Deserialize Binary Tree | | 41.30% | Hard | | | 0298 | Binary Tree Longest Consecutive Sequence | | 44.20% | Medium | | | 0299 | Bulls and Cows | | 39.70% | Medium | | -| 0300 | Longest Increasing Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0300.%20Longest%20Increasing%20Subsequence) | 41.00% | Medium | | +| 0300 | Longest Increasing Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence) | 41.00% | Medium | | | 0301 | Remove Invalid Parentheses | | 39.50% | Hard | | | 0302 | Smallest Rectangle Enclosing Black Pixels | | 49.40% | Hard | | -| 0303 | Range Sum Query - Immutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0303.%20Range%20Sum%20Query%20-%20Immutable) | 38.40% | Easy | | +| 0303 | Range Sum Query - Immutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query---Immutable) | 38.40% | Easy | | | 0304 | Range Sum Query 2D - Immutable | | 32.70% | Medium | | | 0305 | Number of Islands II | | 41.70% | Hard | | -| 0306 | Additive Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0306.%20Additive%20Number) | 28.40% | Medium | | -| 0307 | Range Sum Query - Mutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0307.%20Range%20Sum%20Query%20-%20Mutable) | 29.00% | Medium | | +| 0306 | Additive Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number) | 28.40% | Medium | | +| 0307 | Range Sum Query - Mutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable) | 29.00% | Medium | | | 0308 | Range Sum Query 2D - Mutable | | 32.20% | Hard | | -| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown) | 44.20% | Medium | | +| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown) | 44.20% | Medium | | | 0310 | Minimum Height Trees | | 30.30% | Medium | | | 0311 | Sparse Matrix Multiplication | | 56.70% | Medium | | | 0312 | Burst Balloons | | 47.50% | Hard | | | 0313 | Super Ugly Number | | 41.70% | Medium | | | 0314 | Binary Tree Vertical Order Traversal | | 41.20% | Medium | | -| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0315.%20Count%20of%20Smaller%20Numbers%20After%20Self) | 38.40% | Hard | | +| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self) | 38.40% | Hard | | | 0316 | Remove Duplicate Letters | | 32.80% | Hard | | | 0317 | Shortest Distance from All Buildings | | 38.10% | Hard | | -| 0318 | Maximum Product of Word Lengths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0318.%20Maximum%20Product%20of%20Word%20Lengths) | 48.70% | Medium | | +| 0318 | Maximum Product of Word Lengths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths) | 48.70% | Medium | | | 0319 | Bulb Switcher | | 44.00% | Medium | | | 0320 | Generalized Abbreviation | | 48.90% | Medium | | | 0321 | Create Maximum Number | | 25.50% | Hard | | -| 0322 | Coin Change | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0322.%20Coin%20Change) | 30.80% | Medium | | +| 0322 | Coin Change | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change) | 30.80% | Medium | | | 0323 | Number of Connected Components in an Undirected Graph | | 52.30% | Medium | | -| 0324 | Wiggle Sort II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0324.%20Wiggle%20Sort%20II) | 28.10% | Medium | | +| 0324 | Wiggle Sort II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II) | 28.10% | Medium | | | 0325 | Maximum Size Subarray Sum Equals k | | 44.80% | Medium | | -| 0326 | Power of Three | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0326.%20Power%20of%20Three) | 41.70% | Easy | | -| 0327 | Count of Range Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0327.%20Count%20of%20Range%20Sum) | 32.90% | Hard | | -| 0328 | Odd Even Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0328.%20Odd%20Even%20Linked%20List) | 49.50% | Medium | | -| 0329 | Longest Increasing Path in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0329.%20Longest%20Increasing%20Path%20in%20a%20Matrix) | 40.30% | Hard | | +| 0326 | Power of Three | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three) | 41.70% | Easy | | +| 0327 | Count of Range Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum) | 32.90% | Hard | | +| 0328 | Odd Even Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List) | 49.50% | Medium | | +| 0329 | Longest Increasing Path in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix) | 40.30% | Hard | | | 0330 | Patching Array | | 33.40% | Hard | | -| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0331.%20Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree) | 38.80% | Medium | | +| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree) | 38.80% | Medium | | | 0332 | Reconstruct Itinerary | | 31.70% | Medium | | | 0333 | Largest BST Subtree | | 33.20% | Medium | | | 0334 | Increasing Triplet Subsequence | | 39.60% | Medium | | | 0335 | Self Crossing | | 27.00% | Hard | | | 0336 | Palindrome Pairs | | 31.10% | Hard | | | 0337 | House Robber III | | 48.30% | Medium | | -| 0338 | Counting Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0338.%20Counting%20Bits) | 64.90% | Medium | | +| 0338 | Counting Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits) | 64.90% | Medium | | | 0339 | Nested List Weight Sum | | 68.50% | Easy | | | 0340 | Longest Substring with At Most K Distinct Characters | | 40.00% | Hard | | | 0341 | Flatten Nested List Iterator | | 48.20% | Medium | | -| 0342 | Power of Four | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0342.%20Power%20of%20Four) | 40.40% | Easy | | -| 0343 | Integer Break | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0343.%20Integer%20Break) | 48.00% | Medium | | -| 0344 | Reverse String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0344.%20Reverse%20String) | 63.50% | Easy | | -| 0345 | Reverse Vowels of a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0345.%20Reverse%20Vowels%20of%20a%20String) | 41.70% | Easy | | +| 0342 | Power of Four | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four) | 40.40% | Easy | | +| 0343 | Integer Break | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break) | 48.00% | Medium | | +| 0344 | Reverse String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String) | 63.50% | Easy | | +| 0345 | Reverse Vowels of a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String) | 41.70% | Easy | | | 0346 | Moving Average from Data Stream | | 66.50% | Easy | | -| 0347 | Top K Frequent Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0347.%20Top%20K%20Frequent%20Elements) | 55.30% | Medium | | +| 0347 | Top K Frequent Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements) | 55.30% | Medium | | | 0348 | Design Tic-Tac-Toe | | 50.00% | Medium | | -| 0349 | Intersection of Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays) | 55.10% | Easy | | -| 0350 | Intersection of Two Arrays II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II) | 48.10% | Easy | | +| 0349 | Intersection of Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays) | 55.10% | Easy | | +| 0350 | Intersection of Two Arrays II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II) | 48.10% | Easy | | | 0351 | Android Unlock Patterns | | 46.00% | Medium | | | 0352 | Data Stream as Disjoint Intervals | | 43.70% | Hard | | | 0353 | Design Snake Game | | 30.80% | Medium | | -| 0354 | Russian Doll Envelopes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0354.%20Russian%20Doll%20Envelopes) | 34.10% | Hard | | +| 0354 | Russian Doll Envelopes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes) | 34.10% | Hard | | | 0355 | Design Twitter | | 27.50% | Medium | | | 0356 | Line Reflection | | 30.90% | Medium | | -| 0357 | Count Numbers with Unique Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0357.%20Count%20Numbers%20with%20Unique%20Digits) | 47.10% | Medium | | +| 0357 | Count Numbers with Unique Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits) | 47.10% | Medium | | | 0358 | Rearrange String k Distance Apart | | 32.90% | Hard | | | 0359 | Logger Rate Limiter | | 65.40% | Easy | | | 0360 | Sort Transformed Array | | 46.90% | Medium | | @@ -440,61 +440,60 @@ | 0368 | Largest Divisible Subset | | 34.90% | Medium | | | 0369 | Plus One Linked List | | 56.40% | Medium | | | 0370 | Range Addition | | 60.60% | Medium | | -| 0371 | Sum of Two Integers |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0371.%20Sum%20of%20Two%20Integers) | 50.90% | Easy | | -| 0372 | Super Pow | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0372.%20Super%20Pow) | 35.70% | Medium | | -| 0373 | Find K Pairs with Smallest Sums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0373.%20Find%20K%20Pairs%20with%20Smallest%20Sums) | 34.00% | Medium | | +| 0371 | Sum of Two Integers |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers) | 50.90% | Easy | | +| 0372 | Super Pow | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow) | 35.70% | Medium | | +| 0373 | Find K Pairs with Smallest Sums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums) | 34.00% | Medium | | | 0374 | Guess Number Higher or Lower | | 39.60% | Easy | | | 0375 | Guess Number Higher or Lower II | | 37.80% | Medium | | | 0376 | Wiggle Subsequence | | 37.60% | Medium | | | 0377 | Combination Sum IV | | 43.70% | Medium | | -| 0378 | Kth Smallest Element in a Sorted Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0378.%20Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix) | 49.70% | Medium | | +| 0378 | Kth Smallest Element in a Sorted Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix) | 49.70% | Medium | | | 0379 | Design Phone Directory | | 41.70% | Medium | | | 0380 | Insert Delete GetRandom O(1) | | 43.00% | Medium | | | 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | | 32.10% | Hard | | | 0382 | Linked List Random Node | | 49.40% | Medium | | | 0383 | Ransom Note | | 50.10% | Easy | | | 0384 | Shuffle an Array | | 50.30% | Medium | | -| 0385 | Mini Parser | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0385.%20Mini%20Parser) | 31.90% | Medium | | +| 0385 | Mini Parser | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser) | 31.90% | Medium | | | 0386 | Lexicographical Numbers | | 46.50% | Medium | | -| 0387 | First Unique Character in a String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0387.%20First%20Unique%20Character%20in%20a%20String) | 50.20% | Easy | | +| 0387 | First Unique Character in a String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String) | 50.20% | Easy | | | 0388 | Longest Absolute File Path | | 39.30% | Medium | | -| 0389 | Find the Difference |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0389.%20Find%20the%20Difference) | 53.20% | Easy | | +| 0389 | Find the Difference |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference) | 53.20% | Easy | | | 0390 | Elimination Game | | 43.40% | Medium | | | 0391 | Perfect Rectangle | | 28.30% | Hard | | -| 0392 | Is Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0392.%20Is%20Subsequence) | 46.90% | Medium | | -| 0393 | UTF-8 Validation |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0393.%20UTF-8%20Validation) | 36.00% | Medium | | -| 0394 | Decode String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0394.%20Decode%20String) | 45.20% | Medium | | +| 0392 | Is Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence) | 46.90% | Medium | | +| 0393 | UTF-8 Validation |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation) | 36.00% | Medium | | +| 0394 | Decode String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String) | 45.20% | Medium | | | 0395 | Longest Substring with At Least K Repeating Characters | | 38.80% | Medium | | | 0396 | Rotate Function | | 35.20% | Medium | | -| 0397 | Integer Replacement |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0397.%20Integer%20Replacement) | 31.50% | Medium | | +| 0397 | Integer Replacement |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement) | 31.50% | Medium | | | 0398 | Random Pick Index | | 50.20% | Medium | | -| 0399 | Evaluate Division | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0399.%20Evaluate%20Division) | 47.80% | Medium | | +| 0399 | Evaluate Division | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division) | 47.80% | Medium | | | 0400 | Nth Digit | | 30.40% | Easy | | -| 0401 | Binary Watch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0401.%20Binary%20Watch) | 45.40% | Easy | | -| 0402 | Remove K Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0402.%20Remove%20K%20Digits) | 26.70% | Medium | | +| 0401 | Binary Watch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch) | 45.40% | Easy | | +| 0402 | Remove K Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits) | 26.70% | Medium | | | 0403 | Frog Jump | | 36.40% | Hard | | -| 0404 | Sum of Left Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0404.%20Sum%20of%20Left%20Leaves) | 49.20% | Easy | | -| 0405 | Convert a Number to Hexadecimal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0405.%20Convert%20a%20Number%20to%20Hexadecimal) | 42.00% | Easy | | +| 0404 | Sum of Left Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves) | 49.20% | Easy | | +| 0405 | Convert a Number to Hexadecimal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal) | 42.00% | Easy | | | 0406 | Queue Reconstruction by Height | | 60.10% | Medium | | | 0407 | Trapping Rain Water II | | 39.40% | Hard | | | 0408 | Valid Word Abbreviation | | 29.60% | Easy | | -| 0409 | Longest Palindrome |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0409.%20Longest%20Palindrome) | 48.20% | Easy | | -| 0410 | Split Array Largest Sum |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0410.%20Split%20Array%20Largest%20Sum) | 42.60% | Hard | | +| 0409 | Longest Palindrome |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome) | 48.20% | Easy | | +| 0410 | Split Array Largest Sum |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum) | 42.60% | Hard | | | 0411 | Minimum Unique Word Abbreviation | | 35.10% | Hard | | -| 0412 | Fizz Buzz | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0412.%20Fizz%20Buzz) | 59.70% | Easy | | +| 0412 | Fizz Buzz | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz) | 59.70% | Easy | | | 0413 | Arithmetic Slices | | 56.00% | Medium | | -| 0414 | Third Maximum Number | -[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0414.%20Third%20Maximum%20Number) | 29.10% | Easy | | +| 0414 | Third Maximum Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)| 29.10% | Easy | | | 0415 | Add Strings | | 43.90% | Easy | | -| 0416 | Partition Equal Subset Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0416.%20Partition%20Equal%20Subset%20Sum) | 40.90% | Medium | | +| 0416 | Partition Equal Subset Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum) | 40.90% | Medium | | | 0417 | Pacific Atlantic Water Flow | | 37.60% | Medium | | | 0418 | Sentence Screen Fitting | | 31.20% | Medium | | | 0419 | Battleships in a Board | | 65.90% | Medium | | | 0420 | Strong Password Checker | | 17.20% | Hard | | -| 0421 | Maximum XOR of Two Numbers in an Array |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0421.%20Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array) | 51.20% | Medium | | +| 0421 | Maximum XOR of Two Numbers in an Array |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array) | 51.20% | Medium | | | 0422 | Valid Word Square | | 36.60% | Easy | | | 0423 | Reconstruct Original Digits from English | | 45.70% | Medium | | -| 0424 | Longest Repeating Character Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0424.%20Longest%20Repeating%20Character%20Replacement) | 44.30% | Medium | | +| 0424 | Longest Repeating Character Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement) | 44.30% | Medium | | | 0425 | Word Squares | | 44.50% | Hard | | | 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | | 52.50% | Medium | | | 0427 | Construct Quad Tree | | 57.20% | Medium | | @@ -503,57 +502,57 @@ | 0430 | Flatten a Multilevel Doubly Linked List | | 42.60% | Medium | | | 0431 | Encode N-ary Tree to Binary Tree | | 64.20% | Hard | | | 0432 | All O`one Data Structure | | 29.70% | Hard | | -| 0433 | Minimum Genetic Mutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0433.%20Minimum%20Genetic%20Mutation) | 38.40% | Medium | | +| 0433 | Minimum Genetic Mutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation) | 38.40% | Medium | | | 0434 | Number of Segments in a String | | 37.00% | Easy | | -| 0435 | Non-overlapping Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0435.%20Non-overlapping%20Intervals) | 41.60% | Medium | | -| 0436 | Find Right Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0436.%20Find%20Right%20Interval) | 42.90% | Medium | | -| 0437 | Path Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0437.%20Path%20Sum%20III) | 43.00% | Easy | | -| 0438 | Find All Anagrams in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0438.%20Find%20All%20Anagrams%20in%20a%20String) | 37.50% | Easy | | +| 0435 | Non-overlapping Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals) | 41.60% | Medium | | +| 0436 | Find Right Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval) | 42.90% | Medium | | +| 0437 | Path Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III) | 43.00% | Easy | | +| 0438 | Find All Anagrams in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String) | 37.50% | Easy | | | 0439 | Ternary Expression Parser | | 53.70% | Medium | | | 0440 | K-th Smallest in Lexicographical Order | | 26.60% | Hard | | -| 0441 | Arranging Coins |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0441.%20Arranging%20Coins) | 38.10% | Easy | | +| 0441 | Arranging Coins |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins) | 38.10% | Easy | | | 0442 | Find All Duplicates in an Array | | 61.30% | Medium | | | 0443 | String Compression | | 37.90% | Easy | | | 0444 | Sequence Reconstruction | | 20.50% | Medium | | -| 0445 | Add Two Numbers II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0445.%20Add%20Two%20Numbers%20II) | 50.40% | Medium | | +| 0445 | Add Two Numbers II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II) | 50.40% | Medium | | | 0446 | Arithmetic Slices II - Subsequence | | 30.30% | Hard | | -| 0447 | Number of Boomerangs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0447.%20Number%20of%20Boomerangs) | 50.00% | Easy | | +| 0447 | Number of Boomerangs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs) | 50.00% | Easy | | | 0448 | Find All Numbers Disappeared in an Array | | 53.60% | Easy | | | 0449 | Serialize and Deserialize BST | | 47.50% | Medium | | | 0450 | Delete Node in a BST | | 40.20% | Medium | | -| 0451 | Sort Characters By Frequency | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0451.%20Sort%20Characters%20By%20Frequency) | 56.40% | Medium | | +| 0451 | Sort Characters By Frequency | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency) | 56.40% | Medium | | | 0452 | Minimum Number of Arrows to Burst Balloons | | 46.60% | Medium | | | 0453 | Minimum Moves to Equal Array Elements | | 49.30% | Easy | | -| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0454.%204Sum%20II) | 50.80% | Medium | | -| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0455.%20Assign%20Cookies) | 48.50% | Easy | | -| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0456.%20132%20Pattern) | 27.40% | Medium | | -| 0457 | Circular Array Loop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0457.%20Circular%20Array%20Loop) | 27.70% | Medium | | +| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II) | 50.80% | Medium | | +| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies) | 48.50% | Easy | | +| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern) | 27.40% | Medium | | +| 0457 | Circular Array Loop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop) | 27.70% | Medium | | | 0458 | Poor Pigs | | 45.50% | Hard | | | 0459 | Repeated Substring Pattern | | 40.00% | Easy | | | 0460 | LFU Cache | | 29.00% | Hard | | -| 0461 | Hamming Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0461.%20Hamming%20Distance) | 70.40% | Easy | | +| 0461 | Hamming Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance) | 70.40% | Easy | | | 0462 | Minimum Moves to Equal Array Elements II | | 52.50% | Medium | | -| 0463 | Island Perimeter |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0463.%20Island%20Perimeter) | 61.20% | Easy | | +| 0463 | Island Perimeter |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter) | 61.20% | Easy | | | 0464 | Can I Win | | 27.30% | Medium | | | 0465 | Optimal Account Balancing | | 42.90% | Hard | | | 0466 | Count The Repetitions | | 27.30% | Hard | | | 0467 | Unique Substrings in Wraparound String | | 34.10% | Medium | | | 0468 | Validate IP Address | | 21.40% | Medium | | | 0469 | Convex Polygon | | 35.50% | Medium | | -| 0470 | Implement Rand10() Using Rand7() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0470.%20Implement%20Rand10()%20Using%20Rand7()) | 45.10% | Medium | | +| 0470 | Implement Rand10() Using Rand7() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7) | 45.10% | Medium | | | 0471 | Encode String with Shortest Length | | 45.20% | Hard | | | 0472 | Concatenated Words | | 35.10% | Hard | | | 0473 | Matchsticks to Square | | 36.00% | Medium | | -| 0474 | Ones and Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0474.%20Ones%20and%20Zeroes) | 39.80% | Medium | | +| 0474 | Ones and Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes) | 39.80% | Medium | | | 0475 | Heaters | | 31.90% | Easy | | -| 0476 | Number Complement |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0476.%20Number%20Complement) | 62.50% | Easy | | -| 0477 | Total Hamming Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0477.%20Total%20Hamming%20Distance) | 49.00% | Medium | | +| 0476 | Number Complement |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement) | 62.50% | Easy | | +| 0477 | Total Hamming Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance) | 49.00% | Medium | | | 0478 | Generate Random Point in a Circle | | 36.90% | Medium | | | 0479 | Largest Palindrome Product | | 27.50% | Hard | | -| 0480 | Sliding Window Median | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0480.%20Sliding%20Window%20Median) | 32.80% | Hard | | +| 0480 | Sliding Window Median | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median) | 32.80% | Hard | | | 0481 | Magical String | | 46.30% | Medium | | | 0482 | License Key Formatting | | 41.10% | Easy | | -| 0483 | Smallest Good Base | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0483.%20Smallest%20Good%20Base) | 34.20% | Hard | | +| 0483 | Smallest Good Base | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base) | 34.20% | Hard | | | 0484 | Find Permutation | | 57.80% | Medium | | | 0485 | Max Consecutive Ones | | 55.10% | Easy | | | 0486 | Predict the Winner | | 46.80% | Medium | | @@ -561,31 +560,31 @@ | 0488 | Zuma Game | | 39.10% | Hard | | | 0489 | Robot Room Cleaner | | 64.70% | Hard | | | 0490 | The Maze | | 47.60% | Medium | | -| 0491 | Increasing Subsequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0491.%20Increasing%20Subsequences) | 42.20% | Medium | | +| 0491 | Increasing Subsequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences) | 42.20% | Medium | | | 0492 | Construct the Rectangle | | 48.80% | Easy | | -| 0493 | Reverse Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0493.%20Reverse%20Pairs) | 23.30% | Hard | | +| 0493 | Reverse Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs) | 23.30% | Hard | | | 0494 | Target Sum | | 45.40% | Medium | | | 0495 | Teemo Attacking | | 52.30% | Medium | | -| 0496 | Next Greater Element I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0496.%20Next%20Greater%20Element%20I) | 59.80% | Easy | | -| 0497 | Random Point in Non-overlapping Rectangles |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0497.%20Random%20Point%20in%20Non-overlapping%20Rectangles) | 35.90% | Medium | | -| 0498 | Diagonal Traverse | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0498.%20Diagonal%20Traverse) | 45.40% | Medium | | +| 0496 | Next Greater Element I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I) | 59.80% | Easy | | +| 0497 | Random Point in Non-overlapping Rectangles |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles) | 35.90% | Medium | | +| 0498 | Diagonal Traverse | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse) | 45.40% | Medium | | | 0499 | The Maze III | | 37.40% | Hard | | -| 0500 | Keyboard Row |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0500.%20Keyboard%20Row) | 62.40% | Easy | | +| 0500 | Keyboard Row |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row) | 62.40% | Easy | | | 0501 | Find Mode in Binary Search Tree | | 39.60% | Easy | | | 0502 | IPO | | 38.00% | Hard | | -| 0503 | Next Greater Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0503.%20Next%20Greater%20Element%20II) | 51.30% | Medium | | +| 0503 | Next Greater Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II) | 51.30% | Medium | | | 0504 | Base 7 | | 45.00% | Easy | | | 0505 | The Maze II | | 44.10% | Medium | | | 0506 | Relative Ranks | | 48.40% | Easy | | | 0507 | Perfect Number | | 34.40% | Easy | | -| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0508.%20Most%20Frequent%20Subtree%20Sum) | 54.80% | Medium | | -| 0509 | Fibonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0509.%20Fibonacci%20Number) | 66.70% | Easy | | +| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum) | 54.80% | Medium | | +| 0509 | Fibonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number) | 66.70% | Easy | | | 0510 | Inorder Successor in BST II | | 53.30% | Medium | | | 0511 | Game Play Analysis I | | 74.40% | Easy | | | 0512 | Game Play Analysis II | | 56.80% | Easy | | -| 0513 | Find Bottom Left Tree Value | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0513.%20Find%20Bottom%20Left%20Tree%20Value) | 58.60% | Medium | | +| 0513 | Find Bottom Left Tree Value | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value) | 58.60% | Medium | | | 0514 | Freedom Trail | | 40.70% | Hard | | -| 0515 | Find Largest Value in Each Tree Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row) | 58.00% | Medium | | +| 0515 | Find Largest Value in Each Tree Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row) | 58.00% | Medium | | | 0516 | Longest Palindromic Subsequence | | 47.10% | Medium | | | 0517 | Super Washing Machines | | 37.00% | Hard | | | 0518 | Coin Change 2 | | 43.10% | Medium | | @@ -594,15 +593,15 @@ | 0521 | Longest Uncommon Subsequence I | | 56.50% | Easy | | | 0522 | Longest Uncommon Subsequence II | | 32.90% | Medium | | | 0523 | Continuous Subarray Sum | | 24.20% | Medium | | -| 0524 | Longest Word in Dictionary through Deleting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0524.%20Longest%20Word%20in%20Dictionary%20through%20Deleting) | 46.00% | Medium | | +| 0524 | Longest Word in Dictionary through Deleting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting) | 46.00% | Medium | | | 0525 | Contiguous Array | | 42.80% | Medium | | -| 0526 | Beautiful Arrangement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0526.%20Beautiful%20Arrangement) | 54.80% | Medium | | +| 0526 | Beautiful Arrangement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement) | 54.80% | Medium | | | 0527 | Word Abbreviation | | 50.20% | Hard | | -| 0528 | Random Pick with Weight |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0528.%20Random%20Pick%20with%20Weight) | 42.80% | Medium | | +| 0528 | Random Pick with Weight |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight) | 42.80% | Medium | | | 0529 | Minesweeper | | 53.10% | Medium | | | 0530 | Minimum Absolute Difference in BST | | 50.70% | Easy | | | 0531 | Lonely Pixel I | | 57.60% | Medium | | -| 0532 | K-diff Pairs in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0532.%20K-diff%20Pairs%20in%20an%20Array) | 30.00% | Easy | | +| 0532 | K-diff Pairs in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array) | 30.00% | Easy | | | 0533 | Lonely Pixel II | | 46.20% | Medium | | | 0534 | Game Play Analysis III | | 64.60% | Medium | | | 0535 | Encode and Decode TinyURL | | 76.90% | Medium | | @@ -611,13 +610,13 @@ | 0538 | Convert BST to Greater Tree | | 51.30% | Easy | | | 0539 | Minimum Time Difference | | 48.10% | Medium | | | 0540 | Single Element in a Sorted Array | | 57.40% | Medium | | -| 0541 | Reverse String II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0541.%20Reverse%20String%20II) | 45.70% | Easy | | -| 0542 | 01 Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0542.%2001%20Matrix) | 36.00% | Medium | | +| 0541 | Reverse String II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II) | 45.70% | Easy | | +| 0542 | 01 Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix) | 36.00% | Medium | | | 0543 | Diameter of Binary Tree | | 46.90% | Easy | | | 0544 | Output Contest Matches | | 73.50% | Medium | | | 0545 | Boundary of Binary Tree | | 35.30% | Medium | | | 0546 | Remove Boxes | | 38.50% | Hard | | -| 0547 | Friend Circles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0547.%20Friend%20Circles) | 53.90% | Medium | | +| 0547 | Friend Circles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Friend-Circles) | 53.90% | Medium | | | 0548 | Split Array with Equal Sum | | 43.50% | Medium | | | 0549 | Binary Tree Longest Consecutive Sequence II | | 44.50% | Medium | | | 0550 | Game Play Analysis IV | | 42.20% | Medium | | @@ -627,25 +626,25 @@ | 0554 | Brick Wall | | 47.80% | Medium | | | 0555 | Split Concatenated Strings | | 40.00% | Medium | | | 0556 | Next Greater Element III | | 30.00% | Medium | | -| 0557 | Reverse Words in a String III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0557.%20Reverse%20Words%20in%20a%20String%20III) | 64.40% | Easy | | +| 0557 | Reverse Words in a String III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III) | 64.40% | Easy | | | 0558 | Quad Tree Intersection | | 41.10% | Easy | | | 0559 | Maximum Depth of N-ary Tree | | 65.60% | Easy | | | 0560 | Subarray Sum Equals K | | 42.30% | Medium | | | 0561 | Array Partition I | | 69.30% | Easy | | | 0562 | Longest Line of Consecutive One in Matrix | | 43.80% | Medium | | -| 0563 | Binary Tree Tilt | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0563.%20Binary%20Tree%20Tilt) | 47.10% | Easy | | +| 0563 | Binary Tree Tilt | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt) | 47.10% | Easy | | | 0564 | Find the Closest Palindrome | | 18.90% | Hard | | | 0565 | Array Nesting | | 52.80% | Medium | | -| 0566 | Reshape the Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0566.%20Reshape%20the%20Matrix) | 59.00% | Easy | | -| 0567 | Permutation in String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0567.%20Permutation%20in%20String) | 38.60% | Medium | | +| 0566 | Reshape the Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix) | 59.00% | Easy | | +| 0567 | Permutation in String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String) | 38.60% | Medium | | | 0568 | Maximum Vacation Days | | 38.30% | Hard | | | 0569 | Median Employee Salary | | 47.60% | Hard | | | 0570 | Managers with at Least 5 Direct Reports | | 62.90% | Medium | | | 0571 | Find Median Given Frequency of Numbers | | 46.80% | Hard | | -| 0572 | Subtree of Another Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0572.%20Subtree%20of%20Another%20Tree) | 41.80% | Easy | | +| 0572 | Subtree of Another Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree) | 41.80% | Easy | | | 0573 | Squirrel Simulation | | 53.80% | Medium | | | 0574 | Winning Candidate | | 36.80% | Medium | | -| 0575 | Distribute Candies |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0575.%20Distribute%20Candies) | 59.80% | Easy | | +| 0575 | Distribute Candies |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies) | 59.80% | Easy | | | 0576 | Out of Boundary Paths | | 32.30% | Medium | | | 0577 | Employee Bonus | | 59.90% | Easy | | | 0578 | Get Highest Answer Rate Question | | 35.70% | Medium | | @@ -664,12 +663,12 @@ | 0591 | Tag Validator | | 32.90% | Hard | | | 0592 | Fraction Addition and Subtraction | | 47.20% | Medium | | | 0593 | Valid Square | | 40.60% | Medium | | -| 0594 | Longest Harmonious Subsequence |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0594.%20Longest%20Harmonious%20Subsequence) | 44.00% | Easy | | +| 0594 | Longest Harmonious Subsequence |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence) | 44.00% | Easy | | | 0595 | Big Countries | | 74.00% | Easy | | | 0596 | Classes More Than 5 Students | | 35.80% | Easy | | | 0597 | Friend Requests I: Overall Acceptance Rate | | 39.80% | Easy | | | 0598 | Range Addition II | | 48.70% | Easy | | -| 0599 | Minimum Index Sum of Two Lists |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0599.%20Minimum%20Index%20Sum%20of%20Two%20Lists) | 48.20% | Easy | | +| 0599 | Minimum Index Sum of Two Lists |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists) | 48.20% | Easy | | | 0600 | Non-negative Integers without Consecutive Ones | | 32.80% | Hard | | | 0601 | Human Traffic of Stadium | | 36.80% | Hard | | | 0602 | Friend Requests II: Who Has the Most Friends | | 45.40% | Medium | | @@ -698,16 +697,16 @@ | 0625 | Minimum Factorization | | 32.00% | Medium | | | 0626 | Exchange Seats | | 54.80% | Medium | | | 0627 | Swap Salary | | 69.20% | Easy | | -| 0628 | Maximum Product of Three Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0628.%20Maximum%20Product%20of%20Three%20Numbers) | 46.20% | Easy | | +| 0628 | Maximum Product of Three Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers) | 46.20% | Easy | | | 0629 | K Inverse Pairs Array | | 29.30% | Hard | | | 0630 | Course Schedule III | | 31.90% | Hard | | | 0631 | Design Excel Sum Formula | | 29.30% | Hard | | -| 0632 | Smallest Range Covering Elements from K Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists) | 47.90% | Hard | | +| 0632 | Smallest Range Covering Elements from K Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists) | 47.90% | Hard | | | 0633 | Sum of Square Numbers | | 32.70% | Easy | | | 0634 | Find the Derangement of An Array | | 37.80% | Medium | | | 0635 | Design Log Storage System | | 54.40% | Medium | | -| 0636 | Exclusive Time of Functions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0636.%20Exclusive%20Time%20of%20Functions) | 48.80% | Medium | | -| 0637 | Average of Levels in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0637.%20Average%20of%20Levels%20in%20Binary%20Tree) | 59.00% | Easy | | +| 0636 | Exclusive Time of Functions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions) | 48.80% | Medium | | +| 0637 | Average of Levels in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree) | 59.00% | Easy | | | 0638 | Shopping Offers | | 48.90% | Medium | | | 0639 | Decode Ways II | | 25.30% | Hard | | | 0640 | Solve the Equation | | 40.40% | Medium | | @@ -715,30 +714,30 @@ | 0642 | Design Search Autocomplete System | | 38.20% | Hard | | | 0643 | Maximum Average Subarray I | | 39.70% | Easy | | | 0644 | Maximum Average Subarray II | | 28.70% | Hard | | -| 0645 | Set Mismatch |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0645.%20Set%20Mismatch) | 40.80% | Easy | | +| 0645 | Set Mismatch |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch) | 40.80% | Easy | | | 0646 | Maximum Length of Pair Chain | | 49.00% | Medium | | | 0647 | Palindromic Substrings | | 57.20% | Medium | | -| 0648 | Replace Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0648.%20Replace%20Words) | 52.20% | Medium | | +| 0648 | Replace Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words) | 52.20% | Medium | | | 0649 | Dota2 Senate | | 37.80% | Medium | | | 0650 | 2 Keys Keyboard | | 46.80% | Medium | | | 0651 | 4 Keys Keyboard | | 50.80% | Medium | | | 0652 | Find Duplicate Subtrees | | 45.90% | Medium | | -| 0653 | Two Sum IV - Input is a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0653.%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST) | 52.60% | Easy | | +| 0653 | Two Sum IV - Input is a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV---Input-is-a-BST) | 52.60% | Easy | | | 0654 | Maximum Binary Tree | | 76.40% | Medium | | | 0655 | Print Binary Tree | | 52.10% | Medium | | | 0656 | Coin Path | | 27.00% | Hard | | | 0657 | Robot Return to Origin | | 71.70% | Easy | | -| 0658 | Find K Closest Elements |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0658.%20Find%20K%20Closest%20Elements) | 38.20% | Medium | | +| 0658 | Find K Closest Elements |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements) | 38.20% | Medium | | | 0659 | Split Array into Consecutive Subsequences | | 40.80% | Medium | | | 0660 | Remove 9 | | 51.60% | Hard | | | 0661 | Image Smoother | | 49.00% | Easy | | -| 0662 | Maximum Width of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0662.%20Maximum%20Width%20of%20Binary%20Tree) | 39.60% | Medium | | +| 0662 | Maximum Width of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree) | 39.60% | Medium | | | 0663 | Equal Tree Partition | | 38.10% | Medium | | | 0664 | Strange Printer | | 36.90% | Hard | | | 0665 | Non-decreasing Array | | 19.50% | Easy | | | 0666 | Path Sum IV | | 52.50% | Medium | | | 0667 | Beautiful Arrangement II | | 52.10% | Medium | | -| 0668 | Kth Smallest Number in Multiplication Table |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0668.%20Kth%20Smallest%20Number%20in%20Multiplication%20Table) | 42.20% | Hard | | +| 0668 | Kth Smallest Number in Multiplication Table |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table) | 42.20% | Hard | | | 0669 | Trim a Binary Search Tree | | 60.50% | Easy | | | 0670 | Maximum Swap | | 39.80% | Medium | | | 0671 | Second Minimum Node In a Binary Tree | | 43.30% | Easy | | @@ -746,16 +745,16 @@ | 0673 | Number of Longest Increasing Subsequence | | 33.70% | Medium | | | 0674 | Longest Continuous Increasing Subsequence | | 44.40% | Easy | | | 0675 | Cut Off Trees for Golf Event | | 30.80% | Hard | | -| 0676 | Implement Magic Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0676.%20Implement%20Magic%20Dictionary) | 51.70% | Medium | | +| 0676 | Implement Magic Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary) | 51.70% | Medium | | | 0677 | Map Sum Pairs | | 51.80% | Medium | | | 0678 | Valid Parenthesis String | | 32.90% | Medium | | | 0679 | 24 Game | | 43.00% | Hard | | | 0680 | Valid Palindrome II | | 34.30% | Easy | | | 0681 | Next Closest Time | | 42.70% | Medium | | -| 0682 | Baseball Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0682.%20Baseball%20Game) | 61.20% | Easy | | +| 0682 | Baseball Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game) | 61.20% | Easy | | | 0683 | K Empty Slots | | 34.20% | Hard | | -| 0684 | Redundant Connection | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0684.%20Redundant%20Connection) | 52.10% | Medium | | -| 0685 | Redundant Connection II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0685.%20Redundant%20Connection%20II) | 30.80% | Hard | | +| 0684 | Redundant Connection | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection) | 52.10% | Medium | | +| 0685 | Redundant Connection II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II) | 30.80% | Hard | | | 0686 | Repeated String Match | | 31.50% | Easy | | | 0687 | Longest Univalue Path | | 33.90% | Easy | | | 0688 | Knight Probability in Chessboard | | 44.60% | Medium | | @@ -763,62 +762,62 @@ | 0690 | Employee Importance | | 54.40% | Easy | | | 0691 | Stickers to Spell Word | | 38.50% | Hard | | | 0692 | Top K Frequent Words | | 46.00% | Medium | | -| 0693 | Binary Number with Alternating Bits |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0693.%20Binary%20Number%20with%20Alternating%20Bits) | 58.00% | Easy | | +| 0693 | Binary Number with Alternating Bits |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits) | 58.00% | Easy | | | 0694 | Number of Distinct Islands | | 51.40% | Medium | | | 0695 | Max Area of Island | | 57.60% | Medium | | | 0696 | Count Binary Substrings | | 53.60% | Easy | | | 0697 | Degree of an Array | | 50.60% | Easy | | | 0698 | Partition to K Equal Sum Subsets | | 42.50% | Medium | | -| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0699.%20Falling%20Squares) | 40.10% | Hard | | +| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares) | 40.10% | Hard | | | 0700 | Search in a Binary Search Tree | | 68.60% | Easy | | | 0701 | Insert into a Binary Search Tree | | 76.10% | Medium | | | 0702 | Search in a Sorted Array of Unknown Size | | 59.30% | Medium | | | 0703 | Kth Largest Element in a Stream | | 46.60% | Easy | | -| 0704 | Binary Search |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0704.%20Binary%20Search) | 48.00% | Easy | | -| 0705 | Design HashSet |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0705.%20Design%20HashSet) | 53.90% | Easy | | -| 0706 | Design HashMap |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0706.%20Design%20HashMap) | 56.30% | Easy | | -| 0707 | Design Linked List |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0707.%20Design%20Linked%20List) | 21.60% | Easy | | +| 0704 | Binary Search |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search) | 48.00% | Easy | | +| 0705 | Design HashSet |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet) | 53.90% | Easy | | +| 0706 | Design HashMap |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap) | 56.30% | Easy | | +| 0707 | Design Linked List |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List) | 21.60% | Easy | | | 0708 | Insert into a Cyclic Sorted List | | 29.20% | Medium | | | 0709 | To Lower Case | | 77.00% | Easy | | -| 0710 | Random Pick with Blacklist |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0710.%20Random%20Pick%20with%20Blacklist) | 31.30% | Hard | | +| 0710 | Random Pick with Blacklist |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist) | 31.30% | Hard | | | 0711 | Number of Distinct Islands II | | 46.20% | Hard | | | 0712 | Minimum ASCII Delete Sum for Two Strings | | 54.80% | Medium | | -| 0713 | Subarray Product Less Than K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0713.%20Subarray%20Product%20Less%20Than%20K) | 36.80% | Medium | | -| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee) | 50.60% | Medium | | -| 0715 | Range Module | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0715.%20Range%20Module) | 35.70% | Hard | | +| 0713 | Subarray Product Less Than K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K) | 36.80% | Medium | | +| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee) | 50.60% | Medium | | +| 0715 | Range Module | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module) | 35.70% | Hard | | | 0716 | Max Stack | | 40.20% | Easy | | -| 0717 | 1-bit and 2-bit Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0717.%201-bit%20and%202-bit%20Characters) | 49.20% | Easy | | -| 0718 | Maximum Length of Repeated Subarray |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0718.%20Maximum%20Length%20of%20Repeated%20Subarray) | 46.30% | Medium | | -| 0719 | Find K-th Smallest Pair Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0719.%20Find%20K-th%20Smallest%20Pair%20Distance) | 29.30% | Hard | | -| 0720 | Longest Word in Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0720.%20Longest%20Word%20in%20Dictionary) | 45.00% | Easy | | -| 0721 | Accounts Merge | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0721.%20Accounts%20Merge) | 40.80% | Medium | | +| 0717 | 1-bit and 2-bit Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters) | 49.20% | Easy | | +| 0718 | Maximum Length of Repeated Subarray |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray) | 46.30% | Medium | | +| 0719 | Find K-th Smallest Pair Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance) | 29.30% | Hard | | +| 0720 | Longest Word in Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary) | 45.00% | Easy | | +| 0721 | Accounts Merge | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge) | 40.80% | Medium | | | 0722 | Remove Comments | | 31.40% | Medium | | | 0723 | Candy Crush | | 63.40% | Medium | | | 0724 | Find Pivot Index | | 41.30% | Easy | | -| 0725 | Split Linked List in Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0725.%20Split%20Linked%20List%20in%20Parts) | 49.10% | Medium | | -| 0726 | Number of Atoms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0726.%20Number%20of%20Atoms) | 44.90% | Hard | | +| 0725 | Split Linked List in Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts) | 49.10% | Medium | | +| 0726 | Number of Atoms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms) | 44.90% | Hard | | | 0727 | Minimum Window Subsequence | | 37.50% | Hard | | | 0728 | Self Dividing Numbers | | 70.50% | Easy | | -| 0729 | My Calendar I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0729.%20My%20Calendar%20I) | 47.60% | Medium | | +| 0729 | My Calendar I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I) | 47.60% | Medium | | | 0730 | Count Different Palindromic Subsequences | | 39.20% | Hard | | | 0731 | My Calendar II | | 44.80% | Medium | | -| 0732 | My Calendar III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0732.%20My%20Calendar%20III) | 55.20% | Hard | | -| 0733 | Flood Fill | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0733.%20Flood%20Fill) | 51.10% | Easy | | +| 0732 | My Calendar III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III) | 55.20% | Hard | | +| 0733 | Flood Fill | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill) | 51.10% | Easy | | | 0734 | Sentence Similarity | | 40.80% | Easy | | -| 0735 | Asteroid Collision | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0735.%20Asteroid%20Collision) | 38.60% | Medium | | +| 0735 | Asteroid Collision | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision) | 38.60% | Medium | | | 0736 | Parse Lisp Expression | | 44.30% | Hard | | | 0737 | Sentence Similarity II | | 43.60% | Medium | | | 0738 | Monotone Increasing Digits | | 42.00% | Medium | | -| 0739 | Daily Temperatures | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0739.%20Daily%20Temperatures) | 60.10% | Medium | | +| 0739 | Daily Temperatures | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures) | 60.10% | Medium | | | 0740 | Delete and Earn | | 46.10% | Medium | | | 0741 | Cherry Pickup | | 30.10% | Hard | | | 0742 | Closest Leaf in a Binary Tree | | 39.40% | Medium | | | 0743 | Network Delay Time | | 42.40% | Medium | | -| 0744 | Find Smallest Letter Greater Than Target |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0744.%20Find%20Smallest%20Letter%20Greater%20Than%20Target) | 44.10% | Easy | | -| 0745 | Prefix and Suffix Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0745.%20Prefix%20and%20Suffix%20Search) | 30.90% | Hard | | -| 0746 | Min Cost Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0746.%20Min%20Cost%20Climbing%20Stairs) | 47.50% | Easy | | +| 0744 | Find Smallest Letter Greater Than Target |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target) | 44.10% | Easy | | +| 0745 | Prefix and Suffix Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search) | 30.90% | Hard | | +| 0746 | Min Cost Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs) | 47.50% | Easy | | | 0747 | Largest Number At Least Twice of Others | | 40.70% | Easy | | -| 0748 | Shortest Completing Word |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0748.%20Shortest%20Completing%20Word) | 54.50% | Easy | | +| 0748 | Shortest Completing Word |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word) | 54.50% | Easy | | | 0749 | Contain Virus | | 41.40% | Hard | | | 0750 | Number Of Corner Rectangles | | 64.80% | Medium | | | 0751 | IP to CIDR | | 59.70% | Easy | | @@ -826,44 +825,44 @@ | 0753 | Cracking the Safe | | 46.60% | Hard | | | 0754 | Reach a Number | | 32.80% | Easy | | | 0755 | Pour Water | | 40.80% | Medium | | -| 0756 | Pyramid Transition Matrix |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0756.%20Pyramid%20Transition%20Matrix) | 51.80% | Medium | | +| 0756 | Pyramid Transition Matrix |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix) | 51.80% | Medium | | | 0757 | Set Intersection Size At Least Two | | 37.00% | Hard | | | 0758 | Bold Words in String | | 42.70% | Easy | | | 0759 | Employee Free Time | | 61.50% | Hard | | | 0760 | Find Anagram Mappings | | 79.40% | Easy | | | 0761 | Special Binary String | | 52.00% | Hard | | -| 0762 | Prime Number of Set Bits in Binary Representation |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0762.%20Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation) | 59.60% | Easy | | -| 0763 | Partition Labels | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0763.%20Partition%20Labels) | 70.80% | Medium | | +| 0762 | Prime Number of Set Bits in Binary Representation |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation) | 59.60% | Easy | | +| 0763 | Partition Labels | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels) | 70.80% | Medium | | | 0764 | Largest Plus Sign | | 43.50% | Medium | | -| 0765 | Couples Holding Hands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0765.%20Couples%20Holding%20Hands) | 51.70% | Hard | | -| 0766 | Toeplitz Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0766.%20Toeplitz%20Matrix) | 61.90% | Easy | | -| 0767 | Reorganize String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0767.%20Reorganize%20String) | 42.70% | Medium | | +| 0765 | Couples Holding Hands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands) | 51.70% | Hard | | +| 0766 | Toeplitz Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix) | 61.90% | Easy | | +| 0767 | Reorganize String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String) | 42.70% | Medium | | | 0768 | Max Chunks To Make Sorted II | | 46.10% | Hard | | | 0769 | Max Chunks To Make Sorted | | 51.90% | Medium | | | 0770 | Basic Calculator IV | | 45.70% | Hard | | -| 0771 | Jewels and Stones |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0771.%20Jewels%20and%20Stones) | 83.20% | Easy | | +| 0771 | Jewels and Stones |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones) | 83.20% | Easy | | | 0772 | Basic Calculator III | | 43.40% | Hard | | | 0773 | Sliding Puzzle | | 52.90% | Hard | | | 0774 | Minimize Max Distance to Gas Station | | 42.00% | Hard | | | 0775 | Global and Local Inversions | | 39.10% | Medium | | | 0776 | Split BST | | 52.70% | Medium | | | 0777 | Swap Adjacent in LR String | | 33.40% | Medium | | -| 0778 | Swim in Rising Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0778.%20Swim%20in%20Rising%20Water) | 47.80% | Hard | | +| 0778 | Swim in Rising Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water) | 47.80% | Hard | | | 0779 | K-th Symbol in Grammar | | 37.50% | Medium | | | 0780 | Reaching Points | | 27.60% | Hard | | -| 0781 | Rabbits in Forest |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0781.%20Rabbits%20in%20Forest) | 51.80% | Medium | | +| 0781 | Rabbits in Forest |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest) | 51.80% | Medium | | | 0782 | Transform to Chessboard | | 39.80% | Hard | | | 0783 | Minimum Distance Between BST Nodes | | 50.60% | Easy | | -| 0784 | Letter Case Permutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0784.%20Letter%20Case%20Permutation) | 57.40% | Easy | | +| 0784 | Letter Case Permutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation) | 57.40% | Easy | | | 0785 | Is Graph Bipartite? | | 43.50% | Medium | | -| 0786 | K-th Smallest Prime Fraction |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0786.%20K-th%20Smallest%20Prime%20Fraction) | 39.90% | Hard | | +| 0786 | K-th Smallest Prime Fraction |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction) | 39.90% | Hard | | | 0787 | Cheapest Flights Within K Stops | | 35.20% | Medium | | | 0788 | Rotated Digits | | 54.40% | Easy | | | 0789 | Escape The Ghosts | | 55.40% | Medium | | | 0790 | Domino and Tromino Tiling | | 36.00% | Medium | | | 0791 | Custom Sort String | | 62.30% | Medium | | | 0792 | Number of Matching Subsequences | | 43.40% | Medium | | -| 0793 | Preimage Size of Factorial Zeroes Function | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0793.%20Preimage%20Size%20of%20Factorial%20Zeroes%20Function) | 39.10% | Hard | | +| 0793 | Preimage Size of Factorial Zeroes Function | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function) | 39.10% | Hard | | | 0794 | Valid Tic-Tac-Toe State | | 29.80% | Medium | | | 0795 | Number of Subarrays with Bounded Maximum | | 43.40% | Medium | | | 0796 | Rotate String | | 49.10% | Easy | | @@ -873,7 +872,7 @@ | 0800 | Similar RGB Color | | 59.80% | Easy | | | 0801 | Minimum Swaps To Make Sequences Increasing | | 34.90% | Medium | | | 0802 | Find Eventual Safe States | | 44.10% | Medium | | -| 0803 | Bricks Falling When Hit | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0803.%20Bricks%20Falling%20When%20Hit) | 28.80% | Hard | | +| 0803 | Bricks Falling When Hit | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit) | 28.80% | Hard | | | 0804 | Unique Morse Code Words | | 74.90% | Easy | | | 0805 | Split Array With Same Average | | 24.50% | Hard | | | 0806 | Number of Lines To Write String | | 63.20% | Easy | | @@ -881,52 +880,52 @@ | 0808 | Soup Servings | | 37.50% | Medium | | | 0809 | Expressive Words | | 43.70% | Medium | | | 0810 | Chalkboard XOR Game | | 45.10% | Hard | | -| 0811 | Subdomain Visit Count |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0811.%20Subdomain%20Visit%20Count) | 65.60% | Easy | | +| 0811 | Subdomain Visit Count |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count) | 65.60% | Easy | | | 0812 | Largest Triangle Area | | 56.30% | Easy | | | 0813 | Largest Sum of Averages | | 45.50% | Medium | | | 0814 | Binary Tree Pruning | | 71.20% | Medium | | -| 0815 | Bus Routes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0815.%20Bus%20Routes) | 40.30% | Hard | | +| 0815 | Bus Routes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes) | 40.30% | Hard | | | 0816 | Ambiguous Coordinates | | 44.20% | Medium | | -| 0817 | Linked List Components | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0817.%20Linked%20List%20Components) | 54.80% | Medium | | +| 0817 | Linked List Components | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components) | 54.80% | Medium | | | 0818 | Race Car | | 35.20% | Hard | | -| 0819 | Most Common Word |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0819.%20Most%20Common%20Word) | 42.20% | Easy | | +| 0819 | Most Common Word |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word) | 42.20% | Easy | | | 0820 | Short Encoding of Words | | 47.40% | Medium | | | 0821 | Shortest Distance to a Character | | 63.60% | Easy | | | 0822 | Card Flipping Game | | 40.50% | Medium | | | 0823 | Binary Trees With Factors | | 32.60% | Medium | | | 0824 | Goat Latin | | 57.90% | Easy | | | 0825 | Friends Of Appropriate Ages | | 36.50% | Medium | | -| 0826 | Most Profit Assigning Work | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0826.%20Most%20Profit%20Assigning%20Work) | 35.90% | Medium | | +| 0826 | Most Profit Assigning Work | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work) | 35.90% | Medium | | | 0827 | Making A Large Island | | 43.40% | Hard | | -| 0828 | Unique Letter String |[Go]() | 39.80% | Hard | | +| 0828 | Unique Letter String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.COPYRIGHT-PROBLEM-XXX) | 39.80% | Hard | | | 0829 | Consecutive Numbers Sum | | 33.50% | Hard | | | 0830 | Positions of Large Groups | | 47.90% | Easy | | | 0831 | Masking Personal Information | | 42.20% | Medium | | | 0832 | Flipping an Image | | 72.90% | Easy | | | 0833 | Find And Replace in String | | 46.50% | Medium | | -| 0834 | Sum of Distances in Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0834.%20Sum%20of%20Distances%20in%20Tree) | 39.70% | Hard | | +| 0834 | Sum of Distances in Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree) | 39.70% | Hard | | | 0835 | Image Overlap | | 52.90% | Medium | | | 0836 | Rectangle Overlap | | 46.60% | Easy | | | 0837 | New 21 Game | | 31.80% | Medium | | -| 0838 | Push Dominoes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0838.%20Push%20Dominoes) | 44.00% | Medium | | -| 0839 | Similar String Groups | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0839.%20Similar%20String%20Groups) | 34.70% | Hard | | +| 0838 | Push Dominoes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes) | 44.00% | Medium | | +| 0839 | Similar String Groups | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups) | 34.70% | Hard | | | 0840 | Magic Squares In Grid | | 35.60% | Easy | | | 0841 | Keys and Rooms | | 60.50% | Medium | | -| 0842 | Split Array into Fibonacci Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0842.%20Split%20Array%20into%20Fibonacci%20Sequence) | 34.90% | Medium | | +| 0842 | Split Array into Fibonacci Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence) | 34.90% | Medium | | | 0843 | Guess the Word | | 43.60% | Hard | | -| 0844 | Backspace String Compare | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0844.%20Backspace%20String%20Compare) | 46.10% | Easy | | -| 0845 | Longest Mountain in Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0845.%20Longest%20Mountain%20in%20Array) | 34.40% | Medium | | +| 0844 | Backspace String Compare | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare) | 46.10% | Easy | | +| 0845 | Longest Mountain in Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array) | 34.40% | Medium | | | 0846 | Hand of Straights | | 49.50% | Medium | | | 0847 | Shortest Path Visiting All Nodes | | 47.10% | Hard | | | 0848 | Shifting Letters | | 41.00% | Medium | | | 0849 | Maximize Distance to Closest Person | | 41.00% | Easy | | -| 0850 | Rectangle Area II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0850.%20Rectangle%20Area%20II) | 45.00% | Hard | | +| 0850 | Rectangle Area II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II) | 45.00% | Hard | | | 0851 | Loud and Rich | | 47.80% | Medium | | -| 0852 | Peak Index in a Mountain Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0852.%20Peak%20Index%20in%20a%20Mountain%20Array) | 69.70% | Easy | | -| 0853 | Car Fleet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0853.%20Car%20Fleet) | 40.00% | Medium | | +| 0852 | Peak Index in a Mountain Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array) | 69.70% | Easy | | +| 0853 | Car Fleet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet) | 40.00% | Medium | | | 0854 | K-Similar Strings | | 33.80% | Hard | | | 0855 | Exam Room | | 38.60% | Medium | | -| 0856 | Score of Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0856.%20Score%20of%20Parentheses) | 56.50% | Medium | | +| 0856 | Score of Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses) | 56.50% | Medium | | | 0857 | Minimum Cost to Hire K Workers | | 47.60% | Hard | | | 0858 | Mirror Reflection | | 52.00% | Medium | | | 0859 | Buddy Strings | | 27.60% | Easy | | @@ -934,10 +933,10 @@ | 0861 | Score After Flipping Matrix | | 69.80% | Medium | | | 0862 | Shortest Subarray with Sum at Least K | | 22.20% | Hard | | | 0863 | All Nodes Distance K in Binary Tree | | 48.00% | Medium | | -| 0864 | Shortest Path to Get All Keys | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0864.%20Shortest%20Path%20to%20Get%20All%20Keys) | 36.20% | Hard | | +| 0864 | Shortest Path to Get All Keys | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys) | 36.20% | Hard | | | 0865 | Smallest Subtree with all the Deepest Nodes | | 56.00% | Medium | | | 0866 | Prime Palindrome | | 20.30% | Medium | | -| 0867 | Transpose Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0867.%20Transpose%20Matrix) | 63.90% | Easy | | +| 0867 | Transpose Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix) | 63.90% | Easy | | | 0868 | Binary Gap | | 59.50% | Easy | | | 0869 | Reordered Power of 2 | | 51.10% | Medium | | | 0870 | Advantage Shuffle | | 42.60% | Medium | | @@ -945,62 +944,62 @@ | 0872 | Leaf-Similar Trees | | 63.50% | Easy | | | 0873 | Length of Longest Fibonacci Subsequence | | 46.40% | Medium | | | 0874 | Walking Robot Simulation | | 32.30% | Easy | | -| 0875 | Koko Eating Bananas |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0875.%20Koko%20Eating%20Bananas) | 46.20% | Medium | | -| 0876 | Middle of the Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0876.%20Middle%20of%20the%20Linked%20List) | 64.40% | Easy | | +| 0875 | Koko Eating Bananas |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas) | 46.20% | Medium | | +| 0876 | Middle of the Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List) | 64.40% | Easy | | | 0877 | Stone Game | | 61.50% | Medium | | -| 0878 | Nth Magical Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0878.%20Nth%20Magical%20Number) | 25.60% | Hard | | +| 0878 | Nth Magical Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number) | 25.60% | Hard | | | 0879 | Profitable Schemes | | 36.80% | Hard | | -| 0880 | Decoded String at Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0880.%20Decoded%20String%20at%20Index) | 23.00% | Medium | | -| 0881 | Boats to Save People | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0881.%20Boats%20to%20Save%20People) | 44.00% | Medium | | +| 0880 | Decoded String at Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index) | 23.00% | Medium | | +| 0881 | Boats to Save People | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People) | 44.00% | Medium | | | 0882 | Reachable Nodes In Subdivided Graph | | 38.30% | Hard | | | 0883 | Projection Area of 3D Shapes | | 65.80% | Easy | | -| 0884 | Uncommon Words from Two Sentences |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0884.%20Uncommon%20Words%20from%20Two%20Sentences) | 60.90% | Easy | | -| 0885 | Spiral Matrix III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0885.%20Spiral%20Matrix%20III) | 64.40% | Medium | | +| 0884 | Uncommon Words from Two Sentences |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences) | 60.90% | Easy | | +| 0885 | Spiral Matrix III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III) | 64.40% | Medium | | | 0886 | Possible Bipartition | | 40.90% | Medium | | -| 0887 | Super Egg Drop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0887.%20Super%20Egg%20Drop) | 24.80% | Hard | | +| 0887 | Super Egg Drop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop) | 24.80% | Hard | | | 0888 | Fair Candy Swap | | 56.80% | Easy | | | 0889 | Construct Binary Tree from Preorder and Postorder Traversal | | 60.30% | Medium | | | 0890 | Find and Replace Pattern | | 71.30% | Medium | | -| 0891 | Sum of Subsequence Widths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0891.%20Sum%20of%20Subsequence%20Widths) | 29.10% | Hard | | +| 0891 | Sum of Subsequence Widths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths) | 29.10% | Hard | | | 0892 | Surface Area of 3D Shapes | | 56.10% | Easy | | | 0893 | Groups of Special-Equivalent Strings | | 62.80% | Easy | | | 0894 | All Possible Full Binary Trees | | 71.00% | Medium | | -| 0895 | Maximum Frequency Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0895.%20Maximum%20Frequency%20Stack) | 56.40% | Hard | | +| 0895 | Maximum Frequency Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack) | 56.40% | Hard | | | 0896 | Monotonic Array | | 55.40% | Easy | | -| 0897 | Increasing Order Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0897.%20Increasing%20Order%20Search%20Tree) | 64.90% | Easy | | -| 0898 | Bitwise ORs of Subarrays |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0898.%20Bitwise%20ORs%20of%20Subarrays) | 34.40% | Medium | | +| 0897 | Increasing Order Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree) | 64.90% | Easy | | +| 0898 | Bitwise ORs of Subarrays |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays) | 34.40% | Medium | | | 0899 | Orderly Queue | | 47.50% | Hard | | | 0900 | RLE Iterator | | 50.30% | Medium | | -| 0901 | Online Stock Span | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0901.%20Online%20Stock%20Span) | 49.40% | Medium | | +| 0901 | Online Stock Span | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span) | 49.40% | Medium | | | 0902 | Numbers At Most N Given Digit Set | | 28.70% | Hard | | | 0903 | Valid Permutations for DI Sequence | | 44.70% | Hard | | -| 0904 | Fruit Into Baskets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0904.%20Fruit%20Into%20Baskets) | 41.60% | Medium | | +| 0904 | Fruit Into Baskets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets) | 41.60% | Medium | | | 0905 | Sort Array By Parity | | 72.60% | Easy | | | 0906 | Super Palindromes | | 30.40% | Hard | | -| 0907 | Sum of Subarray Minimums |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0907.%20Sum%20of%20Subarray%20Minimums) | 27.60% | Medium | | +| 0907 | Sum of Subarray Minimums |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums) | 27.60% | Medium | | | 0908 | Smallest Range I | | 64.60% | Easy | | | 0909 | Snakes and Ladders | | 33.80% | Medium | | | 0910 | Smallest Range II | | 23.70% | Medium | | -| 0911 | Online Election |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0911.%20Online%20Election) | 47.10% | Medium | | +| 0911 | Online Election |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election) | 47.10% | Medium | | | 0912 | Sort an Array | | 63.60% | Medium | | | 0913 | Cat and Mouse | | 28.80% | Hard | | | 0914 | X of a Kind in a Deck of Cards | | 34.10% | Easy | | | 0915 | Partition Array into Disjoint Intervals | | 43.50% | Medium | | | 0916 | Word Subsets | | 45.40% | Medium | | | 0917 | Reverse Only Letters | | 55.90% | Easy | | -| 0918 | Maximum Sum Circular Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0918.%20Maximum%20Sum%20Circular%20Subarray) | 32.00% | Medium | | +| 0918 | Maximum Sum Circular Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray) | 32.00% | Medium | | | 0919 | Complete Binary Tree Inserter | | 55.20% | Medium | | -| 0920 | Number of Music Playlists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0920.%20Number%20of%20Music%20Playlists) | 43.90% | Hard | | -| 0921 | Minimum Add to Make Parentheses Valid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0921.%20Minimum%20Add%20to%20Make%20Parentheses%20Valid) | 70.30% | Medium | | -| 0922 | Sort Array By Parity II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0922.%20Sort%20Array%20By%20Parity%20II) | 67.10% | Easy | | -| 0923 | 3Sum With Multiplicity | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0923.%203Sum%20With%20Multiplicity) | 33.90% | Medium | | -| 0924 | Minimize Malware Spread | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0924.%20Minimize%20Malware%20Spread) | 40.10% | Hard | | -| 0925 | Long Pressed Name | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0925.%20Long%20Pressed%20Name) | 44.50% | Easy | | +| 0920 | Number of Music Playlists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists) | 43.90% | Hard | | +| 0921 | Minimum Add to Make Parentheses Valid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid) | 70.30% | Medium | | +| 0922 | Sort Array By Parity II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II) | 67.10% | Easy | | +| 0923 | 3Sum With Multiplicity | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity) | 33.90% | Medium | | +| 0924 | Minimize Malware Spread | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread) | 40.10% | Hard | | +| 0925 | Long Pressed Name | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name) | 44.50% | Easy | | | 0926 | Flip String to Monotone Increasing | | 49.80% | Medium | | -| 0927 | Three Equal Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0927.%20Three%20Equal%20Parts) | 30.40% | Hard | | -| 0928 | Minimize Malware Spread II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0928.%20Minimize%20Malware%20Spread%20II) | 39.50% | Hard | | +| 0927 | Three Equal Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts) | 30.40% | Hard | | +| 0928 | Minimize Malware Spread II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II) | 39.50% | Hard | | | 0929 | Unique Email Addresses | | 70.50% | Easy | | -| 0930 | Binary Subarrays With Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0930.%20Binary%20Subarrays%20With%20Sum) | 38.20% | Medium | | +| 0930 | Binary Subarrays With Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum) | 38.20% | Medium | | | 0931 | Minimum Falling Path Sum | | 59.00% | Medium | | | 0932 | Beautiful Array | | 53.60% | Medium | | | 0933 | Number of Recent Calls | | 69.40% | Easy | | @@ -1012,95 +1011,95 @@ | 0939 | Minimum Area Rectangle | | 50.50% | Medium | | | 0940 | Distinct Subsequences II | | 39.80% | Hard | | | 0941 | Valid Mountain Array | | 35.50% | Easy | | -| 0942 | DI String Match | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0942.%20DI%20String%20Match) | 70.00% | Easy | | +| 0942 | DI String Match | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match) | 70.00% | Easy | | | 0943 | Find the Shortest Superstring | | 38.30% | Hard | | | 0944 | Delete Columns to Make Sorted | | 69.40% | Easy | | | 0945 | Minimum Increment to Make Array Unique | | 42.90% | Medium | | -| 0946 | Validate Stack Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0946.%20Validate%20Stack%20Sequences) | 57.60% | Medium | | -| 0947 | Most Stones Removed with Same Row or Column | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column) | 54.20% | Medium | | +| 0946 | Validate Stack Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences) | 57.60% | Medium | | +| 0947 | Most Stones Removed with Same Row or Column | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column) | 54.20% | Medium | | | 0948 | Bag of Tokens | | 39.30% | Medium | | | 0949 | Largest Time for Given Digits | | 34.20% | Easy | | | 0950 | Reveal Cards In Increasing Order | | 72.20% | Medium | | | 0951 | Flip Equivalent Binary Trees | | 65.20% | Medium | | -| 0952 | Largest Component Size by Common Factor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0952.%20Largest%20Component%20Size%20by%20Common%20Factor) | 26.60% | Hard | | -| 0953 | Verifying an Alien Dictionary |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0953.%20Verifying%20an%20Alien%20Dictionary) | 55.60% | Easy | | +| 0952 | Largest Component Size by Common Factor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor) | 26.60% | Hard | | +| 0953 | Verifying an Alien Dictionary |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary) | 55.60% | Easy | | | 0954 | Array of Doubled Pairs | | 34.40% | Medium | | | 0955 | Delete Columns to Make Sorted II | | 31.60% | Medium | | | 0956 | Tallest Billboard | | 38.40% | Hard | | | 0957 | Prison Cells After N Days | | 38.20% | Medium | | | 0958 | Check Completeness of a Binary Tree | | 47.60% | Medium | | -| 0959 | Regions Cut By Slashes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0959.%20Regions%20Cut%20By%20Slashes) | 62.50% | Medium | | +| 0959 | Regions Cut By Slashes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes) | 62.50% | Medium | | | 0960 | Delete Columns to Make Sorted III | | 52.80% | Hard | | -| 0961 | N-Repeated Element in Size 2N Array |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0961.%20N-Repeated%20Element%20in%20Size%202N%20Array) | 72.40% | Easy | | +| 0961 | N-Repeated Element in Size 2N Array |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array) | 72.40% | Easy | | | 0962 | Maximum Width Ramp | | 41.80% | Medium | | | 0963 | Minimum Area Rectangle II | | 44.50% | Medium | | | 0964 | Least Operators to Express Number | | 40.90% | Hard | | | 0965 | Univalued Binary Tree | | 66.90% | Easy | | | 0966 | Vowel Spellchecker | | 41.90% | Medium | | | 0967 | Numbers With Same Consecutive Differences | | 37.10% | Medium | | -| 0968 | Binary Tree Cameras | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0968.%20Binary%20Tree%20Cameras) | 35.40% | Hard | | -| 0969 | Pancake Sorting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0969.%20Pancake%20Sorting) | 62.40% | Medium | | -| 0970 | Powerful Integers |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0970.%20Powerful%20Integers) | 39.30% | Easy | | +| 0968 | Binary Tree Cameras | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras) | 35.40% | Hard | | +| 0969 | Pancake Sorting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting) | 62.40% | Medium | | +| 0970 | Powerful Integers |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers) | 39.30% | Easy | | | 0971 | Flip Binary Tree To Match Preorder Traversal | | 43.00% | Medium | | | 0972 | Equal Rational Numbers | | 40.20% | Hard | | -| 0973 | K Closest Points to Origin | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0973.%20K%20Closest%20Points%20to%20Origin) | 62.20% | Medium | | +| 0973 | K Closest Points to Origin | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin) | 62.20% | Medium | | | 0974 | Subarray Sums Divisible by K | | 45.20% | Medium | | | 0975 | Odd Even Jump | | 47.20% | Hard | | -| 0976 | Largest Perimeter Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0976.%20Largest%20Perimeter%20Triangle) | 57.20% | Easy | | -| 0977 | Squares of a Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0977.%20Squares%20of%20a%20Sorted%20Array) | 72.00% | Easy | | -| 0978 | Longest Turbulent Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0978.%20Longest%20Turbulent%20Subarray) | 45.60% | Medium | | -| 0979 | Distribute Coins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0979.%20Distribute%20Coins%20in%20Binary%20Tree) | 67.20% | Medium | | -| 0980 | Unique Paths III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0980.%20Unique%20Paths%20III) | 71.20% | Hard | | -| 0981 | Time Based Key-Value Store |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0981.%20Time%20Based%20Key-Value%20Store) | 50.80% | Medium | | +| 0976 | Largest Perimeter Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle) | 57.20% | Easy | | +| 0977 | Squares of a Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array) | 72.00% | Easy | | +| 0978 | Longest Turbulent Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray) | 45.60% | Medium | | +| 0979 | Distribute Coins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree) | 67.20% | Medium | | +| 0980 | Unique Paths III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III) | 71.20% | Hard | | +| 0981 | Time Based Key-Value Store |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store) | 50.80% | Medium | | | 0982 | Triples with Bitwise AND Equal To Zero | | 54.00% | Hard | | | 0983 | Minimum Cost For Tickets | | 57.30% | Medium | | -| 0984 | String Without AAA or BBB |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0984.%20String%20Without%20AAA%20or%20BBB) | 33.90% | Medium | | +| 0984 | String Without AAA or BBB |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB) | 33.90% | Medium | | | 0985 | Sum of Even Numbers After Queries | | 63.40% | Easy | | -| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0986.%20Interval%20List%20Intersections) | 63.30% | Medium | | +| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections) | 63.30% | Medium | | | 0987 | Vertical Order Traversal of a Binary Tree | | 31.80% | Medium | | | 0988 | Smallest String Starting From Leaf | | 46.00% | Medium | | | 0989 | Add to Array-Form of Integer | | 44.70% | Easy | | -| 0990 | Satisfiability of Equality Equations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0990.%20Satisfiability%20of%20Equality%20Equations) | 40.10% | Medium | | +| 0990 | Satisfiability of Equality Equations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations) | 40.10% | Medium | | | 0991 | Broken Calculator | | 40.40% | Medium | | -| 0992 | Subarrays with K Different Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0992.%20Subarrays%20with%20K%20Different%20Integers) | 45.20% | Hard | | -| 0993 | Cousins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0993.%20Cousins%20in%20Binary%20Tree) | 52.40% | Easy | | +| 0992 | Subarrays with K Different Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers) | 45.20% | Hard | | +| 0993 | Cousins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree) | 52.40% | Easy | | | 0994 | Rotting Oranges | | 46.40% | Easy | | -| 0995 | Minimum Number of K Consecutive Bit Flips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0995.%20Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips) | 48.40% | Hard | | -| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0996.%20Number%20of%20Squareful%20Arrays) | 47.80% | Hard | | +| 0995 | Minimum Number of K Consecutive Bit Flips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips) | 48.40% | Hard | | +| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays) | 47.80% | Hard | | | 0997 | Find the Town Judge | | 49.10% | Easy | | | 0998 | Maximum Binary Tree II | | 61.60% | Medium | | | 0999 | Available Captures for Rook | | 66.10% | Easy | | | 1000 | Minimum Cost to Merge Stones | | 32.10% | Hard | | | 1001 | Grid Illumination | | 34.40% | Hard | | -| 1002 | Find Common Characters |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1002.%20Find%20Common%20Characters) | 65.80% | Easy | | -| 1003 | Check If Word Is Valid After Substitutions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1003.%20Check%20If%20Word%20Is%20Valid%20After%20Substitutions) | 51.80% | Medium | | -| 1004 | Max Consecutive Ones III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1004.%20Max%20Consecutive%20Ones%20III) | 53.40% | Medium | | -| 1005 | Maximize Sum Of Array After K Negations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1005.%20Maximize%20Sum%20Of%20Array%20After%20K%20Negations) | 49.70% | Easy | | +| 1002 | Find Common Characters |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters) | 65.80% | Easy | | +| 1003 | Check If Word Is Valid After Substitutions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions) | 51.80% | Medium | | +| 1004 | Max Consecutive Ones III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III) | 53.40% | Medium | | +| 1005 | Maximize Sum Of Array After K Negations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations) | 49.70% | Easy | | | 1006 | Clumsy Factorial | | 53.70% | Medium | | | 1007 | Minimum Domino Rotations For Equal Row | | 47.90% | Medium | | | 1008 | Construct Binary Search Tree from Preorder Traversal | | 73.10% | Medium | | | 1009 | Complement of Base 10 Integer | | 58.90% | Easy | | | 1010 | Pairs of Songs With Total Durations Divisible by 60 | | 45.60% | Easy | | -| 1011 | Capacity To Ship Packages Within D Days | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1011.%20Capacity%20To%20Ship%20Packages%20Within%20D%20Days) | 53.30% | Medium | | +| 1011 | Capacity To Ship Packages Within D Days | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days) | 53.30% | Medium | | | 1012 | Numbers With Repeated Digits | | 34.80% | Hard | | | 1013 | Partition Array Into Three Parts With Equal Sum | | 55.50% | Easy | | | 1014 | Best Sightseeing Pair | | 49.30% | Medium | | | 1015 | Smallest Integer Divisible by K | | 28.40% | Medium | | | 1016 | Binary String With Substrings Representing 1 To N | | 60.70% | Medium | | -| 1017 | Convert to Base -2 | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1017.%20Convert%20to%20Base%20-2) | 56.70% | Medium | | +| 1017 | Convert to Base -2 | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base--2) | 56.70% | Medium | | | 1018 | Binary Prefix Divisible By 5 | | 46.60% | Easy | | -| 1019 | Next Greater Node In Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1019.%20Next%20Greater%20Node%20In%20Linked%20List) | 56.50% | Medium | | +| 1019 | Next Greater Node In Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List) | 56.50% | Medium | | | 1020 | Number of Enclaves | | 54.70% | Medium | | -| 1021 | Remove Outermost Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1021.%20Remove%20Outermost%20Parentheses) | 75.60% | Easy | | +| 1021 | Remove Outermost Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses) | 75.60% | Easy | | | 1022 | Sum of Root To Leaf Binary Numbers | | 55.90% | Easy | | | 1023 | Camelcase Matching | | 56.50% | Medium | | | 1024 | Video Stitching | | 47.20% | Medium | | -| 1025 | Divisor Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1025.%20Divisor%20Game) | 63.30% | Easy | | +| 1025 | Divisor Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game) | 63.30% | Easy | | | 1026 | Maximum Difference Between Node and Ancestor | | 59.60% | Medium | | | 1027 | Longest Arithmetic Sequence | | 47.90% | Medium | | -| 1028 | Recover a Tree From Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1028.%20Recover%20a%20Tree%20From%20Preorder%20Traversal) | 70.20% | Hard | | +| 1028 | Recover a Tree From Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal) | 70.20% | Hard | | | 1029 | Two City Scheduling | | 53.90% | Easy | | -| 1030 | Matrix Cells in Distance Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1030.%20Matrix%20Cells%20in%20Distance%20Order) | 65.20% | Easy | | +| 1030 | Matrix Cells in Distance Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order) | 65.20% | Easy | | | 1031 | Maximum Sum of Two Non-Overlapping Subarrays | | 55.30% | Medium | | | 1032 | Stream of Characters | | 41.30% | Hard | | | 1033 | Moving Stones Until Consecutive | | 35.50% | Easy | | @@ -1110,21 +1109,21 @@ | 1037 | Valid Boomerang | | 37.60% | Easy | | | 1038 | Binary Search Tree to Greater Sum Tree | | 79.70% | Medium | | | 1039 | Minimum Score Triangulation of Polygon | | 41.50% | Medium | | -| 1040 | Moving Stones Until Consecutive II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1040.%20Moving%20Stones%20Until%20Consecutive%20II) | 46.20% | Medium | | +| 1040 | Moving Stones Until Consecutive II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II) | 46.20% | Medium | | | 1041 | Robot Bounded In Circle | | 43.40% | Easy | | | 1042 | Flower Planting With No Adjacent | | 48.40% | Easy | | | 1043 | Partition Array for Maximum Sum | | 62.40% | Medium | | | 1044 | Longest Duplicate Substring | | 22.80% | Hard | | | 1045 | Customers Who Bought All Products | | 64.10% | Medium | | | 1046 | Last Stone Weight | | 62.40% | Easy | | -| 1047 | Remove All Adjacent Duplicates In String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String) | 63.60% | Easy | | +| 1047 | Remove All Adjacent Duplicates In String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String) | 63.60% | Easy | | | 1048 | Longest String Chain | | 47.30% | Medium | | -| 1049 | Last Stone Weight II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1049.%20Last%20Stone%20Weight%20II) | 39.90% | Medium | | +| 1049 | Last Stone Weight II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II) | 39.90% | Medium | | | 1050 | Actors and Directors Who Cooperated At Least Three Times | | 75.40% | Easy | | | 1051 | Height Checker | | 69.40% | Easy | | -| 1052 | Grumpy Bookstore Owner | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1052.%20Grumpy%20Bookstore%20Owner) | 52.00% | Medium | | +| 1052 | Grumpy Bookstore Owner | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner) | 52.00% | Medium | | | 1053 | Previous Permutation With One Swap | | 47.10% | Medium | | -| 1054 | Distant Barcodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1054.%20Distant%20Barcodes) | 38.60% | Medium | | +| 1054 | Distant Barcodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes) | 38.60% | Medium | | | 1055 | Shortest Way to Form String | | 58.20% | Medium | | | 1056 | Confusing Number | | 52.10% | Easy | | | 1057 | Campus Bikes | | 58.90% | Medium | | @@ -1143,13 +1142,13 @@ | 1070 | Product Sales Analysis III | | 42.70% | Medium | | | 1071 | Greatest Common Divisor of Strings | | 53.60% | Easy | | | 1072 | Flip Columns For Maximum Number of Equal Rows | | 56.20% | Medium | | -| 1073 | Adding Two Negabinary Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1073.%20Adding%20Two%20Negabinary%20Numbers) | 31.60% | Medium | | -| 1074 | Number of Submatrices That Sum to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1074.%20Number%20of%20Submatrices%20That%20Sum%20to%20Target) | 58.50% | Hard | | +| 1073 | Adding Two Negabinary Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers) | 31.60% | Medium | | +| 1074 | Number of Submatrices That Sum to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target) | 58.50% | Hard | | | 1075 | Project Employees I | | 58.70% | Easy | | | 1076 | Project Employees II | | 52.80% | Easy | | | 1077 | Project Employees III | | 76.90% | Medium | | -| 1078 | Occurrences After Bigram |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1078.%20Occurrences%20After%20Bigram) | 67.40% | Easy | | -| 1079 | Letter Tile Possibilities |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1079.%20Letter%20Tile%20Possibilities) | 76.50% | Medium | | +| 1078 | Occurrences After Bigram |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram) | 67.40% | Easy | | +| 1079 | Letter Tile Possibilities |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities) | 76.50% | Medium | | | 1080 | Insufficient Nodes in Root to Leaf Paths | | 41.10% | Medium | | | 1081 | Smallest Subsequence of Distinct Characters | | 42.80% | Medium | | | 1082 | Sales Analysis I | | 74.20% | Easy | | @@ -1163,7 +1162,7 @@ | 1090 | Largest Values From Labels | | 56.00% | Medium | | | 1091 | Shortest Path in Binary Matrix | | 35.90% | Medium | | | 1092 | Shortest Common Supersequence | | 47.20% | Hard | | -| 1093 | Statistics from a Large Sample |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1093.%20Statistics%20from%20a%20Large%20Sample) | 41.10% | Medium | | +| 1093 | Statistics from a Large Sample |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample) | 41.10% | Medium | | | 1094 | Car Pooling | | 57.10% | Medium | | | 1095 | Find in Mountain Array | | 32.50% | Hard | | | 1096 | Brace Expansion II | | 52.00% | Hard | | @@ -1175,13 +1174,13 @@ | 1102 | Path With Maximum Minimum Value     | | 42.50% | Medium | | | 1103 | Distribute Candies to People     | | 62.00% | Easy | | | 1104 | Path In Zigzag Labelled Binary Tree     | | 71.10% | Medium | | -| 1105 | Filling Bookcase Shelves     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1105.%20Filling%20Bookcase%20Shelves) | 53.80% | Medium | | +| 1105 | Filling Bookcase Shelves     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves) | 53.80% | Medium | | | 1106 | Parsing A Boolean Expression     | | 59.00% | Hard | | | 1107 | New Users Daily Count     | | 46.30% | Medium | | -| 1108 | Defanging an IP Address     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1108.%20Defanging%20an%20IP%20Address) | 87.50% | Easy | | +| 1108 | Defanging an IP Address     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address) | 87.50% | Easy | | | 1109 | Corporate Flight Bookings     | | 47.30% | Medium | | | 1110 | Delete Nodes And Return Forest     | | 61.90% | Medium | | -| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1111.%20Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings) | 63.30% | Medium | | +| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings) | 63.30% | Medium | | | 1112 | Highest Grade For Each Student     | | 60.80% | Medium | | | 1113 | Reported Posts     | | 68.20% | Easy | | | 1114 | Print in Order    | | 59.20% | Easy | | @@ -1192,13 +1191,13 @@ | 1119 | Remove Vowels from a String     | | 91.10% | Easy | | | 1120 | Maximum Average Subtree     | | 60.90% | Medium | | | 1121 | Divide Array Into Increasing Sequences     | | 51.20% | Hard | | -| 1122 | Relative Sort Array     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1122.%20Relative%20Sort%20Array) | 68.50% | Easy | | -| 1123 | Lowest Common Ancestor of Deepest Leaves     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1123.%20Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves) | 64.60% | Medium | | +| 1122 | Relative Sort Array     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array) | 68.50% | Easy | | +| 1123 | Lowest Common Ancestor of Deepest Leaves     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves) | 64.60% | Medium | | | 1124 | Longest Well-Performing Interval    | | 27.40% | Medium | | | 1125 | Smallest Sufficient Team     | | 43.50% | Hard | | | 1126 | Active Businesses     | | 70.80% | Medium | | | 1127 | User Purchase Platform     | | 64.50% | Hard | | -| 1128 | Number of Equivalent Domino Pairs     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1128.%20Number%20of%20Equivalent%20Domino%20Pairs) | 40.30% | Easy | | +| 1128 | Number of Equivalent Domino Pairs     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs) | 40.30% | Easy | | | 1129 | Shortest Path with Alternating Colors | | 34.20% | Medium | | | 1130 | Minimum Cost Tree From Leaf Values     | | 58.80% | Medium | | | 1131 | Maximum of Absolute Value Expression     | | 50.30% | Medium | | @@ -1207,7 +1206,7 @@ | 1134 | Armstrong Number     | | 79.90% | Easy | | | 1135 | Connecting Cities With Minimum Cost     | | 49.40% | Medium | | | 1136 | Parallel Courses     | | 58.80% | Hard | | -| 1137 | N-th Tribonacci Number     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1137.%20N-th%20Tribonacci%20Number) | 61.10% | Easy | | +| 1137 | N-th Tribonacci Number     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number) | 61.10% | Easy | | | 1138 | Alphabet Board Path     | | 42.40% | Medium | | | 1139 | Largest 1-Bordered Square     | | 42.80% | Medium | | | 1140 | Stone Game II     | | 60.60% | Medium | | @@ -1224,13 +1223,13 @@ | 1151 | Minimum Swaps to Group All 1's Together     | | 51.60% | Medium | | | 1152 | Analyze User Website Visit Pattern     | | 33.50% | Medium | | | 1153 | String Transforms Into Another String     | | 23.60% | Hard | | -| 1154 | Day of the Year     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1154.%20Day%20of%20the%20Year) | 52.10% | Easy | | +| 1154 | Day of the Year     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year) | 52.10% | Easy | | | 1155 | Number of Dice Rolls With Target Sum    | | 48.60% | Medium | | | 1156 | Swap For Longest Repeated Character Substring     | | 41.10% | Medium | | -| 1157 | Online Majority Element In Subarray     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1157.%20Online%20Majority%20Element%20In%20Subarray) | 20.50% | Hard | | +| 1157 | Online Majority Element In Subarray     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray) | 20.50% | Hard | | | 1158 | Market Analysis I     | | 50.5% | Medium | | | 1159 | Market Analysis II     | | 46.8% | Hard | | -| 1160 | Find Words That Can Be Formed by Characters     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1160.%20Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters) | 67.6% | Easy | | +| 1160 | Find Words That Can Be Formed by Characters     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters) | 67.6% | Easy | | | 1161 | Maximum Level Sum of a Binary Tree     | | 71.4% | Medium | | | 1162 | As Far from Land as Possible     | | 39.5% | Medium | | | 1163 | Last Substring in Lexicographical Order     | | 30.2% | Hard | | @@ -1240,12 +1239,12 @@ | 1167 | Minimum Cost to Connect Sticks     | | 60.1% | Medium | | | 1168 | Optimize Water Distribution in a Village     | | 52.6% | Hard | | | 1169 | Invalid Transactions     | | 27.4% | Medium | | -| 1170 | Compare Strings by Frequency of the Smallest Character     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1170.%20Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character) | 60.5% | Easy | | -| 1171 | Remove Zero Sum Consecutive Nodes from Linked List     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1171.%20Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List) | 42.3% | Medium | | +| 1170 | Compare Strings by Frequency of the Smallest Character     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character) | 60.5% | Easy | | +| 1171 | Remove Zero Sum Consecutive Nodes from Linked List     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List) | 42.3% | Medium | | | 1172 | Dinner Plate Stacks     | | 41.6% | Hard | | | 1173 | Immediate Food Delivery I     | | 72.5% | Easy | | | 1174 | Immediate Food Delivery II     | | 52.3% | Medium | | -| 1175 | Prime Arrangements     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1175.%20Prime%20Arrangements) | 50.3% | Easy | | +| 1175 | Prime Arrangements     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements) | 50.3% | Easy | | | 1176 | Diet Plan Performance     | | 48.6% | Easy | | | 1177 | Can Make Palindrome from Substring     | | 32.0% | Medium | | | 1178 | Number of Valid Words for Each Puzzle     | | 34.7% | Hard | | @@ -1254,12 +1253,12 @@ | 1181 | Before and After Puzzle     | | 41.9% | Medium | | | 1182 | Shortest Distance to Target Color     | | 50.7% | Medium | | | 1183 | Maximum Number of Ones     | | 45.7% | Hard | | -| 1184 | Distance Between Bus Stops     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1184.%20Distance%20Between%20Bus%20Stops) | 56.7% | Easy | | -| 1185 | Day of the Week     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1185.%20Day%20of%20the%20Week) | 65.8% | Easy | | +| 1184 | Distance Between Bus Stops     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops) | 56.7% | Easy | | +| 1185 | Day of the Week     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week) | 65.8% | Easy | | | 1186 | Maximum Subarray Sum with One Deletion     | | 33.2% | Medium | | | 1187 | Make Array Strictly Increasing     | | 39.6% | Hard | | | 1188 | Design Bounded Blocking Queue     | | 65.0% | Medium | | -| 1189 | Maximum Number of Balloons     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1189.%20Maximum%20Number%20of%20Balloons) | 62.7% | Easy | | +| 1189 | Maximum Number of Balloons     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons) | 62.7% | Easy | | | 1190 | Reverse Substrings Between Each Pair of Parentheses     | | 57.8% | Medium | | | 1191 | K-Concatenation Maximum Sum     | | 24.0% | Medium | | | 1192 | Critical Connections in a Network     | | 45.2% | Hard | | @@ -1270,14 +1269,14 @@ | 1197 | Minimum Knight Moves     | | 30.1% | Medium | | | 1198 | Find Smallest Common Element in All Rows     | | 71.8% | Medium | | | 1199 | Minimum Time to Build Blocks     | | 30.1% | Hard | | -| 1200 | Minimum Absolute Difference     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1200.%20Minimum%20Absolute%20Difference) | 66.3% | Easy | | -| 1201 | Ugly Number III     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1201.%20Ugly%20Number%20III) | 23.9% | Medium | | +| 1200 | Minimum Absolute Difference     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference) | 66.3% | Easy | | +| 1201 | Ugly Number III     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III) | 23.9% | Medium | | | 1202 | Smallest String With Swaps     | | 39.2% | Medium | | | 1203 | Sort Items by Groups Respecting Dependencies     | | 46.9% | Hard | | | 1204 | Last Person to Fit in the Elevator    New | | 65.8% | Medium | | | 1205 | Monthly Transactions II    New | | 49.3% | Medium | | | 1206 | Design Skiplist    New | | 61.8% | Hard | | -| 1207 | Unique Number of Occurrences     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1207.%20Unique%20Number%20of%20Occurrences) | 77.4% | Easy | | +| 1207 | Unique Number of Occurrences     | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences) | 77.4% | Easy | | | 1208 | Get Equal Substrings Within Budget     | | 33.3% | Medium | | | 1209 | Remove All Adjacent Duplicates in String II     | | 59.6% | Medium | | | 1210 | Minimum Moves to Reach Target with Rotations     | | 40.1% | Hard | | @@ -1288,19 +1287,7 @@ 下面这些是免费的算法题，但是暂时还不能使用 Go 解答的： -- [116.Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) -- [117.Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) -- [133.Clone Graph](https://leetcode.com/problems/clone-graph/) -- [138.Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) -- [278.First Bad Version](https://leetcode.com/problems/first-bad-version/) -- [284.Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) -- [297.Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) -- [341.Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) -- [374.Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) -- [449.Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/) -- [535.Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/) -- [690.Employee Importance](https://leetcode.com/problems/employee-importance/) - +暂无 ------------------------------------------------------------------ @@ -1311,58 +1298,58 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[1. Two Sum](https://leetcode.com/problems/two-sum/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0001.%20Two%20Sum)| Easy | O(n)| O(n)|| -|[11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0011.%20Container%20With%20Most%20Water)| Medium | O(n)| O(1)|| -|[15. 3Sum](https://leetcode.com/problems/3sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0015.%203Sum)| Medium | O(n^2)| O(n)|❤️| -|[16. 3Sum Closest](https://leetcode.com/problems/3sum-closest)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0016.%203Sum%20Closest)| Medium | O(n^2)| O(1)|❤️| -|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0018.%204Sum)| Medium | O(n^3)| O(n^2)|❤️| -|[26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0026.%20Remove%20Duplicates%20from%20Sorted%20Array)| Easy | O(n)| O(1)|| -|[27. Remove Element](https://leetcode.com/problems/remove-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0027.%20Remove%20Element)| Easy | O(n)| O(1)|| -|[39. Combination Sum](https://leetcode.com/problems/combination-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0039.%20Combination%20Sum)| Medium | O(n log n)| O(n)|| -|[40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0040.%20Combination%20Sum%20II)| Medium | O(n log n)| O(n)|| -|[41. First Missing Positive](https://leetcode.com/problems/first-missing-positive)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0041.%20First-Missing-Positive)| Hard | O(n)| O(n)|| -|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0042.%20Trapping%20Rain%20Water)| Hard | O(n)| O(1)|❤️| -|[48. Rotate Image](https://leetcode.com/problems/rotate-image)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0048.%20Rotate%20Image)| Medium | O(n)| O(1)|| -|[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0053.%20Maximum%20Subarray)| Easy | O(n)| O(n)|| -|[54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0054.%20Spiral%20Matrix)| Medium | O(n)| O(n^2)|| -|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0056.%20Merge%20Intervals)| Medium | O(n log n)| O(1)|| -|[57. Insert Interval](https://leetcode.com/problems/insert-interval)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0057.%20Insert%20Interval)| Hard | O(n)| O(1)|| -|[59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0059.%20Spiral%20Matrix%20II)| Medium | O(n)| O(n^2)|| -|[62. Unique Paths](https://leetcode.com/problems/unique-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0062.%20Unique%20Paths)| Medium | O(n^2)| O(n^2)|| -|[63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0063.%20Unique%20Paths%20II)| Medium | O(n^2)| O(n^2)|| -|[64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0064.%20Minimum%20Path%20Sum)| Medium | O(n^2)| O(n^2)|| -|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0075.%20Sort%20Colors)| Medium| O(n)| O(1)|❤️| -|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0078.%20Subsets)| Medium | O(n^2)| O(n)|❤️| -|[79. Word Search](https://leetcode.com/problems/word-search)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0079.%20Word%20Search)| Medium | O(n^2)| O(n^2)|❤️| -|[80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II)| Medium | O(n)| O(1|| -|[84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0084.%20Largest%20Rectangle%20in%20Histogram)| Medium | O(n)| O(n)|❤️| -|[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0088.%20Merge-Sorted-Array)| Easy | O(n)| O(1)|❤️| -|[90. Subsets II](https://leetcode.com/problems/subsets-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0090.%20Subsets%20II)| Medium | O(n^2)| O(n)|❤️| -|[120. Triangle](https://leetcode.com/problems/triangle)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0120.%20Triangle)| Medium | O(n^2)| O(n)|| -|[121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock)| Easy | O(n)| O(1)|| -|[122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II)| Easy | O(n)| O(1)|| -|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0126.%20Word%20Ladder%20II)| Hard | O(n)| O(n^2)|❤️| -|[152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0152.%20Maximum%20Product%20Subarray)| Medium | O(n)| O(1)|| -|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted)| Easy | O(n)| O(1)|| -|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0209.%20Minimum%20Size%20Subarray%20Sum)| Medium | O(n)| O(1)|| -|[216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0216.%20Combination%20Sum%20III)| Medium | O(n)| O(1)|❤️| -|[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0217.%20Contains%20Duplicate)| Easy | O(n)| O(n)|| -|[219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0219.%20Contains%20Duplicate%20II)| Easy | O(n)| O(n)|| -|[283. Move Zeroes](https://leetcode.com/problems/move-zeroes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0283.%20Move%20Zeroes)| Easy | O(n)| O(1)|| -|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0287.%20Find%20the%20Duplicate%20Number)| Easy | O(n)| O(1)|❤️| -|[532. K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0532.%20K-diff%20Pairs%20in%20an%20Array)| Easy | O(n)| O(n)|| -|[566. Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0566.%20Reshape%20the%20Matrix)| Easy | O(n^2)| O(n^2)|| -|[628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0628.%20Maximum%20Product%20of%20Three%20Numbers)| Easy | O(n)| O(1)|| -|[713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0713.%20Subarray%20Product%20Less%20Than%20K)| Medium | O(n)| O(1)|| -|[714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee)| Medium | O(n)| O(1)|| -|[746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0746.%20Min%20Cost%20Climbing%20Stairs)| Easy | O(n)| O(1)|| -|[766. Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0766.%20Toeplitz%20Matrix)| Easy | O(n)| O(1)|| -|[867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0867.%20Transpose%20Matrix)| Easy | O(n)| O(1)|| -|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0891.%20Sum%20of%20Subsequence%20Widths)| Hard | O(n log n)| O(1)|| -|[907. Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0907.%20Sum%20of%20Subarray%20Minimums)| Medium | O(n)| O(n)|❤️| -|[922. Sort Array By Parity II](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go]()| Medium | O(n)| O(1)|| -|[969. Pancake Sorting](https://leetcode.com/problems/pancake-sorting)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0969.%20Pancake%20Sorting)| Medium | O(n)| O(1)|❤️| -|[977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0977.%20Squares%20of%20a%20Sorted%20Array)| Easy | O(n)| O(1)|| +|[1. Two Sum](https://leetcode.com/problems/two-sum/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)| Easy | O(n)| O(n)|| +|[11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)| Medium | O(n)| O(1)|| +|[15. 3Sum](https://leetcode.com/problems/3sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)| Medium | O(n^2)| O(n)|❤️| +|[16. 3Sum Closest](https://leetcode.com/problems/3sum-closest)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)| Medium | O(n^2)| O(1)|❤️| +|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)| Medium | O(n^3)| O(n^2)|❤️| +|[26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)| Easy | O(n)| O(1)|| +|[27. Remove Element](https://leetcode.com/problems/remove-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)| Easy | O(n)| O(1)|| +|[39. Combination Sum](https://leetcode.com/problems/combination-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)| Medium | O(n log n)| O(n)|| +|[40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)| Medium | O(n log n)| O(n)|| +|[41. First Missing Positive](https://leetcode.com/problems/first-missing-positive)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)| Hard | O(n)| O(n)|| +|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)| Hard | O(n)| O(1)|❤️| +|[48. Rotate Image](https://leetcode.com/problems/rotate-image)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)| Medium | O(n)| O(1)|| +|[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)| Easy | O(n)| O(n)|| +|[54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)| Medium | O(n)| O(n^2)|| +|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)| Medium | O(n log n)| O(1)|| +|[57. Insert Interval](https://leetcode.com/problems/insert-interval)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)| Hard | O(n)| O(1)|| +|[59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)| Medium | O(n)| O(n^2)|| +|[62. Unique Paths](https://leetcode.com/problems/unique-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)| Medium | O(n^2)| O(n^2)|| +|[63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)| Medium | O(n^2)| O(n^2)|| +|[64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)| Medium | O(n^2)| O(n^2)|| +|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)| Medium| O(n)| O(1)|❤️| +|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)| Medium | O(n^2)| O(n)|❤️| +|[79. Word Search](https://leetcode.com/problems/word-search)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)| Medium | O(n^2)| O(n^2)|❤️| +|[80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)| Medium | O(n)| O(1|| +|[84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)| Medium | O(n)| O(n)|❤️| +|[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)| Easy | O(n)| O(1)|❤️| +|[90. Subsets II](https://leetcode.com/problems/subsets-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)| Medium | O(n^2)| O(n)|❤️| +|[120. Triangle](https://leetcode.com/problems/triangle)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)| Medium | O(n^2)| O(n)|| +|[121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)| Easy | O(n)| O(1)|| +|[122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)| Easy | O(n)| O(1)|| +|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)| Hard | O(n)| O(n^2)|❤️| +|[152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)| Medium | O(n)| O(1)|| +|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted)| Easy | O(n)| O(1)|| +|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)| Medium | O(n)| O(1)|| +|[216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)| Medium | O(n)| O(1)|❤️| +|[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)| Easy | O(n)| O(n)|| +|[219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)| Easy | O(n)| O(n)|| +|[283. Move Zeroes](https://leetcode.com/problems/move-zeroes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)| Easy | O(n)| O(1)|| +|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)| Easy | O(n)| O(1)|❤️| +|[532. K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)| Easy | O(n)| O(n)|| +|[566. Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)| Easy | O(n^2)| O(n^2)|| +|[628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)| Easy | O(n)| O(1)|| +|[713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)| Medium | O(n)| O(1)|| +|[714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)| Medium | O(n)| O(1)|| +|[746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)| Easy | O(n)| O(1)|| +|[766. Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix)| Easy | O(n)| O(1)|| +|[867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)| Easy | O(n)| O(1)|| +|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)| Hard | O(n log n)| O(1)|| +|[907. Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)| Medium | O(n)| O(n)|❤️| +|[922. Sort Array By Parity II](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)| Medium | O(n)| O(1)|| +|[969. Pancake Sorting](https://leetcode.com/problems/pancake-sorting)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)| Medium | O(n)| O(1)|❤️| +|[977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)| Easy | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -1371,32 +1358,32 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters)| Medium | O(n)| O(1)|❤️| -|[17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0017.%20Letter%20Combinations%20of%20a%20Phone%20Number)| Medium | O(log n)| O(1)|| -|[20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0020.%20Valid-Parentheses)| Easy | O(log n)| O(1)|| -|[22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0022.%20Generate%20Parentheses)| Medium | O(log n)| O(1)|| -|[28. Implement strStr()](https://leetcode.com/problems/implement-strstr)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0028.%20Implement%20strStr())| Easy | O(n)| O(1)|| -|[30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0030.%20Substring%20with%20Concatenation%20of%20All%20Words)| Hard | O(n)| O(n)|❤️| -|[49. Group Anagrams](https://leetcode.com/problems/group-anagrams)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0049.%20Group%20Anagrams)| Medium | O(n log n)| O(n)|| -|[71. Simplify Path](https://leetcode.com/problems/simplify-path)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0071.%20Simplify%20Path)| Medium | O(n)| O(n)|| -|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0076.%20Minimum%20Window%20Substring)| Hard | O(n)| O(n)|❤️| -|[91. Decode Ways](https://leetcode.com/problems/decode-ways)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0091.%20Decode%20Ways)| Medium | O(n)| O(n)|| -|[93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0093.%20Restore%20IP%20Addresses)| Medium | O(n)| O(n)|❤️| -|[125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0125.%20Valid-Palindrome)| Easy | O(n)| O(1)|| -|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0126.%20Word%20Ladder%20II)| Hard | O(n)| O(n^2)|❤️| -|[344. Reverse String](https://leetcode.com/problems/reverse-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0344.%20Reverse%20String)| Easy | O(n)| O(1)|| -|[345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0345.%20Reverse%20Vowels%20of%20a%20String)| Easy | O(n)| O(1)|| -|[767. Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0767.%20Reorganize%20String)| Medium | O(n log n)| O(log n) |❤️| -|[842. Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0842.%20Split%20Array%20into%20Fibonacci%20Sequence)| Medium | O(n^2)| O(1)|❤️| -|[856. Score of Parentheses](https://leetcode.com/problems/score-of-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0856.%20Score%20of%20Parentheses)| Medium | O(n)| O(n)|| -|[925. Long Pressed Name](https://leetcode.com/problems/long-pressed-name)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0925.%20Long%20Pressed%20Name)| Easy | O(n)| O(1)|| -|[1003. Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1003.%20Check%20If%20Word%20Is%20Valid%20After%20Substitutions)| Medium | O(n)| O(1)|| +|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)| Medium | O(n)| O(1)|❤️| +|[17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)| Medium | O(log n)| O(1)|| +|[20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)| Easy | O(log n)| O(1)|| +|[22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)| Medium | O(log n)| O(1)|| +|[28. Implement strStr()](https://leetcode.com/problems/implement-strstr)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr)| Easy | O(n)| O(1)|| +|[30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)| Hard | O(n)| O(n)|❤️| +|[49. Group Anagrams](https://leetcode.com/problems/group-anagrams)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)| Medium | O(n log n)| O(n)|| +|[71. Simplify Path](https://leetcode.com/problems/simplify-path)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)| Medium | O(n)| O(n)|| +|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)| Hard | O(n)| O(n)|❤️| +|[91. Decode Ways](https://leetcode.com/problems/decode-ways)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)| Medium | O(n)| O(n)|| +|[93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)| Medium | O(n)| O(n)|❤️| +|[125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)| Easy | O(n)| O(1)|| +|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)| Hard | O(n)| O(n^2)|❤️| +|[344. Reverse String](https://leetcode.com/problems/reverse-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)| Easy | O(n)| O(1)|| +|[345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)| Easy | O(n)| O(1)|| +|[767. Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)| Medium | O(n log n)| O(log n) |❤️| +|[842. Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)| Medium | O(n^2)| O(1)|❤️| +|[856. Score of Parentheses](https://leetcode.com/problems/score-of-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)| Medium | O(n)| O(n)|| +|[925. Long Pressed Name](https://leetcode.com/problems/long-pressed-name)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)| Easy | O(n)| O(1)|| +|[1003. Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)| Medium | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Two Pointers -![](./Topics/Two_pointers.png) +![](./topic/Two_pointers.png) - 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。 @@ -1421,62 +1408,62 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters)| Medium | O(n)| O(1)|❤️| -|[11. Container With Most Water](https://leetcode.com/problems/container-with-most-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0011.%20Container%20With%20Most%20Water)| Medium | O(n)| O(1)|| -|[15. 3Sum](https://leetcode.com/problems/3sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0015.%203Sum)| Medium | O(n^2)| O(n)|❤️| -|[16. 3Sum Closest](https://leetcode.com/problems/3sum-closest)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0016.%203Sum%20Closest)| Medium | O(n^2)| O(1)|❤️| -|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0018.%204Sum)| Medium | O(n^3)| O(n^2)|❤️| -|[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0019.%20Remove%20Nth%20Node%20From%20End%20of%20List)| Medium | O(n)| O(1)|| -|[26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0026.%20Remove%20Duplicates%20from%20Sorted%20Array)| Easy | O(n)| O(1)|| -|[27. Remove Element](https://leetcode.com/problems/remove-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0027.%20Remove%20Element)| Easy | O(n)| O(1)|| -|[28. Implement strStr()](https://leetcode.com/problems/implement-strstr)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0028.%20Implement%20strStr())| Easy | O(n)| O(1)|| -|[30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0030.%20Substring%20with%20Concatenation%20of%20All%20Words)| Hard | O(n)| O(n)|❤️| -|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0042.%20Trapping%20Rain%20Water)| Hard | O(n)| O(1)|❤️| -|[61. Rotate List](https://leetcode.com/problems/rotate-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0061.%20Rotate%20List)| Medium | O(n)| O(1)|| -|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0075.%20Sort%20Colors)| Medium| O(n)| O(1)|❤️| -|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0076.%20Minimum%20Window%20Substring)| Hard | O(n)| O(n)|❤️| -|[80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II)| Medium | O(n)| O(1|| -|[86. Partition List](https://leetcode.com/problems/partition-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0086.%20Partition%20List)| Medium | O(n)| O(1)|❤️| -|[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0088.%20Merge-Sorted-Array)| Easy | O(n)| O(1)|❤️| -|[125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0125.%20Valid-Palindrome)| Easy | O(n)| O(1)|| -|[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0141.%20Linked%20List%20Cycle)| Easy | O(n)| O(1)|❤️| -|[142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0142.%20Linked%20List%20Cycle%20II)| Medium | O(n)| O(1)|❤️| -|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted)| Easy | O(n)| O(1)|| -|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0209.%20Minimum%20Size%20Subarray%20Sum)| Medium | O(n)| O(1)|| -|[234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0234.%20Palindrome%20Linked%20List)| Easy | O(n)| O(1)|| -|[283. Move Zeroes](https://leetcode.com/problems/move-zeroes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0283.%20Move%20Zeroes)| Easy | O(n)| O(1)|| -|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0287.%20Find%20the%20Duplicate%20Number)| Easy | O(n)| O(1)|❤️| -|[344. Reverse String](https://leetcode.com/problems/reverse-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0344.%20Reverse%20String)| Easy | O(n)| O(1)|| -|[345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0345.%20Reverse%20Vowels%20of%20a%20String)| Easy | O(n)| O(1)|| -|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays)| Easy | O(n)| O(n) || -|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II)| Easy | O(n)| O(n) || -|[424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0424.%20Longest%20Repeating%20Character%20Replacement)| Medium | O(n)| O(1) || -|[524. Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0524.%20Longest%20Word%20in%20Dictionary%20through%20Deleting)| Medium | O(n)| O(1) || -|[532. K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0532.%20K-diff%20Pairs%20in%20an%20Array)| Easy | O(n)| O(n)|| -|[567. Permutation in String](https://leetcode.com/problems/permutation-in-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0567.%20Permutation%20in%20String)| Medium | O(n)| O(1)|❤️| -|[713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0713.%20Subarray%20Product%20Less%20Than%20K)| Medium | O(n)| O(1)|| -|[763. Partition Labels](https://leetcode.com/problems/partition-labels)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0763.%20Partition%20Labels)| Medium | O(n)| O(1)|❤️| -|[826. Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0826.%20Most%20Profit%20Assigning%20Work)| Medium | O(n log n)| O(n)|| -|[828. Unique Letter String](https://leetcode.com/problems/unique-letter-string)| [Go]()| Hard | O(n)| O(1)|❤️| -|[838. Push Dominoes](https://leetcode.com/problems/push-dominoes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0838.%20Push%20Dominoes)| Medium | O(n)| O(n)|| -|[844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0844.%20Backspace%20String%20Compare)| Easy | O(n)| O(n) || -|[845. Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0845.%20Longest%20Mountain%20in%20Array)| Medium | O(n)| O(1) || -|[881. Boats to Save People](https://leetcode.com/problems/boats-to-save-people)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0881.%20Boats%20to%20Save%20People)| Medium | O(n log n)| O(1) || -|[904. Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0904.%20Fruit%20Into%20Baskets)| Medium | O(n log n)| O(1) || -|[923. 3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0923.%203Sum%20With%20Multiplicity)| Medium | O(n^2)| O(n) || -|[925. Long Pressed Name](https://leetcode.com/problems/long-pressed-name)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0925.%20Long%20Pressed%20Name)| Easy | O(n)| O(1)|| -|[930. Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0930.%20Binary%20Subarrays%20With%20Sum)| Medium | O(n)| O(n) |❤️| -|[977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0977.%20Squares%20of%20a%20Sorted%20Array)| Easy | O(n)| O(1)|| -|[986. Interval List Intersections](https://leetcode.com/problems/interval-list-intersections)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0986.%20Interval%20List%20Intersections)| Medium | O(n)| O(1)|| -|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0992.%20Subarrays%20with%20K%20Different%20Integers)| Hard | O(n)| O(n)|❤️| -|[1004. Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1004.%20Max%20Consecutive%20Ones%20III)| Medium | O(n)| O(1) || -|[1093. Statistics from a Large Sample](https://leetcode.com/problems/statistics-from-a-large-sample)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1093.%20Statistics%20from%20a%20Large%20Sample)| Medium | O(n)| O(1) || +|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)| Medium | O(n)| O(1)|❤️| +|[11. Container With Most Water](https://leetcode.com/problems/container-with-most-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)| Medium | O(n)| O(1)|| +|[15. 3Sum](https://leetcode.com/problems/3sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)| Medium | O(n^2)| O(n)|❤️| +|[16. 3Sum Closest](https://leetcode.com/problems/3sum-closest)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)| Medium | O(n^2)| O(1)|❤️| +|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)| Medium | O(n^3)| O(n^2)|❤️| +|[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)| Medium | O(n)| O(1)|| +|[26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)| Easy | O(n)| O(1)|| +|[27. Remove Element](https://leetcode.com/problems/remove-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)| Easy | O(n)| O(1)|| +|[28. Implement strStr()](https://leetcode.com/problems/implement-strstr)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr)| Easy | O(n)| O(1)|| +|[30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)| Hard | O(n)| O(n)|❤️| +|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)| Hard | O(n)| O(1)|❤️| +|[61. Rotate List](https://leetcode.com/problems/rotate-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)| Medium | O(n)| O(1)|| +|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)| Medium| O(n)| O(1)|❤️| +|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)| Hard | O(n)| O(n)|❤️| +|[80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)| Medium | O(n)| O(1|| +|[86. Partition List](https://leetcode.com/problems/partition-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)| Medium | O(n)| O(1)|❤️| +|[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)| Easy | O(n)| O(1)|❤️| +|[125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)| Easy | O(n)| O(1)|| +|[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)| Easy | O(n)| O(1)|❤️| +|[142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)| Medium | O(n)| O(1)|❤️| +|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted)| Easy | O(n)| O(1)|| +|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)| Medium | O(n)| O(1)|| +|[234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)| Easy | O(n)| O(1)|| +|[283. Move Zeroes](https://leetcode.com/problems/move-zeroes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)| Easy | O(n)| O(1)|| +|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)| Easy | O(n)| O(1)|❤️| +|[344. Reverse String](https://leetcode.com/problems/reverse-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)| Easy | O(n)| O(1)|| +|[345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)| Easy | O(n)| O(1)|| +|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)| Easy | O(n)| O(n) || +|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)| Easy | O(n)| O(n) || +|[424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)| Medium | O(n)| O(1) || +|[524. Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)| Medium | O(n)| O(1) || +|[532. K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)| Easy | O(n)| O(n)|| +|[567. Permutation in String](https://leetcode.com/problems/permutation-in-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)| Medium | O(n)| O(1)|❤️| +|[713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)| Medium | O(n)| O(1)|| +|[763. Partition Labels](https://leetcode.com/problems/partition-labels)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)| Medium | O(n)| O(1)|❤️| +|[826. Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)| Medium | O(n log n)| O(n)|| +|[828. Unique Letter String](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.COPYRIGHT-PROBLEM-XXX)| Hard | O(n)| O(1)|❤️| +|[838. Push Dominoes](https://leetcode.com/problems/push-dominoes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)| Medium | O(n)| O(n)|| +|[844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)| Easy | O(n)| O(n) || +|[845. Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)| Medium | O(n)| O(1) || +|[881. Boats to Save People](https://leetcode.com/problems/boats-to-save-people)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)| Medium | O(n log n)| O(1) || +|[904. Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets)| Medium | O(n log n)| O(1) || +|[923. 3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity)| Medium | O(n^2)| O(n) || +|[925. Long Pressed Name](https://leetcode.com/problems/long-pressed-name)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)| Easy | O(n)| O(1)|| +|[930. Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)| Medium | O(n)| O(n) |❤️| +|[977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)| Easy | O(n)| O(1)|| +|[986. Interval List Intersections](https://leetcode.com/problems/interval-list-intersections)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)| Medium | O(n)| O(1)|| +|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)| Hard | O(n)| O(n)|❤️| +|[1004. Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)| Medium | O(n)| O(1) || +|[1093. Statistics from a Large Sample](https://leetcode.com/problems/statistics-from-a-large-sample)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)| Medium | O(n)| O(1) || |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Linked List -![](./Topics/Linked_List.png) +![](./topic/Linked_List.png) - 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。 @@ -1492,42 +1479,42 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0002.%20Add%20Two%20Numbers)| Medium | O(n)| O(1)|| -|[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0019.%20Remove%20Nth%20Node%20From%20End%20of%20List)| Medium | O(n)| O(1)|| -|[21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0021.%20Merge%20Two%20Sorted%20Lists)| Easy | O(log n)| O(1)|| -|[23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0023.%20Merge%20k%20Sorted%20Lists)| Hard | O(log n)| O(1)|❤️| -|[24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0024.%20Swap%20Nodes%20in%20Pairs)| Medium | O(n)| O(1)|| -|[25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0025.%20Reverse%20Nodes%20in%20k%20Group)| Hard | O(log n)| O(1)|❤️| -|[61. Rotate List](https://leetcode.com/problems/rotate-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0061.%20Rotate%20List)| Medium | O(n)| O(1)|| -|[82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0082.%20Remove%20Duplicates%20from%20Sorted%20List%20II)| Medium | O(n)| O(1)|| -|[83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0083.%20Remove%20Duplicates%20from%20Sorted%20List)| Easy | O(n)| O(1)|| -|[86. Partition List](https://leetcode.com/problems/partition-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0086.%20Partition%20List)| Medium | O(n)| O(1)|❤️| -|[92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0092.%20Reverse%20Linked%20List%20II)| Medium | O(n)| O(1)|❤️| -|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree)| Medium | O(log n)| O(n)|| -|[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0141.%20Linked%20List%20Cycle)| Easy | O(n)| O(1)|❤️| -|[142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0142.%20Linked%20List%20Cycle%20II)| Medium | O(n)| O(1)|❤️| -|[143. Reorder List](https://leetcode.com/problems/reorder-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0143.%20Reorder%20List)| Medium | O(n)| O(1)|❤️| -|[147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0147.%20Insertion%20Sort%20List)| Medium | O(n)| O(1)|❤️| -|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0148.%20Sort%20List)| Medium | O(n log n)| O(n)|❤️| -|[160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0160.%20Intersection%20of%20Two%20Linked%20Lists)| Easy | O(n)| O(1)|❤️| -|[203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0203.%20Remove%20Linked%20List%20Elements)| Easy | O(n)| O(1)|| -|[206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0206.%20Reverse-Linked-List)| Easy | O(n)| O(1)|| -|[234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0234.%20Palindrome%20Linked%20List)| Easy | O(n)| O(1)|| -|[237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0237.%20Delete%20Node%20in%20a%20Linked%20List)| Easy | O(n)| O(1)|| -|[328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0328.%20Odd%20Even%20Linked%20List)| Medium | O(n)| O(1)|| -|[445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0445.%20Add%20Two%20Numbers%20II)| Medium | O(n)| O(n)|| -|[725. Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0725.%20Split%20Linked%20List%20in%20Parts)| Medium | O(n)| O(1)|| -|[817. Linked List Components](https://leetcode.com/problems/linked-list-components/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0817.%20Linked%20List%20Components)| Medium | O(n)| O(1)|| -|[707. Design Linked List](https://leetcode.com/problems/design-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0707.%20Design%20Linked%20List)| Easy | O(n)| O(1)|| -|[876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0876.%20Middle%20of%20the%20Linked%20List)| Easy | O(n)| O(1)|❤️| -|[1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1019.%20Next%20Greater%20Node%20In%20Linked%20List)| Medium | O(n)| O(1)|| +|[2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)| Medium | O(n)| O(1)|| +|[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)| Medium | O(n)| O(1)|| +|[21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)| Easy | O(log n)| O(1)|| +|[23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)| Hard | O(log n)| O(1)|❤️| +|[24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)| Medium | O(n)| O(1)|| +|[25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)| Hard | O(log n)| O(1)|❤️| +|[61. Rotate List](https://leetcode.com/problems/rotate-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)| Medium | O(n)| O(1)|| +|[82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)| Medium | O(n)| O(1)|| +|[83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)| Easy | O(n)| O(1)|| +|[86. Partition List](https://leetcode.com/problems/partition-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)| Medium | O(n)| O(1)|❤️| +|[92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)| Medium | O(n)| O(1)|❤️| +|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)| Medium | O(log n)| O(n)|| +|[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)| Easy | O(n)| O(1)|❤️| +|[142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)| Medium | O(n)| O(1)|❤️| +|[143. Reorder List](https://leetcode.com/problems/reorder-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)| Medium | O(n)| O(1)|❤️| +|[147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)| Medium | O(n)| O(1)|❤️| +|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)| Medium | O(n log n)| O(n)|❤️| +|[160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)| Easy | O(n)| O(1)|❤️| +|[203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)| Easy | O(n)| O(1)|| +|[206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)| Easy | O(n)| O(1)|| +|[234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)| Easy | O(n)| O(1)|| +|[237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)| Easy | O(n)| O(1)|| +|[328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)| Medium | O(n)| O(1)|| +|[445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)| Medium | O(n)| O(n)|| +|[725. Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)| Medium | O(n)| O(1)|| +|[817. Linked List Components](https://leetcode.com/problems/linked-list-components/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)| Medium | O(n)| O(1)|| +|[707. Design Linked List](https://leetcode.com/problems/design-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)| Easy | O(n)| O(1)|| +|[876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)| Easy | O(n)| O(1)|❤️| +|[1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)| Medium | O(n)| O(1)|| |----------------------------------------------------------------------------|-------------|-------------| -------------| -------------|-------------| ## Stack -![](./Topics/Stack.png) +![](./topic/Stack.png) - 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。 - 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。 @@ -1536,43 +1523,43 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0020.%20Valid-Parentheses)| Easy | O(log n)| O(1)|| -|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0042.%20Trapping%20Rain%20Water)| Hard | O(n)| O(1)|❤️| -|[71. Simplify Path](https://leetcode.com/problems/simplify-path)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0071.%20Simplify%20Path)| Medium | O(n)| O(n)|❤️| -|[84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0084.%20Largest%20Rectangle%20in%20Histogram)| Medium | O(n)| O(n)|❤️| -|[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0094.%20Binary%20Tree%20Inorder%20Traversal)| Medium | O(n)| O(1)|| -|[103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal)| Medium | O(n)| O(n)|| -|[144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0144.%20Binary%20Tree%20Preorder%20Traversal)| Medium | O(n)| O(1)|| -|[145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0145.%20Binary%20Tree%20Postorder%20Traversal)| Hard | O(n)| O(1)|| -|[150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0150.%20Evaluate%20Reverse%20Polish%20Notation)| Medium | O(n)| O(1)|| -|[155. Min Stack](https://leetcode.com/problems/min-stack)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0155.%20Min%20Stack)| Easy | O(n)| O(n)|| -|[173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0173.%20Binary%20Search%20Tree%20Iterator)| Medium | O(n)| O(1)|| -|[224. Basic Calculator](https://leetcode.com/problems/basic-calculator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0224.%20Basic%20Calculator)| Hard | O(n)| O(n)|| -|[225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0225.%20Implement%20Stack%20using%20Queues)| Easy | O(n)| O(n)|| -|[232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0232.%20Implement%20Queue%20using%20Stacks)| Easy | O(n)| O(n)|| -|[331. Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0331.%20Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree)| Medium | O(n)| O(1)|| -|[394. Decode String](https://leetcode.com/problems/decode-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0394.%20Decode%20String)| Medium | O(n)| O(n)|| -|[402. Remove K Digits](https://leetcode.com/problems/remove-k-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0402.%20Remove%20K%20Digits)| Medium | O(n)| O(1)|| -|[456. 132 Pattern](https://leetcode.com/problems/132-pattern)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0456.%20132%20Pattern)| Medium | O(n)| O(n)|| -|[496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0496.%20Next%20Greater%20Element%20I)| Easy | O(n)| O(n)|| -|[503. Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0503.%20Next%20Greater%20Element%20II)| Medium | O(n)| O(n)|| -|[636. Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions)| [Go](https://leetcode.com/problems/exclusive-time-of-functions)| Medium | O(n)| O(n)|| -|[682. Baseball Game](https://leetcode.com/problems/baseball-game)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0682.%20Baseball%20Game)| Easy | O(n)| O(n)|| -|[726. Number of Atoms](https://leetcode.com/problems/number-of-atoms)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0726.%20Number%20of%20Atoms)| Hard | O(n)| O(n) |❤️| -|[735. Asteroid Collision](https://leetcode.com/problems/asteroid-collision)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0735.%20Asteroid%20Collision)| Medium | O(n)| O(n) || -|[739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0739.%20Daily%20Temperatures)| Medium | O(n)| O(n) || -|[844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0844.%20Backspace%20String%20Compare)| Easy | O(n)| O(n) || -|[856. Score of Parentheses](https://leetcode.com/problems/score-of-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0856.%20Score%20of%20Parentheses)| Medium | O(n)| O(n)|| -|[880. Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0880.%20Decoded%20String%20at%20Index)| Medium | O(n)| O(n)|| -|[895. Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0895.%20Maximum%20Frequency%20Stack)| Hard | O(n)| O(n) || -|[901. Online Stock Span](https://leetcode.com/problems/online-stock-span)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0901.%20Online%20Stock%20Span)| Medium | O(n)| O(n) || -|[907. Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0907.%20Sum%20of%20Subarray%20Minimums)| Medium | O(n)| O(n)|❤️| -|[921. Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0921.%20Minimum%20Add%20to%20Make%20Parentheses%20Valid)| Medium | O(n)| O(n)|| -|[946. Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0946.%20Validate%20Stack%20Sequences)| Medium | O(n)| O(n)|| -|[1003. Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1003.%20Check%20If%20Word%20Is%20Valid%20After%20Substitutions)| Medium | O(n)| O(1)|| -|[1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1019.%20Next%20Greater%20Node%20In%20Linked%20List)| Medium | O(n)| O(1)|| -|[1021. Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1021.%20Remove%20Outermost%20Parentheses)| Medium | O(n)| O(1)|| -|[1047. Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String)| Medium | O(n)| O(1)|| +|[20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)| Easy | O(log n)| O(1)|| +|[42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)| Hard | O(n)| O(1)|❤️| +|[71. Simplify Path](https://leetcode.com/problems/simplify-path)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)| Medium | O(n)| O(n)|❤️| +|[84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)| Medium | O(n)| O(n)|❤️| +|[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)| Medium | O(n)| O(1)|| +|[103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)| Medium | O(n)| O(n)|| +|[144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)| Medium | O(n)| O(1)|| +|[145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)| Hard | O(n)| O(1)|| +|[150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)| Medium | O(n)| O(1)|| +|[155. Min Stack](https://leetcode.com/problems/min-stack)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)| Easy | O(n)| O(n)|| +|[173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)| Medium | O(n)| O(1)|| +|[224. Basic Calculator](https://leetcode.com/problems/basic-calculator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)| Hard | O(n)| O(n)|| +|[225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)| Easy | O(n)| O(n)|| +|[232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)| Easy | O(n)| O(n)|| +|[331. Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)| Medium | O(n)| O(1)|| +|[394. Decode String](https://leetcode.com/problems/decode-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)| Medium | O(n)| O(n)|| +|[402. Remove K Digits](https://leetcode.com/problems/remove-k-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)| Medium | O(n)| O(1)|| +|[456. 132 Pattern](https://leetcode.com/problems/132-pattern)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern)| Medium | O(n)| O(n)|| +|[496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)| Easy | O(n)| O(n)|| +|[503. Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)| Medium | O(n)| O(n)|| +|[636. Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)| Medium | O(n)| O(n)|| +|[682. Baseball Game](https://leetcode.com/problems/baseball-game)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)| Easy | O(n)| O(n)|| +|[726. Number of Atoms](https://leetcode.com/problems/number-of-atoms)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)| Hard | O(n)| O(n) |❤️| +|[735. Asteroid Collision](https://leetcode.com/problems/asteroid-collision)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)| Medium | O(n)| O(n) || +|[739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)| Medium | O(n)| O(n) || +|[844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)| Easy | O(n)| O(n) || +|[856. Score of Parentheses](https://leetcode.com/problems/score-of-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)| Medium | O(n)| O(n)|| +|[880. Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)| Medium | O(n)| O(n)|| +|[895. Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)| Hard | O(n)| O(n) || +|[901. Online Stock Span](https://leetcode.com/problems/online-stock-span)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)| Medium | O(n)| O(n) || +|[907. Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)| Medium | O(n)| O(n)|❤️| +|[921. Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid)| Medium | O(n)| O(n)|| +|[946. Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)| Medium | O(n)| O(n)|| +|[1003. Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)| Medium | O(n)| O(1)|| +|[1019. Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)| Medium | O(n)| O(1)|| +|[1021. Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)| Medium | O(n)| O(1)|| +|[1047. Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)| Medium | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -1581,39 +1568,39 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0094.%20Binary%20Tree%20Inorder%20Traversal)| Medium | O(n)| O(1)|| -|[96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0096.%20Unique%20Binary%20Search%20Trees)| Medium | O(n^2)| O(n)|| -|[98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0098.%20Validate%20Binary%20Search%20Tree)| Medium | O(n)| O(1)|| -|[99. Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0099.%20Recover%20Binary%20Search%20Tree)| Hard | O(n)| O(1)|| -|[100. Same Tree](https://leetcode.com/problems/same-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0100.%20Same%20Tree)| Easy | O(n)| O(1)|| -|[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0101.%20Symmetric%20Tree)| Easy | O(n)| O(1)|| -|[102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0102.%20Binary%20Tree%20Level%20Order%20Traversal)| Medium | O(n)| O(1)|| -|[103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal)| Medium | O(n)| O(n)|| -|[104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0104.%20Maximum%20Depth%20of%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0107.%20Binary%20Tree%20Level%20Order%20Traversal%20II)| Easy | O(n)| O(1)|| -|[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree)| Easy | O(n)| O(1)|| -|[110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0110.%20Balanced%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0111.%20Minimum%20Depth%20of%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[112. Path Sum](https://leetcode.com/problems/path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0112.%20Path%20Sum)| Easy | O(n)| O(1)|| -|[113. Path Sum II](https://leetcode.com/problems/path-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0113.%20Path%20Sum%20II)| Medium | O(n)| O(1)|| -|[114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0114.%20Flatten%20Binary%20Tree%20to%20Linked%20List)| Medium | O(n)| O(1)|| -|[124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0124.%20Binary%20Tree%20Maximum%20Path%20Sum)| Hard | O(n)| O(1)|| -|[129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0129.%20Sum%20Root%20to%20Leaf%20Numbers)| Medium | O(n)| O(1)|| -|[144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0144.%20Binary%20Tree%20Preorder%20Traversal)| Medium | O(n)| O(1)|| -|[145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0145.%20Binary%20Tree%20Postorder%20Traversal)| Hard | O(n)| O(1)|| -|[173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0173.%20Binary%20Search%20Tree%20Iterator)| Medium | O(n)| O(1)|| -|[199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0199.%20Binary%20Tree%20Right%20Side%20Views)| Medium | O(n)| O(1)|| -|[222. Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0222.%20Count%20Complete%20Tree%20Nodes)| Medium | O(n)| O(1)|| -|[226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0226.%20Invert%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0230.%20Kth%20Smallest%20Element%20in%20a%20BST)| Medium | O(n)| O(1)|| -|[235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree)| Easy | O(n)| O(1)|| -|[236. Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree)| Medium | O(n)| O(1)|| -|[257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0257.%20Binary%20Tree%20Paths)| Easy | O(n)| O(1)|| -|[404. Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0404.%20Sum%20of%20Left%20Leaves)| Easy | O(n)| O(1)|| -|[437. Path Sum III](https://leetcode.com/problems/path-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0437.%20Path%20Sum%20III)| Easy | O(n)| O(1)|| -|[515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row)| Medium | O(n)| O(n)|| -|[637. Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0637.%20Average%20of%20Levels%20in%20Binary%20Tree)| Easy | O(n)| O(n)|| -|[993. Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0993.%20Cousins%20in%20Binary%20Tree)| Easy | O(n)| O(1)|| +|[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)| Medium | O(n)| O(1)|| +|[96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)| Medium | O(n^2)| O(n)|| +|[98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)| Medium | O(n)| O(1)|| +|[99. Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)| Hard | O(n)| O(1)|| +|[100. Same Tree](https://leetcode.com/problems/same-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)| Easy | O(n)| O(1)|| +|[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)| Easy | O(n)| O(1)|| +|[102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)| Medium | O(n)| O(1)|| +|[103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)| Medium | O(n)| O(n)|| +|[104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)| Easy | O(n)| O(1)|| +|[107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)| Easy | O(n)| O(1)|| +|[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)| Easy | O(n)| O(1)|| +|[110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)| Easy | O(n)| O(1)|| +|[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)| Easy | O(n)| O(1)|| +|[112. Path Sum](https://leetcode.com/problems/path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)| Easy | O(n)| O(1)|| +|[113. Path Sum II](https://leetcode.com/problems/path-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)| Medium | O(n)| O(1)|| +|[114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)| Medium | O(n)| O(1)|| +|[124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)| Hard | O(n)| O(1)|| +|[129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)| Medium | O(n)| O(1)|| +|[144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)| Medium | O(n)| O(1)|| +|[145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)| Hard | O(n)| O(1)|| +|[173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)| Medium | O(n)| O(1)|| +|[199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)| Medium | O(n)| O(1)|| +|[222. Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)| Medium | O(n)| O(1)|| +|[226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)| Easy | O(n)| O(1)|| +|[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)| Medium | O(n)| O(1)|| +|[235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)| Easy | O(n)| O(1)|| +|[236. Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)| Medium | O(n)| O(1)|| +|[257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)| Easy | O(n)| O(1)|| +|[404. Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)| Easy | O(n)| O(1)|| +|[437. Path Sum III](https://leetcode.com/problems/path-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)| Easy | O(n)| O(1)|| +|[515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)| Medium | O(n)| O(n)|| +|[637. Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)| Easy | O(n)| O(n)|| +|[993. Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)| Easy | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -1625,38 +1612,38 @@ | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0053.%20Maximum%20Subarray)| Easy | O(n)| O(n)|| -|[62. Unique Paths](https://leetcode.com/problems/unique-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0062.%20Unique%20Paths)| Medium | O(n^2)| O(n^2)|| -|[63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0063.%20Unique%20Paths%20II)| Medium | O(n^2)| O(n^2)|| -|[64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0064.%20Minimum%20Path%20Sum)| Medium | O(n^2)| O(n^2)|| -|[70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0070.%20Climbing%20Stairs)| Easy | O(n)| O(n)|| -|[91. Decode Ways](https://leetcode.com/problems/decode-ways)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0091.%20Decode%20Ways)| Medium | O(n)| O(n)|| -|[96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0096.%20Unique%20Binary%20Search%20Trees)| Medium | O(n)| O(n)|| -|[120. Triangle](https://leetcode.com/problems/triangle)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0120.%20Triangle)| Medium | O(n^2)| O(n)|| -|[121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock)| Easy | O(n)| O(1)|| -|[152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0152.%20Maximum%20Product%20Subarray)| Medium | O(n)| O(1)|| -|[198. House Robber](https://leetcode.com/problems/house-robber)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0198.%20House%20Robber)| Easy | O(n)| O(n)|| -|[213. House Robber II](https://leetcode.com/problems/house-robber-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0213.%20House%20Robber%20II)| Medium | O(n)| O(n)|| -|[300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0300.%20Longest%20Increasing%20Subsequence)| Medium | O(n log n)| O(n)|| -|[309. Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown)| Medium | O(n)| O(n)|| -|[322. Coin Change](https://leetcode.com/problems/coin-change)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0322.%20Coin%20Change)| Medium | O(n)| O(n)|| -|[338. Counting Bits](https://leetcode.com/problems/counting-bits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0338.%20Counting%20Bits)| Medium | O(n)| O(n)|| -|[343. Integer Break](https://leetcode.com/problems/integer-break)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0343.%20Integer%20Break)| Medium | O(n^2)| O(n)|| -|[357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0357.%20Count%20Numbers%20with%20Unique%20Digits)| Medium | O(1)| O(1)|| -|[392. Is Subsequence](https://leetcode.com/problems/is-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0392.%20Is%20Subsequence)| Medium | O(n)| O(1)|| -|[416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0416.%20Partition%20Equal%20Subset%20Sum)| Medium | O(n^2)| O(n)|| -|[714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee)| Medium | O(n)| O(1)|| -|[746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0746.%20Min%20Cost%20Climbing%20Stairs)| Easy | O(n)| O(1)|| -|[838. Push Dominoes](https://leetcode.com/problems/push-dominoes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0838.%20Push%20Dominoes)| Medium | O(n)| O(n)|| -|[1025. Divisor Game](https://leetcode.com/problems/divisor-game)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1025.%20Divisor%20Game)| Easy | O(1)| O(1)|| -|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0891.%20Sum%20of%20Subsequence%20Widths)| Hard | O(n log n)| O(1)|| -|[942. DI String Match](https://leetcode.com/problems/di-string-match)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0942.%20DI%20String%20Match)| Easy | O(n)| O(1)|| +|[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)| Easy | O(n)| O(n)|| +|[62. Unique Paths](https://leetcode.com/problems/unique-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)| Medium | O(n^2)| O(n^2)|| +|[63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)| Medium | O(n^2)| O(n^2)|| +|[64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)| Medium | O(n^2)| O(n^2)|| +|[70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)| Easy | O(n)| O(n)|| +|[91. Decode Ways](https://leetcode.com/problems/decode-ways)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)| Medium | O(n)| O(n)|| +|[96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)| Medium | O(n)| O(n)|| +|[120. Triangle](https://leetcode.com/problems/triangle)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)| Medium | O(n^2)| O(n)|| +|[121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)| Easy | O(n)| O(1)|| +|[152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)| Medium | O(n)| O(1)|| +|[198. House Robber](https://leetcode.com/problems/house-robber)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)| Easy | O(n)| O(n)|| +|[213. House Robber II](https://leetcode.com/problems/house-robber-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)| Medium | O(n)| O(n)|| +|[300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)| Medium | O(n log n)| O(n)|| +|[309. Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)| Medium | O(n)| O(n)|| +|[322. Coin Change](https://leetcode.com/problems/coin-change)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)| Medium | O(n)| O(n)|| +|[338. Counting Bits](https://leetcode.com/problems/counting-bits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)| Medium | O(n)| O(n)|| +|[343. Integer Break](https://leetcode.com/problems/integer-break)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)| Medium | O(n^2)| O(n)|| +|[357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)| Medium | O(1)| O(1)|| +|[392. Is Subsequence](https://leetcode.com/problems/is-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)| Medium | O(n)| O(1)|| +|[416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)| Medium | O(n^2)| O(n)|| +|[714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)| Medium | O(n)| O(1)|| +|[746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)| Easy | O(n)| O(1)|| +|[838. Push Dominoes](https://leetcode.com/problems/push-dominoes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)| Medium | O(n)| O(n)|| +|[1025. Divisor Game](https://leetcode.com/problems/divisor-game)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)| Easy | O(1)| O(1)|| +|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)| Hard | O(n log n)| O(1)|| +|[942. DI String Match](https://leetcode.com/problems/di-string-match)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)| Easy | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Backtracking -![](./Topics/Backtracking.png) +![](./topic/Backtracking.png) - 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。 - 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。 @@ -1750,36 +1737,36 @@ func updateMatrix_BFS(matrix [][]int) [][]int { | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0017.%20Letter%20Combinations%20of%20a%20Phone%20Number)| Medium | O(log n)| O(1)|| -|[22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0022.%20Generate%20Parentheses)| Medium | O(log n)| O(1)|| -|[37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0037.%20Sudoku%20Solver)| Hard | O(n^2)| O(n^2)|❤️| -|[39. Combination Sum](https://leetcode.com/problems/combination-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0039.%20Combination%20Sum)| Medium | O(n log n)| O(n)|| -|[40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0040.%20Combination%20Sum%20II)| Medium | O(n log n)| O(n)|| -|[46. Permutations](https://leetcode.com/problems/permutations)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0046.%20Permutations)| Medium | O(n)| O(n)|❤️| -|[47. Permutations II](https://leetcode.com/problems/permutations-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0047.%20Permutations%20II)| Medium | O(n^2)| O(n)|❤️| -|[51. N-Queens](https://leetcode.com/problems/n-queens)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0051.%20N-Queens)| Hard | O(n^2)| O(n)|❤️| -|[52. N-Queens II](https://leetcode.com/problems/n-queens-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0052.%20N-Queens%20II)| Hard | O(n^2)| O(n)|❤️| -|[60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0060.%20Permutation%20Sequence)| Medium | O(n log n)| O(1)|| -|[77. Combinations](https://leetcode.com/problems/combinations)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0077.%20Combinations)| Medium | O(n)| O(n)|❤️| -|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0078.%20Subsets)| Medium | O(n^2)| O(n)|❤️| -|[79. Word Search](https://leetcode.com/problems/word-search)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0079.%20Word%20Search)| Medium | O(n^2)| O(n^2)|❤️| -|[89. Gray Codes](https://leetcode.com/problems/gray-code)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0089.%20Gray%20Code)| Medium | O(n)| O(1)|| -|[90. Subsets II](https://leetcode.com/problems/subsets-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0090.%20Subsets%20II)| Medium | O(n^2)| O(n)|❤️| -|[93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0093.%20Restore%20IP%20Addresses)| Medium | O(n)| O(n)|❤️| -|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0126.%20Word%20Ladder%20II)| Hard | O(n)| O(n^2)|❤️| -|[131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0131.%20Palindrome%20Partitioning)| Medium | O(n)| O(n^2)|❤️| -|[211. Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0211.%20Add%20and%20Search%20Word%20-%20Data%20structure%20design)| Medium | O(n)| O(n)|❤️| -|[212. Word Search II](https://leetcode.com/problems/word-search-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0212.%20Word%20Search%20II)| Hard | O(n^2)| O(n^2)|❤️| -|[216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0216.%20Combination%20Sum%20III)| Medium | O(n)| O(1)|❤️| -|[306. Additive Number](https://leetcode.com/problems/additive-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0306.%20Additive%20Number)| Medium | O(n^2)| O(1)|❤️| -|[357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0357.%20Count%20Numbers%20with%20Unique%20Digits)| Medium | O(1)| O(1)|| -|[401. Binary Watch](https://leetcode.com/problems/binary-watch)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0401.%20Binary%20Watch)| Easy | O(1)| O(1)|| -|[526. Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0526.%20Beautiful%20Arrangement)| Medium | O(n^2)| O(1)|❤️| -|[784. Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0784.%20Letter%20Case%20Permutation)| Easy | O(n)| O(n)|| -|[842. Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0842.%20Split%20Array%20into%20Fibonacci%20Sequence)| Medium | O(n^2)| O(1)|❤️| -|[980. Unique Paths III](https://leetcode.com/problems/unique-paths-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0980.%20Unique%20Paths%20III)| Hard | O(n log n)| O(n)|| -|[996. Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0996.%20Number%20of%20Squareful%20Arrays)| Hard | O(n log n)| O(n) || -|[1079. Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1079.%20Letter%20Tile%20Possibilities)| Medium | O(n^2)| O(1)|❤️| +|[17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)| Medium | O(log n)| O(1)|| +|[22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)| Medium | O(log n)| O(1)|| +|[37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)| Hard | O(n^2)| O(n^2)|❤️| +|[39. Combination Sum](https://leetcode.com/problems/combination-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)| Medium | O(n log n)| O(n)|| +|[40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)| Medium | O(n log n)| O(n)|| +|[46. Permutations](https://leetcode.com/problems/permutations)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)| Medium | O(n)| O(n)|❤️| +|[47. Permutations II](https://leetcode.com/problems/permutations-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)| Medium | O(n^2)| O(n)|❤️| +|[51. N-Queens](https://leetcode.com/problems/n-queens)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)| Hard | O(n^2)| O(n)|❤️| +|[52. N-Queens II](https://leetcode.com/problems/n-queens-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)| Hard | O(n^2)| O(n)|❤️| +|[60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)| Medium | O(n log n)| O(1)|| +|[77. Combinations](https://leetcode.com/problems/combinations)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)| Medium | O(n)| O(n)|❤️| +|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)| Medium | O(n^2)| O(n)|❤️| +|[79. Word Search](https://leetcode.com/problems/word-search)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)| Medium | O(n^2)| O(n^2)|❤️| +|[89. Gray Codes](https://leetcode.com/problems/gray-code)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)| Medium | O(n)| O(1)|| +|[90. Subsets II](https://leetcode.com/problems/subsets-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)| Medium | O(n^2)| O(n)|❤️| +|[93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)| Medium | O(n)| O(n)|❤️| +|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)| Hard | O(n)| O(n^2)|❤️| +|[131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)| Medium | O(n)| O(n^2)|❤️| +|[211. Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Add-and-Search-Word---Data-structure-design)| Medium | O(n)| O(n)|❤️| +|[212. Word Search II](https://leetcode.com/problems/word-search-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)| Hard | O(n^2)| O(n^2)|❤️| +|[216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)| Medium | O(n)| O(1)|❤️| +|[306. Additive Number](https://leetcode.com/problems/additive-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)| Medium | O(n^2)| O(1)|❤️| +|[357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)| Medium | O(1)| O(1)|| +|[401. Binary Watch](https://leetcode.com/problems/binary-watch)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)| Easy | O(1)| O(1)|| +|[526. Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)| Medium | O(n^2)| O(1)|❤️| +|[784. Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)| Easy | O(n)| O(n)|| +|[842. Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)| Medium | O(n^2)| O(1)|❤️| +|[980. Unique Paths III](https://leetcode.com/problems/unique-paths-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)| Hard | O(n log n)| O(n)|| +|[996. Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)| Hard | O(n log n)| O(n) || +|[1079. Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)| Medium | O(n^2)| O(1)|❤️| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -1788,29 +1775,29 @@ func updateMatrix_BFS(matrix [][]int) [][]int { | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0098.%20Validate%20Binary%20Search%20Tree)| Medium | O(n)| O(1)|| -|[99. Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0099.%20Recover%20Binary%20Search%20Tree)| Hard | O(n)| O(1)|| -|[100. Same Tree](https://leetcode.com/problems/same-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0100.%20Same%20Tree)| Easy | O(n)| O(1)|| -|[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0101.%20Symmetric%20Tree)| Easy | O(n)| O(1)|| -|[104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0104.%20Maximum%20Depth%20of%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree)| Easy | O(n)| O(1)|| -|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree)| Medium | O(log n)| O(n)|| -|[110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0110.%20Balanced%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0111.%20Minimum%20Depth%20of%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[112. Path Sum](https://leetcode.com/problems/path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0112.%20Path%20Sum)| Easy | O(n)| O(1)|| -|[113. Path Sum II](https://leetcode.com/problems/path-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0113.%20Path%20Sum%20II)| Medium | O(n)| O(1)|| -|[114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0114.%20Flatten%20Binary%20Tree%20to%20Linked%20List)| Medium | O(n)| O(1)|| -|[124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0124.%20Binary%20Tree%20Maximum%20Path%20Sum)| Hard | O(n)| O(1)|| -|[129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0129.%20Sum%20Root%20to%20Leaf%20Numbers)| Medium | O(n)| O(1)|| -|[199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0199.%20Binary%20Tree%20Right%20Side%20Views)| Medium | O(n)| O(1)|| -|[200. Number of Islands](https://leetcode.com/problems/number-of-islands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0200.%20Number%20of%20Islands)| Medium | O(n^2)| O(n^2)|| -|[207. Course Schedule](https://leetcode.com/problems/course-schedule)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0207.%20Course%20Schedule)| Medium | O(n^2)| O(n^2)|| -|[210. Course Schedule II](https://leetcode.com/problems/course-schedule-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0210.%20Course%20Schedule%20II)| Medium | O(n^2)| O(n^2)|| -|[257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0257.%20Binary%20Tree%20Paths)| Easy | O(n)| O(1)|| -|[394. Decode String](https://leetcode.com/problems/decode-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0394.%20Decode%20String)| Medium | O(n)| O(n)|| -|[515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row)| Medium | O(n)| O(n)|| -|[542. 01 Matrix](https://leetcode.com/problems/01-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0542.%2001%20Matrix)| Medium | O(n)| O(1)|| -|[980. Unique Paths III](https://leetcode.com/problems/unique-paths-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0980.%20Unique%20Paths%20III)| Hard | O(n log n)| O(n)|| +|[98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)| Medium | O(n)| O(1)|| +|[99. Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)| Hard | O(n)| O(1)|| +|[100. Same Tree](https://leetcode.com/problems/same-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)| Easy | O(n)| O(1)|| +|[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)| Easy | O(n)| O(1)|| +|[104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)| Easy | O(n)| O(1)|| +|[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)| Easy | O(n)| O(1)|| +|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)| Medium | O(log n)| O(n)|| +|[110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)| Easy | O(n)| O(1)|| +|[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)| Easy | O(n)| O(1)|| +|[112. Path Sum](https://leetcode.com/problems/path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)| Easy | O(n)| O(1)|| +|[113. Path Sum II](https://leetcode.com/problems/path-sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)| Medium | O(n)| O(1)|| +|[114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)| Medium | O(n)| O(1)|| +|[124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)| Hard | O(n)| O(1)|| +|[129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)| Medium | O(n)| O(1)|| +|[199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)| Medium | O(n)| O(1)|| +|[200. Number of Islands](https://leetcode.com/problems/number-of-islands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)| Medium | O(n^2)| O(n^2)|| +|[207. Course Schedule](https://leetcode.com/problems/course-schedule)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)| Medium | O(n^2)| O(n^2)|| +|[210. Course Schedule II](https://leetcode.com/problems/course-schedule-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)| Medium | O(n^2)| O(n^2)|| +|[257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)| Easy | O(n)| O(1)|| +|[394. Decode String](https://leetcode.com/problems/decode-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)| Medium | O(n)| O(n)|| +|[515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)| Medium | O(n)| O(n)|| +|[542. 01 Matrix](https://leetcode.com/problems/01-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)| Medium | O(n)| O(1)|| +|[980. Unique Paths III](https://leetcode.com/problems/unique-paths-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)| Hard | O(n log n)| O(n)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -1823,20 +1810,20 @@ func updateMatrix_BFS(matrix [][]int) [][]int { | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0101.%20Symmetric%20Tree)| Easy | O(n)| O(1)|| -|[102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0102.%20Binary%20Tree%20Level%20Order%20Traversal)| Medium | O(n)| O(1)|| -|[103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal)| Medium | O(n)| O(n)|| -|[107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0107.%20Binary%20Tree%20Level%20Order%20Traversal%20II)| Easy | O(n)| O(1)|| -|[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0111.%20Minimum%20Depth%20of%20Binary%20Tree)| Easy | O(n)| O(1)|| -|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0126.%20Word%20Ladder%20II)| Hard | O(n)| O(n^2)|❤️| -|[127. Word Ladder](https://leetcode.com/problems/word-ladder)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0127.%20Word%20Ladder)| Medium | O(n)| O(n)|| -|[199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0199.%20Binary%20Tree%20Right%20Side%20Views)| Medium | O(n)| O(1)|| -|[200. Number of Islands](https://leetcode.com/problems/number-of-islands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0200.%20Number%20of%20Islands)| Medium | O(n^2)| O(n^2)|| -|[207. Course Schedule](https://leetcode.com/problems/course-schedule)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0207.%20Course%20Schedule)| Medium | O(n^2)| O(n^2)|| -|[210. Course Schedule II](https://leetcode.com/problems/course-schedule-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0210.%20Course%20Schedule%20II)| Medium | O(n^2)| O(n^2)|| -|[515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row)| Medium | O(n)| O(n)|| -|[542. 01 Matrix](https://leetcode.com/problems/01-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0542.%2001%20Matrix)| Medium | O(n)| O(1)|| -|[993. Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0993.%20Cousins%20in%20Binary%20Tree)| Easy | O(n)| O(1)|| +|[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)| Easy | O(n)| O(1)|| +|[102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)| Medium | O(n)| O(1)|| +|[103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)| Medium | O(n)| O(n)|| +|[107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)| Easy | O(n)| O(1)|| +|[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)| Easy | O(n)| O(1)|| +|[126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)| Hard | O(n)| O(n^2)|❤️| +|[127. Word Ladder](https://leetcode.com/problems/word-ladder)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)| Medium | O(n)| O(n)|| +|[199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)| Medium | O(n)| O(1)|| +|[200. Number of Islands](https://leetcode.com/problems/number-of-islands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)| Medium | O(n^2)| O(n^2)|| +|[207. Course Schedule](https://leetcode.com/problems/course-schedule)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)| Medium | O(n^2)| O(n^2)|| +|[210. Course Schedule II](https://leetcode.com/problems/course-schedule-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)| Medium | O(n^2)| O(n^2)|| +|[515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)| Medium | O(n)| O(n)|| +|[542. 01 Matrix](https://leetcode.com/problems/01-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)| Medium | O(n)| O(1)|| +|[993. Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)| Easy | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -1972,19 +1959,19 @@ func peakIndexInMountainArray(A []int) int { | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[50. Pow(x, n)](https://leetcode.com/problems/powx-n)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0050.%20Pow(x%2C%20n))| Medium | O(log n)| O(1)|| -|[69. Sqrt(x)](https://leetcode.com/problems/sqrtx)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0069.%20Sqrt(x))| Easy | O(log n)| O(1)|| -|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted)| Easy | O(n)| O(1)|| -|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0209.%20Minimum%20Size%20Subarray%20Sum)| Medium | O(n)| O(1)|| -|[222. Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0222.%20Count%20Complete%20Tree%20Nodes)| Medium | O(n)| O(1)|| -|[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0230.%20Kth%20Smallest%20Element%20in%20a%20BST)| Medium | O(n)| O(1)|| -|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0287.%20Find%20the%20Duplicate%20Number)| Easy | O(n)| O(1)|❤️| -|[300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0300.%20Longest%20Increasing%20Subsequence)| Medium | O(n log n)| O(n)|| -|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays)| Easy | O(n)| O(n) || -|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II)| Easy | O(n)| O(n) || -|[392. Is Subsequence](https://leetcode.com/problems/is-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0392.%20Is%20Subsequence)| Medium | O(n)| O(1)|| -|[454. 4Sum II](https://leetcode.com/problems/4sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0454.%204Sum%20II)| Medium | O(n^2)| O(n) || -|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0710.%20Random%20Pick%20with%20Blacklist)| Hard | O(n)| O(n) || +|[50. Pow(x, n)](https://leetcode.com/problems/powx-n)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)| Medium | O(log n)| O(1)|| +|[69. Sqrt(x)](https://leetcode.com/problems/sqrtx)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)| Easy | O(log n)| O(1)|| +|[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted)| Easy | O(n)| O(1)|| +|[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)| Medium | O(n)| O(1)|| +|[222. Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)| Medium | O(n)| O(1)|| +|[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)| Medium | O(n)| O(1)|| +|[287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)| Easy | O(n)| O(1)|❤️| +|[300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)| Medium | O(n log n)| O(n)|| +|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)| Easy | O(n)| O(n) || +|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)| Easy | O(n)| O(n) || +|[392. Is Subsequence](https://leetcode.com/problems/is-subsequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)| Medium | O(n)| O(1)|| +|[454. 4Sum II](https://leetcode.com/problems/4sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)| Medium | O(n^2)| O(n) || +|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)| Hard | O(n)| O(n) || |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -2004,24 +1991,24 @@ func peakIndexInMountainArray(A []int) int { | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0002.%20Add%20Two%20Numbers)| Medium | O(n)| O(1)|| -|[50. Pow(x, n)](https://leetcode.com/problems/powx-n)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0050.%20Pow(x%2C%20n))| Medium | O(log n)| O(1)|| -|[60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0060.%20Permutation%20Sequence)| Medium | O(n log n)| O(1)|| -|[69. Sqrt(x)](https://leetcode.com/problems/sqrtx)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0069.%20Sqrt(x))| Easy | O(log n)| O(1)|| -|[202. Happy Number](https://leetcode.com/problems/happy-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0202.%20Happy%20Number)| Easy | O(log n)| O(1)|| -|[224. Basic Calculator](https://leetcode.com/problems/basic-calculator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0224.%20Basic%20Calculator)| Hard | O(n)| O(n)|| -|[231. Power of Two](https://leetcode.com/problems/power-of-twor)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0231.%20Power%20of%20Two)| Easy | O(1)| O(1)|| -|[263. Ugly Number](https://leetcode.com/problems/ugly-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0263.%20Ugly%20Number)| Easy | O(log n)| O(1)|| -|[326. Power of Three](https://leetcode.com/problems/power-of-three)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0326.%20Power%20of%20Three)| Easy | O(1)| O(1)|| -|[343. Integer Break](https://leetcode.com/problems/integer-break)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0343.%20Integer%20Break)| Medium | O(n^2)| O(n)|| -|[357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0357.%20Count%20Numbers%20with%20Unique%20Digits)| Medium | O(1)| O(1)|| -|[628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0628.%20Maximum%20Product%20of%20Three%20Numbers)| Easy | O(n)| O(1)|| -|[885. Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0885.%20Spiral%20Matrix%20III)| Medium | O(n^2)| O(1)|| -|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0891.%20Sum%20of%20Subsequence%20Widths)| Hard | O(n log n)| O(1)|| -|[942. DI String Match](https://leetcode.com/problems/di-string-match)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0942.%20DI%20String%20Match)| Easy | O(n)| O(1)|| -|[976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0976.%20Largest%20Perimeter%20Triangle)| Easy | O(n log n)| O(log n) || -|[996. Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0996.%20Number%20of%20Squareful%20Arrays)| Hard | O(n log n)| O(n) || -|[1025. Divisor Game](https://leetcode.com/problems/divisor-game)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1025.%20Divisor%20Game)| Easy | O(1)| O(1)|| +|[2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)| Medium | O(n)| O(1)|| +|[50. Pow(x, n)](https://leetcode.com/problems/powx-n)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)| Medium | O(log n)| O(1)|| +|[60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)| Medium | O(n log n)| O(1)|| +|[69. Sqrt(x)](https://leetcode.com/problems/sqrtx)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)| Easy | O(log n)| O(1)|| +|[202. Happy Number](https://leetcode.com/problems/happy-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)| Easy | O(log n)| O(1)|| +|[224. Basic Calculator](https://leetcode.com/problems/basic-calculator)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)| Hard | O(n)| O(n)|| +|[231. Power of Two](https://leetcode.com/problems/power-of-twor)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)| Easy | O(1)| O(1)|| +|[263. Ugly Number](https://leetcode.com/problems/ugly-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)| Easy | O(log n)| O(1)|| +|[326. Power of Three](https://leetcode.com/problems/power-of-three)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)| Easy | O(1)| O(1)|| +|[343. Integer Break](https://leetcode.com/problems/integer-break)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)| Medium | O(n^2)| O(n)|| +|[357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)| Medium | O(1)| O(1)|| +|[628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)| Easy | O(n)| O(1)|| +|[885. Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)| Medium | O(n^2)| O(1)|| +|[891. Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)| Hard | O(n log n)| O(1)|| +|[942. DI String Match](https://leetcode.com/problems/di-string-match)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)| Easy | O(n)| O(1)|| +|[976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)| Easy | O(n log n)| O(log n) || +|[996. Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)| Hard | O(n log n)| O(n) || +|[1025. Divisor Game](https://leetcode.com/problems/divisor-game)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)| Easy | O(1)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -2031,46 +2018,46 @@ func peakIndexInMountainArray(A []int) int { | Title | Solution | Difficulty | Time | Space |收藏| | ----- | :--------: | :----------: | :----: | :-----: | :-----: | -|[1. Two Sum](https://leetcode.com/problems/two-sum/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0001.%20Two%20Sum)| Easy | O(n)| O(n)|| -|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters)| Medium | O(n)| O(1)|❤️| -|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0018.%204Sum)| Medium | O(n^3)| O(n^2)|❤️| -|[30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0030.%20Substring%20with%20Concatenation%20of%20All%20Words)| Hard | O(n)| O(n)|❤️| -|[36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0036.%20Valid%20Sudoku)| Medium | O(n^2)| O(n^2)|| -|[37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0037.%20Sudoku%20Solver)| Hard | O(n^2)| O(n^2)|❤️| -|[49. Group Anagrams](https://leetcode.com/problems/group-anagrams)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0049.%20Group%20Anagrams)| Medium | O(n log n)| O(n)|| -|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0076.%20Minimum%20Window%20Substring)| Hard | O(n)| O(n)|❤️| -|[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0094.%20Binary%20Tree%20Inorder%20Traversal)| Medium | O(n)| O(1)|| +|[1. Two Sum](https://leetcode.com/problems/two-sum/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)| Easy | O(n)| O(n)|| +|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)| Medium | O(n)| O(1)|❤️| +|[18. 4Sum](https://leetcode.com/problems/4sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)| Medium | O(n^3)| O(n^2)|❤️| +|[30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)| Hard | O(n)| O(n)|❤️| +|[36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)| Medium | O(n^2)| O(n^2)|| +|[37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)| Hard | O(n^2)| O(n^2)|❤️| +|[49. Group Anagrams](https://leetcode.com/problems/group-anagrams)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)| Medium | O(n log n)| O(n)|| +|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)| Hard | O(n)| O(n)|❤️| +|[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)| Medium | O(n)| O(1)|| |[138. Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer)| [Go]()| Medium | O(n)| O(1)|| -|[202. Happy Number](https://leetcode.com/problems/happy-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0202.%20Happy%20Number)| Easy | O(log n)| O(1)|| -|[205. Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0205.%20Isomorphic%20Strings)| Easy | O(log n)| O(n)|| -|[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0217.%20Contains%20Duplicate)| Easy | O(n)| O(n)|| -|[219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0219.%20Contains%20Duplicate%20II)| Easy | O(n)| O(n)|| -|[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0242.%20Valid%20Anagram)| Easy | O(n)| O(n) || -|[274. H-Index](https://leetcode.com/problems/h-index/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0274.%20H-Index)| Medium | O(n)| O(n) || -|[290. Word Pattern](https://leetcode.com/problems/word-pattern)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0290.%20Word%20Pattern)| Easy | O(n)| O(n) || -|[347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0347.%20Top%20K%20Frequent%20Elements)| Medium | O(n)| O(n) || -|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays)| Easy | O(n)| O(n) || -|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II)| Easy | O(n)| O(n) || -|[438. Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0438.%20Find%20All%20Anagrams%20in%20a%20String)| Easy | O(n)| O(1) || -|[447. Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0447.%20Number%20of%20Boomerangs)| Easy | O(n)| O(1) || -|[451. Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0451.%20Sort%20Characters%20By%20Frequency)| Medium | O(n log n)| O(1) || -|[454. 4Sum II](https://leetcode.com/problems/4sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0454.%204Sum%20II)| Medium | O(n^2)| O(n) || -|[648. Replace Words](https://leetcode.com/problems/replace-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0648.%20Replace%20Words)| Medium | O(n)| O(n) || -|[676. Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0676.%20Implement%20Magic%20Dictionary)| Medium | O(n)| O(n) || -|[720. Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0720.%20Longest%20Word%20in%20Dictionary)| Easy | O(n)| O(n) || -|[726. Number of Atoms](https://leetcode.com/problems/number-of-atoms)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0726.%20Number%20of%20Atoms)| Hard | O(n)| O(n) |❤️| -|[739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0739.%20Daily%20Temperatures)| Medium | O(n)| O(n) || -|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0710.%20Random%20Pick%20with%20Blacklist)| Hard | O(n)| O(n) || -|[895. Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0895.%20Maximum%20Frequency%20Stack)| Hard | O(n)| O(n) || -|[930. Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0930.%20Binary%20Subarrays%20With%20Sum)| Medium | O(n)| O(n) |❤️| -|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0992.%20Subarrays%20with%20K%20Different%20Integers)| Hard | O(n)| O(n) |❤️| +|[202. Happy Number](https://leetcode.com/problems/happy-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)| Easy | O(log n)| O(1)|| +|[205. Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)| Easy | O(log n)| O(n)|| +|[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)| Easy | O(n)| O(n)|| +|[219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)| Easy | O(n)| O(n)|| +|[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)| Easy | O(n)| O(n) || +|[274. H-Index](https://leetcode.com/problems/h-index/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)| Medium | O(n)| O(n) || +|[290. Word Pattern](https://leetcode.com/problems/word-pattern)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)| Easy | O(n)| O(n) || +|[347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)| Medium | O(n)| O(n) || +|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)| Easy | O(n)| O(n) || +|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)| Easy | O(n)| O(n) || +|[438. Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)| Easy | O(n)| O(1) || +|[447. Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)| Easy | O(n)| O(1) || +|[451. Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)| Medium | O(n log n)| O(1) || +|[454. 4Sum II](https://leetcode.com/problems/4sum-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)| Medium | O(n^2)| O(n) || +|[648. Replace Words](https://leetcode.com/problems/replace-words)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)| Medium | O(n)| O(n) || +|[676. Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)| Medium | O(n)| O(n) || +|[720. Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)| Easy | O(n)| O(n) || +|[726. Number of Atoms](https://leetcode.com/problems/number-of-atoms)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)| Hard | O(n)| O(n) |❤️| +|[739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)| Medium | O(n)| O(n) || +|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)| Hard | O(n)| O(n) || +|[895. Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)| Hard | O(n)| O(n) || +|[930. Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)| Medium | O(n)| O(n) |❤️| +|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)| Hard | O(n)| O(n) |❤️| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Sort -![](./Topics/Sort.png) +![](./topic/Sort.png) - 深刻的理解多路快排。第 75 题。 - 链表的排序，插入排序(第 147 题)和归并排序(第 148 题) @@ -2081,35 +2068,35 @@ func peakIndexInMountainArray(A []int) int { | Title | Solution | Difficulty | Time | Space | 收藏 | | ----- | :--------: | :----------: | :----: | :-----: |:-----: | -|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0056.%20Merge%20Intervals)| Medium | O(n log n)| O(log n)|| -|[57. Insert Interval](https://leetcode.com/problems/insert-interval/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0057.%20Insert%20Interval)| Hard | O(n)| O(1)|| -|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0075.%20Sort%20Colors)| Medium| O(n)| O(1)|❤️| -|[147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0147.%20Insertion%20Sort%20List)| Medium | O(n)| O(1) |❤️| -|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0148.%20Sort%20List)| Medium |O(n log n)| O(log n)|❤️| -|[164. Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0164.%20Maximum%20Gap)| Hard | O(n log n)| O(log n) |❤️| -|[179. Largest Number](https://leetcode.com/problems/largest-number/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0179.%20Largest%20Number)| Medium | O(n log n)| O(log n) |❤️| -|[220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0220.%20Contains%20Duplicate%20III)| Medium | O(n log n)| O(1) |❤️| -|[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0242.%20Valid%20Anagram)| Easy | O(n)| O(n) || -|[274. H-Index](https://leetcode.com/problems/h-index/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0274.%20H-Index)| Medium | O(n)| O(n) || -|[324. Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0324.%20Wiggle%20Sort%20II)| Medium| O(n)| O(n)|❤️| -|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays)| Easy | O(n)| O(n) || -|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II)| Easy | O(n)| O(n) || -|[524. Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0524.%20Longest%20Word%20in%20Dictionary%20through%20Deleting)| Medium | O(n)| O(1) || -|[767. Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0767.%20Reorganize%20String)| Medium | O(n log n)| O(log n) |❤️| -|[853. Car Fleet](https://leetcode.com/problems/car-fleet/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0853.%20Car%20Fleet)| Medium | O(n log n)| O(log n) || -|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0710.%20Random%20Pick%20with%20Blacklist)| Hard | O(n)| O(n) || -|[922. Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0922.%20Sort%20Array%20By%20Parity%20II)| Easy | O(n)| O(1) || -|[969. Pancake Sorting](https://leetcode.com/problems/pancake-sorting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0969.%20Pancake%20Sorting)| Medium | O(n log n)| O(log n) |❤️| -|[973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0973.%20K%20Closest%20Points%20to%20Origin)| Medium | O(n log n)| O(log n) || -|[976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0976.%20Largest%20Perimeter%20Triangle)| Easy | O(n log n)| O(log n) || -|[1030. Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1030.%20Matrix%20Cells%20in%20Distance%20Order)| Easy | O(n^2)| O(1) || -|[1054. Distant Barcodes](https://leetcode.com/problems/distant-barcodes/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1054.%20Distant%20Barcodes)| Medium | O(n log n)| O(log n) |❤️| +|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)| Medium | O(n log n)| O(log n)|| +|[57. Insert Interval](https://leetcode.com/problems/insert-interval/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)| Hard | O(n)| O(1)|| +|[75. Sort Colors](https://leetcode.com/problems/sort-colors/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)| Medium| O(n)| O(1)|❤️| +|[147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)| Medium | O(n)| O(1) |❤️| +|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)| Medium |O(n log n)| O(log n)|❤️| +|[164. Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)| Hard | O(n log n)| O(log n) |❤️| +|[179. Largest Number](https://leetcode.com/problems/largest-number/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)| Medium | O(n log n)| O(log n) |❤️| +|[220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)| Medium | O(n log n)| O(1) |❤️| +|[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)| Easy | O(n)| O(n) || +|[274. H-Index](https://leetcode.com/problems/h-index/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)| Medium | O(n)| O(n) || +|[324. Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)| Medium| O(n)| O(n)|❤️| +|[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)| Easy | O(n)| O(n) || +|[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)| Easy | O(n)| O(n) || +|[524. Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)| Medium | O(n)| O(1) || +|[767. Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)| Medium | O(n log n)| O(log n) |❤️| +|[853. Car Fleet](https://leetcode.com/problems/car-fleet/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)| Medium | O(n log n)| O(log n) || +|[710. Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)| Hard | O(n)| O(n) || +|[922. Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)| Easy | O(n)| O(1) || +|[969. Pancake Sorting](https://leetcode.com/problems/pancake-sorting/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)| Medium | O(n log n)| O(log n) |❤️| +|[973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin)| Medium | O(n log n)| O(log n) || +|[976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)| Easy | O(n log n)| O(log n) || +|[1030. Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)| Easy | O(n^2)| O(1) || +|[1054. Distant Barcodes](https://leetcode.com/problems/distant-barcodes/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes)| Medium | O(n log n)| O(log n) |❤️| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Bit Manipulation -![](./Topics/Bit_Manipulation.png) +![](./topic/Bit_Manipulation.png) - 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题， @@ -2146,42 +2133,42 @@ X & ~X = 0 | Title | Solution | Difficulty | Time | Space | 收藏 | | ----- | :--------: | :----------: | :----: | :-----: |:-----: | -|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0078.%20Subsets)| Medium | O(n^2)| O(n)|❤️| -|[136. Single Number](https://leetcode.com/problems/single-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0136.%20Single%20Number)| Easy | O(n)| O(1)|| -|[137. Single Number II](https://leetcode.com/problems/single-number-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0137.%20Single%20Number%20II)| Medium | O(n)| O(1)|❤️| -|[169. Majority Element](https://leetcode.com/problems/majority-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0169.%20Majority%20Element)| Easy | O(n)| O(1)|❤️| -|[187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0187.%20Repeated%20DNA%20Sequences)| Medium | O(n)| O(1)|| -|[190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0190.%20Reverse%20Bits)| Easy | O(n)| O(1)|❤️| -|[191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0191.%20Number%20of%201%20Bits)| Easy | O(n)| O(1)|| -|[201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0201.%20Bitwise%20AND%20of%20Numbers%20Range)| Medium | O(n)| O(1)|❤️| -|[231. Power of Two](https://leetcode.com/problems/power-of-twor)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0231.%20Power%20of%20Two)| Easy | O(1)| O(1)|| -|[260. Single Number III](https://leetcode.com/problems/single-number-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0260.%20Single%20Number%20III)| Medium | O(n)| O(1)|❤️| -|[268. Missing Number](https://leetcode.com/problems/missing-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0268.%20Missing%20Number)| Easy | O(n)| O(1)|| -|[318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0318.%20Maximum%20Product%20of%20Word%20Lengths)| Medium | O(n)| O(1)|| -|[338. Counting Bits](https://leetcode.com/problems/counting-bits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0338.%20Counting%20Bits)| Medium | O(n)| O(n)|| -|[342. Power of Four](https://leetcode.com/problems/power-of-four)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0342.%20Power%20of%20Four)| Easy | O(n)| O(1)|| -|[371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0371.%20Sum%20of%20Two%20Integers)| Easy | O(n)| O(1)|| -|[389. Find the Difference](https://leetcode.com/problems/find-the-difference)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0389.%20Find%20the%20Difference)| Easy | O(n)| O(1)|| -|[393. UTF-8 Validation](https://leetcode.com/problems/utf-8-validation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0393.%20UTF-8%20Validation)| Medium | O(n)| O(1)|| -|[397. Integer Replacement](https://leetcode.com/problems/integer-replacement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0397.%20Integer%20Replacement)| Medium | O(n)| O(1)|| -|[401. Binary Watch](https://leetcode.com/problems/binary-watch)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0401.%20Binary%20Watch)| Easy | O(1)| O(1)|| -|[405. Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0405.%20Convert%20a%20Number%20to%20Hexadecimal)| Easy | O(n)| O(1)|| -|[421. Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0421.%20Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array)| Medium | O(n)| O(1)|❤️| -|[461. Hamming Distance](https://leetcode.com/problems/hamming-distance)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0461.%20Hamming%20Distance)| Easy | O(n)| O(1)|| -|[476. Number Complement](https://leetcode.com/problems/number-complement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0476.%20Number%20Complement)| Easy | O(n)| O(1)|| -|[477. Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0477.%20Total%20Hamming%20Distance)| Medium | O(n)| O(1)|| -|[693. Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0693.%20Binary%20Number%20with%20Alternating%20Bits)| Easy | O(n)| O(1)|❤️| -|[756. Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0756.%20Pyramid%20Transition%20Matrix)| Medium | O(n log n)| O(n)|| -|[762. Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0762.%20Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation)| Easy | O(n)| O(1)|| -|[784. Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0784.%20Letter%20Case%20Permutation)| Easy | O(n)| O(1)|| -|[898. Bitwise ORs of Subarrays](https://leetcode.com/problems/letter-case-permutation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0898.%20Bitwise%20ORs%20of%20Subarrays)| Medium | O(n)| O(1)|| +|[78. Subsets](https://leetcode.com/problems/subsets)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)| Medium | O(n^2)| O(n)|❤️| +|[136. Single Number](https://leetcode.com/problems/single-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)| Easy | O(n)| O(1)|| +|[137. Single Number II](https://leetcode.com/problems/single-number-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)| Medium | O(n)| O(1)|❤️| +|[169. Majority Element](https://leetcode.com/problems/majority-element)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)| Easy | O(n)| O(1)|❤️| +|[187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)| Medium | O(n)| O(1)|| +|[190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)| Easy | O(n)| O(1)|❤️| +|[191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)| Easy | O(n)| O(1)|| +|[201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)| Medium | O(n)| O(1)|❤️| +|[231. Power of Two](https://leetcode.com/problems/power-of-twor)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)| Easy | O(1)| O(1)|| +|[260. Single Number III](https://leetcode.com/problems/single-number-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)| Medium | O(n)| O(1)|❤️| +|[268. Missing Number](https://leetcode.com/problems/missing-number)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)| Easy | O(n)| O(1)|| +|[318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)| Medium | O(n)| O(1)|| +|[338. Counting Bits](https://leetcode.com/problems/counting-bits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)| Medium | O(n)| O(n)|| +|[342. Power of Four](https://leetcode.com/problems/power-of-four)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)| Easy | O(n)| O(1)|| +|[371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)| Easy | O(n)| O(1)|| +|[389. Find the Difference](https://leetcode.com/problems/find-the-difference)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)| Easy | O(n)| O(1)|| +|[393. UTF-8 Validation](https://leetcode.com/problems/utf-8-validation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)| Medium | O(n)| O(1)|| +|[397. Integer Replacement](https://leetcode.com/problems/integer-replacement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)| Medium | O(n)| O(1)|| +|[401. Binary Watch](https://leetcode.com/problems/binary-watch)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)| Easy | O(1)| O(1)|| +|[405. Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)| Easy | O(n)| O(1)|| +|[421. Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)| Medium | O(n)| O(1)|❤️| +|[461. Hamming Distance](https://leetcode.com/problems/hamming-distance)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)| Easy | O(n)| O(1)|| +|[476. Number Complement](https://leetcode.com/problems/number-complement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)| Easy | O(n)| O(1)|| +|[477. Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance)| Medium | O(n)| O(1)|| +|[693. Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)| Easy | O(n)| O(1)|❤️| +|[756. Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)| Medium | O(n log n)| O(n)|| +|[762. Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)| Easy | O(n)| O(1)|| +|[784. Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)| Easy | O(n)| O(1)|| +|[898. Bitwise ORs of Subarrays](https://leetcode.com/problems/letter-case-permutation)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)| Medium | O(n)| O(1)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Union Find -![](./Topics/Union_Find.png) +![](./topic/Union_Find.png) - 灵活使用并查集的思想，熟练掌握并查集的[模板](https://github.com/halfrost/LeetCode-Go/blob/master/template/UnionFind.go)，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。 - 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。 @@ -2193,24 +2180,24 @@ X & ~X = 0 | Title | Solution | Difficulty | Time | Space | 收藏 | | ----- | :--------: | :----------: | :----: | :-----: |:-----: | -|[128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0128.%20Longest%20Consecutive%20Sequence)| Hard | O(n)| O(n)|❤️| -|[130. Surrounded Regions](https://leetcode.com/problems/surrounded-regions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0130.%20Surrounded%20Regions)| Medium | O(m\*n)| O(m\*n)|| -|[200. Number of Islands](https://leetcode.com/problems/number-of-islands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0200.%20Number%20of%20Islands)| Medium | O(m\*n)| O(m\*n)|| -|[399. Evaluate Division](https://leetcode.com/problems/evaluate-division)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0399.%20Evaluate%20Division)| Medium | O(n)| O(n)|| -|[547. Friend Circles](https://leetcode.com/problems/friend-circles)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0547.%20Friend%20Circles)| Medium | O(n^2)| O(n)|| -|[684. Redundant Connection](https://leetcode.com/problems/redundant-connections)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0684.%20Redundant%20Connection)| Medium | O(n)| O(n)|| -|[685. Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0685.%20Redundant%20Connection%20II)| Hard | O(n)| O(n)|| -|[721. Accounts Merge](https://leetcode.com/problems/accounts-merge)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0721.%20Accounts%20Merge)| Medium | O(n)| O(n)|❤️| -|[765. Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0765.%20Couples%20Holding%20Hands)| Hard | O(n)| O(n)|❤️| -|[778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0778.%20Swim%20in%20Rising%20Water)| Hard | O(n^2)| O(n)|❤️| -|[803. Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0803.%20Bricks%20Falling%20When%20Hit)| Hard | O(n^2)| O(n)|❤️| -|[839. Similar String Groups](https://leetcode.com/problems/similar-string-groups)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0839.%20Similar%20String%20Groups)| Hard | O(n^2)| O(n)|| -|[924. Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0924.%20Minimize%20Malware%20Spread)| Hard | O(m\*n)| O(n)|| -|[928. Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0928.%20Minimize%20Malware%20Spread%20II)| Hard | O(m\*n)| O(n)|❤️| -|[947. Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column)| Medium | O(n)| O(n)|| -|[952. Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0952.%20Largest%20Component%20Size%20by%20Common%20Factor)| Hard | O(n)| O(n)|❤️| -|[959. Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0959.%20Regions%20Cut%20By%20Slashes)| Medium | O(n^2)| O(n^2)|❤️| -|[990. Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0990.%20Satisfiability%20of%20Equality%20Equations)| Medium | O(n)| O(n)|| +|[128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)| Hard | O(n)| O(n)|❤️| +|[130. Surrounded Regions](https://leetcode.com/problems/surrounded-regions)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)| Medium | O(m\*n)| O(m\*n)|| +|[200. Number of Islands](https://leetcode.com/problems/number-of-islands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)| Medium | O(m\*n)| O(m\*n)|| +|[399. Evaluate Division](https://leetcode.com/problems/evaluate-division)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)| Medium | O(n)| O(n)|| +|[547. Friend Circles](https://leetcode.com/problems/friend-circles)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Friend-Circles)| Medium | O(n^2)| O(n)|| +|[684. Redundant Connection](https://leetcode.com/problems/redundant-connections)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)| Medium | O(n)| O(n)|| +|[685. Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)| Hard | O(n)| O(n)|| +|[721. Accounts Merge](https://leetcode.com/problems/accounts-merge)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)| Medium | O(n)| O(n)|❤️| +|[765. Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)| Hard | O(n)| O(n)|❤️| +|[778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)| Hard | O(n^2)| O(n)|❤️| +|[803. Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)| Hard | O(n^2)| O(n)|❤️| +|[839. Similar String Groups](https://leetcode.com/problems/similar-string-groups)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)| Hard | O(n^2)| O(n)|| +|[924. Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread)| Hard | O(m\*n)| O(n)|| +|[928. Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)| Hard | O(m\*n)| O(n)|❤️| +|[947. Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)| Medium | O(n)| O(n)|| +|[952. Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)| Hard | O(n)| O(n)|❤️| +|[959. Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)| Medium | O(n^2)| O(n^2)|❤️| +|[990. Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)| Medium | O(n)| O(n)|| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| @@ -2219,7 +2206,7 @@ X & ~X = 0 ## Sliding Window -![](./Topics/Sliding_Window.png) +![](./topic/Sliding_Window.png) - 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。 @@ -2241,25 +2228,25 @@ X & ~X = 0 | Title | Solution | Difficulty | Time | Space | 收藏 | | ----- | :--------: | :----------: | :----: | :-----: |:-----: | -|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters)| Medium | O(n)| O(1)|❤️| -|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0076.%20Minimum%20Window%20Substring)| Hard | O(n)| O(n)|❤️| -|[239. Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0239.%20Sliding%20Window%20Maximum)| Hard | O(n * k)| O(n)|❤️| -|[424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0424.%20Longest%20Repeating%20Character%20Replacement)| Medium | O(n)| O(1) || -|[480. Sliding Window Median](https://leetcode.com/problems/sliding-window-median)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0480.%20Sliding%20Window%20Median)| Hard | O(n * log k)| O(k)|❤️| -|[567. Permutation in String](https://leetcode.com/problems/permutation-in-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0567.%20Permutation%20in%20String)| Medium | O(n)| O(1)|❤️| -|[978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0978.%20Longest%20Turbulent%20Subarray)| Medium | O(n)| O(1)|❤️| -|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0992.%20Subarrays%20with%20K%20Different%20Integers)| Hard | O(n)| O(n)|❤️| -|[995. Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0995.%20Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips)| Hard | O(n)| O(1)|❤️| -|[1004. Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1004.%20Max%20Consecutive%20Ones%20III)| Medium | O(n)| O(1) || -|[1040. Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1040.%20Moving%20Stones%20Until%20Consecutive%20II)| Medium | O(n log n)| O(1) |❤️| -|[1052. Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1052.%20Grumpy%20Bookstore%20Owner)| Medium | O(n log n)| O(1) || -|[1074. Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1074.%20Number%20of%20Submatrices%20That%20Sum%20to%20Target)| Hard | O(n^3)| O(n) |❤️| +|[3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)| Medium | O(n)| O(1)|❤️| +|[76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)| Hard | O(n)| O(n)|❤️| +|[239. Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)| Hard | O(n * k)| O(n)|❤️| +|[424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)| Medium | O(n)| O(1) || +|[480. Sliding Window Median](https://leetcode.com/problems/sliding-window-median)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)| Hard | O(n * log k)| O(k)|❤️| +|[567. Permutation in String](https://leetcode.com/problems/permutation-in-string)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)| Medium | O(n)| O(1)|❤️| +|[978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)| Medium | O(n)| O(1)|❤️| +|[992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)| Hard | O(n)| O(n)|❤️| +|[995. Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips)| Hard | O(n)| O(1)|❤️| +|[1004. Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)| Medium | O(n)| O(1) || +|[1040. Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)| Medium | O(n log n)| O(1) |❤️| +|[1052. Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)| Medium | O(n log n)| O(1) || +|[1074. Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target)| Hard | O(n^3)| O(n) |❤️| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Segment Tree -![](./Topics/Segment_Tree.png) +![](./topic/Segment_Tree.png) - 线段数的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。 - 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。 @@ -2289,21 +2276,21 @@ X & ~X = 0 | Title | Solution | Difficulty | Time | Space | 收藏 | | ----- | :--------: | :----------: | :----: | :-----: |:-----: | -|[218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0218.%20The%20Skyline%20Problem)| Hard | O(n log n)| O(n)|❤️| -|[307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0307.%20Range%20Sum%20Query%20-%20Mutable)| Hard | O(1)| O(n)|| -|[315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0315.%20Count%20of%20Smaller%20Numbers%20After%20Self)| Hard | O(n log n)| O(n)|| -|[327. Count of Range Sum](https://leetcode.com/problems/count-of-range-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0327.%20Count%20of%20Range%20Sum)| Hard | O(n log n)| O(n)|❤️| -|[493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0493.%20Reverse%20Pairs)| Hard | O(n log n)| O(n)|| -|[699. Falling Squares](https://leetcode.com/problems/falling-squares)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0699.%20Falling%20Squares)| Hard | O(n log n)| O(n)|❤️| -|[715. Range Module](https://leetcode.com/problems/range-module)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0715.%20Range%20Module)| Hard | O(log n)| O(n)|❤️| -|[732. My Calendar III](https://leetcode.com/problems/my-calendar-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0732.%20My%20Calendar%20III)| Hard | O(log n)| O(n)|❤️| -|[850. Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0850.%20Rectangle%20Area%20II)| Hard | O(n log n)| O(n)|❤️| -|[1157. Online Majority Element In Subarray](https://leetcode.com/problems/online-majority-element-in-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/1157.%20Online%20Majority%20Element%20In%20Subarray)| Hard | O(log n)| O(n)|❤️| +|[218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)| Hard | O(n log n)| O(n)|❤️| +|[307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable)| Hard | O(1)| O(n)|| +|[315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)| Hard | O(n log n)| O(n)|| +|[327. Count of Range Sum](https://leetcode.com/problems/count-of-range-sum)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)| Hard | O(n log n)| O(n)|❤️| +|[493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)| Hard | O(n log n)| O(n)|| +|[699. Falling Squares](https://leetcode.com/problems/falling-squares)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)| Hard | O(n log n)| O(n)|❤️| +|[715. Range Module](https://leetcode.com/problems/range-module)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)| Hard | O(log n)| O(n)|❤️| +|[732. My Calendar III](https://leetcode.com/problems/my-calendar-iii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)| Hard | O(log n)| O(n)|❤️| +|[850. Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II)| Hard | O(n log n)| O(n)|❤️| +|[1157. Online Majority Element In Subarray](https://leetcode.com/problems/online-majority-element-in-subarray)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)| Hard | O(log n)| O(n)|❤️| |-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------| ## Binary Indexed Tree -![](./Topics/Binary_Indexed_Tree.png) +![](./topic/Binary_Indexed_Tree.png) ---------------------------------------------------------------------------------------- diff --git a/gotest.sh b/gotest.sh index c9cbb90ca..26a68f384 100644 --- a/gotest.sh +++ b/gotest.sh @@ -3,7 +3,7 @@ set -e echo "" > coverage.txt -for d in $(go list ./Algorithms/... | grep -v vendor); do +for d in $(go list ./leetcode/... | grep -v vendor); do echo $d go test -coverprofile=profile.out -covermode=atomic $d if [ -f profile.out ]; then diff --git a/Algorithms/0001.Two-Sum/1. Two Sum.go b/leetcode/0001.Two-Sum/1. Two Sum.go similarity index 100% rename from Algorithms/0001.Two-Sum/1. Two Sum.go rename to leetcode/0001.Two-Sum/1. Two Sum.go diff --git a/Algorithms/0001.Two-Sum/1. Two Sum_test.go b/leetcode/0001.Two-Sum/1. Two Sum_test.go similarity index 100% rename from Algorithms/0001.Two-Sum/1. Two Sum_test.go rename to leetcode/0001.Two-Sum/1. Two Sum_test.go diff --git a/Algorithms/0001.Two-Sum/README.md b/leetcode/0001.Two-Sum/README.md similarity index 100% rename from Algorithms/0001.Two-Sum/README.md rename to leetcode/0001.Two-Sum/README.md diff --git a/Algorithms/0002.Add-Two-Numbers/2. Add Two Numbers.go b/leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go similarity index 100% rename from Algorithms/0002.Add-Two-Numbers/2. Add Two Numbers.go rename to leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go diff --git a/Algorithms/0002.Add-Two-Numbers/2. Add Two Numbers_test.go b/leetcode/0002.Add-Two-Numbers/2. Add Two Numbers_test.go similarity index 100% rename from Algorithms/0002.Add-Two-Numbers/2. Add Two Numbers_test.go rename to leetcode/0002.Add-Two-Numbers/2. Add Two Numbers_test.go diff --git a/Algorithms/0002.Add-Two-Numbers/README.md b/leetcode/0002.Add-Two-Numbers/README.md similarity index 100% rename from Algorithms/0002.Add-Two-Numbers/README.md rename to leetcode/0002.Add-Two-Numbers/README.md diff --git a/Algorithms/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go similarity index 100% rename from Algorithms/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go rename to leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go diff --git a/Algorithms/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go similarity index 100% rename from Algorithms/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go rename to leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go diff --git a/Algorithms/0003.Longest-Substring-Without-Repeating-Characters/README.md b/leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md similarity index 100% rename from Algorithms/0003.Longest-Substring-Without-Repeating-Characters/README.md rename to leetcode/0003.Longest-Substring-Without-Repeating-Characters/README.md diff --git a/Algorithms/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go b/leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go similarity index 100% rename from Algorithms/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go rename to leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go diff --git a/Algorithms/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go b/leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go similarity index 100% rename from Algorithms/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go rename to leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go diff --git a/Algorithms/0004.Median-of-Two-Sorted-Arrays/README.md b/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md similarity index 100% rename from Algorithms/0004.Median-of-Two-Sorted-Arrays/README.md rename to leetcode/0004.Median-of-Two-Sorted-Arrays/README.md diff --git a/Algorithms/0007.Reverse-Integer/7. Reverse Integer.go b/leetcode/0007.Reverse-Integer/7. Reverse Integer.go similarity index 100% rename from Algorithms/0007.Reverse-Integer/7. Reverse Integer.go rename to leetcode/0007.Reverse-Integer/7. Reverse Integer.go diff --git a/Algorithms/0007.Reverse-Integer/7. Reverse Integer_test.go b/leetcode/0007.Reverse-Integer/7. Reverse Integer_test.go similarity index 100% rename from Algorithms/0007.Reverse-Integer/7. Reverse Integer_test.go rename to leetcode/0007.Reverse-Integer/7. Reverse Integer_test.go diff --git a/Algorithms/0007.Reverse-Integer/README.md b/leetcode/0007.Reverse-Integer/README.md similarity index 100% rename from Algorithms/0007.Reverse-Integer/README.md rename to leetcode/0007.Reverse-Integer/README.md diff --git a/Algorithms/0011.Container-With-Most-Water/11. Container With Most Water.go b/leetcode/0011.Container-With-Most-Water/11. Container With Most Water.go similarity index 100% rename from Algorithms/0011.Container-With-Most-Water/11. Container With Most Water.go rename to leetcode/0011.Container-With-Most-Water/11. Container With Most Water.go diff --git a/Algorithms/0011.Container-With-Most-Water/11. Container With Most Water_test.go b/leetcode/0011.Container-With-Most-Water/11. Container With Most Water_test.go similarity index 100% rename from Algorithms/0011.Container-With-Most-Water/11. Container With Most Water_test.go rename to leetcode/0011.Container-With-Most-Water/11. Container With Most Water_test.go diff --git a/Algorithms/0011.Container-With-Most-Water/README.md b/leetcode/0011.Container-With-Most-Water/README.md similarity index 100% rename from Algorithms/0011.Container-With-Most-Water/README.md rename to leetcode/0011.Container-With-Most-Water/README.md diff --git a/Algorithms/0015.3Sum/15. 3Sum.go b/leetcode/0015.3Sum/15. 3Sum.go similarity index 100% rename from Algorithms/0015.3Sum/15. 3Sum.go rename to leetcode/0015.3Sum/15. 3Sum.go diff --git a/Algorithms/0015.3Sum/15. 3Sum_test.go b/leetcode/0015.3Sum/15. 3Sum_test.go similarity index 100% rename from Algorithms/0015.3Sum/15. 3Sum_test.go rename to leetcode/0015.3Sum/15. 3Sum_test.go diff --git a/Algorithms/0015.3Sum/README.md b/leetcode/0015.3Sum/README.md similarity index 100% rename from Algorithms/0015.3Sum/README.md rename to leetcode/0015.3Sum/README.md diff --git a/Algorithms/0016.3Sum-Closest/16. 3Sum Closest.go b/leetcode/0016.3Sum-Closest/16. 3Sum Closest.go similarity index 100% rename from Algorithms/0016.3Sum-Closest/16. 3Sum Closest.go rename to leetcode/0016.3Sum-Closest/16. 3Sum Closest.go diff --git a/Algorithms/0016.3Sum-Closest/16. 3Sum Closest_test.go b/leetcode/0016.3Sum-Closest/16. 3Sum Closest_test.go similarity index 100% rename from Algorithms/0016.3Sum-Closest/16. 3Sum Closest_test.go rename to leetcode/0016.3Sum-Closest/16. 3Sum Closest_test.go diff --git a/Algorithms/0016.3Sum-Closest/README.md b/leetcode/0016.3Sum-Closest/README.md similarity index 100% rename from Algorithms/0016.3Sum-Closest/README.md rename to leetcode/0016.3Sum-Closest/README.md diff --git a/Algorithms/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go b/leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go similarity index 100% rename from Algorithms/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go rename to leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go diff --git a/Algorithms/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go b/leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go similarity index 100% rename from Algorithms/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go rename to leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go diff --git a/Algorithms/0017.Letter-Combinations-of-a-Phone-Number/README.md b/leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md similarity index 100% rename from Algorithms/0017.Letter-Combinations-of-a-Phone-Number/README.md rename to leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md diff --git a/Algorithms/0018.4Sum/18. 4Sum.go b/leetcode/0018.4Sum/18. 4Sum.go similarity index 100% rename from Algorithms/0018.4Sum/18. 4Sum.go rename to leetcode/0018.4Sum/18. 4Sum.go diff --git a/Algorithms/0018.4Sum/18. 4Sum_test.go b/leetcode/0018.4Sum/18. 4Sum_test.go similarity index 100% rename from Algorithms/0018.4Sum/18. 4Sum_test.go rename to leetcode/0018.4Sum/18. 4Sum_test.go diff --git a/Algorithms/0018.4Sum/README.md b/leetcode/0018.4Sum/README.md similarity index 100% rename from Algorithms/0018.4Sum/README.md rename to leetcode/0018.4Sum/README.md diff --git a/Algorithms/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go b/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go similarity index 100% rename from Algorithms/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go rename to leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go diff --git a/Algorithms/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go b/leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go similarity index 100% rename from Algorithms/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go rename to leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go diff --git a/Algorithms/0019.Remove-Nth-Node-From-End-of-List/README.md b/leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md similarity index 100% rename from Algorithms/0019.Remove-Nth-Node-From-End-of-List/README.md rename to leetcode/0019.Remove-Nth-Node-From-End-of-List/README.md diff --git a/Algorithms/0020.Valid-Parentheses/20. Valid Parentheses.go b/leetcode/0020.Valid-Parentheses/20. Valid Parentheses.go similarity index 100% rename from Algorithms/0020.Valid-Parentheses/20. Valid Parentheses.go rename to leetcode/0020.Valid-Parentheses/20. Valid Parentheses.go diff --git a/Algorithms/0020.Valid-Parentheses/20. Valid Parentheses_test.go b/leetcode/0020.Valid-Parentheses/20. Valid Parentheses_test.go similarity index 100% rename from Algorithms/0020.Valid-Parentheses/20. Valid Parentheses_test.go rename to leetcode/0020.Valid-Parentheses/20. Valid Parentheses_test.go diff --git a/Algorithms/0020.Valid-Parentheses/README.md b/leetcode/0020.Valid-Parentheses/README.md similarity index 100% rename from Algorithms/0020.Valid-Parentheses/README.md rename to leetcode/0020.Valid-Parentheses/README.md diff --git a/Algorithms/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go b/leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go similarity index 100% rename from Algorithms/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go rename to leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go diff --git a/Algorithms/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go b/leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go similarity index 100% rename from Algorithms/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go rename to leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go diff --git a/Algorithms/0021.Merge-Two-Sorted-Lists/README.md b/leetcode/0021.Merge-Two-Sorted-Lists/README.md similarity index 100% rename from Algorithms/0021.Merge-Two-Sorted-Lists/README.md rename to leetcode/0021.Merge-Two-Sorted-Lists/README.md diff --git a/Algorithms/0022.Generate-Parentheses/22. Generate Parentheses.go b/leetcode/0022.Generate-Parentheses/22. Generate Parentheses.go similarity index 100% rename from Algorithms/0022.Generate-Parentheses/22. Generate Parentheses.go rename to leetcode/0022.Generate-Parentheses/22. Generate Parentheses.go diff --git a/Algorithms/0022.Generate-Parentheses/22. Generate Parentheses_test.go b/leetcode/0022.Generate-Parentheses/22. Generate Parentheses_test.go similarity index 100% rename from Algorithms/0022.Generate-Parentheses/22. Generate Parentheses_test.go rename to leetcode/0022.Generate-Parentheses/22. Generate Parentheses_test.go diff --git a/Algorithms/0022.Generate-Parentheses/README.md b/leetcode/0022.Generate-Parentheses/README.md similarity index 100% rename from Algorithms/0022.Generate-Parentheses/README.md rename to leetcode/0022.Generate-Parentheses/README.md diff --git a/Algorithms/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go b/leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go similarity index 100% rename from Algorithms/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go rename to leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go diff --git a/Algorithms/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go b/leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go similarity index 100% rename from Algorithms/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go rename to leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go diff --git a/Algorithms/0023.Merge-k-Sorted-Lists/README.md b/leetcode/0023.Merge-k-Sorted-Lists/README.md similarity index 100% rename from Algorithms/0023.Merge-k-Sorted-Lists/README.md rename to leetcode/0023.Merge-k-Sorted-Lists/README.md diff --git a/Algorithms/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go b/leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go similarity index 100% rename from Algorithms/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go rename to leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go diff --git a/Algorithms/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go b/leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go similarity index 100% rename from Algorithms/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go rename to leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go diff --git a/Algorithms/0024.Swap-Nodes-in-Pairs/README.md b/leetcode/0024.Swap-Nodes-in-Pairs/README.md similarity index 100% rename from Algorithms/0024.Swap-Nodes-in-Pairs/README.md rename to leetcode/0024.Swap-Nodes-in-Pairs/README.md diff --git a/Algorithms/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go b/leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go similarity index 100% rename from Algorithms/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go rename to leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go diff --git a/Algorithms/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go b/leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go similarity index 100% rename from Algorithms/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go rename to leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go diff --git a/Algorithms/0025.Reverse-Nodes-in-k-Group/README.md b/leetcode/0025.Reverse-Nodes-in-k-Group/README.md similarity index 100% rename from Algorithms/0025.Reverse-Nodes-in-k-Group/README.md rename to leetcode/0025.Reverse-Nodes-in-k-Group/README.md diff --git a/Algorithms/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go b/leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go similarity index 100% rename from Algorithms/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go rename to leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go diff --git a/Algorithms/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go b/leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go similarity index 100% rename from Algorithms/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go rename to leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go diff --git a/Algorithms/0026.Remove-Duplicates-from-Sorted-Array/README.md b/leetcode/0026.Remove-Duplicates-from-Sorted-Array/README.md similarity index 100% rename from Algorithms/0026.Remove-Duplicates-from-Sorted-Array/README.md rename to leetcode/0026.Remove-Duplicates-from-Sorted-Array/README.md diff --git a/Algorithms/0027.Remove-Element/27. Remove Element.go b/leetcode/0027.Remove-Element/27. Remove Element.go similarity index 100% rename from Algorithms/0027.Remove-Element/27. Remove Element.go rename to leetcode/0027.Remove-Element/27. Remove Element.go diff --git a/Algorithms/0027.Remove-Element/27. Remove Element_test.go b/leetcode/0027.Remove-Element/27. Remove Element_test.go similarity index 100% rename from Algorithms/0027.Remove-Element/27. Remove Element_test.go rename to leetcode/0027.Remove-Element/27. Remove Element_test.go diff --git a/Algorithms/0027.Remove-Element/README.md b/leetcode/0027.Remove-Element/README.md similarity index 100% rename from Algorithms/0027.Remove-Element/README.md rename to leetcode/0027.Remove-Element/README.md diff --git a/Algorithms/0028.Implement-strStr/28. Implement strStr().go b/leetcode/0028.Implement-strStr/28. Implement strStr().go similarity index 100% rename from Algorithms/0028.Implement-strStr/28. Implement strStr().go rename to leetcode/0028.Implement-strStr/28. Implement strStr().go diff --git a/Algorithms/0028.Implement-strStr/28. Implement strStr()_test.go b/leetcode/0028.Implement-strStr/28. Implement strStr()_test.go similarity index 100% rename from Algorithms/0028.Implement-strStr/28. Implement strStr()_test.go rename to leetcode/0028.Implement-strStr/28. Implement strStr()_test.go diff --git a/Algorithms/0028.Implement-strStr/README.md b/leetcode/0028.Implement-strStr/README.md similarity index 100% rename from Algorithms/0028.Implement-strStr/README.md rename to leetcode/0028.Implement-strStr/README.md diff --git a/Algorithms/0029.Divide-Two-Integers/29. Divide Two Integers.go b/leetcode/0029.Divide-Two-Integers/29. Divide Two Integers.go similarity index 100% rename from Algorithms/0029.Divide-Two-Integers/29. Divide Two Integers.go rename to leetcode/0029.Divide-Two-Integers/29. Divide Two Integers.go diff --git a/Algorithms/0029.Divide-Two-Integers/29. Divide Two Integers_test.go b/leetcode/0029.Divide-Two-Integers/29. Divide Two Integers_test.go similarity index 100% rename from Algorithms/0029.Divide-Two-Integers/29. Divide Two Integers_test.go rename to leetcode/0029.Divide-Two-Integers/29. Divide Two Integers_test.go diff --git a/Algorithms/0029.Divide-Two-Integers/README.md b/leetcode/0029.Divide-Two-Integers/README.md similarity index 100% rename from Algorithms/0029.Divide-Two-Integers/README.md rename to leetcode/0029.Divide-Two-Integers/README.md diff --git a/Algorithms/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go b/leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go similarity index 100% rename from Algorithms/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go rename to leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go diff --git a/Algorithms/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go b/leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go similarity index 100% rename from Algorithms/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go rename to leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go diff --git a/Algorithms/0030.Substring-with-Concatenation-of-All-Words/README.md b/leetcode/0030.Substring-with-Concatenation-of-All-Words/README.md similarity index 100% rename from Algorithms/0030.Substring-with-Concatenation-of-All-Words/README.md rename to leetcode/0030.Substring-with-Concatenation-of-All-Words/README.md diff --git a/Algorithms/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go b/leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go similarity index 100% rename from Algorithms/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go rename to leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go diff --git a/Algorithms/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go b/leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go similarity index 100% rename from Algorithms/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go rename to leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go diff --git a/Algorithms/0033.Search-in-Rotated-Sorted-Array/README.md b/leetcode/0033.Search-in-Rotated-Sorted-Array/README.md similarity index 100% rename from Algorithms/0033.Search-in-Rotated-Sorted-Array/README.md rename to leetcode/0033.Search-in-Rotated-Sorted-Array/README.md diff --git a/Algorithms/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go b/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go similarity index 100% rename from Algorithms/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go rename to leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go diff --git a/Algorithms/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go b/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go similarity index 100% rename from Algorithms/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go rename to leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go diff --git a/Algorithms/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md b/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md similarity index 100% rename from Algorithms/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md rename to leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md diff --git a/Algorithms/0035.Search-Insert-Position/35. Search Insert Position.go b/leetcode/0035.Search-Insert-Position/35. Search Insert Position.go similarity index 100% rename from Algorithms/0035.Search-Insert-Position/35. Search Insert Position.go rename to leetcode/0035.Search-Insert-Position/35. Search Insert Position.go diff --git a/Algorithms/0035.Search-Insert-Position/35. Search Insert Position_test.go b/leetcode/0035.Search-Insert-Position/35. Search Insert Position_test.go similarity index 100% rename from Algorithms/0035.Search-Insert-Position/35. Search Insert Position_test.go rename to leetcode/0035.Search-Insert-Position/35. Search Insert Position_test.go diff --git a/Algorithms/0035.Search-Insert-Position/README.md b/leetcode/0035.Search-Insert-Position/README.md similarity index 100% rename from Algorithms/0035.Search-Insert-Position/README.md rename to leetcode/0035.Search-Insert-Position/README.md diff --git a/Algorithms/0036.Valid-Sudoku/36. Valid Sudoku.go b/leetcode/0036.Valid-Sudoku/36. Valid Sudoku.go similarity index 100% rename from Algorithms/0036.Valid-Sudoku/36. Valid Sudoku.go rename to leetcode/0036.Valid-Sudoku/36. Valid Sudoku.go diff --git a/Algorithms/0036.Valid-Sudoku/36. Valid Sudoku_test.go b/leetcode/0036.Valid-Sudoku/36. Valid Sudoku_test.go similarity index 100% rename from Algorithms/0036.Valid-Sudoku/36. Valid Sudoku_test.go rename to leetcode/0036.Valid-Sudoku/36. Valid Sudoku_test.go diff --git a/Algorithms/0036.Valid-Sudoku/README.md b/leetcode/0036.Valid-Sudoku/README.md similarity index 100% rename from Algorithms/0036.Valid-Sudoku/README.md rename to leetcode/0036.Valid-Sudoku/README.md diff --git a/Algorithms/0037.Sudoku-Solver/37. Sudoku Solver.go b/leetcode/0037.Sudoku-Solver/37. Sudoku Solver.go similarity index 100% rename from Algorithms/0037.Sudoku-Solver/37. Sudoku Solver.go rename to leetcode/0037.Sudoku-Solver/37. Sudoku Solver.go diff --git a/Algorithms/0037.Sudoku-Solver/37. Sudoku Solver_test.go b/leetcode/0037.Sudoku-Solver/37. Sudoku Solver_test.go similarity index 100% rename from Algorithms/0037.Sudoku-Solver/37. Sudoku Solver_test.go rename to leetcode/0037.Sudoku-Solver/37. Sudoku Solver_test.go diff --git a/Algorithms/0037.Sudoku-Solver/README.md b/leetcode/0037.Sudoku-Solver/README.md similarity index 100% rename from Algorithms/0037.Sudoku-Solver/README.md rename to leetcode/0037.Sudoku-Solver/README.md diff --git a/Algorithms/0039.Combination-Sum/39. Combination Sum.go b/leetcode/0039.Combination-Sum/39. Combination Sum.go similarity index 100% rename from Algorithms/0039.Combination-Sum/39. Combination Sum.go rename to leetcode/0039.Combination-Sum/39. Combination Sum.go diff --git a/Algorithms/0039.Combination-Sum/39. Combination Sum_test.go b/leetcode/0039.Combination-Sum/39. Combination Sum_test.go similarity index 100% rename from Algorithms/0039.Combination-Sum/39. Combination Sum_test.go rename to leetcode/0039.Combination-Sum/39. Combination Sum_test.go diff --git a/Algorithms/0039.Combination-Sum/README.md b/leetcode/0039.Combination-Sum/README.md similarity index 100% rename from Algorithms/0039.Combination-Sum/README.md rename to leetcode/0039.Combination-Sum/README.md diff --git a/Algorithms/0040.Combination-Sum-II/40. Combination Sum II.go b/leetcode/0040.Combination-Sum-II/40. Combination Sum II.go similarity index 100% rename from Algorithms/0040.Combination-Sum-II/40. Combination Sum II.go rename to leetcode/0040.Combination-Sum-II/40. Combination Sum II.go diff --git a/Algorithms/0040.Combination-Sum-II/40. Combination Sum II_test.go b/leetcode/0040.Combination-Sum-II/40. Combination Sum II_test.go similarity index 100% rename from Algorithms/0040.Combination-Sum-II/40. Combination Sum II_test.go rename to leetcode/0040.Combination-Sum-II/40. Combination Sum II_test.go diff --git a/Algorithms/0040.Combination-Sum-II/README.md b/leetcode/0040.Combination-Sum-II/README.md similarity index 100% rename from Algorithms/0040.Combination-Sum-II/README.md rename to leetcode/0040.Combination-Sum-II/README.md diff --git a/Algorithms/0041.First-Missing-Positive/41. First Missing Positive.go b/leetcode/0041.First-Missing-Positive/41. First Missing Positive.go similarity index 100% rename from Algorithms/0041.First-Missing-Positive/41. First Missing Positive.go rename to leetcode/0041.First-Missing-Positive/41. First Missing Positive.go diff --git a/Algorithms/0041.First-Missing-Positive/41. First Missing Positive_test.go b/leetcode/0041.First-Missing-Positive/41. First Missing Positive_test.go similarity index 100% rename from Algorithms/0041.First-Missing-Positive/41. First Missing Positive_test.go rename to leetcode/0041.First-Missing-Positive/41. First Missing Positive_test.go diff --git a/Algorithms/0041.First-Missing-Positive/README.md b/leetcode/0041.First-Missing-Positive/README.md similarity index 100% rename from Algorithms/0041.First-Missing-Positive/README.md rename to leetcode/0041.First-Missing-Positive/README.md diff --git a/Algorithms/0042.Trapping-Rain-Water/42. Trapping Rain Water.go b/leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water.go similarity index 100% rename from Algorithms/0042.Trapping-Rain-Water/42. Trapping Rain Water.go rename to leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water.go diff --git a/Algorithms/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go b/leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go similarity index 100% rename from Algorithms/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go rename to leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go diff --git a/Algorithms/0042.Trapping-Rain-Water/README.md b/leetcode/0042.Trapping-Rain-Water/README.md similarity index 100% rename from Algorithms/0042.Trapping-Rain-Water/README.md rename to leetcode/0042.Trapping-Rain-Water/README.md diff --git a/Algorithms/0046.Permutations/46. Permutations.go b/leetcode/0046.Permutations/46. Permutations.go similarity index 100% rename from Algorithms/0046.Permutations/46. Permutations.go rename to leetcode/0046.Permutations/46. Permutations.go diff --git a/Algorithms/0046.Permutations/46. Permutations_test.go b/leetcode/0046.Permutations/46. Permutations_test.go similarity index 100% rename from Algorithms/0046.Permutations/46. Permutations_test.go rename to leetcode/0046.Permutations/46. Permutations_test.go diff --git a/Algorithms/0046.Permutations/README.md b/leetcode/0046.Permutations/README.md similarity index 100% rename from Algorithms/0046.Permutations/README.md rename to leetcode/0046.Permutations/README.md diff --git a/Algorithms/0047.Permutations-II/47. Permutations II.go b/leetcode/0047.Permutations-II/47. Permutations II.go similarity index 100% rename from Algorithms/0047.Permutations-II/47. Permutations II.go rename to leetcode/0047.Permutations-II/47. Permutations II.go diff --git a/Algorithms/0047.Permutations-II/47. Permutations II_test.go b/leetcode/0047.Permutations-II/47. Permutations II_test.go similarity index 100% rename from Algorithms/0047.Permutations-II/47. Permutations II_test.go rename to leetcode/0047.Permutations-II/47. Permutations II_test.go diff --git a/Algorithms/0047.Permutations-II/README.md b/leetcode/0047.Permutations-II/README.md similarity index 100% rename from Algorithms/0047.Permutations-II/README.md rename to leetcode/0047.Permutations-II/README.md diff --git a/Algorithms/0048.Rotate-Image/48. Rotate Image.go b/leetcode/0048.Rotate-Image/48. Rotate Image.go similarity index 100% rename from Algorithms/0048.Rotate-Image/48. Rotate Image.go rename to leetcode/0048.Rotate-Image/48. Rotate Image.go diff --git a/Algorithms/0048.Rotate-Image/48. Rotate Image_test.go b/leetcode/0048.Rotate-Image/48. Rotate Image_test.go similarity index 100% rename from Algorithms/0048.Rotate-Image/48. Rotate Image_test.go rename to leetcode/0048.Rotate-Image/48. Rotate Image_test.go diff --git a/Algorithms/0048.Rotate-Image/README.md b/leetcode/0048.Rotate-Image/README.md similarity index 100% rename from Algorithms/0048.Rotate-Image/README.md rename to leetcode/0048.Rotate-Image/README.md diff --git a/Algorithms/0049.Group-Anagrams/49. Group Anagrams.go b/leetcode/0049.Group-Anagrams/49. Group Anagrams.go similarity index 100% rename from Algorithms/0049.Group-Anagrams/49. Group Anagrams.go rename to leetcode/0049.Group-Anagrams/49. Group Anagrams.go diff --git a/Algorithms/0049.Group-Anagrams/49. Group Anagrams_test.go b/leetcode/0049.Group-Anagrams/49. Group Anagrams_test.go similarity index 100% rename from Algorithms/0049.Group-Anagrams/49. Group Anagrams_test.go rename to leetcode/0049.Group-Anagrams/49. Group Anagrams_test.go diff --git a/Algorithms/0049.Group-Anagrams/README.md b/leetcode/0049.Group-Anagrams/README.md similarity index 100% rename from Algorithms/0049.Group-Anagrams/README.md rename to leetcode/0049.Group-Anagrams/README.md diff --git a/Algorithms/0050.Powx-n/50. Pow(x, n).go b/leetcode/0050.Powx-n/50. Pow(x, n).go similarity index 100% rename from Algorithms/0050.Powx-n/50. Pow(x, n).go rename to leetcode/0050.Powx-n/50. Pow(x, n).go diff --git a/Algorithms/0050.Powx-n/50. Pow(x, n)_test.go b/leetcode/0050.Powx-n/50. Pow(x, n)_test.go similarity index 100% rename from Algorithms/0050.Powx-n/50. Pow(x, n)_test.go rename to leetcode/0050.Powx-n/50. Pow(x, n)_test.go diff --git a/Algorithms/0050.Powx-n/README.md b/leetcode/0050.Powx-n/README.md similarity index 100% rename from Algorithms/0050.Powx-n/README.md rename to leetcode/0050.Powx-n/README.md diff --git a/Algorithms/0051.N-Queens/51. N-Queens.go b/leetcode/0051.N-Queens/51. N-Queens.go similarity index 100% rename from Algorithms/0051.N-Queens/51. N-Queens.go rename to leetcode/0051.N-Queens/51. N-Queens.go diff --git a/Algorithms/0051.N-Queens/51. N-Queens_test.go b/leetcode/0051.N-Queens/51. N-Queens_test.go similarity index 100% rename from Algorithms/0051.N-Queens/51. N-Queens_test.go rename to leetcode/0051.N-Queens/51. N-Queens_test.go diff --git a/Algorithms/0051.N-Queens/README.md b/leetcode/0051.N-Queens/README.md similarity index 100% rename from Algorithms/0051.N-Queens/README.md rename to leetcode/0051.N-Queens/README.md diff --git a/Algorithms/0052.N-Queens-II/52. N-Queens II.go b/leetcode/0052.N-Queens-II/52. N-Queens II.go similarity index 100% rename from Algorithms/0052.N-Queens-II/52. N-Queens II.go rename to leetcode/0052.N-Queens-II/52. N-Queens II.go diff --git a/Algorithms/0052.N-Queens-II/52. N-Queens II_test.go b/leetcode/0052.N-Queens-II/52. N-Queens II_test.go similarity index 100% rename from Algorithms/0052.N-Queens-II/52. N-Queens II_test.go rename to leetcode/0052.N-Queens-II/52. N-Queens II_test.go diff --git a/Algorithms/0052.N-Queens-II/README.md b/leetcode/0052.N-Queens-II/README.md similarity index 100% rename from Algorithms/0052.N-Queens-II/README.md rename to leetcode/0052.N-Queens-II/README.md diff --git a/Algorithms/0053.Maximum-Subarray/53. Maximum Subarray.go b/leetcode/0053.Maximum-Subarray/53. Maximum Subarray.go similarity index 100% rename from Algorithms/0053.Maximum-Subarray/53. Maximum Subarray.go rename to leetcode/0053.Maximum-Subarray/53. Maximum Subarray.go diff --git a/Algorithms/0053.Maximum-Subarray/53. Maximum Subarray_test.go b/leetcode/0053.Maximum-Subarray/53. Maximum Subarray_test.go similarity index 100% rename from Algorithms/0053.Maximum-Subarray/53. Maximum Subarray_test.go rename to leetcode/0053.Maximum-Subarray/53. Maximum Subarray_test.go diff --git a/Algorithms/0053.Maximum-Subarray/README.md b/leetcode/0053.Maximum-Subarray/README.md similarity index 100% rename from Algorithms/0053.Maximum-Subarray/README.md rename to leetcode/0053.Maximum-Subarray/README.md diff --git a/Algorithms/0054.Spiral-Matrix/54. Spiral Matrix.go b/leetcode/0054.Spiral-Matrix/54. Spiral Matrix.go similarity index 100% rename from Algorithms/0054.Spiral-Matrix/54. Spiral Matrix.go rename to leetcode/0054.Spiral-Matrix/54. Spiral Matrix.go diff --git a/Algorithms/0054.Spiral-Matrix/54. Spiral Matrix_test.go b/leetcode/0054.Spiral-Matrix/54. Spiral Matrix_test.go similarity index 100% rename from Algorithms/0054.Spiral-Matrix/54. Spiral Matrix_test.go rename to leetcode/0054.Spiral-Matrix/54. Spiral Matrix_test.go diff --git a/Algorithms/0054.Spiral-Matrix/README.md b/leetcode/0054.Spiral-Matrix/README.md similarity index 100% rename from Algorithms/0054.Spiral-Matrix/README.md rename to leetcode/0054.Spiral-Matrix/README.md diff --git a/Algorithms/0055.Jump-Game/55. Jump Game.go b/leetcode/0055.Jump-Game/55. Jump Game.go similarity index 100% rename from Algorithms/0055.Jump-Game/55. Jump Game.go rename to leetcode/0055.Jump-Game/55. Jump Game.go diff --git a/Algorithms/0055.Jump-Game/55. Jump Game_test.go b/leetcode/0055.Jump-Game/55. Jump Game_test.go similarity index 100% rename from Algorithms/0055.Jump-Game/55. Jump Game_test.go rename to leetcode/0055.Jump-Game/55. Jump Game_test.go diff --git a/Algorithms/0055.Jump-Game/README.md b/leetcode/0055.Jump-Game/README.md similarity index 100% rename from Algorithms/0055.Jump-Game/README.md rename to leetcode/0055.Jump-Game/README.md diff --git a/Algorithms/0056.Merge-Intervals/56. Merge Intervals.go b/leetcode/0056.Merge-Intervals/56. Merge Intervals.go similarity index 100% rename from Algorithms/0056.Merge-Intervals/56. Merge Intervals.go rename to leetcode/0056.Merge-Intervals/56. Merge Intervals.go diff --git a/Algorithms/0056.Merge-Intervals/56. Merge Intervals_test.go b/leetcode/0056.Merge-Intervals/56. Merge Intervals_test.go similarity index 100% rename from Algorithms/0056.Merge-Intervals/56. Merge Intervals_test.go rename to leetcode/0056.Merge-Intervals/56. Merge Intervals_test.go diff --git a/Algorithms/0056.Merge-Intervals/README.md b/leetcode/0056.Merge-Intervals/README.md similarity index 100% rename from Algorithms/0056.Merge-Intervals/README.md rename to leetcode/0056.Merge-Intervals/README.md diff --git a/Algorithms/0057.Insert-Interval/57. Insert Interval.go b/leetcode/0057.Insert-Interval/57. Insert Interval.go similarity index 100% rename from Algorithms/0057.Insert-Interval/57. Insert Interval.go rename to leetcode/0057.Insert-Interval/57. Insert Interval.go diff --git a/Algorithms/0057.Insert-Interval/57. Insert Interval_test.go b/leetcode/0057.Insert-Interval/57. Insert Interval_test.go similarity index 100% rename from Algorithms/0057.Insert-Interval/57. Insert Interval_test.go rename to leetcode/0057.Insert-Interval/57. Insert Interval_test.go diff --git a/Algorithms/0057.Insert-Interval/README.md b/leetcode/0057.Insert-Interval/README.md similarity index 100% rename from Algorithms/0057.Insert-Interval/README.md rename to leetcode/0057.Insert-Interval/README.md diff --git a/Algorithms/0059.Spiral-Matrix-II/59. Spiral Matrix II.go b/leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II.go similarity index 100% rename from Algorithms/0059.Spiral-Matrix-II/59. Spiral Matrix II.go rename to leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II.go diff --git a/Algorithms/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go b/leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go similarity index 100% rename from Algorithms/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go rename to leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go diff --git a/Algorithms/0059.Spiral-Matrix-II/README.md b/leetcode/0059.Spiral-Matrix-II/README.md similarity index 100% rename from Algorithms/0059.Spiral-Matrix-II/README.md rename to leetcode/0059.Spiral-Matrix-II/README.md diff --git a/Algorithms/0060.Permutation-Sequence/60. Permutation Sequence.go b/leetcode/0060.Permutation-Sequence/60. Permutation Sequence.go similarity index 100% rename from Algorithms/0060.Permutation-Sequence/60. Permutation Sequence.go rename to leetcode/0060.Permutation-Sequence/60. Permutation Sequence.go diff --git a/Algorithms/0060.Permutation-Sequence/60. Permutation Sequence_test.go b/leetcode/0060.Permutation-Sequence/60. Permutation Sequence_test.go similarity index 100% rename from Algorithms/0060.Permutation-Sequence/60. Permutation Sequence_test.go rename to leetcode/0060.Permutation-Sequence/60. Permutation Sequence_test.go diff --git a/Algorithms/0060.Permutation-Sequence/README.md b/leetcode/0060.Permutation-Sequence/README.md similarity index 100% rename from Algorithms/0060.Permutation-Sequence/README.md rename to leetcode/0060.Permutation-Sequence/README.md diff --git a/Algorithms/0061.Rotate-List/61. Rotate List.go b/leetcode/0061.Rotate-List/61. Rotate List.go similarity index 100% rename from Algorithms/0061.Rotate-List/61. Rotate List.go rename to leetcode/0061.Rotate-List/61. Rotate List.go diff --git a/Algorithms/0061.Rotate-List/61. Rotate List_test.go b/leetcode/0061.Rotate-List/61. Rotate List_test.go similarity index 100% rename from Algorithms/0061.Rotate-List/61. Rotate List_test.go rename to leetcode/0061.Rotate-List/61. Rotate List_test.go diff --git a/Algorithms/0061.Rotate-List/README.md b/leetcode/0061.Rotate-List/README.md similarity index 100% rename from Algorithms/0061.Rotate-List/README.md rename to leetcode/0061.Rotate-List/README.md diff --git a/Algorithms/0062.Unique-Paths/62. Unique Paths.go b/leetcode/0062.Unique-Paths/62. Unique Paths.go similarity index 100% rename from Algorithms/0062.Unique-Paths/62. Unique Paths.go rename to leetcode/0062.Unique-Paths/62. Unique Paths.go diff --git a/Algorithms/0062.Unique-Paths/62. Unique Paths_test.go b/leetcode/0062.Unique-Paths/62. Unique Paths_test.go similarity index 100% rename from Algorithms/0062.Unique-Paths/62. Unique Paths_test.go rename to leetcode/0062.Unique-Paths/62. Unique Paths_test.go diff --git a/Algorithms/0062.Unique-Paths/README.md b/leetcode/0062.Unique-Paths/README.md similarity index 100% rename from Algorithms/0062.Unique-Paths/README.md rename to leetcode/0062.Unique-Paths/README.md diff --git a/Algorithms/0063.Unique-Paths-II/63. Unique Paths II.go b/leetcode/0063.Unique-Paths-II/63. Unique Paths II.go similarity index 100% rename from Algorithms/0063.Unique-Paths-II/63. Unique Paths II.go rename to leetcode/0063.Unique-Paths-II/63. Unique Paths II.go diff --git a/Algorithms/0063.Unique-Paths-II/63. Unique Paths II_test.go b/leetcode/0063.Unique-Paths-II/63. Unique Paths II_test.go similarity index 100% rename from Algorithms/0063.Unique-Paths-II/63. Unique Paths II_test.go rename to leetcode/0063.Unique-Paths-II/63. Unique Paths II_test.go diff --git a/Algorithms/0063.Unique-Paths-II/README.md b/leetcode/0063.Unique-Paths-II/README.md similarity index 100% rename from Algorithms/0063.Unique-Paths-II/README.md rename to leetcode/0063.Unique-Paths-II/README.md diff --git a/Algorithms/0064.Minimum-Path-Sum/64. Minimum Path Sum.go b/leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum.go similarity index 100% rename from Algorithms/0064.Minimum-Path-Sum/64. Minimum Path Sum.go rename to leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum.go diff --git a/Algorithms/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go b/leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go similarity index 100% rename from Algorithms/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go rename to leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go diff --git a/Algorithms/0064.Minimum-Path-Sum/README.md b/leetcode/0064.Minimum-Path-Sum/README.md similarity index 100% rename from Algorithms/0064.Minimum-Path-Sum/README.md rename to leetcode/0064.Minimum-Path-Sum/README.md diff --git a/Algorithms/0066.Plus-One/66. Plus One.go b/leetcode/0066.Plus-One/66. Plus One.go similarity index 100% rename from Algorithms/0066.Plus-One/66. Plus One.go rename to leetcode/0066.Plus-One/66. Plus One.go diff --git a/Algorithms/0066.Plus-One/66. Plus One_test.go b/leetcode/0066.Plus-One/66. Plus One_test.go similarity index 100% rename from Algorithms/0066.Plus-One/66. Plus One_test.go rename to leetcode/0066.Plus-One/66. Plus One_test.go diff --git a/Algorithms/0066.Plus-One/README.md b/leetcode/0066.Plus-One/README.md similarity index 100% rename from Algorithms/0066.Plus-One/README.md rename to leetcode/0066.Plus-One/README.md diff --git a/Algorithms/0069.Sqrtx/69. Sqrt(x).go b/leetcode/0069.Sqrtx/69. Sqrt(x).go similarity index 100% rename from Algorithms/0069.Sqrtx/69. Sqrt(x).go rename to leetcode/0069.Sqrtx/69. Sqrt(x).go diff --git a/Algorithms/0069.Sqrtx/69. Sqrt(x)_test.go b/leetcode/0069.Sqrtx/69. Sqrt(x)_test.go similarity index 100% rename from Algorithms/0069.Sqrtx/69. Sqrt(x)_test.go rename to leetcode/0069.Sqrtx/69. Sqrt(x)_test.go diff --git a/Algorithms/0069.Sqrtx/README.md b/leetcode/0069.Sqrtx/README.md similarity index 100% rename from Algorithms/0069.Sqrtx/README.md rename to leetcode/0069.Sqrtx/README.md diff --git a/Algorithms/0070.Climbing-Stairs/70. Climbing Stairs.go b/leetcode/0070.Climbing-Stairs/70. Climbing Stairs.go similarity index 100% rename from Algorithms/0070.Climbing-Stairs/70. Climbing Stairs.go rename to leetcode/0070.Climbing-Stairs/70. Climbing Stairs.go diff --git a/Algorithms/0070.Climbing-Stairs/70. Climbing Stairs_test.go b/leetcode/0070.Climbing-Stairs/70. Climbing Stairs_test.go similarity index 100% rename from Algorithms/0070.Climbing-Stairs/70. Climbing Stairs_test.go rename to leetcode/0070.Climbing-Stairs/70. Climbing Stairs_test.go diff --git a/Algorithms/0070.Climbing-Stairs/README.md b/leetcode/0070.Climbing-Stairs/README.md similarity index 100% rename from Algorithms/0070.Climbing-Stairs/README.md rename to leetcode/0070.Climbing-Stairs/README.md diff --git a/Algorithms/0071.Simplify-Path/71. Simplify Path.go b/leetcode/0071.Simplify-Path/71. Simplify Path.go similarity index 100% rename from Algorithms/0071.Simplify-Path/71. Simplify Path.go rename to leetcode/0071.Simplify-Path/71. Simplify Path.go diff --git a/Algorithms/0071.Simplify-Path/71. Simplify Path_test.go b/leetcode/0071.Simplify-Path/71. Simplify Path_test.go similarity index 100% rename from Algorithms/0071.Simplify-Path/71. Simplify Path_test.go rename to leetcode/0071.Simplify-Path/71. Simplify Path_test.go diff --git a/Algorithms/0071.Simplify-Path/README.md b/leetcode/0071.Simplify-Path/README.md similarity index 100% rename from Algorithms/0071.Simplify-Path/README.md rename to leetcode/0071.Simplify-Path/README.md diff --git a/Algorithms/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go b/leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go similarity index 100% rename from Algorithms/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go rename to leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go diff --git a/Algorithms/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go b/leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go similarity index 100% rename from Algorithms/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go rename to leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go diff --git a/Algorithms/0074.Search-a-2D-Matrix/README.md b/leetcode/0074.Search-a-2D-Matrix/README.md similarity index 100% rename from Algorithms/0074.Search-a-2D-Matrix/README.md rename to leetcode/0074.Search-a-2D-Matrix/README.md diff --git a/Algorithms/0075.Sort-Colors/75. Sort Colors.go b/leetcode/0075.Sort-Colors/75. Sort Colors.go similarity index 100% rename from Algorithms/0075.Sort-Colors/75. Sort Colors.go rename to leetcode/0075.Sort-Colors/75. Sort Colors.go diff --git a/Algorithms/0075.Sort-Colors/75. Sort Colors_test.go b/leetcode/0075.Sort-Colors/75. Sort Colors_test.go similarity index 100% rename from Algorithms/0075.Sort-Colors/75. Sort Colors_test.go rename to leetcode/0075.Sort-Colors/75. Sort Colors_test.go diff --git a/Algorithms/0075.Sort-Colors/README.md b/leetcode/0075.Sort-Colors/README.md similarity index 100% rename from Algorithms/0075.Sort-Colors/README.md rename to leetcode/0075.Sort-Colors/README.md diff --git a/Algorithms/0076.Minimum-Window-Substring/76. Minimum Window Substring.go b/leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go similarity index 100% rename from Algorithms/0076.Minimum-Window-Substring/76. Minimum Window Substring.go rename to leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go diff --git a/Algorithms/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go b/leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go similarity index 100% rename from Algorithms/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go rename to leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go diff --git a/Algorithms/0076.Minimum-Window-Substring/README.md b/leetcode/0076.Minimum-Window-Substring/README.md similarity index 100% rename from Algorithms/0076.Minimum-Window-Substring/README.md rename to leetcode/0076.Minimum-Window-Substring/README.md diff --git a/Algorithms/0077.Combinations/77. Combinations.go b/leetcode/0077.Combinations/77. Combinations.go similarity index 100% rename from Algorithms/0077.Combinations/77. Combinations.go rename to leetcode/0077.Combinations/77. Combinations.go diff --git a/Algorithms/0077.Combinations/77. Combinations_test.go b/leetcode/0077.Combinations/77. Combinations_test.go similarity index 100% rename from Algorithms/0077.Combinations/77. Combinations_test.go rename to leetcode/0077.Combinations/77. Combinations_test.go diff --git a/Algorithms/0077.Combinations/README.md b/leetcode/0077.Combinations/README.md similarity index 100% rename from Algorithms/0077.Combinations/README.md rename to leetcode/0077.Combinations/README.md diff --git a/Algorithms/0078.Subsets/78. Subsets.go b/leetcode/0078.Subsets/78. Subsets.go similarity index 100% rename from Algorithms/0078.Subsets/78. Subsets.go rename to leetcode/0078.Subsets/78. Subsets.go diff --git a/Algorithms/0078.Subsets/78. Subsets_test.go b/leetcode/0078.Subsets/78. Subsets_test.go similarity index 100% rename from Algorithms/0078.Subsets/78. Subsets_test.go rename to leetcode/0078.Subsets/78. Subsets_test.go diff --git a/Algorithms/0078.Subsets/README.md b/leetcode/0078.Subsets/README.md similarity index 100% rename from Algorithms/0078.Subsets/README.md rename to leetcode/0078.Subsets/README.md diff --git a/Algorithms/0079.Word-Search/79. Word Search.go b/leetcode/0079.Word-Search/79. Word Search.go similarity index 100% rename from Algorithms/0079.Word-Search/79. Word Search.go rename to leetcode/0079.Word-Search/79. Word Search.go diff --git a/Algorithms/0079.Word-Search/79. Word Search_test.go b/leetcode/0079.Word-Search/79. Word Search_test.go similarity index 100% rename from Algorithms/0079.Word-Search/79. Word Search_test.go rename to leetcode/0079.Word-Search/79. Word Search_test.go diff --git a/Algorithms/0079.Word-Search/README.md b/leetcode/0079.Word-Search/README.md similarity index 100% rename from Algorithms/0079.Word-Search/README.md rename to leetcode/0079.Word-Search/README.md diff --git a/Algorithms/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go similarity index 100% rename from Algorithms/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go rename to leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go diff --git a/Algorithms/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go similarity index 100% rename from Algorithms/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go rename to leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go diff --git a/Algorithms/0080.Remove-Duplicates-from-Sorted-Array-II/README.md b/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/README.md similarity index 100% rename from Algorithms/0080.Remove-Duplicates-from-Sorted-Array-II/README.md rename to leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/README.md diff --git a/Algorithms/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go b/leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go similarity index 100% rename from Algorithms/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go rename to leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go diff --git a/Algorithms/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go b/leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go similarity index 100% rename from Algorithms/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go rename to leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go diff --git a/Algorithms/0081.Search-in-Rotated-Sorted-Array-II/README.md b/leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md similarity index 100% rename from Algorithms/0081.Search-in-Rotated-Sorted-Array-II/README.md rename to leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md diff --git a/Algorithms/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go b/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go similarity index 100% rename from Algorithms/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go rename to leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go diff --git a/Algorithms/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go b/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go similarity index 100% rename from Algorithms/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go rename to leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go diff --git a/Algorithms/0082.Remove-Duplicates-from-Sorted-List-II/README.md b/leetcode/0082.Remove-Duplicates-from-Sorted-List-II/README.md similarity index 100% rename from Algorithms/0082.Remove-Duplicates-from-Sorted-List-II/README.md rename to leetcode/0082.Remove-Duplicates-from-Sorted-List-II/README.md diff --git a/Algorithms/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go b/leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go similarity index 100% rename from Algorithms/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go rename to leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go diff --git a/Algorithms/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go b/leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go similarity index 100% rename from Algorithms/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go rename to leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go diff --git a/Algorithms/0083.Remove-Duplicates-from-Sorted-List/README.md b/leetcode/0083.Remove-Duplicates-from-Sorted-List/README.md similarity index 100% rename from Algorithms/0083.Remove-Duplicates-from-Sorted-List/README.md rename to leetcode/0083.Remove-Duplicates-from-Sorted-List/README.md diff --git a/Algorithms/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go b/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go similarity index 100% rename from Algorithms/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go rename to leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go diff --git a/Algorithms/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go b/leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go similarity index 100% rename from Algorithms/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go rename to leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go diff --git a/Algorithms/0084.Largest-Rectangle-in-Histogram/README.md b/leetcode/0084.Largest-Rectangle-in-Histogram/README.md similarity index 100% rename from Algorithms/0084.Largest-Rectangle-in-Histogram/README.md rename to leetcode/0084.Largest-Rectangle-in-Histogram/README.md diff --git a/Algorithms/0086.Partition-List/86. Partition List.go b/leetcode/0086.Partition-List/86. Partition List.go similarity index 100% rename from Algorithms/0086.Partition-List/86. Partition List.go rename to leetcode/0086.Partition-List/86. Partition List.go diff --git a/Algorithms/0086.Partition-List/86. Partition List_test.go b/leetcode/0086.Partition-List/86. Partition List_test.go similarity index 100% rename from Algorithms/0086.Partition-List/86. Partition List_test.go rename to leetcode/0086.Partition-List/86. Partition List_test.go diff --git a/Algorithms/0086.Partition-List/README.md b/leetcode/0086.Partition-List/README.md similarity index 100% rename from Algorithms/0086.Partition-List/README.md rename to leetcode/0086.Partition-List/README.md diff --git a/Algorithms/0088.Merge-Sorted-Array/88. Merge Sorted Array.go b/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go similarity index 100% rename from Algorithms/0088.Merge-Sorted-Array/88. Merge Sorted Array.go rename to leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go diff --git a/Algorithms/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go b/leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go similarity index 100% rename from Algorithms/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go rename to leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go diff --git a/Algorithms/0088.Merge-Sorted-Array/README.md b/leetcode/0088.Merge-Sorted-Array/README.md similarity index 100% rename from Algorithms/0088.Merge-Sorted-Array/README.md rename to leetcode/0088.Merge-Sorted-Array/README.md diff --git a/Algorithms/0089.Gray-Code/89. Gray Code.go b/leetcode/0089.Gray-Code/89. Gray Code.go similarity index 100% rename from Algorithms/0089.Gray-Code/89. Gray Code.go rename to leetcode/0089.Gray-Code/89. Gray Code.go diff --git a/Algorithms/0089.Gray-Code/89. Gray Code_test.go b/leetcode/0089.Gray-Code/89. Gray Code_test.go similarity index 100% rename from Algorithms/0089.Gray-Code/89. Gray Code_test.go rename to leetcode/0089.Gray-Code/89. Gray Code_test.go diff --git a/Algorithms/0089.Gray-Code/README.md b/leetcode/0089.Gray-Code/README.md similarity index 100% rename from Algorithms/0089.Gray-Code/README.md rename to leetcode/0089.Gray-Code/README.md diff --git a/Algorithms/0090.Subsets-II/90. Subsets II.go b/leetcode/0090.Subsets-II/90. Subsets II.go similarity index 100% rename from Algorithms/0090.Subsets-II/90. Subsets II.go rename to leetcode/0090.Subsets-II/90. Subsets II.go diff --git a/Algorithms/0090.Subsets-II/90. Subsets II_test.go b/leetcode/0090.Subsets-II/90. Subsets II_test.go similarity index 100% rename from Algorithms/0090.Subsets-II/90. Subsets II_test.go rename to leetcode/0090.Subsets-II/90. Subsets II_test.go diff --git a/Algorithms/0090.Subsets-II/README.md b/leetcode/0090.Subsets-II/README.md similarity index 100% rename from Algorithms/0090.Subsets-II/README.md rename to leetcode/0090.Subsets-II/README.md diff --git a/Algorithms/0091.Decode-Ways/91. Decode Ways.go b/leetcode/0091.Decode-Ways/91. Decode Ways.go similarity index 100% rename from Algorithms/0091.Decode-Ways/91. Decode Ways.go rename to leetcode/0091.Decode-Ways/91. Decode Ways.go diff --git a/Algorithms/0091.Decode-Ways/91. Decode Ways_test.go b/leetcode/0091.Decode-Ways/91. Decode Ways_test.go similarity index 100% rename from Algorithms/0091.Decode-Ways/91. Decode Ways_test.go rename to leetcode/0091.Decode-Ways/91. Decode Ways_test.go diff --git a/Algorithms/0091.Decode-Ways/README.md b/leetcode/0091.Decode-Ways/README.md similarity index 100% rename from Algorithms/0091.Decode-Ways/README.md rename to leetcode/0091.Decode-Ways/README.md diff --git a/Algorithms/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go b/leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go similarity index 100% rename from Algorithms/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go rename to leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go diff --git a/Algorithms/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go b/leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go similarity index 100% rename from Algorithms/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go rename to leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go diff --git a/Algorithms/0092.Reverse-Linked-List-II/README.md b/leetcode/0092.Reverse-Linked-List-II/README.md similarity index 100% rename from Algorithms/0092.Reverse-Linked-List-II/README.md rename to leetcode/0092.Reverse-Linked-List-II/README.md diff --git a/Algorithms/0093.Restore-IP-Addresses/93. Restore IP Addresses.go b/leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses.go similarity index 100% rename from Algorithms/0093.Restore-IP-Addresses/93. Restore IP Addresses.go rename to leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses.go diff --git a/Algorithms/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go b/leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go similarity index 100% rename from Algorithms/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go rename to leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go diff --git a/Algorithms/0093.Restore-IP-Addresses/README.md b/leetcode/0093.Restore-IP-Addresses/README.md similarity index 100% rename from Algorithms/0093.Restore-IP-Addresses/README.md rename to leetcode/0093.Restore-IP-Addresses/README.md diff --git a/Algorithms/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go b/leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go similarity index 100% rename from Algorithms/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go rename to leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go diff --git a/Algorithms/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go b/leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go similarity index 100% rename from Algorithms/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go rename to leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go diff --git a/Algorithms/0094.Binary-Tree-Inorder-Traversal/README.md b/leetcode/0094.Binary-Tree-Inorder-Traversal/README.md similarity index 100% rename from Algorithms/0094.Binary-Tree-Inorder-Traversal/README.md rename to leetcode/0094.Binary-Tree-Inorder-Traversal/README.md diff --git a/Algorithms/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go b/leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go similarity index 100% rename from Algorithms/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go rename to leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go diff --git a/Algorithms/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go b/leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go similarity index 100% rename from Algorithms/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go rename to leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go diff --git a/Algorithms/0095.Unique-Binary-Search-Trees-II/README.md b/leetcode/0095.Unique-Binary-Search-Trees-II/README.md similarity index 100% rename from Algorithms/0095.Unique-Binary-Search-Trees-II/README.md rename to leetcode/0095.Unique-Binary-Search-Trees-II/README.md diff --git a/Algorithms/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go b/leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go similarity index 100% rename from Algorithms/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go rename to leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go diff --git a/Algorithms/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go b/leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go similarity index 100% rename from Algorithms/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go rename to leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go diff --git a/Algorithms/0096.Unique-Binary-Search-Trees/README.md b/leetcode/0096.Unique-Binary-Search-Trees/README.md similarity index 100% rename from Algorithms/0096.Unique-Binary-Search-Trees/README.md rename to leetcode/0096.Unique-Binary-Search-Trees/README.md diff --git a/Algorithms/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go b/leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go similarity index 100% rename from Algorithms/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go rename to leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go diff --git a/Algorithms/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go b/leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go similarity index 100% rename from Algorithms/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go rename to leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go diff --git a/Algorithms/0098.Validate-Binary-Search-Tree/README.md b/leetcode/0098.Validate-Binary-Search-Tree/README.md similarity index 100% rename from Algorithms/0098.Validate-Binary-Search-Tree/README.md rename to leetcode/0098.Validate-Binary-Search-Tree/README.md diff --git a/Algorithms/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go b/leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go similarity index 100% rename from Algorithms/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go rename to leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go diff --git a/Algorithms/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go b/leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go similarity index 100% rename from Algorithms/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go rename to leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go diff --git a/Algorithms/0099.Recover-Binary-Search-Tree/README.md b/leetcode/0099.Recover-Binary-Search-Tree/README.md similarity index 100% rename from Algorithms/0099.Recover-Binary-Search-Tree/README.md rename to leetcode/0099.Recover-Binary-Search-Tree/README.md diff --git a/Algorithms/0100.Same-Tree/100. Same Tree.go b/leetcode/0100.Same-Tree/100. Same Tree.go similarity index 100% rename from Algorithms/0100.Same-Tree/100. Same Tree.go rename to leetcode/0100.Same-Tree/100. Same Tree.go diff --git a/Algorithms/0100.Same-Tree/100. Same Tree_test.go b/leetcode/0100.Same-Tree/100. Same Tree_test.go similarity index 100% rename from Algorithms/0100.Same-Tree/100. Same Tree_test.go rename to leetcode/0100.Same-Tree/100. Same Tree_test.go diff --git a/Algorithms/0100.Same-Tree/README.md b/leetcode/0100.Same-Tree/README.md similarity index 100% rename from Algorithms/0100.Same-Tree/README.md rename to leetcode/0100.Same-Tree/README.md diff --git a/Algorithms/0101.Symmetric-Tree/101. Symmetric Tree.go b/leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go similarity index 100% rename from Algorithms/0101.Symmetric-Tree/101. Symmetric Tree.go rename to leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go diff --git a/Algorithms/0101.Symmetric-Tree/101. Symmetric Tree_test.go b/leetcode/0101.Symmetric-Tree/101. Symmetric Tree_test.go similarity index 100% rename from Algorithms/0101.Symmetric-Tree/101. Symmetric Tree_test.go rename to leetcode/0101.Symmetric-Tree/101. Symmetric Tree_test.go diff --git a/Algorithms/0101.Symmetric-Tree/README.md b/leetcode/0101.Symmetric-Tree/README.md similarity index 100% rename from Algorithms/0101.Symmetric-Tree/README.md rename to leetcode/0101.Symmetric-Tree/README.md diff --git a/Algorithms/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go b/leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go similarity index 100% rename from Algorithms/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go rename to leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go diff --git a/Algorithms/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go b/leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go similarity index 100% rename from Algorithms/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go rename to leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go diff --git a/Algorithms/0102.Binary-Tree-Level-Order-Traversal/README.md b/leetcode/0102.Binary-Tree-Level-Order-Traversal/README.md similarity index 100% rename from Algorithms/0102.Binary-Tree-Level-Order-Traversal/README.md rename to leetcode/0102.Binary-Tree-Level-Order-Traversal/README.md diff --git a/Algorithms/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go b/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go similarity index 100% rename from Algorithms/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go rename to leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go diff --git a/Algorithms/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go b/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go similarity index 100% rename from Algorithms/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go rename to leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go diff --git a/Algorithms/0103.Binary-Tree-Zigzag-Level-Order-Traversal/README.md b/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/README.md similarity index 100% rename from Algorithms/0103.Binary-Tree-Zigzag-Level-Order-Traversal/README.md rename to leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/README.md diff --git a/Algorithms/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go b/leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go similarity index 100% rename from Algorithms/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go rename to leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go diff --git a/Algorithms/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go b/leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go similarity index 100% rename from Algorithms/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go rename to leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go diff --git a/Algorithms/0104.Maximum-Depth-of-Binary-Tree/README.md b/leetcode/0104.Maximum-Depth-of-Binary-Tree/README.md similarity index 100% rename from Algorithms/0104.Maximum-Depth-of-Binary-Tree/README.md rename to leetcode/0104.Maximum-Depth-of-Binary-Tree/README.md diff --git a/Algorithms/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go similarity index 100% rename from Algorithms/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go rename to leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go diff --git a/Algorithms/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go similarity index 100% rename from Algorithms/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go rename to leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go diff --git a/Algorithms/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md similarity index 100% rename from Algorithms/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md rename to leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md diff --git a/Algorithms/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go similarity index 100% rename from Algorithms/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go rename to leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go diff --git a/Algorithms/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go similarity index 100% rename from Algorithms/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go rename to leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go diff --git a/Algorithms/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md similarity index 100% rename from Algorithms/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md rename to leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md diff --git a/Algorithms/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go b/leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go similarity index 100% rename from Algorithms/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go rename to leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go diff --git a/Algorithms/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go b/leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go similarity index 100% rename from Algorithms/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go rename to leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go diff --git a/Algorithms/0107.Binary-Tree-Level-Order-Traversal-II/README.md b/leetcode/0107.Binary-Tree-Level-Order-Traversal-II/README.md similarity index 100% rename from Algorithms/0107.Binary-Tree-Level-Order-Traversal-II/README.md rename to leetcode/0107.Binary-Tree-Level-Order-Traversal-II/README.md diff --git a/Algorithms/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go b/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go similarity index 100% rename from Algorithms/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go rename to leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go diff --git a/Algorithms/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go b/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go similarity index 100% rename from Algorithms/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go rename to leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go diff --git a/Algorithms/0108.Convert-Sorted-Array-to-Binary-Search-Tree/README.md b/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/README.md similarity index 100% rename from Algorithms/0108.Convert-Sorted-Array-to-Binary-Search-Tree/README.md rename to leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/README.md diff --git a/Algorithms/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go similarity index 100% rename from Algorithms/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go rename to leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go diff --git a/Algorithms/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go similarity index 100% rename from Algorithms/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go rename to leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go diff --git a/Algorithms/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md similarity index 100% rename from Algorithms/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md rename to leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md diff --git a/Algorithms/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go b/leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go similarity index 100% rename from Algorithms/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go rename to leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go diff --git a/Algorithms/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go b/leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go similarity index 100% rename from Algorithms/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go rename to leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go diff --git a/Algorithms/0110.Balanced-Binary-Tree/README.md b/leetcode/0110.Balanced-Binary-Tree/README.md similarity index 100% rename from Algorithms/0110.Balanced-Binary-Tree/README.md rename to leetcode/0110.Balanced-Binary-Tree/README.md diff --git a/Algorithms/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go b/leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go similarity index 100% rename from Algorithms/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go rename to leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go diff --git a/Algorithms/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go b/leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go similarity index 100% rename from Algorithms/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go rename to leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go diff --git a/Algorithms/0111.Minimum-Depth-of-Binary-Tree/README.md b/leetcode/0111.Minimum-Depth-of-Binary-Tree/README.md similarity index 100% rename from Algorithms/0111.Minimum-Depth-of-Binary-Tree/README.md rename to leetcode/0111.Minimum-Depth-of-Binary-Tree/README.md diff --git a/Algorithms/0112.Path-Sum/112. Path Sum.go b/leetcode/0112.Path-Sum/112. Path Sum.go similarity index 100% rename from Algorithms/0112.Path-Sum/112. Path Sum.go rename to leetcode/0112.Path-Sum/112. Path Sum.go diff --git a/Algorithms/0112.Path-Sum/112. Path Sum_test.go b/leetcode/0112.Path-Sum/112. Path Sum_test.go similarity index 100% rename from Algorithms/0112.Path-Sum/112. Path Sum_test.go rename to leetcode/0112.Path-Sum/112. Path Sum_test.go diff --git a/Algorithms/0112.Path-Sum/README.md b/leetcode/0112.Path-Sum/README.md similarity index 100% rename from Algorithms/0112.Path-Sum/README.md rename to leetcode/0112.Path-Sum/README.md diff --git a/Algorithms/0113.Path-Sum-II/113. Path Sum II.go b/leetcode/0113.Path-Sum-II/113. Path Sum II.go similarity index 100% rename from Algorithms/0113.Path-Sum-II/113. Path Sum II.go rename to leetcode/0113.Path-Sum-II/113. Path Sum II.go diff --git a/Algorithms/0113.Path-Sum-II/113. Path Sum II_test.go b/leetcode/0113.Path-Sum-II/113. Path Sum II_test.go similarity index 100% rename from Algorithms/0113.Path-Sum-II/113. Path Sum II_test.go rename to leetcode/0113.Path-Sum-II/113. Path Sum II_test.go diff --git a/Algorithms/0113.Path-Sum-II/README.md b/leetcode/0113.Path-Sum-II/README.md similarity index 100% rename from Algorithms/0113.Path-Sum-II/README.md rename to leetcode/0113.Path-Sum-II/README.md diff --git a/Algorithms/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go similarity index 100% rename from Algorithms/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go rename to leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go diff --git a/Algorithms/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go similarity index 100% rename from Algorithms/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go rename to leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go diff --git a/Algorithms/0114.Flatten-Binary-Tree-to-Linked-List/README.md b/leetcode/0114.Flatten-Binary-Tree-to-Linked-List/README.md similarity index 100% rename from Algorithms/0114.Flatten-Binary-Tree-to-Linked-List/README.md rename to leetcode/0114.Flatten-Binary-Tree-to-Linked-List/README.md diff --git a/Algorithms/0120.Triangle/120. Triangle.go b/leetcode/0120.Triangle/120. Triangle.go similarity index 100% rename from Algorithms/0120.Triangle/120. Triangle.go rename to leetcode/0120.Triangle/120. Triangle.go diff --git a/Algorithms/0120.Triangle/120. Triangle_test.go b/leetcode/0120.Triangle/120. Triangle_test.go similarity index 100% rename from Algorithms/0120.Triangle/120. Triangle_test.go rename to leetcode/0120.Triangle/120. Triangle_test.go diff --git a/Algorithms/0120.Triangle/README.md b/leetcode/0120.Triangle/README.md similarity index 100% rename from Algorithms/0120.Triangle/README.md rename to leetcode/0120.Triangle/README.md diff --git a/Algorithms/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go b/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go similarity index 100% rename from Algorithms/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go rename to leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go diff --git a/Algorithms/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go b/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go similarity index 100% rename from Algorithms/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go rename to leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go diff --git a/Algorithms/0121.Best-Time-to-Buy-and-Sell-Stock/README.md b/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/README.md similarity index 100% rename from Algorithms/0121.Best-Time-to-Buy-and-Sell-Stock/README.md rename to leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/README.md diff --git a/Algorithms/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go b/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go similarity index 100% rename from Algorithms/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go rename to leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go diff --git a/Algorithms/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go b/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go similarity index 100% rename from Algorithms/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go rename to leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go diff --git a/Algorithms/0122.Best-Time-to-Buy-and-Sell-Stock-II/README.md b/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/README.md similarity index 100% rename from Algorithms/0122.Best-Time-to-Buy-and-Sell-Stock-II/README.md rename to leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/README.md diff --git a/Algorithms/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go b/leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go similarity index 100% rename from Algorithms/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go rename to leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go diff --git a/Algorithms/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go b/leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go similarity index 100% rename from Algorithms/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go rename to leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go diff --git a/Algorithms/0124.Binary-Tree-Maximum-Path-Sum/README.md b/leetcode/0124.Binary-Tree-Maximum-Path-Sum/README.md similarity index 100% rename from Algorithms/0124.Binary-Tree-Maximum-Path-Sum/README.md rename to leetcode/0124.Binary-Tree-Maximum-Path-Sum/README.md diff --git a/Algorithms/0125.Valid-Palindrome/125. Valid Palindrome.go b/leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go similarity index 100% rename from Algorithms/0125.Valid-Palindrome/125. Valid Palindrome.go rename to leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go diff --git a/Algorithms/0125.Valid-Palindrome/125. Valid Palindrome_test.go b/leetcode/0125.Valid-Palindrome/125. Valid Palindrome_test.go similarity index 100% rename from Algorithms/0125.Valid-Palindrome/125. Valid Palindrome_test.go rename to leetcode/0125.Valid-Palindrome/125. Valid Palindrome_test.go diff --git a/Algorithms/0125.Valid-Palindrome/README.md b/leetcode/0125.Valid-Palindrome/README.md similarity index 100% rename from Algorithms/0125.Valid-Palindrome/README.md rename to leetcode/0125.Valid-Palindrome/README.md diff --git a/Algorithms/0126.Word-Ladder-II/126. Word Ladder II.go b/leetcode/0126.Word-Ladder-II/126. Word Ladder II.go similarity index 100% rename from Algorithms/0126.Word-Ladder-II/126. Word Ladder II.go rename to leetcode/0126.Word-Ladder-II/126. Word Ladder II.go diff --git a/Algorithms/0126.Word-Ladder-II/126. Word Ladder II_test.go b/leetcode/0126.Word-Ladder-II/126. Word Ladder II_test.go similarity index 100% rename from Algorithms/0126.Word-Ladder-II/126. Word Ladder II_test.go rename to leetcode/0126.Word-Ladder-II/126. Word Ladder II_test.go diff --git a/Algorithms/0126.Word-Ladder-II/README.md b/leetcode/0126.Word-Ladder-II/README.md similarity index 100% rename from Algorithms/0126.Word-Ladder-II/README.md rename to leetcode/0126.Word-Ladder-II/README.md diff --git a/Algorithms/0127.Word-Ladder/127. Word Ladder.go b/leetcode/0127.Word-Ladder/127. Word Ladder.go similarity index 100% rename from Algorithms/0127.Word-Ladder/127. Word Ladder.go rename to leetcode/0127.Word-Ladder/127. Word Ladder.go diff --git a/Algorithms/0127.Word-Ladder/127. Word Ladder_test.go b/leetcode/0127.Word-Ladder/127. Word Ladder_test.go similarity index 100% rename from Algorithms/0127.Word-Ladder/127. Word Ladder_test.go rename to leetcode/0127.Word-Ladder/127. Word Ladder_test.go diff --git a/Algorithms/0127.Word-Ladder/README.md b/leetcode/0127.Word-Ladder/README.md similarity index 100% rename from Algorithms/0127.Word-Ladder/README.md rename to leetcode/0127.Word-Ladder/README.md diff --git a/Algorithms/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go b/leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go similarity index 100% rename from Algorithms/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go rename to leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go diff --git a/Algorithms/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go b/leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go similarity index 100% rename from Algorithms/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go rename to leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go diff --git a/Algorithms/0128.Longest-Consecutive-Sequence/README.md b/leetcode/0128.Longest-Consecutive-Sequence/README.md similarity index 100% rename from Algorithms/0128.Longest-Consecutive-Sequence/README.md rename to leetcode/0128.Longest-Consecutive-Sequence/README.md diff --git a/Algorithms/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go b/leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go similarity index 100% rename from Algorithms/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go rename to leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go diff --git a/Algorithms/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go b/leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go similarity index 100% rename from Algorithms/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go rename to leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go diff --git a/Algorithms/0129.Sum-Root-to-Leaf-Numbers/README.md b/leetcode/0129.Sum-Root-to-Leaf-Numbers/README.md similarity index 100% rename from Algorithms/0129.Sum-Root-to-Leaf-Numbers/README.md rename to leetcode/0129.Sum-Root-to-Leaf-Numbers/README.md diff --git a/Algorithms/0130.Surrounded-Regions/130. Surrounded Regions.go b/leetcode/0130.Surrounded-Regions/130. Surrounded Regions.go similarity index 100% rename from Algorithms/0130.Surrounded-Regions/130. Surrounded Regions.go rename to leetcode/0130.Surrounded-Regions/130. Surrounded Regions.go diff --git a/Algorithms/0130.Surrounded-Regions/130. Surrounded Regions_test.go b/leetcode/0130.Surrounded-Regions/130. Surrounded Regions_test.go similarity index 100% rename from Algorithms/0130.Surrounded-Regions/130. Surrounded Regions_test.go rename to leetcode/0130.Surrounded-Regions/130. Surrounded Regions_test.go diff --git a/Algorithms/0130.Surrounded-Regions/README.md b/leetcode/0130.Surrounded-Regions/README.md similarity index 100% rename from Algorithms/0130.Surrounded-Regions/README.md rename to leetcode/0130.Surrounded-Regions/README.md diff --git a/Algorithms/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go b/leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go similarity index 100% rename from Algorithms/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go rename to leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go diff --git a/Algorithms/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go b/leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go similarity index 100% rename from Algorithms/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go rename to leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go diff --git a/Algorithms/0131.Palindrome-Partitioning/README.md b/leetcode/0131.Palindrome-Partitioning/README.md similarity index 100% rename from Algorithms/0131.Palindrome-Partitioning/README.md rename to leetcode/0131.Palindrome-Partitioning/README.md diff --git a/Algorithms/0136.Single-Number/136. Single Number.go b/leetcode/0136.Single-Number/136. Single Number.go similarity index 100% rename from Algorithms/0136.Single-Number/136. Single Number.go rename to leetcode/0136.Single-Number/136. Single Number.go diff --git a/Algorithms/0136.Single-Number/136. Single Number_test.go b/leetcode/0136.Single-Number/136. Single Number_test.go similarity index 100% rename from Algorithms/0136.Single-Number/136. Single Number_test.go rename to leetcode/0136.Single-Number/136. Single Number_test.go diff --git a/Algorithms/0136.Single-Number/README.md b/leetcode/0136.Single-Number/README.md similarity index 100% rename from Algorithms/0136.Single-Number/README.md rename to leetcode/0136.Single-Number/README.md diff --git a/Algorithms/0137.Single-Number-II/137. Single Number II.go b/leetcode/0137.Single-Number-II/137. Single Number II.go similarity index 100% rename from Algorithms/0137.Single-Number-II/137. Single Number II.go rename to leetcode/0137.Single-Number-II/137. Single Number II.go diff --git a/Algorithms/0137.Single-Number-II/137. Single Number II_test.go b/leetcode/0137.Single-Number-II/137. Single Number II_test.go similarity index 100% rename from Algorithms/0137.Single-Number-II/137. Single Number II_test.go rename to leetcode/0137.Single-Number-II/137. Single Number II_test.go diff --git a/Algorithms/0137.Single-Number-II/README.md b/leetcode/0137.Single-Number-II/README.md similarity index 100% rename from Algorithms/0137.Single-Number-II/README.md rename to leetcode/0137.Single-Number-II/README.md diff --git a/Algorithms/0141.Linked-List-Cycle/141. Linked List Cycle.go b/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go similarity index 100% rename from Algorithms/0141.Linked-List-Cycle/141. Linked List Cycle.go rename to leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go diff --git a/Algorithms/0141.Linked-List-Cycle/141. Linked List Cycle_test.go b/leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go similarity index 100% rename from Algorithms/0141.Linked-List-Cycle/141. Linked List Cycle_test.go rename to leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go diff --git a/Algorithms/0141.Linked-List-Cycle/README.md b/leetcode/0141.Linked-List-Cycle/README.md similarity index 100% rename from Algorithms/0141.Linked-List-Cycle/README.md rename to leetcode/0141.Linked-List-Cycle/README.md diff --git a/Algorithms/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go b/leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go similarity index 100% rename from Algorithms/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go rename to leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go diff --git a/Algorithms/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go b/leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go similarity index 100% rename from Algorithms/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go rename to leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go diff --git a/Algorithms/0142.Linked-List-Cycle-II/README.md b/leetcode/0142.Linked-List-Cycle-II/README.md similarity index 100% rename from Algorithms/0142.Linked-List-Cycle-II/README.md rename to leetcode/0142.Linked-List-Cycle-II/README.md diff --git a/Algorithms/0143.Reorder-List/143. Reorder List.go b/leetcode/0143.Reorder-List/143. Reorder List.go similarity index 100% rename from Algorithms/0143.Reorder-List/143. Reorder List.go rename to leetcode/0143.Reorder-List/143. Reorder List.go diff --git a/Algorithms/0143.Reorder-List/143. Reorder List_test.go b/leetcode/0143.Reorder-List/143. Reorder List_test.go similarity index 100% rename from Algorithms/0143.Reorder-List/143. Reorder List_test.go rename to leetcode/0143.Reorder-List/143. Reorder List_test.go diff --git a/Algorithms/0143.Reorder-List/README.md b/leetcode/0143.Reorder-List/README.md similarity index 76% rename from Algorithms/0143.Reorder-List/README.md rename to leetcode/0143.Reorder-List/README.md index 8c1046f7d..4df8c7ff4 100644 --- a/Algorithms/0143.Reorder-List/README.md +++ b/leetcode/0143.Reorder-List/README.md @@ -31,4 +31,4 @@ Given 1->2->3->4->5, reorder it to 1->5->2->4->3. 更好的做法是结合之前几道题的操作：链表逆序，找中间结点。 -先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0092.%20Reverse%20Linked%20List%20II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。 \ No newline at end of file +先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。 \ No newline at end of file diff --git a/Algorithms/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go b/leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go similarity index 100% rename from Algorithms/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go rename to leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go diff --git a/Algorithms/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go b/leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go similarity index 100% rename from Algorithms/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go rename to leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go diff --git a/Algorithms/0144.Binary-Tree-Preorder-Traversal/README.md b/leetcode/0144.Binary-Tree-Preorder-Traversal/README.md similarity index 100% rename from Algorithms/0144.Binary-Tree-Preorder-Traversal/README.md rename to leetcode/0144.Binary-Tree-Preorder-Traversal/README.md diff --git a/Algorithms/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go b/leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go similarity index 100% rename from Algorithms/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go rename to leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go diff --git a/Algorithms/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go b/leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go similarity index 100% rename from Algorithms/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go rename to leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go diff --git a/Algorithms/0145.Binary-Tree-Postorder-Traversal/README.md b/leetcode/0145.Binary-Tree-Postorder-Traversal/README.md similarity index 100% rename from Algorithms/0145.Binary-Tree-Postorder-Traversal/README.md rename to leetcode/0145.Binary-Tree-Postorder-Traversal/README.md diff --git a/Algorithms/0147.Insertion-Sort-List/147. Insertion Sort List.go b/leetcode/0147.Insertion-Sort-List/147. Insertion Sort List.go similarity index 100% rename from Algorithms/0147.Insertion-Sort-List/147. Insertion Sort List.go rename to leetcode/0147.Insertion-Sort-List/147. Insertion Sort List.go diff --git a/Algorithms/0147.Insertion-Sort-List/147. Insertion Sort List_test.go b/leetcode/0147.Insertion-Sort-List/147. Insertion Sort List_test.go similarity index 100% rename from Algorithms/0147.Insertion-Sort-List/147. Insertion Sort List_test.go rename to leetcode/0147.Insertion-Sort-List/147. Insertion Sort List_test.go diff --git a/Algorithms/0147.Insertion-Sort-List/README.md b/leetcode/0147.Insertion-Sort-List/README.md similarity index 100% rename from Algorithms/0147.Insertion-Sort-List/README.md rename to leetcode/0147.Insertion-Sort-List/README.md diff --git a/Algorithms/0148.Sort-List/148. Sort List.go b/leetcode/0148.Sort-List/148. Sort List.go similarity index 100% rename from Algorithms/0148.Sort-List/148. Sort List.go rename to leetcode/0148.Sort-List/148. Sort List.go diff --git a/Algorithms/0148.Sort-List/148. Sort List_test.go b/leetcode/0148.Sort-List/148. Sort List_test.go similarity index 100% rename from Algorithms/0148.Sort-List/148. Sort List_test.go rename to leetcode/0148.Sort-List/148. Sort List_test.go diff --git a/Algorithms/0148.Sort-List/README.md b/leetcode/0148.Sort-List/README.md similarity index 100% rename from Algorithms/0148.Sort-List/README.md rename to leetcode/0148.Sort-List/README.md diff --git a/Algorithms/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go b/leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go similarity index 100% rename from Algorithms/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go rename to leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go diff --git a/Algorithms/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go b/leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go similarity index 100% rename from Algorithms/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go rename to leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go diff --git a/Algorithms/0150.Evaluate-Reverse-Polish-Notation/README.md b/leetcode/0150.Evaluate-Reverse-Polish-Notation/README.md similarity index 100% rename from Algorithms/0150.Evaluate-Reverse-Polish-Notation/README.md rename to leetcode/0150.Evaluate-Reverse-Polish-Notation/README.md diff --git a/Algorithms/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go b/leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go similarity index 100% rename from Algorithms/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go rename to leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go diff --git a/Algorithms/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go b/leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go similarity index 100% rename from Algorithms/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go rename to leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go diff --git a/Algorithms/0151.Reverse-Words-in-a-String/README.md b/leetcode/0151.Reverse-Words-in-a-String/README.md similarity index 100% rename from Algorithms/0151.Reverse-Words-in-a-String/README.md rename to leetcode/0151.Reverse-Words-in-a-String/README.md diff --git a/Algorithms/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go b/leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go similarity index 100% rename from Algorithms/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go rename to leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go diff --git a/Algorithms/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go b/leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go similarity index 100% rename from Algorithms/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go rename to leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go diff --git a/Algorithms/0152.Maximum-Product-Subarray/README.md b/leetcode/0152.Maximum-Product-Subarray/README.md similarity index 100% rename from Algorithms/0152.Maximum-Product-Subarray/README.md rename to leetcode/0152.Maximum-Product-Subarray/README.md diff --git a/Algorithms/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go b/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go similarity index 100% rename from Algorithms/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go rename to leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go diff --git a/Algorithms/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go b/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go similarity index 100% rename from Algorithms/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go rename to leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go diff --git a/Algorithms/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md b/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md similarity index 100% rename from Algorithms/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md rename to leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md diff --git a/Algorithms/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go b/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go similarity index 100% rename from Algorithms/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go rename to leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go diff --git a/Algorithms/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go b/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go similarity index 100% rename from Algorithms/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go rename to leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go diff --git a/Algorithms/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md b/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md similarity index 100% rename from Algorithms/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md rename to leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md diff --git a/Algorithms/0155.Min-Stack/155. Min Stack.go b/leetcode/0155.Min-Stack/155. Min Stack.go similarity index 100% rename from Algorithms/0155.Min-Stack/155. Min Stack.go rename to leetcode/0155.Min-Stack/155. Min Stack.go diff --git a/Algorithms/0155.Min-Stack/155. Min Stack_test.go b/leetcode/0155.Min-Stack/155. Min Stack_test.go similarity index 100% rename from Algorithms/0155.Min-Stack/155. Min Stack_test.go rename to leetcode/0155.Min-Stack/155. Min Stack_test.go diff --git a/Algorithms/0155.Min-Stack/README.md b/leetcode/0155.Min-Stack/README.md similarity index 100% rename from Algorithms/0155.Min-Stack/README.md rename to leetcode/0155.Min-Stack/README.md diff --git a/Algorithms/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go b/leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go similarity index 100% rename from Algorithms/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go rename to leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go diff --git a/Algorithms/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go b/leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go similarity index 100% rename from Algorithms/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go rename to leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go diff --git a/Algorithms/0160.Intersection-of-Two-Linked-Lists/README.md b/leetcode/0160.Intersection-of-Two-Linked-Lists/README.md similarity index 100% rename from Algorithms/0160.Intersection-of-Two-Linked-Lists/README.md rename to leetcode/0160.Intersection-of-Two-Linked-Lists/README.md diff --git a/Algorithms/0162.Find-Peak-Element/162. Find Peak Element.go b/leetcode/0162.Find-Peak-Element/162. Find Peak Element.go similarity index 100% rename from Algorithms/0162.Find-Peak-Element/162. Find Peak Element.go rename to leetcode/0162.Find-Peak-Element/162. Find Peak Element.go diff --git a/Algorithms/0162.Find-Peak-Element/162. Find Peak Element_test.go b/leetcode/0162.Find-Peak-Element/162. Find Peak Element_test.go similarity index 100% rename from Algorithms/0162.Find-Peak-Element/162. Find Peak Element_test.go rename to leetcode/0162.Find-Peak-Element/162. Find Peak Element_test.go diff --git a/Algorithms/0162.Find-Peak-Element/README.md b/leetcode/0162.Find-Peak-Element/README.md similarity index 100% rename from Algorithms/0162.Find-Peak-Element/README.md rename to leetcode/0162.Find-Peak-Element/README.md diff --git a/Algorithms/0164.Maximum-Gap/164. Maximum Gap.go b/leetcode/0164.Maximum-Gap/164. Maximum Gap.go similarity index 100% rename from Algorithms/0164.Maximum-Gap/164. Maximum Gap.go rename to leetcode/0164.Maximum-Gap/164. Maximum Gap.go diff --git a/Algorithms/0164.Maximum-Gap/164. Maximum Gap_test.go b/leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go similarity index 100% rename from Algorithms/0164.Maximum-Gap/164. Maximum Gap_test.go rename to leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go diff --git a/Algorithms/0164.Maximum-Gap/README.md b/leetcode/0164.Maximum-Gap/README.md similarity index 100% rename from Algorithms/0164.Maximum-Gap/README.md rename to leetcode/0164.Maximum-Gap/README.md diff --git a/Algorithms/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go b/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go similarity index 100% rename from Algorithms/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go rename to leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go diff --git a/Algorithms/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go b/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go similarity index 100% rename from Algorithms/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go rename to leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go diff --git a/Algorithms/0167.Two-Sum-II---Input-array-is-sorted/README.md b/leetcode/0167.Two-Sum-II---Input-array-is-sorted/README.md similarity index 100% rename from Algorithms/0167.Two-Sum-II---Input-array-is-sorted/README.md rename to leetcode/0167.Two-Sum-II---Input-array-is-sorted/README.md diff --git a/Algorithms/0169.Majority-Element/169. Majority Element.go b/leetcode/0169.Majority-Element/169. Majority Element.go similarity index 100% rename from Algorithms/0169.Majority-Element/169. Majority Element.go rename to leetcode/0169.Majority-Element/169. Majority Element.go diff --git a/Algorithms/0169.Majority-Element/169. Majority Element_test.go b/leetcode/0169.Majority-Element/169. Majority Element_test.go similarity index 100% rename from Algorithms/0169.Majority-Element/169. Majority Element_test.go rename to leetcode/0169.Majority-Element/169. Majority Element_test.go diff --git a/Algorithms/0169.Majority-Element/README.md b/leetcode/0169.Majority-Element/README.md similarity index 100% rename from Algorithms/0169.Majority-Element/README.md rename to leetcode/0169.Majority-Element/README.md diff --git a/Algorithms/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go b/leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go similarity index 100% rename from Algorithms/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go rename to leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go diff --git a/Algorithms/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go b/leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go similarity index 100% rename from Algorithms/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go rename to leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go diff --git a/Algorithms/0172.Factorial-Trailing-Zeroes/README.md b/leetcode/0172.Factorial-Trailing-Zeroes/README.md similarity index 100% rename from Algorithms/0172.Factorial-Trailing-Zeroes/README.md rename to leetcode/0172.Factorial-Trailing-Zeroes/README.md diff --git a/Algorithms/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go b/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go similarity index 100% rename from Algorithms/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go rename to leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go diff --git a/Algorithms/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go b/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go similarity index 100% rename from Algorithms/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go rename to leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go diff --git a/Algorithms/0173.Binary-Search-Tree-Iterator/README.md b/leetcode/0173.Binary-Search-Tree-Iterator/README.md similarity index 100% rename from Algorithms/0173.Binary-Search-Tree-Iterator/README.md rename to leetcode/0173.Binary-Search-Tree-Iterator/README.md diff --git a/Algorithms/0174.Dungeon-Game/174. Dungeon Game.go b/leetcode/0174.Dungeon-Game/174. Dungeon Game.go similarity index 100% rename from Algorithms/0174.Dungeon-Game/174. Dungeon Game.go rename to leetcode/0174.Dungeon-Game/174. Dungeon Game.go diff --git a/Algorithms/0174.Dungeon-Game/174. Dungeon Game_test.go b/leetcode/0174.Dungeon-Game/174. Dungeon Game_test.go similarity index 100% rename from Algorithms/0174.Dungeon-Game/174. Dungeon Game_test.go rename to leetcode/0174.Dungeon-Game/174. Dungeon Game_test.go diff --git a/Algorithms/0174.Dungeon-Game/README.md b/leetcode/0174.Dungeon-Game/README.md similarity index 100% rename from Algorithms/0174.Dungeon-Game/README.md rename to leetcode/0174.Dungeon-Game/README.md diff --git a/Algorithms/0179.Largest-Number/179. Largest Number.go b/leetcode/0179.Largest-Number/179. Largest Number.go similarity index 100% rename from Algorithms/0179.Largest-Number/179. Largest Number.go rename to leetcode/0179.Largest-Number/179. Largest Number.go diff --git a/Algorithms/0179.Largest-Number/179. Largest Number_test.go b/leetcode/0179.Largest-Number/179. Largest Number_test.go similarity index 100% rename from Algorithms/0179.Largest-Number/179. Largest Number_test.go rename to leetcode/0179.Largest-Number/179. Largest Number_test.go diff --git a/Algorithms/0179.Largest-Number/README.md b/leetcode/0179.Largest-Number/README.md similarity index 100% rename from Algorithms/0179.Largest-Number/README.md rename to leetcode/0179.Largest-Number/README.md diff --git a/Algorithms/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go b/leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go similarity index 100% rename from Algorithms/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go rename to leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go diff --git a/Algorithms/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go b/leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go similarity index 100% rename from Algorithms/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go rename to leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go diff --git a/Algorithms/0187.Repeated-DNA-Sequences/README.md b/leetcode/0187.Repeated-DNA-Sequences/README.md similarity index 100% rename from Algorithms/0187.Repeated-DNA-Sequences/README.md rename to leetcode/0187.Repeated-DNA-Sequences/README.md diff --git a/Algorithms/0190.Reverse-Bits/190. Reverse Bits.go b/leetcode/0190.Reverse-Bits/190. Reverse Bits.go similarity index 100% rename from Algorithms/0190.Reverse-Bits/190. Reverse Bits.go rename to leetcode/0190.Reverse-Bits/190. Reverse Bits.go diff --git a/Algorithms/0190.Reverse-Bits/190. Reverse Bits_test.go b/leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go similarity index 100% rename from Algorithms/0190.Reverse-Bits/190. Reverse Bits_test.go rename to leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go diff --git a/Algorithms/0190.Reverse-Bits/README.md b/leetcode/0190.Reverse-Bits/README.md similarity index 100% rename from Algorithms/0190.Reverse-Bits/README.md rename to leetcode/0190.Reverse-Bits/README.md diff --git a/Algorithms/0191.Number-of-1-Bits/191. Number of 1 Bits.go b/leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits.go similarity index 100% rename from Algorithms/0191.Number-of-1-Bits/191. Number of 1 Bits.go rename to leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits.go diff --git a/Algorithms/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go b/leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go similarity index 100% rename from Algorithms/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go rename to leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go diff --git a/Algorithms/0191.Number-of-1-Bits/README.md b/leetcode/0191.Number-of-1-Bits/README.md similarity index 100% rename from Algorithms/0191.Number-of-1-Bits/README.md rename to leetcode/0191.Number-of-1-Bits/README.md diff --git a/Algorithms/0198.House-Robber/198. House Robber.go b/leetcode/0198.House-Robber/198. House Robber.go similarity index 100% rename from Algorithms/0198.House-Robber/198. House Robber.go rename to leetcode/0198.House-Robber/198. House Robber.go diff --git a/Algorithms/0198.House-Robber/198. House Robber_test.go b/leetcode/0198.House-Robber/198. House Robber_test.go similarity index 100% rename from Algorithms/0198.House-Robber/198. House Robber_test.go rename to leetcode/0198.House-Robber/198. House Robber_test.go diff --git a/Algorithms/0198.House-Robber/README.md b/leetcode/0198.House-Robber/README.md similarity index 100% rename from Algorithms/0198.House-Robber/README.md rename to leetcode/0198.House-Robber/README.md diff --git a/Algorithms/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go b/leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go similarity index 100% rename from Algorithms/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go rename to leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go diff --git a/Algorithms/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go b/leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go similarity index 100% rename from Algorithms/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go rename to leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go diff --git a/Algorithms/0199.Binary-Tree-Right-Side-View/README.md b/leetcode/0199.Binary-Tree-Right-Side-View/README.md similarity index 100% rename from Algorithms/0199.Binary-Tree-Right-Side-View/README.md rename to leetcode/0199.Binary-Tree-Right-Side-View/README.md diff --git a/Algorithms/0200.Number-of-Islands/200. Number of Islands.go b/leetcode/0200.Number-of-Islands/200. Number of Islands.go similarity index 100% rename from Algorithms/0200.Number-of-Islands/200. Number of Islands.go rename to leetcode/0200.Number-of-Islands/200. Number of Islands.go diff --git a/Algorithms/0200.Number-of-Islands/200. Number of Islands_test.go b/leetcode/0200.Number-of-Islands/200. Number of Islands_test.go similarity index 100% rename from Algorithms/0200.Number-of-Islands/200. Number of Islands_test.go rename to leetcode/0200.Number-of-Islands/200. Number of Islands_test.go diff --git a/Algorithms/0200.Number-of-Islands/README.md b/leetcode/0200.Number-of-Islands/README.md similarity index 100% rename from Algorithms/0200.Number-of-Islands/README.md rename to leetcode/0200.Number-of-Islands/README.md diff --git a/Algorithms/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go b/leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go similarity index 100% rename from Algorithms/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go rename to leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go diff --git a/Algorithms/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go b/leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go similarity index 100% rename from Algorithms/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go rename to leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go diff --git a/Algorithms/0201.Bitwise-AND-of-Numbers-Range/README.md b/leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md similarity index 100% rename from Algorithms/0201.Bitwise-AND-of-Numbers-Range/README.md rename to leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md diff --git a/Algorithms/0202.Happy-Number/202. Happy Number.go b/leetcode/0202.Happy-Number/202. Happy Number.go similarity index 100% rename from Algorithms/0202.Happy-Number/202. Happy Number.go rename to leetcode/0202.Happy-Number/202. Happy Number.go diff --git a/Algorithms/0202.Happy-Number/202. Happy Number_test.go b/leetcode/0202.Happy-Number/202. Happy Number_test.go similarity index 100% rename from Algorithms/0202.Happy-Number/202. Happy Number_test.go rename to leetcode/0202.Happy-Number/202. Happy Number_test.go diff --git a/Algorithms/0202.Happy-Number/README.md b/leetcode/0202.Happy-Number/README.md similarity index 100% rename from Algorithms/0202.Happy-Number/README.md rename to leetcode/0202.Happy-Number/README.md diff --git a/Algorithms/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go b/leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go similarity index 100% rename from Algorithms/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go rename to leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go diff --git a/Algorithms/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go b/leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go similarity index 100% rename from Algorithms/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go rename to leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go diff --git a/Algorithms/0203.Remove-Linked-List-Elements/README.md b/leetcode/0203.Remove-Linked-List-Elements/README.md similarity index 100% rename from Algorithms/0203.Remove-Linked-List-Elements/README.md rename to leetcode/0203.Remove-Linked-List-Elements/README.md diff --git a/Algorithms/0204.Count-Primes/204. Count Primes.go b/leetcode/0204.Count-Primes/204. Count Primes.go similarity index 100% rename from Algorithms/0204.Count-Primes/204. Count Primes.go rename to leetcode/0204.Count-Primes/204. Count Primes.go diff --git a/Algorithms/0204.Count-Primes/204. Count Primes_test.go b/leetcode/0204.Count-Primes/204. Count Primes_test.go similarity index 100% rename from Algorithms/0204.Count-Primes/204. Count Primes_test.go rename to leetcode/0204.Count-Primes/204. Count Primes_test.go diff --git a/Algorithms/0204.Count-Primes/README.md b/leetcode/0204.Count-Primes/README.md similarity index 100% rename from Algorithms/0204.Count-Primes/README.md rename to leetcode/0204.Count-Primes/README.md diff --git a/Algorithms/0205.Isomorphic-Strings/205. Isomorphic Strings.go b/leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings.go similarity index 100% rename from Algorithms/0205.Isomorphic-Strings/205. Isomorphic Strings.go rename to leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings.go diff --git a/Algorithms/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go b/leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go similarity index 100% rename from Algorithms/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go rename to leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go diff --git a/Algorithms/0205.Isomorphic-Strings/README.md b/leetcode/0205.Isomorphic-Strings/README.md similarity index 100% rename from Algorithms/0205.Isomorphic-Strings/README.md rename to leetcode/0205.Isomorphic-Strings/README.md diff --git a/Algorithms/0206.Reverse-Linked-List/206. Reverse Linked List.go b/leetcode/0206.Reverse-Linked-List/206. Reverse Linked List.go similarity index 100% rename from Algorithms/0206.Reverse-Linked-List/206. Reverse Linked List.go rename to leetcode/0206.Reverse-Linked-List/206. Reverse Linked List.go diff --git a/Algorithms/0206.Reverse-Linked-List/206. Reverse Linked List_test.go b/leetcode/0206.Reverse-Linked-List/206. Reverse Linked List_test.go similarity index 100% rename from Algorithms/0206.Reverse-Linked-List/206. Reverse Linked List_test.go rename to leetcode/0206.Reverse-Linked-List/206. Reverse Linked List_test.go diff --git a/Algorithms/0206.Reverse-Linked-List/README.md b/leetcode/0206.Reverse-Linked-List/README.md similarity index 100% rename from Algorithms/0206.Reverse-Linked-List/README.md rename to leetcode/0206.Reverse-Linked-List/README.md diff --git a/Algorithms/0207.Course-Schedule/207. Course Schedule.go b/leetcode/0207.Course-Schedule/207. Course Schedule.go similarity index 100% rename from Algorithms/0207.Course-Schedule/207. Course Schedule.go rename to leetcode/0207.Course-Schedule/207. Course Schedule.go diff --git a/Algorithms/0207.Course-Schedule/207. Course Schedule_test.go b/leetcode/0207.Course-Schedule/207. Course Schedule_test.go similarity index 100% rename from Algorithms/0207.Course-Schedule/207. Course Schedule_test.go rename to leetcode/0207.Course-Schedule/207. Course Schedule_test.go diff --git a/Algorithms/0207.Course-Schedule/README.md b/leetcode/0207.Course-Schedule/README.md similarity index 100% rename from Algorithms/0207.Course-Schedule/README.md rename to leetcode/0207.Course-Schedule/README.md diff --git a/Algorithms/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go b/leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go similarity index 100% rename from Algorithms/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go rename to leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go diff --git a/Algorithms/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go b/leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go similarity index 100% rename from Algorithms/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go rename to leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go diff --git a/Algorithms/0208.Implement-Trie-Prefix-Tree/README.md b/leetcode/0208.Implement-Trie-Prefix-Tree/README.md similarity index 100% rename from Algorithms/0208.Implement-Trie-Prefix-Tree/README.md rename to leetcode/0208.Implement-Trie-Prefix-Tree/README.md diff --git a/Algorithms/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go b/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go similarity index 100% rename from Algorithms/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go rename to leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go diff --git a/Algorithms/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go b/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go similarity index 100% rename from Algorithms/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go rename to leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go diff --git a/Algorithms/0209.Minimum-Size-Subarray-Sum/README.md b/leetcode/0209.Minimum-Size-Subarray-Sum/README.md similarity index 100% rename from Algorithms/0209.Minimum-Size-Subarray-Sum/README.md rename to leetcode/0209.Minimum-Size-Subarray-Sum/README.md diff --git a/Algorithms/0210.Course-Schedule-II/210. Course Schedule II.go b/leetcode/0210.Course-Schedule-II/210. Course Schedule II.go similarity index 100% rename from Algorithms/0210.Course-Schedule-II/210. Course Schedule II.go rename to leetcode/0210.Course-Schedule-II/210. Course Schedule II.go diff --git a/Algorithms/0210.Course-Schedule-II/210. Course Schedule II_test.go b/leetcode/0210.Course-Schedule-II/210. Course Schedule II_test.go similarity index 100% rename from Algorithms/0210.Course-Schedule-II/210. Course Schedule II_test.go rename to leetcode/0210.Course-Schedule-II/210. Course Schedule II_test.go diff --git a/Algorithms/0210.Course-Schedule-II/README.md b/leetcode/0210.Course-Schedule-II/README.md similarity index 100% rename from Algorithms/0210.Course-Schedule-II/README.md rename to leetcode/0210.Course-Schedule-II/README.md diff --git a/Algorithms/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go b/leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go similarity index 100% rename from Algorithms/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go rename to leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design.go diff --git a/Algorithms/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go b/leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go similarity index 100% rename from Algorithms/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go rename to leetcode/0211.Add-and-Search-Word---Data-structure-design/211. Add and Search Word - Data structure design_test.go diff --git a/Algorithms/0211.Add-and-Search-Word---Data-structure-design/README.md b/leetcode/0211.Add-and-Search-Word---Data-structure-design/README.md similarity index 100% rename from Algorithms/0211.Add-and-Search-Word---Data-structure-design/README.md rename to leetcode/0211.Add-and-Search-Word---Data-structure-design/README.md diff --git a/Algorithms/0212.Word-Search-II/212. Word Search II.go b/leetcode/0212.Word-Search-II/212. Word Search II.go similarity index 100% rename from Algorithms/0212.Word-Search-II/212. Word Search II.go rename to leetcode/0212.Word-Search-II/212. Word Search II.go diff --git a/Algorithms/0212.Word-Search-II/212. Word Search II_test.go b/leetcode/0212.Word-Search-II/212. Word Search II_test.go similarity index 100% rename from Algorithms/0212.Word-Search-II/212. Word Search II_test.go rename to leetcode/0212.Word-Search-II/212. Word Search II_test.go diff --git a/Algorithms/0212.Word-Search-II/README.md b/leetcode/0212.Word-Search-II/README.md similarity index 100% rename from Algorithms/0212.Word-Search-II/README.md rename to leetcode/0212.Word-Search-II/README.md diff --git a/Algorithms/0213.House-Robber-II/213. House Robber II.go b/leetcode/0213.House-Robber-II/213. House Robber II.go similarity index 100% rename from Algorithms/0213.House-Robber-II/213. House Robber II.go rename to leetcode/0213.House-Robber-II/213. House Robber II.go diff --git a/Algorithms/0213.House-Robber-II/213. House Robber II_test.go b/leetcode/0213.House-Robber-II/213. House Robber II_test.go similarity index 100% rename from Algorithms/0213.House-Robber-II/213. House Robber II_test.go rename to leetcode/0213.House-Robber-II/213. House Robber II_test.go diff --git a/Algorithms/0213.House-Robber-II/README.md b/leetcode/0213.House-Robber-II/README.md similarity index 100% rename from Algorithms/0213.House-Robber-II/README.md rename to leetcode/0213.House-Robber-II/README.md diff --git a/Algorithms/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go b/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go similarity index 100% rename from Algorithms/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go rename to leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go diff --git a/Algorithms/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go b/leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go similarity index 100% rename from Algorithms/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go rename to leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go diff --git a/Algorithms/0215.Kth-Largest-Element-in-an-Array/README.md b/leetcode/0215.Kth-Largest-Element-in-an-Array/README.md similarity index 100% rename from Algorithms/0215.Kth-Largest-Element-in-an-Array/README.md rename to leetcode/0215.Kth-Largest-Element-in-an-Array/README.md diff --git a/Algorithms/0216.Combination-Sum-III/216. Combination Sum III.go b/leetcode/0216.Combination-Sum-III/216. Combination Sum III.go similarity index 100% rename from Algorithms/0216.Combination-Sum-III/216. Combination Sum III.go rename to leetcode/0216.Combination-Sum-III/216. Combination Sum III.go diff --git a/Algorithms/0216.Combination-Sum-III/216. Combination Sum III_test.go b/leetcode/0216.Combination-Sum-III/216. Combination Sum III_test.go similarity index 100% rename from Algorithms/0216.Combination-Sum-III/216. Combination Sum III_test.go rename to leetcode/0216.Combination-Sum-III/216. Combination Sum III_test.go diff --git a/Algorithms/0216.Combination-Sum-III/README.md b/leetcode/0216.Combination-Sum-III/README.md similarity index 100% rename from Algorithms/0216.Combination-Sum-III/README.md rename to leetcode/0216.Combination-Sum-III/README.md diff --git a/Algorithms/0217.Contains-Duplicate/217. Contains Duplicate.go b/leetcode/0217.Contains-Duplicate/217. Contains Duplicate.go similarity index 100% rename from Algorithms/0217.Contains-Duplicate/217. Contains Duplicate.go rename to leetcode/0217.Contains-Duplicate/217. Contains Duplicate.go diff --git a/Algorithms/0217.Contains-Duplicate/217. Contains Duplicate_test.go b/leetcode/0217.Contains-Duplicate/217. Contains Duplicate_test.go similarity index 100% rename from Algorithms/0217.Contains-Duplicate/217. Contains Duplicate_test.go rename to leetcode/0217.Contains-Duplicate/217. Contains Duplicate_test.go diff --git a/Algorithms/0217.Contains-Duplicate/README.md b/leetcode/0217.Contains-Duplicate/README.md similarity index 100% rename from Algorithms/0217.Contains-Duplicate/README.md rename to leetcode/0217.Contains-Duplicate/README.md diff --git a/Algorithms/0218.The-Skyline-Problem/218. The Skyline Problem.go b/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go similarity index 100% rename from Algorithms/0218.The-Skyline-Problem/218. The Skyline Problem.go rename to leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go diff --git a/Algorithms/0218.The-Skyline-Problem/218. The Skyline Problem_test.go b/leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go similarity index 100% rename from Algorithms/0218.The-Skyline-Problem/218. The Skyline Problem_test.go rename to leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go diff --git a/Algorithms/0218.The-Skyline-Problem/README.md b/leetcode/0218.The-Skyline-Problem/README.md similarity index 100% rename from Algorithms/0218.The-Skyline-Problem/README.md rename to leetcode/0218.The-Skyline-Problem/README.md diff --git a/Algorithms/0219.Contains-Duplicate-II/219. Contains Duplicate II.go b/leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II.go similarity index 100% rename from Algorithms/0219.Contains-Duplicate-II/219. Contains Duplicate II.go rename to leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II.go diff --git a/Algorithms/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go b/leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go similarity index 100% rename from Algorithms/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go rename to leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go diff --git a/Algorithms/0219.Contains-Duplicate-II/README.md b/leetcode/0219.Contains-Duplicate-II/README.md similarity index 100% rename from Algorithms/0219.Contains-Duplicate-II/README.md rename to leetcode/0219.Contains-Duplicate-II/README.md diff --git a/Algorithms/0220.Contains-Duplicate-III/220. Contains Duplicate III.go b/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go similarity index 100% rename from Algorithms/0220.Contains-Duplicate-III/220. Contains Duplicate III.go rename to leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go diff --git a/Algorithms/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go b/leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go similarity index 100% rename from Algorithms/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go rename to leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go diff --git a/Algorithms/0220.Contains-Duplicate-III/README.md b/leetcode/0220.Contains-Duplicate-III/README.md similarity index 100% rename from Algorithms/0220.Contains-Duplicate-III/README.md rename to leetcode/0220.Contains-Duplicate-III/README.md diff --git a/Algorithms/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go b/leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go similarity index 100% rename from Algorithms/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go rename to leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go diff --git a/Algorithms/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go b/leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go similarity index 100% rename from Algorithms/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go rename to leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go diff --git a/Algorithms/0222.Count-Complete-Tree-Nodes/README.md b/leetcode/0222.Count-Complete-Tree-Nodes/README.md similarity index 100% rename from Algorithms/0222.Count-Complete-Tree-Nodes/README.md rename to leetcode/0222.Count-Complete-Tree-Nodes/README.md diff --git a/Algorithms/0223.Rectangle-Area/223. Rectangle Area.go b/leetcode/0223.Rectangle-Area/223. Rectangle Area.go similarity index 100% rename from Algorithms/0223.Rectangle-Area/223. Rectangle Area.go rename to leetcode/0223.Rectangle-Area/223. Rectangle Area.go diff --git a/Algorithms/0223.Rectangle-Area/223. Rectangle Area_test.go b/leetcode/0223.Rectangle-Area/223. Rectangle Area_test.go similarity index 100% rename from Algorithms/0223.Rectangle-Area/223. Rectangle Area_test.go rename to leetcode/0223.Rectangle-Area/223. Rectangle Area_test.go diff --git a/Algorithms/0223.Rectangle-Area/README.md b/leetcode/0223.Rectangle-Area/README.md similarity index 100% rename from Algorithms/0223.Rectangle-Area/README.md rename to leetcode/0223.Rectangle-Area/README.md diff --git a/Algorithms/0224.Basic-Calculator/224. Basic Calculator.go b/leetcode/0224.Basic-Calculator/224. Basic Calculator.go similarity index 100% rename from Algorithms/0224.Basic-Calculator/224. Basic Calculator.go rename to leetcode/0224.Basic-Calculator/224. Basic Calculator.go diff --git a/Algorithms/0224.Basic-Calculator/224. Basic Calculator_test.go b/leetcode/0224.Basic-Calculator/224. Basic Calculator_test.go similarity index 100% rename from Algorithms/0224.Basic-Calculator/224. Basic Calculator_test.go rename to leetcode/0224.Basic-Calculator/224. Basic Calculator_test.go diff --git a/Algorithms/0224.Basic-Calculator/README.md b/leetcode/0224.Basic-Calculator/README.md similarity index 100% rename from Algorithms/0224.Basic-Calculator/README.md rename to leetcode/0224.Basic-Calculator/README.md diff --git a/Algorithms/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go b/leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go similarity index 100% rename from Algorithms/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go rename to leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go diff --git a/Algorithms/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go b/leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go similarity index 100% rename from Algorithms/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go rename to leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go diff --git a/Algorithms/0225.Implement-Stack-using-Queues/README.md b/leetcode/0225.Implement-Stack-using-Queues/README.md similarity index 100% rename from Algorithms/0225.Implement-Stack-using-Queues/README.md rename to leetcode/0225.Implement-Stack-using-Queues/README.md diff --git a/Algorithms/0226.Invert-Binary-Tree/226. Invert Binary Tree.go b/leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree.go similarity index 100% rename from Algorithms/0226.Invert-Binary-Tree/226. Invert Binary Tree.go rename to leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree.go diff --git a/Algorithms/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go b/leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go similarity index 100% rename from Algorithms/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go rename to leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go diff --git a/Algorithms/0226.Invert-Binary-Tree/README.md b/leetcode/0226.Invert-Binary-Tree/README.md similarity index 100% rename from Algorithms/0226.Invert-Binary-Tree/README.md rename to leetcode/0226.Invert-Binary-Tree/README.md diff --git a/Algorithms/0229.Majority-Element-II/229. Majority Element II.go b/leetcode/0229.Majority-Element-II/229. Majority Element II.go similarity index 100% rename from Algorithms/0229.Majority-Element-II/229. Majority Element II.go rename to leetcode/0229.Majority-Element-II/229. Majority Element II.go diff --git a/Algorithms/0229.Majority-Element-II/229. Majority Element II_test.go b/leetcode/0229.Majority-Element-II/229. Majority Element II_test.go similarity index 100% rename from Algorithms/0229.Majority-Element-II/229. Majority Element II_test.go rename to leetcode/0229.Majority-Element-II/229. Majority Element II_test.go diff --git a/Algorithms/0229.Majority-Element-II/README.md b/leetcode/0229.Majority-Element-II/README.md similarity index 100% rename from Algorithms/0229.Majority-Element-II/README.md rename to leetcode/0229.Majority-Element-II/README.md diff --git a/Algorithms/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go b/leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go similarity index 100% rename from Algorithms/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go rename to leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go diff --git a/Algorithms/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go b/leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go similarity index 100% rename from Algorithms/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go rename to leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go diff --git a/Algorithms/0230.Kth-Smallest-Element-in-a-BST/README.md b/leetcode/0230.Kth-Smallest-Element-in-a-BST/README.md similarity index 100% rename from Algorithms/0230.Kth-Smallest-Element-in-a-BST/README.md rename to leetcode/0230.Kth-Smallest-Element-in-a-BST/README.md diff --git a/Algorithms/0231.Power-of-Two/231. Power of Two.go b/leetcode/0231.Power-of-Two/231. Power of Two.go similarity index 100% rename from Algorithms/0231.Power-of-Two/231. Power of Two.go rename to leetcode/0231.Power-of-Two/231. Power of Two.go diff --git a/Algorithms/0231.Power-of-Two/231. Power of Two_test.go b/leetcode/0231.Power-of-Two/231. Power of Two_test.go similarity index 100% rename from Algorithms/0231.Power-of-Two/231. Power of Two_test.go rename to leetcode/0231.Power-of-Two/231. Power of Two_test.go diff --git a/Algorithms/0231.Power-of-Two/README.md b/leetcode/0231.Power-of-Two/README.md similarity index 100% rename from Algorithms/0231.Power-of-Two/README.md rename to leetcode/0231.Power-of-Two/README.md diff --git a/Algorithms/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go b/leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go similarity index 100% rename from Algorithms/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go rename to leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go diff --git a/Algorithms/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go b/leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go similarity index 100% rename from Algorithms/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go rename to leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go diff --git a/Algorithms/0232.Implement-Queue-using-Stacks/README.md b/leetcode/0232.Implement-Queue-using-Stacks/README.md similarity index 100% rename from Algorithms/0232.Implement-Queue-using-Stacks/README.md rename to leetcode/0232.Implement-Queue-using-Stacks/README.md diff --git a/Algorithms/0234.Palindrome-Linked-List/234. Palindrome Linked List.go b/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go similarity index 100% rename from Algorithms/0234.Palindrome-Linked-List/234. Palindrome Linked List.go rename to leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go diff --git a/Algorithms/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go b/leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go similarity index 100% rename from Algorithms/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go rename to leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go diff --git a/Algorithms/0234.Palindrome-Linked-List/README.md b/leetcode/0234.Palindrome-Linked-List/README.md similarity index 100% rename from Algorithms/0234.Palindrome-Linked-List/README.md rename to leetcode/0234.Palindrome-Linked-List/README.md diff --git a/Algorithms/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go b/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go similarity index 100% rename from Algorithms/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go rename to leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go diff --git a/Algorithms/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go b/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go similarity index 100% rename from Algorithms/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go rename to leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go diff --git a/Algorithms/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/README.md b/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/README.md similarity index 100% rename from Algorithms/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/README.md rename to leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/README.md diff --git a/Algorithms/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go b/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go similarity index 100% rename from Algorithms/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go rename to leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go diff --git a/Algorithms/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go b/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go similarity index 100% rename from Algorithms/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go rename to leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go diff --git a/Algorithms/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/README.md b/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/README.md similarity index 100% rename from Algorithms/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/README.md rename to leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/README.md diff --git a/Algorithms/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go b/leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go similarity index 100% rename from Algorithms/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go rename to leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go diff --git a/Algorithms/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go b/leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go similarity index 100% rename from Algorithms/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go rename to leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go diff --git a/Algorithms/0237.Delete-Node-in-a-Linked-List/README.md b/leetcode/0237.Delete-Node-in-a-Linked-List/README.md similarity index 100% rename from Algorithms/0237.Delete-Node-in-a-Linked-List/README.md rename to leetcode/0237.Delete-Node-in-a-Linked-List/README.md diff --git a/Algorithms/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go b/leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go similarity index 100% rename from Algorithms/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go rename to leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go diff --git a/Algorithms/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go b/leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go similarity index 100% rename from Algorithms/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go rename to leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go diff --git a/Algorithms/0239.Sliding-Window-Maximum/README.md b/leetcode/0239.Sliding-Window-Maximum/README.md similarity index 100% rename from Algorithms/0239.Sliding-Window-Maximum/README.md rename to leetcode/0239.Sliding-Window-Maximum/README.md diff --git a/Algorithms/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go b/leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go similarity index 100% rename from Algorithms/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go rename to leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go diff --git a/Algorithms/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go b/leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go similarity index 100% rename from Algorithms/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go rename to leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go diff --git a/Algorithms/0240.Search-a-2D-Matrix-II/README.md b/leetcode/0240.Search-a-2D-Matrix-II/README.md similarity index 100% rename from Algorithms/0240.Search-a-2D-Matrix-II/README.md rename to leetcode/0240.Search-a-2D-Matrix-II/README.md diff --git a/Algorithms/0242.Valid-Anagram/242. Valid Anagram.go b/leetcode/0242.Valid-Anagram/242. Valid Anagram.go similarity index 100% rename from Algorithms/0242.Valid-Anagram/242. Valid Anagram.go rename to leetcode/0242.Valid-Anagram/242. Valid Anagram.go diff --git a/Algorithms/0242.Valid-Anagram/242. Valid Anagram_test.go b/leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go similarity index 100% rename from Algorithms/0242.Valid-Anagram/242. Valid Anagram_test.go rename to leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go diff --git a/Algorithms/0242.Valid-Anagram/README.md b/leetcode/0242.Valid-Anagram/README.md similarity index 100% rename from Algorithms/0242.Valid-Anagram/README.md rename to leetcode/0242.Valid-Anagram/README.md diff --git a/Algorithms/0257.Binary-Tree-Paths/257. Binary Tree Paths.go b/leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go similarity index 100% rename from Algorithms/0257.Binary-Tree-Paths/257. Binary Tree Paths.go rename to leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go diff --git a/Algorithms/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go b/leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go similarity index 100% rename from Algorithms/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go rename to leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go diff --git a/Algorithms/0257.Binary-Tree-Paths/README.md b/leetcode/0257.Binary-Tree-Paths/README.md similarity index 100% rename from Algorithms/0257.Binary-Tree-Paths/README.md rename to leetcode/0257.Binary-Tree-Paths/README.md diff --git a/Algorithms/0260.Single-Number-III/260. Single Number III.go b/leetcode/0260.Single-Number-III/260. Single Number III.go similarity index 100% rename from Algorithms/0260.Single-Number-III/260. Single Number III.go rename to leetcode/0260.Single-Number-III/260. Single Number III.go diff --git a/Algorithms/0260.Single-Number-III/260. Single Number III_test.go b/leetcode/0260.Single-Number-III/260. Single Number III_test.go similarity index 100% rename from Algorithms/0260.Single-Number-III/260. Single Number III_test.go rename to leetcode/0260.Single-Number-III/260. Single Number III_test.go diff --git a/Algorithms/0260.Single-Number-III/README.md b/leetcode/0260.Single-Number-III/README.md similarity index 100% rename from Algorithms/0260.Single-Number-III/README.md rename to leetcode/0260.Single-Number-III/README.md diff --git a/Algorithms/0263.Ugly-Number/263. Ugly Number.go b/leetcode/0263.Ugly-Number/263. Ugly Number.go similarity index 100% rename from Algorithms/0263.Ugly-Number/263. Ugly Number.go rename to leetcode/0263.Ugly-Number/263. Ugly Number.go diff --git a/Algorithms/0263.Ugly-Number/263. Ugly Number_test.go b/leetcode/0263.Ugly-Number/263. Ugly Number_test.go similarity index 100% rename from Algorithms/0263.Ugly-Number/263. Ugly Number_test.go rename to leetcode/0263.Ugly-Number/263. Ugly Number_test.go diff --git a/Algorithms/0263.Ugly-Number/README.md b/leetcode/0263.Ugly-Number/README.md similarity index 100% rename from Algorithms/0263.Ugly-Number/README.md rename to leetcode/0263.Ugly-Number/README.md diff --git a/Algorithms/0268.Missing-Number/268. Missing Number.go b/leetcode/0268.Missing-Number/268. Missing Number.go similarity index 100% rename from Algorithms/0268.Missing-Number/268. Missing Number.go rename to leetcode/0268.Missing-Number/268. Missing Number.go diff --git a/Algorithms/0268.Missing-Number/268. Missing Number_test.go b/leetcode/0268.Missing-Number/268. Missing Number_test.go similarity index 100% rename from Algorithms/0268.Missing-Number/268. Missing Number_test.go rename to leetcode/0268.Missing-Number/268. Missing Number_test.go diff --git a/Algorithms/0268.Missing-Number/README.md b/leetcode/0268.Missing-Number/README.md similarity index 100% rename from Algorithms/0268.Missing-Number/README.md rename to leetcode/0268.Missing-Number/README.md diff --git a/Algorithms/0274.H-Index/274. H-Index.go b/leetcode/0274.H-Index/274. H-Index.go similarity index 100% rename from Algorithms/0274.H-Index/274. H-Index.go rename to leetcode/0274.H-Index/274. H-Index.go diff --git a/Algorithms/0274.H-Index/274. H-Index_test.go b/leetcode/0274.H-Index/274. H-Index_test.go similarity index 100% rename from Algorithms/0274.H-Index/274. H-Index_test.go rename to leetcode/0274.H-Index/274. H-Index_test.go diff --git a/Algorithms/0274.H-Index/README.md b/leetcode/0274.H-Index/README.md similarity index 100% rename from Algorithms/0274.H-Index/README.md rename to leetcode/0274.H-Index/README.md diff --git a/Algorithms/0275.H-Index-II/275. H-Index II.go b/leetcode/0275.H-Index-II/275. H-Index II.go similarity index 100% rename from Algorithms/0275.H-Index-II/275. H-Index II.go rename to leetcode/0275.H-Index-II/275. H-Index II.go diff --git a/Algorithms/0275.H-Index-II/275. H-Index II_test.go b/leetcode/0275.H-Index-II/275. H-Index II_test.go similarity index 100% rename from Algorithms/0275.H-Index-II/275. H-Index II_test.go rename to leetcode/0275.H-Index-II/275. H-Index II_test.go diff --git a/Algorithms/0275.H-Index-II/README.md b/leetcode/0275.H-Index-II/README.md similarity index 100% rename from Algorithms/0275.H-Index-II/README.md rename to leetcode/0275.H-Index-II/README.md diff --git a/Algorithms/0283.Move-Zeroes/283. Move Zeroes.go b/leetcode/0283.Move-Zeroes/283. Move Zeroes.go similarity index 100% rename from Algorithms/0283.Move-Zeroes/283. Move Zeroes.go rename to leetcode/0283.Move-Zeroes/283. Move Zeroes.go diff --git a/Algorithms/0283.Move-Zeroes/283. Move Zeroes_test.go b/leetcode/0283.Move-Zeroes/283. Move Zeroes_test.go similarity index 100% rename from Algorithms/0283.Move-Zeroes/283. Move Zeroes_test.go rename to leetcode/0283.Move-Zeroes/283. Move Zeroes_test.go diff --git a/Algorithms/0283.Move-Zeroes/README.md b/leetcode/0283.Move-Zeroes/README.md similarity index 100% rename from Algorithms/0283.Move-Zeroes/README.md rename to leetcode/0283.Move-Zeroes/README.md diff --git a/Algorithms/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go b/leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go similarity index 100% rename from Algorithms/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go rename to leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go diff --git a/Algorithms/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go b/leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go similarity index 100% rename from Algorithms/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go rename to leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go diff --git a/Algorithms/0287.Find-the-Duplicate-Number/README.md b/leetcode/0287.Find-the-Duplicate-Number/README.md similarity index 100% rename from Algorithms/0287.Find-the-Duplicate-Number/README.md rename to leetcode/0287.Find-the-Duplicate-Number/README.md diff --git a/Algorithms/0290.Word-Pattern/290. Word Pattern.go b/leetcode/0290.Word-Pattern/290. Word Pattern.go similarity index 100% rename from Algorithms/0290.Word-Pattern/290. Word Pattern.go rename to leetcode/0290.Word-Pattern/290. Word Pattern.go diff --git a/Algorithms/0290.Word-Pattern/290. Word Pattern_test.go b/leetcode/0290.Word-Pattern/290. Word Pattern_test.go similarity index 100% rename from Algorithms/0290.Word-Pattern/290. Word Pattern_test.go rename to leetcode/0290.Word-Pattern/290. Word Pattern_test.go diff --git a/Algorithms/0290.Word-Pattern/README.md b/leetcode/0290.Word-Pattern/README.md similarity index 100% rename from Algorithms/0290.Word-Pattern/README.md rename to leetcode/0290.Word-Pattern/README.md diff --git a/Algorithms/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go b/leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go similarity index 100% rename from Algorithms/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go rename to leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go diff --git a/Algorithms/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go b/leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go similarity index 100% rename from Algorithms/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go rename to leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go diff --git a/Algorithms/0300.Longest-Increasing-Subsequence/README.md b/leetcode/0300.Longest-Increasing-Subsequence/README.md similarity index 100% rename from Algorithms/0300.Longest-Increasing-Subsequence/README.md rename to leetcode/0300.Longest-Increasing-Subsequence/README.md diff --git a/Algorithms/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go b/leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go similarity index 100% rename from Algorithms/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go rename to leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go diff --git a/Algorithms/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go b/leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go similarity index 100% rename from Algorithms/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go rename to leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go diff --git a/Algorithms/0303.Range-Sum-Query---Immutable/README.md b/leetcode/0303.Range-Sum-Query---Immutable/README.md similarity index 100% rename from Algorithms/0303.Range-Sum-Query---Immutable/README.md rename to leetcode/0303.Range-Sum-Query---Immutable/README.md diff --git a/Algorithms/0306.Additive-Number/306. Additive Number.go b/leetcode/0306.Additive-Number/306. Additive Number.go similarity index 100% rename from Algorithms/0306.Additive-Number/306. Additive Number.go rename to leetcode/0306.Additive-Number/306. Additive Number.go diff --git a/Algorithms/0306.Additive-Number/306. Additive Number_test.go b/leetcode/0306.Additive-Number/306. Additive Number_test.go similarity index 100% rename from Algorithms/0306.Additive-Number/306. Additive Number_test.go rename to leetcode/0306.Additive-Number/306. Additive Number_test.go diff --git a/Algorithms/0306.Additive-Number/README.md b/leetcode/0306.Additive-Number/README.md similarity index 100% rename from Algorithms/0306.Additive-Number/README.md rename to leetcode/0306.Additive-Number/README.md diff --git a/Algorithms/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go b/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go similarity index 100% rename from Algorithms/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go rename to leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go diff --git a/Algorithms/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go b/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go similarity index 100% rename from Algorithms/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go rename to leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go diff --git a/Algorithms/0307.Range-Sum-Query---Mutable/README.md b/leetcode/0307.Range-Sum-Query---Mutable/README.md similarity index 100% rename from Algorithms/0307.Range-Sum-Query---Mutable/README.md rename to leetcode/0307.Range-Sum-Query---Mutable/README.md diff --git a/Algorithms/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go b/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go similarity index 100% rename from Algorithms/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go rename to leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go diff --git a/Algorithms/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go b/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go similarity index 100% rename from Algorithms/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go rename to leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go diff --git a/Algorithms/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/README.md b/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/README.md similarity index 100% rename from Algorithms/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/README.md rename to leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/README.md diff --git a/Algorithms/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go similarity index 100% rename from Algorithms/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go rename to leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go diff --git a/Algorithms/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go similarity index 100% rename from Algorithms/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go rename to leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go diff --git a/Algorithms/0315.Count-of-Smaller-Numbers-After-Self/README.md b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md similarity index 100% rename from Algorithms/0315.Count-of-Smaller-Numbers-After-Self/README.md rename to leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md diff --git a/Algorithms/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go b/leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go similarity index 100% rename from Algorithms/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go rename to leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go diff --git a/Algorithms/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go b/leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go similarity index 100% rename from Algorithms/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go rename to leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go diff --git a/Algorithms/0318.Maximum-Product-of-Word-Lengths/README.md b/leetcode/0318.Maximum-Product-of-Word-Lengths/README.md similarity index 100% rename from Algorithms/0318.Maximum-Product-of-Word-Lengths/README.md rename to leetcode/0318.Maximum-Product-of-Word-Lengths/README.md diff --git a/Algorithms/0322.Coin-Change/322. Coin Change.go b/leetcode/0322.Coin-Change/322. Coin Change.go similarity index 100% rename from Algorithms/0322.Coin-Change/322. Coin Change.go rename to leetcode/0322.Coin-Change/322. Coin Change.go diff --git a/Algorithms/0322.Coin-Change/322. Coin Change_test.go b/leetcode/0322.Coin-Change/322. Coin Change_test.go similarity index 100% rename from Algorithms/0322.Coin-Change/322. Coin Change_test.go rename to leetcode/0322.Coin-Change/322. Coin Change_test.go diff --git a/Algorithms/0322.Coin-Change/README.md b/leetcode/0322.Coin-Change/README.md similarity index 100% rename from Algorithms/0322.Coin-Change/README.md rename to leetcode/0322.Coin-Change/README.md diff --git a/Algorithms/0324.Wiggle-Sort-II/324. Wiggle Sort II.go b/leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II.go similarity index 100% rename from Algorithms/0324.Wiggle-Sort-II/324. Wiggle Sort II.go rename to leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II.go diff --git a/Algorithms/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go b/leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go similarity index 100% rename from Algorithms/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go rename to leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go diff --git a/Algorithms/0324.Wiggle-Sort-II/README.md b/leetcode/0324.Wiggle-Sort-II/README.md similarity index 100% rename from Algorithms/0324.Wiggle-Sort-II/README.md rename to leetcode/0324.Wiggle-Sort-II/README.md diff --git a/Algorithms/0326.Power-of-Three/326. Power of Three.go b/leetcode/0326.Power-of-Three/326. Power of Three.go similarity index 100% rename from Algorithms/0326.Power-of-Three/326. Power of Three.go rename to leetcode/0326.Power-of-Three/326. Power of Three.go diff --git a/Algorithms/0326.Power-of-Three/326. Power of Three_test.go b/leetcode/0326.Power-of-Three/326. Power of Three_test.go similarity index 100% rename from Algorithms/0326.Power-of-Three/326. Power of Three_test.go rename to leetcode/0326.Power-of-Three/326. Power of Three_test.go diff --git a/Algorithms/0326.Power-of-Three/README.md b/leetcode/0326.Power-of-Three/README.md similarity index 100% rename from Algorithms/0326.Power-of-Three/README.md rename to leetcode/0326.Power-of-Three/README.md diff --git a/Algorithms/0327.Count-of-Range-Sum/327. Count of Range Sum.go b/leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go similarity index 100% rename from Algorithms/0327.Count-of-Range-Sum/327. Count of Range Sum.go rename to leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go diff --git a/Algorithms/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go b/leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go similarity index 100% rename from Algorithms/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go rename to leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go diff --git a/Algorithms/0327.Count-of-Range-Sum/README.md b/leetcode/0327.Count-of-Range-Sum/README.md similarity index 100% rename from Algorithms/0327.Count-of-Range-Sum/README.md rename to leetcode/0327.Count-of-Range-Sum/README.md diff --git a/Algorithms/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go b/leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go similarity index 100% rename from Algorithms/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go rename to leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go diff --git a/Algorithms/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go b/leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go similarity index 100% rename from Algorithms/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go rename to leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go diff --git a/Algorithms/0328.Odd-Even-Linked-List/README.md b/leetcode/0328.Odd-Even-Linked-List/README.md similarity index 100% rename from Algorithms/0328.Odd-Even-Linked-List/README.md rename to leetcode/0328.Odd-Even-Linked-List/README.md diff --git a/Algorithms/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go b/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go similarity index 100% rename from Algorithms/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go rename to leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go diff --git a/Algorithms/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go b/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go similarity index 100% rename from Algorithms/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go rename to leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go diff --git a/Algorithms/0329.Longest-Increasing-Path-in-a-Matrix/README.md b/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md similarity index 100% rename from Algorithms/0329.Longest-Increasing-Path-in-a-Matrix/README.md rename to leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md diff --git a/Algorithms/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go b/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go similarity index 100% rename from Algorithms/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go rename to leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go diff --git a/Algorithms/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go b/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go similarity index 100% rename from Algorithms/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go rename to leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go diff --git a/Algorithms/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/README.md b/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/README.md similarity index 100% rename from Algorithms/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/README.md rename to leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/README.md diff --git a/Algorithms/0337.House-Robber-III/337. House Robber III.go b/leetcode/0337.House-Robber-III/337. House Robber III.go similarity index 100% rename from Algorithms/0337.House-Robber-III/337. House Robber III.go rename to leetcode/0337.House-Robber-III/337. House Robber III.go diff --git a/Algorithms/0337.House-Robber-III/337. House Robber III_test.go b/leetcode/0337.House-Robber-III/337. House Robber III_test.go similarity index 100% rename from Algorithms/0337.House-Robber-III/337. House Robber III_test.go rename to leetcode/0337.House-Robber-III/337. House Robber III_test.go diff --git a/Algorithms/0337.House-Robber-III/README.md b/leetcode/0337.House-Robber-III/README.md similarity index 100% rename from Algorithms/0337.House-Robber-III/README.md rename to leetcode/0337.House-Robber-III/README.md diff --git a/Algorithms/0338.Counting-Bits/338. Counting Bits.go b/leetcode/0338.Counting-Bits/338. Counting Bits.go similarity index 100% rename from Algorithms/0338.Counting-Bits/338. Counting Bits.go rename to leetcode/0338.Counting-Bits/338. Counting Bits.go diff --git a/Algorithms/0338.Counting-Bits/338. Counting Bits_test.go b/leetcode/0338.Counting-Bits/338. Counting Bits_test.go similarity index 100% rename from Algorithms/0338.Counting-Bits/338. Counting Bits_test.go rename to leetcode/0338.Counting-Bits/338. Counting Bits_test.go diff --git a/Algorithms/0338.Counting-Bits/README.md b/leetcode/0338.Counting-Bits/README.md similarity index 100% rename from Algorithms/0338.Counting-Bits/README.md rename to leetcode/0338.Counting-Bits/README.md diff --git a/Algorithms/0342.Power-of-Four/342. Power of Four.go b/leetcode/0342.Power-of-Four/342. Power of Four.go similarity index 100% rename from Algorithms/0342.Power-of-Four/342. Power of Four.go rename to leetcode/0342.Power-of-Four/342. Power of Four.go diff --git a/Algorithms/0342.Power-of-Four/342. Power of Four_test.go b/leetcode/0342.Power-of-Four/342. Power of Four_test.go similarity index 100% rename from Algorithms/0342.Power-of-Four/342. Power of Four_test.go rename to leetcode/0342.Power-of-Four/342. Power of Four_test.go diff --git a/Algorithms/0342.Power-of-Four/README.md b/leetcode/0342.Power-of-Four/README.md similarity index 100% rename from Algorithms/0342.Power-of-Four/README.md rename to leetcode/0342.Power-of-Four/README.md diff --git a/Algorithms/0343.Integer-Break/343. Integer Break.go b/leetcode/0343.Integer-Break/343. Integer Break.go similarity index 100% rename from Algorithms/0343.Integer-Break/343. Integer Break.go rename to leetcode/0343.Integer-Break/343. Integer Break.go diff --git a/Algorithms/0343.Integer-Break/343. Integer Break_test.go b/leetcode/0343.Integer-Break/343. Integer Break_test.go similarity index 100% rename from Algorithms/0343.Integer-Break/343. Integer Break_test.go rename to leetcode/0343.Integer-Break/343. Integer Break_test.go diff --git a/Algorithms/0343.Integer-Break/README.md b/leetcode/0343.Integer-Break/README.md similarity index 100% rename from Algorithms/0343.Integer-Break/README.md rename to leetcode/0343.Integer-Break/README.md diff --git a/Algorithms/0344.Reverse-String/344. Reverse String.go b/leetcode/0344.Reverse-String/344. Reverse String.go similarity index 100% rename from Algorithms/0344.Reverse-String/344. Reverse String.go rename to leetcode/0344.Reverse-String/344. Reverse String.go diff --git a/Algorithms/0344.Reverse-String/344. Reverse String_test.go b/leetcode/0344.Reverse-String/344. Reverse String_test.go similarity index 100% rename from Algorithms/0344.Reverse-String/344. Reverse String_test.go rename to leetcode/0344.Reverse-String/344. Reverse String_test.go diff --git a/Algorithms/0344.Reverse-String/README.md b/leetcode/0344.Reverse-String/README.md similarity index 100% rename from Algorithms/0344.Reverse-String/README.md rename to leetcode/0344.Reverse-String/README.md diff --git a/Algorithms/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go b/leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go similarity index 100% rename from Algorithms/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go rename to leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go diff --git a/Algorithms/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go b/leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go similarity index 100% rename from Algorithms/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go rename to leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go diff --git a/Algorithms/0345.Reverse-Vowels-of-a-String/README.md b/leetcode/0345.Reverse-Vowels-of-a-String/README.md similarity index 100% rename from Algorithms/0345.Reverse-Vowels-of-a-String/README.md rename to leetcode/0345.Reverse-Vowels-of-a-String/README.md diff --git a/Algorithms/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go b/leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go similarity index 100% rename from Algorithms/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go rename to leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go diff --git a/Algorithms/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go b/leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go similarity index 100% rename from Algorithms/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go rename to leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go diff --git a/Algorithms/0347.Top-K-Frequent-Elements/README.md b/leetcode/0347.Top-K-Frequent-Elements/README.md similarity index 100% rename from Algorithms/0347.Top-K-Frequent-Elements/README.md rename to leetcode/0347.Top-K-Frequent-Elements/README.md diff --git a/Algorithms/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go b/leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go similarity index 100% rename from Algorithms/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go rename to leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go diff --git a/Algorithms/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go b/leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go similarity index 100% rename from Algorithms/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go rename to leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go diff --git a/Algorithms/0349.Intersection-of-Two-Arrays/README.md b/leetcode/0349.Intersection-of-Two-Arrays/README.md similarity index 100% rename from Algorithms/0349.Intersection-of-Two-Arrays/README.md rename to leetcode/0349.Intersection-of-Two-Arrays/README.md diff --git a/Algorithms/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go b/leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go similarity index 100% rename from Algorithms/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go rename to leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go diff --git a/Algorithms/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go b/leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go similarity index 100% rename from Algorithms/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go rename to leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go diff --git a/Algorithms/0350.Intersection-of-Two-Arrays-II/README.md b/leetcode/0350.Intersection-of-Two-Arrays-II/README.md similarity index 100% rename from Algorithms/0350.Intersection-of-Two-Arrays-II/README.md rename to leetcode/0350.Intersection-of-Two-Arrays-II/README.md diff --git a/Algorithms/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go b/leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go similarity index 100% rename from Algorithms/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go rename to leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go diff --git a/Algorithms/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go b/leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go similarity index 100% rename from Algorithms/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go rename to leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go diff --git a/Algorithms/0354.Russian-Doll-Envelopes/README.md b/leetcode/0354.Russian-Doll-Envelopes/README.md similarity index 100% rename from Algorithms/0354.Russian-Doll-Envelopes/README.md rename to leetcode/0354.Russian-Doll-Envelopes/README.md diff --git a/Algorithms/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go b/leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go similarity index 100% rename from Algorithms/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go rename to leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go diff --git a/Algorithms/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go b/leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go similarity index 100% rename from Algorithms/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go rename to leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go diff --git a/Algorithms/0357.Count-Numbers-with-Unique-Digits/README.md b/leetcode/0357.Count-Numbers-with-Unique-Digits/README.md similarity index 100% rename from Algorithms/0357.Count-Numbers-with-Unique-Digits/README.md rename to leetcode/0357.Count-Numbers-with-Unique-Digits/README.md diff --git a/Algorithms/0367.Valid-Perfect-Square/367. Valid Perfect Square.go b/leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square.go similarity index 100% rename from Algorithms/0367.Valid-Perfect-Square/367. Valid Perfect Square.go rename to leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square.go diff --git a/Algorithms/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go b/leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go similarity index 100% rename from Algorithms/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go rename to leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go diff --git a/Algorithms/0367.Valid-Perfect-Square/README.md b/leetcode/0367.Valid-Perfect-Square/README.md similarity index 100% rename from Algorithms/0367.Valid-Perfect-Square/README.md rename to leetcode/0367.Valid-Perfect-Square/README.md diff --git a/Algorithms/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go b/leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go similarity index 100% rename from Algorithms/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go rename to leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go diff --git a/Algorithms/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go b/leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go similarity index 100% rename from Algorithms/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go rename to leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go diff --git a/Algorithms/0371.Sum-of-Two-Integers/README.md b/leetcode/0371.Sum-of-Two-Integers/README.md similarity index 100% rename from Algorithms/0371.Sum-of-Two-Integers/README.md rename to leetcode/0371.Sum-of-Two-Integers/README.md diff --git a/Algorithms/0372.Super-Pow/372. Super Pow.go b/leetcode/0372.Super-Pow/372. Super Pow.go similarity index 100% rename from Algorithms/0372.Super-Pow/372. Super Pow.go rename to leetcode/0372.Super-Pow/372. Super Pow.go diff --git a/Algorithms/0372.Super-Pow/372. Super Pow_test.go b/leetcode/0372.Super-Pow/372. Super Pow_test.go similarity index 100% rename from Algorithms/0372.Super-Pow/372. Super Pow_test.go rename to leetcode/0372.Super-Pow/372. Super Pow_test.go diff --git a/Algorithms/0372.Super-Pow/README.md b/leetcode/0372.Super-Pow/README.md similarity index 100% rename from Algorithms/0372.Super-Pow/README.md rename to leetcode/0372.Super-Pow/README.md diff --git a/Algorithms/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go b/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go similarity index 100% rename from Algorithms/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go rename to leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go diff --git a/Algorithms/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go b/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go similarity index 100% rename from Algorithms/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go rename to leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go diff --git a/Algorithms/0373.Find-K-Pairs-with-Smallest-Sums/README.md b/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/README.md similarity index 100% rename from Algorithms/0373.Find-K-Pairs-with-Smallest-Sums/README.md rename to leetcode/0373.Find-K-Pairs-with-Smallest-Sums/README.md diff --git a/Algorithms/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go b/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go similarity index 100% rename from Algorithms/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go rename to leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go diff --git a/Algorithms/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go b/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go similarity index 100% rename from Algorithms/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go rename to leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go diff --git a/Algorithms/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md b/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md similarity index 100% rename from Algorithms/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md rename to leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md diff --git a/Algorithms/0385.Mini-Parser/385. Mini Parser.go b/leetcode/0385.Mini-Parser/385. Mini Parser.go similarity index 100% rename from Algorithms/0385.Mini-Parser/385. Mini Parser.go rename to leetcode/0385.Mini-Parser/385. Mini Parser.go diff --git a/Algorithms/0385.Mini-Parser/385. Mini Parser_test.go b/leetcode/0385.Mini-Parser/385. Mini Parser_test.go similarity index 100% rename from Algorithms/0385.Mini-Parser/385. Mini Parser_test.go rename to leetcode/0385.Mini-Parser/385. Mini Parser_test.go diff --git a/Algorithms/0385.Mini-Parser/README.md b/leetcode/0385.Mini-Parser/README.md similarity index 100% rename from Algorithms/0385.Mini-Parser/README.md rename to leetcode/0385.Mini-Parser/README.md diff --git a/Algorithms/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go b/leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go similarity index 100% rename from Algorithms/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go rename to leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go diff --git a/Algorithms/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go b/leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go similarity index 100% rename from Algorithms/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go rename to leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go diff --git a/Algorithms/0386.Lexicographical-Numbers/README.md b/leetcode/0386.Lexicographical-Numbers/README.md similarity index 100% rename from Algorithms/0386.Lexicographical-Numbers/README.md rename to leetcode/0386.Lexicographical-Numbers/README.md diff --git a/Algorithms/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go b/leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go similarity index 100% rename from Algorithms/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go rename to leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go diff --git a/Algorithms/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go b/leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go similarity index 100% rename from Algorithms/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go rename to leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go diff --git a/Algorithms/0387.First-Unique-Character-in-a-String/README.md b/leetcode/0387.First-Unique-Character-in-a-String/README.md similarity index 100% rename from Algorithms/0387.First-Unique-Character-in-a-String/README.md rename to leetcode/0387.First-Unique-Character-in-a-String/README.md diff --git a/Algorithms/0389.Find-the-Difference/389. Find the Difference.go b/leetcode/0389.Find-the-Difference/389. Find the Difference.go similarity index 100% rename from Algorithms/0389.Find-the-Difference/389. Find the Difference.go rename to leetcode/0389.Find-the-Difference/389. Find the Difference.go diff --git a/Algorithms/0389.Find-the-Difference/389. Find the Difference_test.go b/leetcode/0389.Find-the-Difference/389. Find the Difference_test.go similarity index 100% rename from Algorithms/0389.Find-the-Difference/389. Find the Difference_test.go rename to leetcode/0389.Find-the-Difference/389. Find the Difference_test.go diff --git a/Algorithms/0389.Find-the-Difference/README.md b/leetcode/0389.Find-the-Difference/README.md similarity index 100% rename from Algorithms/0389.Find-the-Difference/README.md rename to leetcode/0389.Find-the-Difference/README.md diff --git a/Algorithms/0392.Is-Subsequence/392. Is Subsequence.go b/leetcode/0392.Is-Subsequence/392. Is Subsequence.go similarity index 100% rename from Algorithms/0392.Is-Subsequence/392. Is Subsequence.go rename to leetcode/0392.Is-Subsequence/392. Is Subsequence.go diff --git a/Algorithms/0392.Is-Subsequence/392. Is Subsequence_test.go b/leetcode/0392.Is-Subsequence/392. Is Subsequence_test.go similarity index 100% rename from Algorithms/0392.Is-Subsequence/392. Is Subsequence_test.go rename to leetcode/0392.Is-Subsequence/392. Is Subsequence_test.go diff --git a/Algorithms/0392.Is-Subsequence/README.md b/leetcode/0392.Is-Subsequence/README.md similarity index 100% rename from Algorithms/0392.Is-Subsequence/README.md rename to leetcode/0392.Is-Subsequence/README.md diff --git a/Algorithms/0393.UTF-8-Validation/393. UTF-8 Validation.go b/leetcode/0393.UTF-8-Validation/393. UTF-8 Validation.go similarity index 100% rename from Algorithms/0393.UTF-8-Validation/393. UTF-8 Validation.go rename to leetcode/0393.UTF-8-Validation/393. UTF-8 Validation.go diff --git a/Algorithms/0393.UTF-8-Validation/393. UTF-8 Validation_test.go b/leetcode/0393.UTF-8-Validation/393. UTF-8 Validation_test.go similarity index 100% rename from Algorithms/0393.UTF-8-Validation/393. UTF-8 Validation_test.go rename to leetcode/0393.UTF-8-Validation/393. UTF-8 Validation_test.go diff --git a/Algorithms/0393.UTF-8-Validation/README.md b/leetcode/0393.UTF-8-Validation/README.md similarity index 100% rename from Algorithms/0393.UTF-8-Validation/README.md rename to leetcode/0393.UTF-8-Validation/README.md diff --git a/Algorithms/0394.Decode-String/394. Decode String.go b/leetcode/0394.Decode-String/394. Decode String.go similarity index 100% rename from Algorithms/0394.Decode-String/394. Decode String.go rename to leetcode/0394.Decode-String/394. Decode String.go diff --git a/Algorithms/0394.Decode-String/394. Decode String_test.go b/leetcode/0394.Decode-String/394. Decode String_test.go similarity index 100% rename from Algorithms/0394.Decode-String/394. Decode String_test.go rename to leetcode/0394.Decode-String/394. Decode String_test.go diff --git a/Algorithms/0394.Decode-String/README.md b/leetcode/0394.Decode-String/README.md similarity index 100% rename from Algorithms/0394.Decode-String/README.md rename to leetcode/0394.Decode-String/README.md diff --git a/Algorithms/0397.Integer-Replacement/397. Integer Replacement.go b/leetcode/0397.Integer-Replacement/397. Integer Replacement.go similarity index 100% rename from Algorithms/0397.Integer-Replacement/397. Integer Replacement.go rename to leetcode/0397.Integer-Replacement/397. Integer Replacement.go diff --git a/Algorithms/0397.Integer-Replacement/397. Integer Replacement_test.go b/leetcode/0397.Integer-Replacement/397. Integer Replacement_test.go similarity index 100% rename from Algorithms/0397.Integer-Replacement/397. Integer Replacement_test.go rename to leetcode/0397.Integer-Replacement/397. Integer Replacement_test.go diff --git a/Algorithms/0397.Integer-Replacement/README.md b/leetcode/0397.Integer-Replacement/README.md similarity index 100% rename from Algorithms/0397.Integer-Replacement/README.md rename to leetcode/0397.Integer-Replacement/README.md diff --git a/Algorithms/0399.Evaluate-Division/399. Evaluate Division.go b/leetcode/0399.Evaluate-Division/399. Evaluate Division.go similarity index 100% rename from Algorithms/0399.Evaluate-Division/399. Evaluate Division.go rename to leetcode/0399.Evaluate-Division/399. Evaluate Division.go diff --git a/Algorithms/0399.Evaluate-Division/399. Evaluate Division_test.go b/leetcode/0399.Evaluate-Division/399. Evaluate Division_test.go similarity index 100% rename from Algorithms/0399.Evaluate-Division/399. Evaluate Division_test.go rename to leetcode/0399.Evaluate-Division/399. Evaluate Division_test.go diff --git a/Algorithms/0399.Evaluate-Division/README.md b/leetcode/0399.Evaluate-Division/README.md similarity index 100% rename from Algorithms/0399.Evaluate-Division/README.md rename to leetcode/0399.Evaluate-Division/README.md diff --git a/Algorithms/0401.Binary-Watch/401. Binary Watch.go b/leetcode/0401.Binary-Watch/401. Binary Watch.go similarity index 100% rename from Algorithms/0401.Binary-Watch/401. Binary Watch.go rename to leetcode/0401.Binary-Watch/401. Binary Watch.go diff --git a/Algorithms/0401.Binary-Watch/401. Binary Watch_test.go b/leetcode/0401.Binary-Watch/401. Binary Watch_test.go similarity index 100% rename from Algorithms/0401.Binary-Watch/401. Binary Watch_test.go rename to leetcode/0401.Binary-Watch/401. Binary Watch_test.go diff --git a/Algorithms/0401.Binary-Watch/README.md b/leetcode/0401.Binary-Watch/README.md similarity index 100% rename from Algorithms/0401.Binary-Watch/README.md rename to leetcode/0401.Binary-Watch/README.md diff --git a/Algorithms/0402.Remove-K-Digits/402. Remove K Digits.go b/leetcode/0402.Remove-K-Digits/402. Remove K Digits.go similarity index 100% rename from Algorithms/0402.Remove-K-Digits/402. Remove K Digits.go rename to leetcode/0402.Remove-K-Digits/402. Remove K Digits.go diff --git a/Algorithms/0402.Remove-K-Digits/402. Remove K Digits_test.go b/leetcode/0402.Remove-K-Digits/402. Remove K Digits_test.go similarity index 100% rename from Algorithms/0402.Remove-K-Digits/402. Remove K Digits_test.go rename to leetcode/0402.Remove-K-Digits/402. Remove K Digits_test.go diff --git a/Algorithms/0402.Remove-K-Digits/README.md b/leetcode/0402.Remove-K-Digits/README.md similarity index 100% rename from Algorithms/0402.Remove-K-Digits/README.md rename to leetcode/0402.Remove-K-Digits/README.md diff --git a/Algorithms/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go b/leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go similarity index 100% rename from Algorithms/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go rename to leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go diff --git a/Algorithms/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go b/leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go similarity index 100% rename from Algorithms/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go rename to leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go diff --git a/Algorithms/0404.Sum-of-Left-Leaves/README.md b/leetcode/0404.Sum-of-Left-Leaves/README.md similarity index 100% rename from Algorithms/0404.Sum-of-Left-Leaves/README.md rename to leetcode/0404.Sum-of-Left-Leaves/README.md diff --git a/Algorithms/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go b/leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go similarity index 100% rename from Algorithms/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go rename to leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go diff --git a/Algorithms/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go b/leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go similarity index 100% rename from Algorithms/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go rename to leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go diff --git a/Algorithms/0405.Convert-a-Number-to-Hexadecimal/README.md b/leetcode/0405.Convert-a-Number-to-Hexadecimal/README.md similarity index 100% rename from Algorithms/0405.Convert-a-Number-to-Hexadecimal/README.md rename to leetcode/0405.Convert-a-Number-to-Hexadecimal/README.md diff --git a/Algorithms/0409.Longest-Palindrome/409. Longest Palindrome.go b/leetcode/0409.Longest-Palindrome/409. Longest Palindrome.go similarity index 100% rename from Algorithms/0409.Longest-Palindrome/409. Longest Palindrome.go rename to leetcode/0409.Longest-Palindrome/409. Longest Palindrome.go diff --git a/Algorithms/0409.Longest-Palindrome/409. Longest Palindrome_test.go b/leetcode/0409.Longest-Palindrome/409. Longest Palindrome_test.go similarity index 100% rename from Algorithms/0409.Longest-Palindrome/409. Longest Palindrome_test.go rename to leetcode/0409.Longest-Palindrome/409. Longest Palindrome_test.go diff --git a/Algorithms/0409.Longest-Palindrome/README.md b/leetcode/0409.Longest-Palindrome/README.md similarity index 100% rename from Algorithms/0409.Longest-Palindrome/README.md rename to leetcode/0409.Longest-Palindrome/README.md diff --git a/Algorithms/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go b/leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go similarity index 100% rename from Algorithms/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go rename to leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go diff --git a/Algorithms/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go b/leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go similarity index 100% rename from Algorithms/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go rename to leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go diff --git a/Algorithms/0410.Split-Array-Largest-Sum/README.md b/leetcode/0410.Split-Array-Largest-Sum/README.md similarity index 100% rename from Algorithms/0410.Split-Array-Largest-Sum/README.md rename to leetcode/0410.Split-Array-Largest-Sum/README.md diff --git a/Algorithms/0412.Fizz-Buzz/412. Fizz Buzz.go b/leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go similarity index 100% rename from Algorithms/0412.Fizz-Buzz/412. Fizz Buzz.go rename to leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go diff --git a/Algorithms/0412.Fizz-Buzz/412. Fizz Buzz_test.go b/leetcode/0412.Fizz-Buzz/412. Fizz Buzz_test.go similarity index 100% rename from Algorithms/0412.Fizz-Buzz/412. Fizz Buzz_test.go rename to leetcode/0412.Fizz-Buzz/412. Fizz Buzz_test.go diff --git a/Algorithms/0412.Fizz-Buzz/README.md b/leetcode/0412.Fizz-Buzz/README.md similarity index 100% rename from Algorithms/0412.Fizz-Buzz/README.md rename to leetcode/0412.Fizz-Buzz/README.md diff --git a/Algorithms/0414.Third-Maximum-Number/414. Third Maximum Number.go b/leetcode/0414.Third-Maximum-Number/414. Third Maximum Number.go similarity index 100% rename from Algorithms/0414.Third-Maximum-Number/414. Third Maximum Number.go rename to leetcode/0414.Third-Maximum-Number/414. Third Maximum Number.go diff --git a/Algorithms/0414.Third-Maximum-Number/414. Third Maximum Number_test.go b/leetcode/0414.Third-Maximum-Number/414. Third Maximum Number_test.go similarity index 100% rename from Algorithms/0414.Third-Maximum-Number/414. Third Maximum Number_test.go rename to leetcode/0414.Third-Maximum-Number/414. Third Maximum Number_test.go diff --git a/Algorithms/0414.Third-Maximum-Number/README.md b/leetcode/0414.Third-Maximum-Number/README.md similarity index 100% rename from Algorithms/0414.Third-Maximum-Number/README.md rename to leetcode/0414.Third-Maximum-Number/README.md diff --git a/Algorithms/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go b/leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go similarity index 100% rename from Algorithms/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go rename to leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go diff --git a/Algorithms/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go b/leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go similarity index 100% rename from Algorithms/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go rename to leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go diff --git a/Algorithms/0416.Partition-Equal-Subset-Sum/README.md b/leetcode/0416.Partition-Equal-Subset-Sum/README.md similarity index 100% rename from Algorithms/0416.Partition-Equal-Subset-Sum/README.md rename to leetcode/0416.Partition-Equal-Subset-Sum/README.md diff --git a/Algorithms/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go b/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go similarity index 100% rename from Algorithms/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go rename to leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go diff --git a/Algorithms/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go b/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go similarity index 100% rename from Algorithms/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go rename to leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go diff --git a/Algorithms/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md b/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md similarity index 100% rename from Algorithms/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md rename to leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md diff --git a/Algorithms/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go b/leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go similarity index 100% rename from Algorithms/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go rename to leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go diff --git a/Algorithms/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go b/leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go similarity index 100% rename from Algorithms/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go rename to leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go diff --git a/Algorithms/0424.Longest-Repeating-Character-Replacement/README.md b/leetcode/0424.Longest-Repeating-Character-Replacement/README.md similarity index 100% rename from Algorithms/0424.Longest-Repeating-Character-Replacement/README.md rename to leetcode/0424.Longest-Repeating-Character-Replacement/README.md diff --git a/Algorithms/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go b/leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go similarity index 100% rename from Algorithms/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go rename to leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go diff --git a/Algorithms/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go b/leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go similarity index 100% rename from Algorithms/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go rename to leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go diff --git a/Algorithms/0433.Minimum-Genetic-Mutation/README.md b/leetcode/0433.Minimum-Genetic-Mutation/README.md similarity index 100% rename from Algorithms/0433.Minimum-Genetic-Mutation/README.md rename to leetcode/0433.Minimum-Genetic-Mutation/README.md diff --git a/Algorithms/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go b/leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go similarity index 100% rename from Algorithms/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go rename to leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go diff --git a/Algorithms/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go b/leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go similarity index 100% rename from Algorithms/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go rename to leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go diff --git a/Algorithms/0435.Non-overlapping-Intervals/README.md b/leetcode/0435.Non-overlapping-Intervals/README.md similarity index 100% rename from Algorithms/0435.Non-overlapping-Intervals/README.md rename to leetcode/0435.Non-overlapping-Intervals/README.md diff --git a/Algorithms/0436.Find-Right-Interval/436. Find Right Interval.go b/leetcode/0436.Find-Right-Interval/436. Find Right Interval.go similarity index 100% rename from Algorithms/0436.Find-Right-Interval/436. Find Right Interval.go rename to leetcode/0436.Find-Right-Interval/436. Find Right Interval.go diff --git a/Algorithms/0436.Find-Right-Interval/436. Find Right Interval_test.go b/leetcode/0436.Find-Right-Interval/436. Find Right Interval_test.go similarity index 100% rename from Algorithms/0436.Find-Right-Interval/436. Find Right Interval_test.go rename to leetcode/0436.Find-Right-Interval/436. Find Right Interval_test.go diff --git a/Algorithms/0436.Find-Right-Interval/README.md b/leetcode/0436.Find-Right-Interval/README.md similarity index 100% rename from Algorithms/0436.Find-Right-Interval/README.md rename to leetcode/0436.Find-Right-Interval/README.md diff --git a/Algorithms/0437.Path-Sum-III/437. Path Sum III.go b/leetcode/0437.Path-Sum-III/437. Path Sum III.go similarity index 100% rename from Algorithms/0437.Path-Sum-III/437. Path Sum III.go rename to leetcode/0437.Path-Sum-III/437. Path Sum III.go diff --git a/Algorithms/0437.Path-Sum-III/437. Path Sum III_test.go b/leetcode/0437.Path-Sum-III/437. Path Sum III_test.go similarity index 100% rename from Algorithms/0437.Path-Sum-III/437. Path Sum III_test.go rename to leetcode/0437.Path-Sum-III/437. Path Sum III_test.go diff --git a/Algorithms/0437.Path-Sum-III/README.md b/leetcode/0437.Path-Sum-III/README.md similarity index 100% rename from Algorithms/0437.Path-Sum-III/README.md rename to leetcode/0437.Path-Sum-III/README.md diff --git a/Algorithms/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go b/leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go similarity index 100% rename from Algorithms/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go rename to leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go diff --git a/Algorithms/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go b/leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go similarity index 100% rename from Algorithms/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go rename to leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go diff --git a/Algorithms/0438.Find-All-Anagrams-in-a-String/README.md b/leetcode/0438.Find-All-Anagrams-in-a-String/README.md similarity index 100% rename from Algorithms/0438.Find-All-Anagrams-in-a-String/README.md rename to leetcode/0438.Find-All-Anagrams-in-a-String/README.md diff --git a/Algorithms/0441.Arranging-Coins/441. Arranging Coins.go b/leetcode/0441.Arranging-Coins/441. Arranging Coins.go similarity index 100% rename from Algorithms/0441.Arranging-Coins/441. Arranging Coins.go rename to leetcode/0441.Arranging-Coins/441. Arranging Coins.go diff --git a/Algorithms/0441.Arranging-Coins/441. Arranging Coins_test.go b/leetcode/0441.Arranging-Coins/441. Arranging Coins_test.go similarity index 100% rename from Algorithms/0441.Arranging-Coins/441. Arranging Coins_test.go rename to leetcode/0441.Arranging-Coins/441. Arranging Coins_test.go diff --git a/Algorithms/0441.Arranging-Coins/README.md b/leetcode/0441.Arranging-Coins/README.md similarity index 100% rename from Algorithms/0441.Arranging-Coins/README.md rename to leetcode/0441.Arranging-Coins/README.md diff --git a/Algorithms/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go b/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go similarity index 100% rename from Algorithms/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go rename to leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go diff --git a/Algorithms/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go b/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go similarity index 100% rename from Algorithms/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go rename to leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go diff --git a/Algorithms/0445.Add-Two-Numbers-II/README.md b/leetcode/0445.Add-Two-Numbers-II/README.md similarity index 100% rename from Algorithms/0445.Add-Two-Numbers-II/README.md rename to leetcode/0445.Add-Two-Numbers-II/README.md diff --git a/Algorithms/0447.Number-of-Boomerangs/447. Number of Boomerangs.go b/leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs.go similarity index 100% rename from Algorithms/0447.Number-of-Boomerangs/447. Number of Boomerangs.go rename to leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs.go diff --git a/Algorithms/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go b/leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go similarity index 100% rename from Algorithms/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go rename to leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go diff --git a/Algorithms/0447.Number-of-Boomerangs/README.md b/leetcode/0447.Number-of-Boomerangs/README.md similarity index 100% rename from Algorithms/0447.Number-of-Boomerangs/README.md rename to leetcode/0447.Number-of-Boomerangs/README.md diff --git a/Algorithms/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go b/leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go similarity index 100% rename from Algorithms/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go rename to leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go diff --git a/Algorithms/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go b/leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go similarity index 100% rename from Algorithms/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go rename to leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go diff --git a/Algorithms/0451.Sort-Characters-By-Frequency/README.md b/leetcode/0451.Sort-Characters-By-Frequency/README.md similarity index 100% rename from Algorithms/0451.Sort-Characters-By-Frequency/README.md rename to leetcode/0451.Sort-Characters-By-Frequency/README.md diff --git a/Algorithms/0454.4Sum-II/454. 4Sum II.go b/leetcode/0454.4Sum-II/454. 4Sum II.go similarity index 100% rename from Algorithms/0454.4Sum-II/454. 4Sum II.go rename to leetcode/0454.4Sum-II/454. 4Sum II.go diff --git a/Algorithms/0454.4Sum-II/454. 4Sum II_test.go b/leetcode/0454.4Sum-II/454. 4Sum II_test.go similarity index 100% rename from Algorithms/0454.4Sum-II/454. 4Sum II_test.go rename to leetcode/0454.4Sum-II/454. 4Sum II_test.go diff --git a/Algorithms/0454.4Sum-II/README.md b/leetcode/0454.4Sum-II/README.md similarity index 100% rename from Algorithms/0454.4Sum-II/README.md rename to leetcode/0454.4Sum-II/README.md diff --git a/Algorithms/0455.Assign-Cookies/455. Assign Cookies.go b/leetcode/0455.Assign-Cookies/455. Assign Cookies.go similarity index 100% rename from Algorithms/0455.Assign-Cookies/455. Assign Cookies.go rename to leetcode/0455.Assign-Cookies/455. Assign Cookies.go diff --git a/Algorithms/0455.Assign-Cookies/455. Assign Cookies_test.go b/leetcode/0455.Assign-Cookies/455. Assign Cookies_test.go similarity index 100% rename from Algorithms/0455.Assign-Cookies/455. Assign Cookies_test.go rename to leetcode/0455.Assign-Cookies/455. Assign Cookies_test.go diff --git a/Algorithms/0455.Assign-Cookies/README.md b/leetcode/0455.Assign-Cookies/README.md similarity index 100% rename from Algorithms/0455.Assign-Cookies/README.md rename to leetcode/0455.Assign-Cookies/README.md diff --git a/Algorithms/0456.132-Pattern/456. 132 Pattern.go b/leetcode/0456.132-Pattern/456. 132 Pattern.go similarity index 100% rename from Algorithms/0456.132-Pattern/456. 132 Pattern.go rename to leetcode/0456.132-Pattern/456. 132 Pattern.go diff --git a/Algorithms/0456.132-Pattern/456. 132 Pattern_test.go b/leetcode/0456.132-Pattern/456. 132 Pattern_test.go similarity index 100% rename from Algorithms/0456.132-Pattern/456. 132 Pattern_test.go rename to leetcode/0456.132-Pattern/456. 132 Pattern_test.go diff --git a/Algorithms/0456.132-Pattern/README.md b/leetcode/0456.132-Pattern/README.md similarity index 100% rename from Algorithms/0456.132-Pattern/README.md rename to leetcode/0456.132-Pattern/README.md diff --git a/Algorithms/0457.Circular-Array-Loop/457. Circular Array Loop.go b/leetcode/0457.Circular-Array-Loop/457. Circular Array Loop.go similarity index 100% rename from Algorithms/0457.Circular-Array-Loop/457. Circular Array Loop.go rename to leetcode/0457.Circular-Array-Loop/457. Circular Array Loop.go diff --git a/Algorithms/0457.Circular-Array-Loop/457. Circular Array Loop_test.go b/leetcode/0457.Circular-Array-Loop/457. Circular Array Loop_test.go similarity index 100% rename from Algorithms/0457.Circular-Array-Loop/457. Circular Array Loop_test.go rename to leetcode/0457.Circular-Array-Loop/457. Circular Array Loop_test.go diff --git a/Algorithms/0457.Circular-Array-Loop/README.md b/leetcode/0457.Circular-Array-Loop/README.md similarity index 100% rename from Algorithms/0457.Circular-Array-Loop/README.md rename to leetcode/0457.Circular-Array-Loop/README.md diff --git a/Algorithms/0461.Hamming-Distance/461. Hamming Distance.go b/leetcode/0461.Hamming-Distance/461. Hamming Distance.go similarity index 100% rename from Algorithms/0461.Hamming-Distance/461. Hamming Distance.go rename to leetcode/0461.Hamming-Distance/461. Hamming Distance.go diff --git a/Algorithms/0461.Hamming-Distance/461. Hamming Distance_test.go b/leetcode/0461.Hamming-Distance/461. Hamming Distance_test.go similarity index 100% rename from Algorithms/0461.Hamming-Distance/461. Hamming Distance_test.go rename to leetcode/0461.Hamming-Distance/461. Hamming Distance_test.go diff --git a/Algorithms/0461.Hamming-Distance/README.md b/leetcode/0461.Hamming-Distance/README.md similarity index 100% rename from Algorithms/0461.Hamming-Distance/README.md rename to leetcode/0461.Hamming-Distance/README.md diff --git a/Algorithms/0463.Island-Perimeter/463. Island Perimeter.go b/leetcode/0463.Island-Perimeter/463. Island Perimeter.go similarity index 100% rename from Algorithms/0463.Island-Perimeter/463. Island Perimeter.go rename to leetcode/0463.Island-Perimeter/463. Island Perimeter.go diff --git a/Algorithms/0463.Island-Perimeter/463. Island Perimeter_test.go b/leetcode/0463.Island-Perimeter/463. Island Perimeter_test.go similarity index 100% rename from Algorithms/0463.Island-Perimeter/463. Island Perimeter_test.go rename to leetcode/0463.Island-Perimeter/463. Island Perimeter_test.go diff --git a/Algorithms/0463.Island-Perimeter/README.md b/leetcode/0463.Island-Perimeter/README.md similarity index 100% rename from Algorithms/0463.Island-Perimeter/README.md rename to leetcode/0463.Island-Perimeter/README.md diff --git a/Algorithms/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go b/leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go similarity index 100% rename from Algorithms/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go rename to leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go diff --git a/Algorithms/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go b/leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go similarity index 100% rename from Algorithms/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go rename to leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go diff --git a/Algorithms/0470.Implement-Rand10-Using-Rand7/README.md b/leetcode/0470.Implement-Rand10-Using-Rand7/README.md similarity index 100% rename from Algorithms/0470.Implement-Rand10-Using-Rand7/README.md rename to leetcode/0470.Implement-Rand10-Using-Rand7/README.md diff --git a/Algorithms/0474.Ones-and-Zeroes/474. Ones and Zeroes.go b/leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes.go similarity index 100% rename from Algorithms/0474.Ones-and-Zeroes/474. Ones and Zeroes.go rename to leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes.go diff --git a/Algorithms/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go b/leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go similarity index 100% rename from Algorithms/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go rename to leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go diff --git a/Algorithms/0474.Ones-and-Zeroes/README.md b/leetcode/0474.Ones-and-Zeroes/README.md similarity index 100% rename from Algorithms/0474.Ones-and-Zeroes/README.md rename to leetcode/0474.Ones-and-Zeroes/README.md diff --git a/Algorithms/0475.Heaters/475. Heaters.go b/leetcode/0475.Heaters/475. Heaters.go similarity index 100% rename from Algorithms/0475.Heaters/475. Heaters.go rename to leetcode/0475.Heaters/475. Heaters.go diff --git a/Algorithms/0475.Heaters/475. Heaters_test.go b/leetcode/0475.Heaters/475. Heaters_test.go similarity index 100% rename from Algorithms/0475.Heaters/475. Heaters_test.go rename to leetcode/0475.Heaters/475. Heaters_test.go diff --git a/Algorithms/0475.Heaters/README.md b/leetcode/0475.Heaters/README.md similarity index 100% rename from Algorithms/0475.Heaters/README.md rename to leetcode/0475.Heaters/README.md diff --git a/Algorithms/0476.Number-Complement/476. Number Complement.go b/leetcode/0476.Number-Complement/476. Number Complement.go similarity index 100% rename from Algorithms/0476.Number-Complement/476. Number Complement.go rename to leetcode/0476.Number-Complement/476. Number Complement.go diff --git a/Algorithms/0476.Number-Complement/476. Number Complement_test.go b/leetcode/0476.Number-Complement/476. Number Complement_test.go similarity index 100% rename from Algorithms/0476.Number-Complement/476. Number Complement_test.go rename to leetcode/0476.Number-Complement/476. Number Complement_test.go diff --git a/Algorithms/0476.Number-Complement/README.md b/leetcode/0476.Number-Complement/README.md similarity index 100% rename from Algorithms/0476.Number-Complement/README.md rename to leetcode/0476.Number-Complement/README.md diff --git a/Algorithms/0477.Total-Hamming-Distance/477. Total Hamming Distance.go b/leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance.go similarity index 100% rename from Algorithms/0477.Total-Hamming-Distance/477. Total Hamming Distance.go rename to leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance.go diff --git a/Algorithms/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go b/leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go similarity index 100% rename from Algorithms/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go rename to leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go diff --git a/Algorithms/0477.Total-Hamming-Distance/README.md b/leetcode/0477.Total-Hamming-Distance/README.md similarity index 100% rename from Algorithms/0477.Total-Hamming-Distance/README.md rename to leetcode/0477.Total-Hamming-Distance/README.md diff --git a/Algorithms/0480.Sliding-Window-Median/480. Sliding Window Median.go b/leetcode/0480.Sliding-Window-Median/480. Sliding Window Median.go similarity index 100% rename from Algorithms/0480.Sliding-Window-Median/480. Sliding Window Median.go rename to leetcode/0480.Sliding-Window-Median/480. Sliding Window Median.go diff --git a/Algorithms/0480.Sliding-Window-Median/480. Sliding Window Median_test.go b/leetcode/0480.Sliding-Window-Median/480. Sliding Window Median_test.go similarity index 100% rename from Algorithms/0480.Sliding-Window-Median/480. Sliding Window Median_test.go rename to leetcode/0480.Sliding-Window-Median/480. Sliding Window Median_test.go diff --git a/Algorithms/0480.Sliding-Window-Median/README.md b/leetcode/0480.Sliding-Window-Median/README.md similarity index 100% rename from Algorithms/0480.Sliding-Window-Median/README.md rename to leetcode/0480.Sliding-Window-Median/README.md diff --git a/Algorithms/0483.Smallest-Good-Base/483. Smallest Good Base.go b/leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go similarity index 100% rename from Algorithms/0483.Smallest-Good-Base/483. Smallest Good Base.go rename to leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go diff --git a/Algorithms/0483.Smallest-Good-Base/483. Smallest Good Base_test.go b/leetcode/0483.Smallest-Good-Base/483. Smallest Good Base_test.go similarity index 100% rename from Algorithms/0483.Smallest-Good-Base/483. Smallest Good Base_test.go rename to leetcode/0483.Smallest-Good-Base/483. Smallest Good Base_test.go diff --git a/Algorithms/0483.Smallest-Good-Base/README.md b/leetcode/0483.Smallest-Good-Base/README.md similarity index 100% rename from Algorithms/0483.Smallest-Good-Base/README.md rename to leetcode/0483.Smallest-Good-Base/README.md diff --git a/Algorithms/0491.Increasing-Subsequences/491. Increasing Subsequences.go b/leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences.go similarity index 100% rename from Algorithms/0491.Increasing-Subsequences/491. Increasing Subsequences.go rename to leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences.go diff --git a/Algorithms/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go b/leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go similarity index 100% rename from Algorithms/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go rename to leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go diff --git a/Algorithms/0491.Increasing-Subsequences/README.md b/leetcode/0491.Increasing-Subsequences/README.md similarity index 100% rename from Algorithms/0491.Increasing-Subsequences/README.md rename to leetcode/0491.Increasing-Subsequences/README.md diff --git a/Algorithms/0493.Reverse-Pairs/493. Reverse Pairs.go b/leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go similarity index 100% rename from Algorithms/0493.Reverse-Pairs/493. Reverse Pairs.go rename to leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go diff --git a/Algorithms/0493.Reverse-Pairs/493. Reverse Pairs_test.go b/leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go similarity index 100% rename from Algorithms/0493.Reverse-Pairs/493. Reverse Pairs_test.go rename to leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go diff --git a/Algorithms/0493.Reverse-Pairs/README.md b/leetcode/0493.Reverse-Pairs/README.md similarity index 100% rename from Algorithms/0493.Reverse-Pairs/README.md rename to leetcode/0493.Reverse-Pairs/README.md diff --git a/Algorithms/0494.Target-Sum/494. Target Sum.go b/leetcode/0494.Target-Sum/494. Target Sum.go similarity index 100% rename from Algorithms/0494.Target-Sum/494. Target Sum.go rename to leetcode/0494.Target-Sum/494. Target Sum.go diff --git a/Algorithms/0494.Target-Sum/494. Target Sum_test.go b/leetcode/0494.Target-Sum/494. Target Sum_test.go similarity index 100% rename from Algorithms/0494.Target-Sum/494. Target Sum_test.go rename to leetcode/0494.Target-Sum/494. Target Sum_test.go diff --git a/Algorithms/0494.Target-Sum/README.md b/leetcode/0494.Target-Sum/README.md similarity index 100% rename from Algorithms/0494.Target-Sum/README.md rename to leetcode/0494.Target-Sum/README.md diff --git a/Algorithms/0496.Next-Greater-Element-I/496. Next Greater Element I.go b/leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I.go similarity index 100% rename from Algorithms/0496.Next-Greater-Element-I/496. Next Greater Element I.go rename to leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I.go diff --git a/Algorithms/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go b/leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go similarity index 100% rename from Algorithms/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go rename to leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go diff --git a/Algorithms/0496.Next-Greater-Element-I/README.md b/leetcode/0496.Next-Greater-Element-I/README.md similarity index 100% rename from Algorithms/0496.Next-Greater-Element-I/README.md rename to leetcode/0496.Next-Greater-Element-I/README.md diff --git a/Algorithms/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go b/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go similarity index 100% rename from Algorithms/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go rename to leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go diff --git a/Algorithms/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go b/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go similarity index 100% rename from Algorithms/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go rename to leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go diff --git a/Algorithms/0497.Random-Point-in-Non-overlapping-Rectangles/README.md b/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/README.md similarity index 100% rename from Algorithms/0497.Random-Point-in-Non-overlapping-Rectangles/README.md rename to leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/README.md diff --git a/Algorithms/0498.Diagonal-Traverse/498. Diagonal Traverse.go b/leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse.go similarity index 100% rename from Algorithms/0498.Diagonal-Traverse/498. Diagonal Traverse.go rename to leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse.go diff --git a/Algorithms/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go b/leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go similarity index 100% rename from Algorithms/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go rename to leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go diff --git a/Algorithms/0498.Diagonal-Traverse/README.md b/leetcode/0498.Diagonal-Traverse/README.md similarity index 100% rename from Algorithms/0498.Diagonal-Traverse/README.md rename to leetcode/0498.Diagonal-Traverse/README.md diff --git a/Algorithms/0500.Keyboard-Row/500. Keyboard Row.go b/leetcode/0500.Keyboard-Row/500. Keyboard Row.go similarity index 100% rename from Algorithms/0500.Keyboard-Row/500. Keyboard Row.go rename to leetcode/0500.Keyboard-Row/500. Keyboard Row.go diff --git a/Algorithms/0500.Keyboard-Row/500. Keyboard Row_test.go b/leetcode/0500.Keyboard-Row/500. Keyboard Row_test.go similarity index 100% rename from Algorithms/0500.Keyboard-Row/500. Keyboard Row_test.go rename to leetcode/0500.Keyboard-Row/500. Keyboard Row_test.go diff --git a/Algorithms/0500.Keyboard-Row/README.md b/leetcode/0500.Keyboard-Row/README.md similarity index 100% rename from Algorithms/0500.Keyboard-Row/README.md rename to leetcode/0500.Keyboard-Row/README.md diff --git a/Algorithms/0503.Next-Greater-Element-II/503. Next Greater Element II.go b/leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II.go similarity index 100% rename from Algorithms/0503.Next-Greater-Element-II/503. Next Greater Element II.go rename to leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II.go diff --git a/Algorithms/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go b/leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go similarity index 100% rename from Algorithms/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go rename to leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go diff --git a/Algorithms/0503.Next-Greater-Element-II/README.md b/leetcode/0503.Next-Greater-Element-II/README.md similarity index 100% rename from Algorithms/0503.Next-Greater-Element-II/README.md rename to leetcode/0503.Next-Greater-Element-II/README.md diff --git a/Algorithms/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go b/leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go similarity index 100% rename from Algorithms/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go rename to leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go diff --git a/Algorithms/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go b/leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go similarity index 100% rename from Algorithms/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go rename to leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go diff --git a/Algorithms/0508.Most-Frequent-Subtree-Sum/README.md b/leetcode/0508.Most-Frequent-Subtree-Sum/README.md similarity index 100% rename from Algorithms/0508.Most-Frequent-Subtree-Sum/README.md rename to leetcode/0508.Most-Frequent-Subtree-Sum/README.md diff --git a/Algorithms/0509.Fibonacci-Number/509. Fibonacci Number.go b/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go similarity index 100% rename from Algorithms/0509.Fibonacci-Number/509. Fibonacci Number.go rename to leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go diff --git a/Algorithms/0509.Fibonacci-Number/509. Fibonacci Number_test.go b/leetcode/0509.Fibonacci-Number/509. Fibonacci Number_test.go similarity index 100% rename from Algorithms/0509.Fibonacci-Number/509. Fibonacci Number_test.go rename to leetcode/0509.Fibonacci-Number/509. Fibonacci Number_test.go diff --git a/Algorithms/0509.Fibonacci-Number/README.md b/leetcode/0509.Fibonacci-Number/README.md similarity index 100% rename from Algorithms/0509.Fibonacci-Number/README.md rename to leetcode/0509.Fibonacci-Number/README.md diff --git a/Algorithms/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go b/leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go similarity index 100% rename from Algorithms/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go rename to leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go diff --git a/Algorithms/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go b/leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go similarity index 100% rename from Algorithms/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go rename to leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go diff --git a/Algorithms/0513.Find-Bottom-Left-Tree-Value/README.md b/leetcode/0513.Find-Bottom-Left-Tree-Value/README.md similarity index 100% rename from Algorithms/0513.Find-Bottom-Left-Tree-Value/README.md rename to leetcode/0513.Find-Bottom-Left-Tree-Value/README.md diff --git a/Algorithms/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go b/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go similarity index 100% rename from Algorithms/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go rename to leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go diff --git a/Algorithms/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go b/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go similarity index 100% rename from Algorithms/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go rename to leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go diff --git a/Algorithms/0515.Find-Largest-Value-in-Each-Tree-Row/README.md b/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/README.md similarity index 100% rename from Algorithms/0515.Find-Largest-Value-in-Each-Tree-Row/README.md rename to leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/README.md diff --git a/Algorithms/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go b/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go similarity index 100% rename from Algorithms/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go rename to leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go diff --git a/Algorithms/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go b/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go similarity index 100% rename from Algorithms/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go rename to leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go diff --git a/Algorithms/0524.Longest-Word-in-Dictionary-through-Deleting/README.md b/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/README.md similarity index 100% rename from Algorithms/0524.Longest-Word-in-Dictionary-through-Deleting/README.md rename to leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/README.md diff --git a/Algorithms/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go b/leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go similarity index 100% rename from Algorithms/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go rename to leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go diff --git a/Algorithms/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go b/leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go similarity index 100% rename from Algorithms/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go rename to leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go diff --git a/Algorithms/0526.Beautiful-Arrangement/README.md b/leetcode/0526.Beautiful-Arrangement/README.md similarity index 100% rename from Algorithms/0526.Beautiful-Arrangement/README.md rename to leetcode/0526.Beautiful-Arrangement/README.md diff --git a/Algorithms/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go b/leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go similarity index 100% rename from Algorithms/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go rename to leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go diff --git a/Algorithms/0528.Random-Pick-with-Weight/528. Random Pick with Weight_test.go b/leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight_test.go similarity index 100% rename from Algorithms/0528.Random-Pick-with-Weight/528. Random Pick with Weight_test.go rename to leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight_test.go diff --git a/Algorithms/0528.Random-Pick-with-Weight/README.md b/leetcode/0528.Random-Pick-with-Weight/README.md similarity index 100% rename from Algorithms/0528.Random-Pick-with-Weight/README.md rename to leetcode/0528.Random-Pick-with-Weight/README.md diff --git a/Algorithms/0529.Minesweeper/529. Minesweeper.go b/leetcode/0529.Minesweeper/529. Minesweeper.go similarity index 100% rename from Algorithms/0529.Minesweeper/529. Minesweeper.go rename to leetcode/0529.Minesweeper/529. Minesweeper.go diff --git a/Algorithms/0529.Minesweeper/529. Minesweeper_test.go b/leetcode/0529.Minesweeper/529. Minesweeper_test.go similarity index 100% rename from Algorithms/0529.Minesweeper/529. Minesweeper_test.go rename to leetcode/0529.Minesweeper/529. Minesweeper_test.go diff --git a/Algorithms/0529.Minesweeper/README.md b/leetcode/0529.Minesweeper/README.md similarity index 100% rename from Algorithms/0529.Minesweeper/README.md rename to leetcode/0529.Minesweeper/README.md diff --git a/Algorithms/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array.go b/leetcode/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array.go similarity index 100% rename from Algorithms/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array.go rename to leetcode/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array.go diff --git a/Algorithms/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array_test.go b/leetcode/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array_test.go similarity index 100% rename from Algorithms/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array_test.go rename to leetcode/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array_test.go diff --git a/Algorithms/0532.K-diff-Pairs-in-an-Array/README.md b/leetcode/0532.K-diff-Pairs-in-an-Array/README.md similarity index 100% rename from Algorithms/0532.K-diff-Pairs-in-an-Array/README.md rename to leetcode/0532.K-diff-Pairs-in-an-Array/README.md diff --git a/Algorithms/0541.Reverse-String-II/541. Reverse String II.go b/leetcode/0541.Reverse-String-II/541. Reverse String II.go similarity index 100% rename from Algorithms/0541.Reverse-String-II/541. Reverse String II.go rename to leetcode/0541.Reverse-String-II/541. Reverse String II.go diff --git a/Algorithms/0541.Reverse-String-II/541. Reverse String II_test.go b/leetcode/0541.Reverse-String-II/541. Reverse String II_test.go similarity index 100% rename from Algorithms/0541.Reverse-String-II/541. Reverse String II_test.go rename to leetcode/0541.Reverse-String-II/541. Reverse String II_test.go diff --git a/Algorithms/0541.Reverse-String-II/README.md b/leetcode/0541.Reverse-String-II/README.md similarity index 100% rename from Algorithms/0541.Reverse-String-II/README.md rename to leetcode/0541.Reverse-String-II/README.md diff --git a/Algorithms/0542.01-Matrix/542. 01 Matrix.go b/leetcode/0542.01-Matrix/542. 01 Matrix.go similarity index 100% rename from Algorithms/0542.01-Matrix/542. 01 Matrix.go rename to leetcode/0542.01-Matrix/542. 01 Matrix.go diff --git a/Algorithms/0542.01-Matrix/542. 01 Matrix_test.go b/leetcode/0542.01-Matrix/542. 01 Matrix_test.go similarity index 100% rename from Algorithms/0542.01-Matrix/542. 01 Matrix_test.go rename to leetcode/0542.01-Matrix/542. 01 Matrix_test.go diff --git a/Algorithms/0542.01-Matrix/README.md b/leetcode/0542.01-Matrix/README.md similarity index 100% rename from Algorithms/0542.01-Matrix/README.md rename to leetcode/0542.01-Matrix/README.md diff --git a/Algorithms/0547.Friend-Circles/547. Friend Circles.go b/leetcode/0547.Friend-Circles/547. Friend Circles.go similarity index 100% rename from Algorithms/0547.Friend-Circles/547. Friend Circles.go rename to leetcode/0547.Friend-Circles/547. Friend Circles.go diff --git a/Algorithms/0547.Friend-Circles/547. Friend Circles_test.go b/leetcode/0547.Friend-Circles/547. Friend Circles_test.go similarity index 100% rename from Algorithms/0547.Friend-Circles/547. Friend Circles_test.go rename to leetcode/0547.Friend-Circles/547. Friend Circles_test.go diff --git a/Algorithms/0547.Friend-Circles/README.md b/leetcode/0547.Friend-Circles/README.md similarity index 100% rename from Algorithms/0547.Friend-Circles/README.md rename to leetcode/0547.Friend-Circles/README.md diff --git a/Algorithms/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III.go b/leetcode/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III.go similarity index 100% rename from Algorithms/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III.go rename to leetcode/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III.go diff --git a/Algorithms/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III_test.go b/leetcode/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III_test.go similarity index 100% rename from Algorithms/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III_test.go rename to leetcode/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III_test.go diff --git a/Algorithms/0557.Reverse-Words-in-a-String-III/README.md b/leetcode/0557.Reverse-Words-in-a-String-III/README.md similarity index 100% rename from Algorithms/0557.Reverse-Words-in-a-String-III/README.md rename to leetcode/0557.Reverse-Words-in-a-String-III/README.md diff --git a/Algorithms/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go b/leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go similarity index 100% rename from Algorithms/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go rename to leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go diff --git a/Algorithms/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go b/leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go similarity index 100% rename from Algorithms/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go rename to leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go diff --git a/Algorithms/0563.Binary-Tree-Tilt/README.md b/leetcode/0563.Binary-Tree-Tilt/README.md similarity index 100% rename from Algorithms/0563.Binary-Tree-Tilt/README.md rename to leetcode/0563.Binary-Tree-Tilt/README.md diff --git a/Algorithms/0566.Reshape-the-Matrix/566. Reshape the Matrix.go b/leetcode/0566.Reshape-the-Matrix/566. Reshape the Matrix.go similarity index 100% rename from Algorithms/0566.Reshape-the-Matrix/566. Reshape the Matrix.go rename to leetcode/0566.Reshape-the-Matrix/566. Reshape the Matrix.go diff --git a/Algorithms/0566.Reshape-the-Matrix/566. Reshape the Matrix_test.go b/leetcode/0566.Reshape-the-Matrix/566. Reshape the Matrix_test.go similarity index 100% rename from Algorithms/0566.Reshape-the-Matrix/566. Reshape the Matrix_test.go rename to leetcode/0566.Reshape-the-Matrix/566. Reshape the Matrix_test.go diff --git a/Algorithms/0566.Reshape-the-Matrix/README.md b/leetcode/0566.Reshape-the-Matrix/README.md similarity index 100% rename from Algorithms/0566.Reshape-the-Matrix/README.md rename to leetcode/0566.Reshape-the-Matrix/README.md diff --git a/Algorithms/0567.Permutation-in-String/567. Permutation in String.go b/leetcode/0567.Permutation-in-String/567. Permutation in String.go similarity index 100% rename from Algorithms/0567.Permutation-in-String/567. Permutation in String.go rename to leetcode/0567.Permutation-in-String/567. Permutation in String.go diff --git a/Algorithms/0567.Permutation-in-String/567. Permutation in String_test.go b/leetcode/0567.Permutation-in-String/567. Permutation in String_test.go similarity index 100% rename from Algorithms/0567.Permutation-in-String/567. Permutation in String_test.go rename to leetcode/0567.Permutation-in-String/567. Permutation in String_test.go diff --git a/Algorithms/0567.Permutation-in-String/README.md b/leetcode/0567.Permutation-in-String/README.md similarity index 100% rename from Algorithms/0567.Permutation-in-String/README.md rename to leetcode/0567.Permutation-in-String/README.md diff --git a/Algorithms/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go b/leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go similarity index 100% rename from Algorithms/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go rename to leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go diff --git a/Algorithms/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go b/leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go similarity index 100% rename from Algorithms/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go rename to leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go diff --git a/Algorithms/0572.Subtree-of-Another-Tree/README.md b/leetcode/0572.Subtree-of-Another-Tree/README.md similarity index 100% rename from Algorithms/0572.Subtree-of-Another-Tree/README.md rename to leetcode/0572.Subtree-of-Another-Tree/README.md diff --git a/Algorithms/0575.Distribute-Candies/575. Distribute Candies.go b/leetcode/0575.Distribute-Candies/575. Distribute Candies.go similarity index 100% rename from Algorithms/0575.Distribute-Candies/575. Distribute Candies.go rename to leetcode/0575.Distribute-Candies/575. Distribute Candies.go diff --git a/Algorithms/0575.Distribute-Candies/575. Distribute Candies_test.go b/leetcode/0575.Distribute-Candies/575. Distribute Candies_test.go similarity index 100% rename from Algorithms/0575.Distribute-Candies/575. Distribute Candies_test.go rename to leetcode/0575.Distribute-Candies/575. Distribute Candies_test.go diff --git a/Algorithms/0575.Distribute-Candies/README.md b/leetcode/0575.Distribute-Candies/README.md similarity index 100% rename from Algorithms/0575.Distribute-Candies/README.md rename to leetcode/0575.Distribute-Candies/README.md diff --git a/Algorithms/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence.go b/leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence.go similarity index 100% rename from Algorithms/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence.go rename to leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence.go diff --git a/Algorithms/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go b/leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go similarity index 100% rename from Algorithms/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go rename to leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go diff --git a/Algorithms/0594.Longest-Harmonious-Subsequence/README.md b/leetcode/0594.Longest-Harmonious-Subsequence/README.md similarity index 100% rename from Algorithms/0594.Longest-Harmonious-Subsequence/README.md rename to leetcode/0594.Longest-Harmonious-Subsequence/README.md diff --git a/Algorithms/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists.go b/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists.go similarity index 100% rename from Algorithms/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists.go rename to leetcode/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists.go diff --git a/Algorithms/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists_test.go b/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists_test.go similarity index 100% rename from Algorithms/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists_test.go rename to leetcode/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists_test.go diff --git a/Algorithms/0599.Minimum-Index-Sum-of-Two-Lists/README.md b/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/README.md similarity index 100% rename from Algorithms/0599.Minimum-Index-Sum-of-Two-Lists/README.md rename to leetcode/0599.Minimum-Index-Sum-of-Two-Lists/README.md diff --git a/Algorithms/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go b/leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go similarity index 100% rename from Algorithms/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go rename to leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go diff --git a/Algorithms/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers_test.go b/leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers_test.go similarity index 100% rename from Algorithms/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers_test.go rename to leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers_test.go diff --git a/Algorithms/0628.Maximum-Product-of-Three-Numbers/README.md b/leetcode/0628.Maximum-Product-of-Three-Numbers/README.md similarity index 100% rename from Algorithms/0628.Maximum-Product-of-Three-Numbers/README.md rename to leetcode/0628.Maximum-Product-of-Three-Numbers/README.md diff --git a/Algorithms/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists.go b/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists.go similarity index 100% rename from Algorithms/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists.go rename to leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists.go diff --git a/Algorithms/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists_test.go b/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists_test.go similarity index 100% rename from Algorithms/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists_test.go rename to leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists_test.go diff --git a/Algorithms/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md b/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md similarity index 100% rename from Algorithms/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md rename to leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md diff --git a/Algorithms/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers.go b/leetcode/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers.go similarity index 100% rename from Algorithms/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers.go rename to leetcode/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers.go diff --git a/Algorithms/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers_test.go b/leetcode/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers_test.go similarity index 100% rename from Algorithms/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers_test.go rename to leetcode/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers_test.go diff --git a/Algorithms/0633.Sum-of-Square-Numbers/README.md b/leetcode/0633.Sum-of-Square-Numbers/README.md similarity index 100% rename from Algorithms/0633.Sum-of-Square-Numbers/README.md rename to leetcode/0633.Sum-of-Square-Numbers/README.md diff --git a/Algorithms/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions.go b/leetcode/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions.go similarity index 100% rename from Algorithms/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions.go rename to leetcode/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions.go diff --git a/Algorithms/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions_test.go b/leetcode/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions_test.go similarity index 100% rename from Algorithms/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions_test.go rename to leetcode/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions_test.go diff --git a/Algorithms/0636.Exclusive-Time-of-Functions/README.md b/leetcode/0636.Exclusive-Time-of-Functions/README.md similarity index 100% rename from Algorithms/0636.Exclusive-Time-of-Functions/README.md rename to leetcode/0636.Exclusive-Time-of-Functions/README.md diff --git a/Algorithms/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree.go b/leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree.go similarity index 100% rename from Algorithms/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree.go rename to leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree.go diff --git a/Algorithms/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go b/leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go similarity index 100% rename from Algorithms/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go rename to leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go diff --git a/Algorithms/0637.Average-of-Levels-in-Binary-Tree/README.md b/leetcode/0637.Average-of-Levels-in-Binary-Tree/README.md similarity index 100% rename from Algorithms/0637.Average-of-Levels-in-Binary-Tree/README.md rename to leetcode/0637.Average-of-Levels-in-Binary-Tree/README.md diff --git a/Algorithms/0638.Shopping-Offers/638. Shopping Offers.go b/leetcode/0638.Shopping-Offers/638. Shopping Offers.go similarity index 100% rename from Algorithms/0638.Shopping-Offers/638. Shopping Offers.go rename to leetcode/0638.Shopping-Offers/638. Shopping Offers.go diff --git a/Algorithms/0638.Shopping-Offers/638. Shopping Offers_test.go b/leetcode/0638.Shopping-Offers/638. Shopping Offers_test.go similarity index 100% rename from Algorithms/0638.Shopping-Offers/638. Shopping Offers_test.go rename to leetcode/0638.Shopping-Offers/638. Shopping Offers_test.go diff --git a/Algorithms/0638.Shopping-Offers/README.md b/leetcode/0638.Shopping-Offers/README.md similarity index 100% rename from Algorithms/0638.Shopping-Offers/README.md rename to leetcode/0638.Shopping-Offers/README.md diff --git a/Algorithms/0645.Set-Mismatch/645. Set Mismatch.go b/leetcode/0645.Set-Mismatch/645. Set Mismatch.go similarity index 100% rename from Algorithms/0645.Set-Mismatch/645. Set Mismatch.go rename to leetcode/0645.Set-Mismatch/645. Set Mismatch.go diff --git a/Algorithms/0645.Set-Mismatch/645. Set Mismatch_test.go b/leetcode/0645.Set-Mismatch/645. Set Mismatch_test.go similarity index 100% rename from Algorithms/0645.Set-Mismatch/645. Set Mismatch_test.go rename to leetcode/0645.Set-Mismatch/645. Set Mismatch_test.go diff --git a/Algorithms/0645.Set-Mismatch/README.md b/leetcode/0645.Set-Mismatch/README.md similarity index 100% rename from Algorithms/0645.Set-Mismatch/README.md rename to leetcode/0645.Set-Mismatch/README.md diff --git a/Algorithms/0648.Replace-Words/648. Replace Words.go b/leetcode/0648.Replace-Words/648. Replace Words.go similarity index 100% rename from Algorithms/0648.Replace-Words/648. Replace Words.go rename to leetcode/0648.Replace-Words/648. Replace Words.go diff --git a/Algorithms/0648.Replace-Words/648. Replace Words_test.go b/leetcode/0648.Replace-Words/648. Replace Words_test.go similarity index 100% rename from Algorithms/0648.Replace-Words/648. Replace Words_test.go rename to leetcode/0648.Replace-Words/648. Replace Words_test.go diff --git a/Algorithms/0648.Replace-Words/README.md b/leetcode/0648.Replace-Words/README.md similarity index 100% rename from Algorithms/0648.Replace-Words/README.md rename to leetcode/0648.Replace-Words/README.md diff --git a/Algorithms/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go b/leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go similarity index 100% rename from Algorithms/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go rename to leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go diff --git a/Algorithms/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go b/leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go similarity index 100% rename from Algorithms/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go rename to leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go diff --git a/Algorithms/0653.Two-Sum-IV---Input-is-a-BST/README.md b/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md similarity index 100% rename from Algorithms/0653.Two-Sum-IV---Input-is-a-BST/README.md rename to leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md diff --git a/Algorithms/0658.Find-K-Closest-Elements/658. Find K Closest Elements.go b/leetcode/0658.Find-K-Closest-Elements/658. Find K Closest Elements.go similarity index 100% rename from Algorithms/0658.Find-K-Closest-Elements/658. Find K Closest Elements.go rename to leetcode/0658.Find-K-Closest-Elements/658. Find K Closest Elements.go diff --git a/Algorithms/0658.Find-K-Closest-Elements/658. Find K Closest Elements_test.go b/leetcode/0658.Find-K-Closest-Elements/658. Find K Closest Elements_test.go similarity index 100% rename from Algorithms/0658.Find-K-Closest-Elements/658. Find K Closest Elements_test.go rename to leetcode/0658.Find-K-Closest-Elements/658. Find K Closest Elements_test.go diff --git a/Algorithms/0658.Find-K-Closest-Elements/README.md b/leetcode/0658.Find-K-Closest-Elements/README.md similarity index 100% rename from Algorithms/0658.Find-K-Closest-Elements/README.md rename to leetcode/0658.Find-K-Closest-Elements/README.md diff --git a/Algorithms/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree.go b/leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree.go similarity index 100% rename from Algorithms/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree.go rename to leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree.go diff --git a/Algorithms/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go b/leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go similarity index 100% rename from Algorithms/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go rename to leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go diff --git a/Algorithms/0662.Maximum-Width-of-Binary-Tree/README.md b/leetcode/0662.Maximum-Width-of-Binary-Tree/README.md similarity index 100% rename from Algorithms/0662.Maximum-Width-of-Binary-Tree/README.md rename to leetcode/0662.Maximum-Width-of-Binary-Tree/README.md diff --git a/Algorithms/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table.go b/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table.go similarity index 100% rename from Algorithms/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table.go rename to leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table.go diff --git a/Algorithms/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table_test.go b/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table_test.go similarity index 100% rename from Algorithms/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table_test.go rename to leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table_test.go diff --git a/Algorithms/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md b/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md similarity index 100% rename from Algorithms/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md rename to leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md diff --git a/Algorithms/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary.go b/leetcode/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary.go similarity index 100% rename from Algorithms/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary.go rename to leetcode/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary.go diff --git a/Algorithms/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary_test.go b/leetcode/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary_test.go similarity index 100% rename from Algorithms/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary_test.go rename to leetcode/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary_test.go diff --git a/Algorithms/0676.Implement-Magic-Dictionary/README.md b/leetcode/0676.Implement-Magic-Dictionary/README.md similarity index 100% rename from Algorithms/0676.Implement-Magic-Dictionary/README.md rename to leetcode/0676.Implement-Magic-Dictionary/README.md diff --git a/Algorithms/0682.Baseball-Game/682. Baseball Game.go b/leetcode/0682.Baseball-Game/682. Baseball Game.go similarity index 100% rename from Algorithms/0682.Baseball-Game/682. Baseball Game.go rename to leetcode/0682.Baseball-Game/682. Baseball Game.go diff --git a/Algorithms/0682.Baseball-Game/682. Baseball Game_test.go b/leetcode/0682.Baseball-Game/682. Baseball Game_test.go similarity index 100% rename from Algorithms/0682.Baseball-Game/682. Baseball Game_test.go rename to leetcode/0682.Baseball-Game/682. Baseball Game_test.go diff --git a/Algorithms/0682.Baseball-Game/README.md b/leetcode/0682.Baseball-Game/README.md similarity index 100% rename from Algorithms/0682.Baseball-Game/README.md rename to leetcode/0682.Baseball-Game/README.md diff --git a/Algorithms/0684.Redundant-Connection/684. Redundant Connection.go b/leetcode/0684.Redundant-Connection/684. Redundant Connection.go similarity index 100% rename from Algorithms/0684.Redundant-Connection/684. Redundant Connection.go rename to leetcode/0684.Redundant-Connection/684. Redundant Connection.go diff --git a/Algorithms/0684.Redundant-Connection/684. Redundant Connection_test.go b/leetcode/0684.Redundant-Connection/684. Redundant Connection_test.go similarity index 100% rename from Algorithms/0684.Redundant-Connection/684. Redundant Connection_test.go rename to leetcode/0684.Redundant-Connection/684. Redundant Connection_test.go diff --git a/Algorithms/0684.Redundant-Connection/README.md b/leetcode/0684.Redundant-Connection/README.md similarity index 100% rename from Algorithms/0684.Redundant-Connection/README.md rename to leetcode/0684.Redundant-Connection/README.md diff --git a/Algorithms/0685.Redundant-Connection-II/685. Redundant Connection II.go b/leetcode/0685.Redundant-Connection-II/685. Redundant Connection II.go similarity index 100% rename from Algorithms/0685.Redundant-Connection-II/685. Redundant Connection II.go rename to leetcode/0685.Redundant-Connection-II/685. Redundant Connection II.go diff --git a/Algorithms/0685.Redundant-Connection-II/685. Redundant Connection II_test.go b/leetcode/0685.Redundant-Connection-II/685. Redundant Connection II_test.go similarity index 100% rename from Algorithms/0685.Redundant-Connection-II/685. Redundant Connection II_test.go rename to leetcode/0685.Redundant-Connection-II/685. Redundant Connection II_test.go diff --git a/Algorithms/0685.Redundant-Connection-II/README.md b/leetcode/0685.Redundant-Connection-II/README.md similarity index 100% rename from Algorithms/0685.Redundant-Connection-II/README.md rename to leetcode/0685.Redundant-Connection-II/README.md diff --git a/Algorithms/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits.go b/leetcode/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits.go similarity index 100% rename from Algorithms/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits.go rename to leetcode/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits.go diff --git a/Algorithms/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits_test.go b/leetcode/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits_test.go similarity index 100% rename from Algorithms/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits_test.go rename to leetcode/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits_test.go diff --git a/Algorithms/0693.Binary-Number-with-Alternating-Bits/README.md b/leetcode/0693.Binary-Number-with-Alternating-Bits/README.md similarity index 100% rename from Algorithms/0693.Binary-Number-with-Alternating-Bits/README.md rename to leetcode/0693.Binary-Number-with-Alternating-Bits/README.md diff --git a/Algorithms/0695.Max-Area-of-Island/695. Max Area of Island.go b/leetcode/0695.Max-Area-of-Island/695. Max Area of Island.go similarity index 100% rename from Algorithms/0695.Max-Area-of-Island/695. Max Area of Island.go rename to leetcode/0695.Max-Area-of-Island/695. Max Area of Island.go diff --git a/Algorithms/0695.Max-Area-of-Island/695. Max Area of Island_test.go b/leetcode/0695.Max-Area-of-Island/695. Max Area of Island_test.go similarity index 100% rename from Algorithms/0695.Max-Area-of-Island/695. Max Area of Island_test.go rename to leetcode/0695.Max-Area-of-Island/695. Max Area of Island_test.go diff --git a/Algorithms/0695.Max-Area-of-Island/README.md b/leetcode/0695.Max-Area-of-Island/README.md similarity index 100% rename from Algorithms/0695.Max-Area-of-Island/README.md rename to leetcode/0695.Max-Area-of-Island/README.md diff --git a/Algorithms/0699.Falling-Squares/699. Falling Squares.go b/leetcode/0699.Falling-Squares/699. Falling Squares.go similarity index 100% rename from Algorithms/0699.Falling-Squares/699. Falling Squares.go rename to leetcode/0699.Falling-Squares/699. Falling Squares.go diff --git a/Algorithms/0699.Falling-Squares/699. Falling Squares_test.go b/leetcode/0699.Falling-Squares/699. Falling Squares_test.go similarity index 100% rename from Algorithms/0699.Falling-Squares/699. Falling Squares_test.go rename to leetcode/0699.Falling-Squares/699. Falling Squares_test.go diff --git a/Algorithms/0699.Falling-Squares/README.md b/leetcode/0699.Falling-Squares/README.md similarity index 100% rename from Algorithms/0699.Falling-Squares/README.md rename to leetcode/0699.Falling-Squares/README.md diff --git a/Algorithms/0704.Binary-Search/704. Binary Search.go b/leetcode/0704.Binary-Search/704. Binary Search.go similarity index 100% rename from Algorithms/0704.Binary-Search/704. Binary Search.go rename to leetcode/0704.Binary-Search/704. Binary Search.go diff --git a/Algorithms/0704.Binary-Search/704. Binary Search_test.go b/leetcode/0704.Binary-Search/704. Binary Search_test.go similarity index 100% rename from Algorithms/0704.Binary-Search/704. Binary Search_test.go rename to leetcode/0704.Binary-Search/704. Binary Search_test.go diff --git a/Algorithms/0704.Binary-Search/README.md b/leetcode/0704.Binary-Search/README.md similarity index 100% rename from Algorithms/0704.Binary-Search/README.md rename to leetcode/0704.Binary-Search/README.md diff --git a/Algorithms/0705.Design-HashSet/705. Design HashSet.go b/leetcode/0705.Design-HashSet/705. Design HashSet.go similarity index 100% rename from Algorithms/0705.Design-HashSet/705. Design HashSet.go rename to leetcode/0705.Design-HashSet/705. Design HashSet.go diff --git a/Algorithms/0705.Design-HashSet/705. Design HashSet_test.go b/leetcode/0705.Design-HashSet/705. Design HashSet_test.go similarity index 100% rename from Algorithms/0705.Design-HashSet/705. Design HashSet_test.go rename to leetcode/0705.Design-HashSet/705. Design HashSet_test.go diff --git a/Algorithms/0705.Design-HashSet/README.md b/leetcode/0705.Design-HashSet/README.md similarity index 100% rename from Algorithms/0705.Design-HashSet/README.md rename to leetcode/0705.Design-HashSet/README.md diff --git a/Algorithms/0706.Design-HashMap/706. Design HashMap.go b/leetcode/0706.Design-HashMap/706. Design HashMap.go similarity index 100% rename from Algorithms/0706.Design-HashMap/706. Design HashMap.go rename to leetcode/0706.Design-HashMap/706. Design HashMap.go diff --git a/Algorithms/0706.Design-HashMap/706. Design HashMap_test.go b/leetcode/0706.Design-HashMap/706. Design HashMap_test.go similarity index 100% rename from Algorithms/0706.Design-HashMap/706. Design HashMap_test.go rename to leetcode/0706.Design-HashMap/706. Design HashMap_test.go diff --git a/Algorithms/0706.Design-HashMap/README.md b/leetcode/0706.Design-HashMap/README.md similarity index 100% rename from Algorithms/0706.Design-HashMap/README.md rename to leetcode/0706.Design-HashMap/README.md diff --git a/Algorithms/0707.Design-Linked-List/707. Design Linked List.go b/leetcode/0707.Design-Linked-List/707. Design Linked List.go similarity index 100% rename from Algorithms/0707.Design-Linked-List/707. Design Linked List.go rename to leetcode/0707.Design-Linked-List/707. Design Linked List.go diff --git a/Algorithms/0707.Design-Linked-List/707. Design Linked List_test.go b/leetcode/0707.Design-Linked-List/707. Design Linked List_test.go similarity index 100% rename from Algorithms/0707.Design-Linked-List/707. Design Linked List_test.go rename to leetcode/0707.Design-Linked-List/707. Design Linked List_test.go diff --git a/Algorithms/0707.Design-Linked-List/README.md b/leetcode/0707.Design-Linked-List/README.md similarity index 100% rename from Algorithms/0707.Design-Linked-List/README.md rename to leetcode/0707.Design-Linked-List/README.md diff --git a/Algorithms/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist.go b/leetcode/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist.go similarity index 100% rename from Algorithms/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist.go rename to leetcode/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist.go diff --git a/Algorithms/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist_test.go b/leetcode/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist_test.go similarity index 100% rename from Algorithms/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist_test.go rename to leetcode/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist_test.go diff --git a/Algorithms/0710.Random-Pick-with-Blacklist/README.md b/leetcode/0710.Random-Pick-with-Blacklist/README.md similarity index 100% rename from Algorithms/0710.Random-Pick-with-Blacklist/README.md rename to leetcode/0710.Random-Pick-with-Blacklist/README.md diff --git a/Algorithms/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K.go b/leetcode/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K.go similarity index 100% rename from Algorithms/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K.go rename to leetcode/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K.go diff --git a/Algorithms/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K_test.go b/leetcode/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K_test.go similarity index 100% rename from Algorithms/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K_test.go rename to leetcode/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K_test.go diff --git a/Algorithms/0713.Subarray-Product-Less-Than-K/README.md b/leetcode/0713.Subarray-Product-Less-Than-K/README.md similarity index 100% rename from Algorithms/0713.Subarray-Product-Less-Than-K/README.md rename to leetcode/0713.Subarray-Product-Less-Than-K/README.md diff --git a/Algorithms/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee.go b/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee.go similarity index 100% rename from Algorithms/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee.go rename to leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee.go diff --git a/Algorithms/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee_test.go b/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee_test.go similarity index 100% rename from Algorithms/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee_test.go rename to leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee_test.go diff --git a/Algorithms/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/README.md b/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/README.md similarity index 100% rename from Algorithms/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/README.md rename to leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/README.md diff --git a/Algorithms/0715.Range-Module/715. Range Module.go b/leetcode/0715.Range-Module/715. Range Module.go similarity index 100% rename from Algorithms/0715.Range-Module/715. Range Module.go rename to leetcode/0715.Range-Module/715. Range Module.go diff --git a/Algorithms/0715.Range-Module/715. Range Module_test.go b/leetcode/0715.Range-Module/715. Range Module_test.go similarity index 100% rename from Algorithms/0715.Range-Module/715. Range Module_test.go rename to leetcode/0715.Range-Module/715. Range Module_test.go diff --git a/Algorithms/0715.Range-Module/README.md b/leetcode/0715.Range-Module/README.md similarity index 100% rename from Algorithms/0715.Range-Module/README.md rename to leetcode/0715.Range-Module/README.md diff --git a/Algorithms/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters.go b/leetcode/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters.go similarity index 100% rename from Algorithms/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters.go rename to leetcode/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters.go diff --git a/Algorithms/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters_test.go b/leetcode/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters_test.go similarity index 100% rename from Algorithms/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters_test.go rename to leetcode/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters_test.go diff --git a/Algorithms/0717.1-bit-and-2-bit-Characters/README.md b/leetcode/0717.1-bit-and-2-bit-Characters/README.md similarity index 93% rename from Algorithms/0717.1-bit-and-2-bit-Characters/README.md rename to leetcode/0717.1-bit-and-2-bit-Characters/README.md index 44224df0f..2573acaca 100755 --- a/Algorithms/0717.1-bit-and-2-bit-Characters/README.md +++ b/leetcode/0717.1-bit-and-2-bit-Characters/README.md @@ -1,9 +1,5 @@ -# 717. 1-bit and 2-bit Characters +# [717. 1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/) -Created Time: Jul 25, 2019 10:23 AM -Difficulty: Easy -Link: https://leetcode.com/problems/1-bit-and-2-bit-characters/ -Tags: Array # 题目: diff --git a/Algorithms/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray.go b/leetcode/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray.go similarity index 100% rename from Algorithms/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray.go rename to leetcode/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray.go diff --git a/Algorithms/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray_test.go b/leetcode/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray_test.go similarity index 100% rename from Algorithms/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray_test.go rename to leetcode/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray_test.go diff --git a/Algorithms/0718.Maximum-Length-of-Repeated-Subarray/README.md b/leetcode/0718.Maximum-Length-of-Repeated-Subarray/README.md similarity index 100% rename from Algorithms/0718.Maximum-Length-of-Repeated-Subarray/README.md rename to leetcode/0718.Maximum-Length-of-Repeated-Subarray/README.md diff --git a/Algorithms/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance.go b/leetcode/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance.go similarity index 100% rename from Algorithms/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance.go rename to leetcode/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance.go diff --git a/Algorithms/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance_test.go b/leetcode/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance_test.go similarity index 100% rename from Algorithms/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance_test.go rename to leetcode/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance_test.go diff --git a/Algorithms/0719.Find-K-th-Smallest-Pair-Distance/README.md b/leetcode/0719.Find-K-th-Smallest-Pair-Distance/README.md similarity index 100% rename from Algorithms/0719.Find-K-th-Smallest-Pair-Distance/README.md rename to leetcode/0719.Find-K-th-Smallest-Pair-Distance/README.md diff --git a/Algorithms/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary.go b/leetcode/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary.go similarity index 100% rename from Algorithms/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary.go rename to leetcode/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary.go diff --git a/Algorithms/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary_test.go b/leetcode/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary_test.go similarity index 100% rename from Algorithms/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary_test.go rename to leetcode/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary_test.go diff --git a/Algorithms/0720.Longest-Word-in-Dictionary/README.md b/leetcode/0720.Longest-Word-in-Dictionary/README.md similarity index 100% rename from Algorithms/0720.Longest-Word-in-Dictionary/README.md rename to leetcode/0720.Longest-Word-in-Dictionary/README.md diff --git a/Algorithms/0721.Accounts-Merge/721. Accounts Merge.go b/leetcode/0721.Accounts-Merge/721. Accounts Merge.go similarity index 100% rename from Algorithms/0721.Accounts-Merge/721. Accounts Merge.go rename to leetcode/0721.Accounts-Merge/721. Accounts Merge.go diff --git a/Algorithms/0721.Accounts-Merge/721. Accounts Merge_test.go b/leetcode/0721.Accounts-Merge/721. Accounts Merge_test.go similarity index 100% rename from Algorithms/0721.Accounts-Merge/721. Accounts Merge_test.go rename to leetcode/0721.Accounts-Merge/721. Accounts Merge_test.go diff --git a/Algorithms/0721.Accounts-Merge/README.md b/leetcode/0721.Accounts-Merge/README.md similarity index 100% rename from Algorithms/0721.Accounts-Merge/README.md rename to leetcode/0721.Accounts-Merge/README.md diff --git a/Algorithms/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go b/leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go similarity index 100% rename from Algorithms/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go rename to leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go diff --git a/Algorithms/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go b/leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go similarity index 100% rename from Algorithms/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go rename to leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go diff --git a/Algorithms/0725.Split-Linked-List-in-Parts/README.md b/leetcode/0725.Split-Linked-List-in-Parts/README.md similarity index 100% rename from Algorithms/0725.Split-Linked-List-in-Parts/README.md rename to leetcode/0725.Split-Linked-List-in-Parts/README.md diff --git a/Algorithms/0726.Number-of-Atoms/726. Number of Atoms.go b/leetcode/0726.Number-of-Atoms/726. Number of Atoms.go similarity index 100% rename from Algorithms/0726.Number-of-Atoms/726. Number of Atoms.go rename to leetcode/0726.Number-of-Atoms/726. Number of Atoms.go diff --git a/Algorithms/0726.Number-of-Atoms/726. Number of Atoms_test.go b/leetcode/0726.Number-of-Atoms/726. Number of Atoms_test.go similarity index 100% rename from Algorithms/0726.Number-of-Atoms/726. Number of Atoms_test.go rename to leetcode/0726.Number-of-Atoms/726. Number of Atoms_test.go diff --git a/Algorithms/0726.Number-of-Atoms/README.md b/leetcode/0726.Number-of-Atoms/README.md similarity index 100% rename from Algorithms/0726.Number-of-Atoms/README.md rename to leetcode/0726.Number-of-Atoms/README.md diff --git a/Algorithms/0729.My-Calendar-I/729. My Calendar I.go b/leetcode/0729.My-Calendar-I/729. My Calendar I.go similarity index 100% rename from Algorithms/0729.My-Calendar-I/729. My Calendar I.go rename to leetcode/0729.My-Calendar-I/729. My Calendar I.go diff --git a/Algorithms/0729.My-Calendar-I/729. My Calendar I_test.go b/leetcode/0729.My-Calendar-I/729. My Calendar I_test.go similarity index 100% rename from Algorithms/0729.My-Calendar-I/729. My Calendar I_test.go rename to leetcode/0729.My-Calendar-I/729. My Calendar I_test.go diff --git a/Algorithms/0729.My-Calendar-I/README.md b/leetcode/0729.My-Calendar-I/README.md similarity index 100% rename from Algorithms/0729.My-Calendar-I/README.md rename to leetcode/0729.My-Calendar-I/README.md diff --git a/Algorithms/0732.My-Calendar-III/732. My Calendar III.go b/leetcode/0732.My-Calendar-III/732. My Calendar III.go similarity index 100% rename from Algorithms/0732.My-Calendar-III/732. My Calendar III.go rename to leetcode/0732.My-Calendar-III/732. My Calendar III.go diff --git a/Algorithms/0732.My-Calendar-III/732. My Calendar III_test.go b/leetcode/0732.My-Calendar-III/732. My Calendar III_test.go similarity index 100% rename from Algorithms/0732.My-Calendar-III/732. My Calendar III_test.go rename to leetcode/0732.My-Calendar-III/732. My Calendar III_test.go diff --git a/Algorithms/0732.My-Calendar-III/README.md b/leetcode/0732.My-Calendar-III/README.md similarity index 100% rename from Algorithms/0732.My-Calendar-III/README.md rename to leetcode/0732.My-Calendar-III/README.md diff --git a/Algorithms/0733.Flood-Fill/733. Flood Fill.go b/leetcode/0733.Flood-Fill/733. Flood Fill.go similarity index 100% rename from Algorithms/0733.Flood-Fill/733. Flood Fill.go rename to leetcode/0733.Flood-Fill/733. Flood Fill.go diff --git a/Algorithms/0733.Flood-Fill/733. Flood Fill_test.go b/leetcode/0733.Flood-Fill/733. Flood Fill_test.go similarity index 100% rename from Algorithms/0733.Flood-Fill/733. Flood Fill_test.go rename to leetcode/0733.Flood-Fill/733. Flood Fill_test.go diff --git a/Algorithms/0733.Flood-Fill/README.md b/leetcode/0733.Flood-Fill/README.md similarity index 100% rename from Algorithms/0733.Flood-Fill/README.md rename to leetcode/0733.Flood-Fill/README.md diff --git a/Algorithms/0735.Asteroid-Collision/735. Asteroid Collision.go b/leetcode/0735.Asteroid-Collision/735. Asteroid Collision.go similarity index 100% rename from Algorithms/0735.Asteroid-Collision/735. Asteroid Collision.go rename to leetcode/0735.Asteroid-Collision/735. Asteroid Collision.go diff --git a/Algorithms/0735.Asteroid-Collision/735. Asteroid Collision_test.go b/leetcode/0735.Asteroid-Collision/735. Asteroid Collision_test.go similarity index 100% rename from Algorithms/0735.Asteroid-Collision/735. Asteroid Collision_test.go rename to leetcode/0735.Asteroid-Collision/735. Asteroid Collision_test.go diff --git a/Algorithms/0735.Asteroid-Collision/README.md b/leetcode/0735.Asteroid-Collision/README.md similarity index 100% rename from Algorithms/0735.Asteroid-Collision/README.md rename to leetcode/0735.Asteroid-Collision/README.md diff --git a/Algorithms/0739.Daily-Temperatures/739. Daily Temperatures.go b/leetcode/0739.Daily-Temperatures/739. Daily Temperatures.go similarity index 100% rename from Algorithms/0739.Daily-Temperatures/739. Daily Temperatures.go rename to leetcode/0739.Daily-Temperatures/739. Daily Temperatures.go diff --git a/Algorithms/0739.Daily-Temperatures/739. Daily Temperatures_test.go b/leetcode/0739.Daily-Temperatures/739. Daily Temperatures_test.go similarity index 100% rename from Algorithms/0739.Daily-Temperatures/739. Daily Temperatures_test.go rename to leetcode/0739.Daily-Temperatures/739. Daily Temperatures_test.go diff --git a/Algorithms/0739.Daily-Temperatures/README.md b/leetcode/0739.Daily-Temperatures/README.md similarity index 100% rename from Algorithms/0739.Daily-Temperatures/README.md rename to leetcode/0739.Daily-Temperatures/README.md diff --git a/Algorithms/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target.go b/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target.go similarity index 100% rename from Algorithms/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target.go rename to leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target.go diff --git a/Algorithms/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target_test.go b/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target_test.go similarity index 100% rename from Algorithms/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target_test.go rename to leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target_test.go diff --git a/Algorithms/0744.Find-Smallest-Letter-Greater-Than-Target/README.md b/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/README.md similarity index 100% rename from Algorithms/0744.Find-Smallest-Letter-Greater-Than-Target/README.md rename to leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/README.md diff --git a/Algorithms/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search.go b/leetcode/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search.go similarity index 100% rename from Algorithms/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search.go rename to leetcode/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search.go diff --git a/Algorithms/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search_test.go b/leetcode/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search_test.go similarity index 100% rename from Algorithms/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search_test.go rename to leetcode/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search_test.go diff --git a/Algorithms/0745.Prefix-and-Suffix-Search/README.md b/leetcode/0745.Prefix-and-Suffix-Search/README.md similarity index 100% rename from Algorithms/0745.Prefix-and-Suffix-Search/README.md rename to leetcode/0745.Prefix-and-Suffix-Search/README.md diff --git a/Algorithms/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs.go b/leetcode/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs.go similarity index 100% rename from Algorithms/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs.go rename to leetcode/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs.go diff --git a/Algorithms/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs_test.go b/leetcode/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs_test.go similarity index 100% rename from Algorithms/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs_test.go rename to leetcode/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs_test.go diff --git a/Algorithms/0746.Min-Cost-Climbing-Stairs/README.md b/leetcode/0746.Min-Cost-Climbing-Stairs/README.md similarity index 100% rename from Algorithms/0746.Min-Cost-Climbing-Stairs/README.md rename to leetcode/0746.Min-Cost-Climbing-Stairs/README.md diff --git a/Algorithms/0748.Shortest-Completing-Word/748. Shortest Completing Word.go b/leetcode/0748.Shortest-Completing-Word/748. Shortest Completing Word.go similarity index 100% rename from Algorithms/0748.Shortest-Completing-Word/748. Shortest Completing Word.go rename to leetcode/0748.Shortest-Completing-Word/748. Shortest Completing Word.go diff --git a/Algorithms/0748.Shortest-Completing-Word/748. Shortest Completing Word_test.go b/leetcode/0748.Shortest-Completing-Word/748. Shortest Completing Word_test.go similarity index 100% rename from Algorithms/0748.Shortest-Completing-Word/748. Shortest Completing Word_test.go rename to leetcode/0748.Shortest-Completing-Word/748. Shortest Completing Word_test.go diff --git a/Algorithms/0748.Shortest-Completing-Word/README.md b/leetcode/0748.Shortest-Completing-Word/README.md similarity index 100% rename from Algorithms/0748.Shortest-Completing-Word/README.md rename to leetcode/0748.Shortest-Completing-Word/README.md diff --git a/Algorithms/0753.Cracking-the-Safe/753. Cracking the Safe.go b/leetcode/0753.Cracking-the-Safe/753. Cracking the Safe.go similarity index 100% rename from Algorithms/0753.Cracking-the-Safe/753. Cracking the Safe.go rename to leetcode/0753.Cracking-the-Safe/753. Cracking the Safe.go diff --git a/Algorithms/0753.Cracking-the-Safe/753. Cracking the Safe_test.go b/leetcode/0753.Cracking-the-Safe/753. Cracking the Safe_test.go similarity index 100% rename from Algorithms/0753.Cracking-the-Safe/753. Cracking the Safe_test.go rename to leetcode/0753.Cracking-the-Safe/753. Cracking the Safe_test.go diff --git a/Algorithms/0753.Cracking-the-Safe/README.md b/leetcode/0753.Cracking-the-Safe/README.md similarity index 100% rename from Algorithms/0753.Cracking-the-Safe/README.md rename to leetcode/0753.Cracking-the-Safe/README.md diff --git a/Algorithms/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix.go b/leetcode/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix.go similarity index 100% rename from Algorithms/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix.go rename to leetcode/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix.go diff --git a/Algorithms/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix_test.go b/leetcode/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix_test.go similarity index 100% rename from Algorithms/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix_test.go rename to leetcode/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix_test.go diff --git a/Algorithms/0756.Pyramid-Transition-Matrix/README.md b/leetcode/0756.Pyramid-Transition-Matrix/README.md similarity index 100% rename from Algorithms/0756.Pyramid-Transition-Matrix/README.md rename to leetcode/0756.Pyramid-Transition-Matrix/README.md diff --git a/Algorithms/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation.go b/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation.go similarity index 100% rename from Algorithms/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation.go rename to leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation.go diff --git a/Algorithms/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation_test.go b/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation_test.go similarity index 100% rename from Algorithms/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation_test.go rename to leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation_test.go diff --git a/Algorithms/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md b/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md similarity index 100% rename from Algorithms/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md rename to leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md diff --git a/Algorithms/0763.Partition-Labels/763. Partition Labels.go b/leetcode/0763.Partition-Labels/763. Partition Labels.go similarity index 100% rename from Algorithms/0763.Partition-Labels/763. Partition Labels.go rename to leetcode/0763.Partition-Labels/763. Partition Labels.go diff --git a/Algorithms/0763.Partition-Labels/763. Partition Labels_test.go b/leetcode/0763.Partition-Labels/763. Partition Labels_test.go similarity index 100% rename from Algorithms/0763.Partition-Labels/763. Partition Labels_test.go rename to leetcode/0763.Partition-Labels/763. Partition Labels_test.go diff --git a/Algorithms/0763.Partition-Labels/README.md b/leetcode/0763.Partition-Labels/README.md similarity index 100% rename from Algorithms/0763.Partition-Labels/README.md rename to leetcode/0763.Partition-Labels/README.md diff --git a/Algorithms/0765.Couples-Holding-Hands/765. Couples Holding Hands.go b/leetcode/0765.Couples-Holding-Hands/765. Couples Holding Hands.go similarity index 100% rename from Algorithms/0765.Couples-Holding-Hands/765. Couples Holding Hands.go rename to leetcode/0765.Couples-Holding-Hands/765. Couples Holding Hands.go diff --git a/Algorithms/0765.Couples-Holding-Hands/765. Couples Holding Hands_test.go b/leetcode/0765.Couples-Holding-Hands/765. Couples Holding Hands_test.go similarity index 100% rename from Algorithms/0765.Couples-Holding-Hands/765. Couples Holding Hands_test.go rename to leetcode/0765.Couples-Holding-Hands/765. Couples Holding Hands_test.go diff --git a/Algorithms/0765.Couples-Holding-Hands/README.md b/leetcode/0765.Couples-Holding-Hands/README.md similarity index 100% rename from Algorithms/0765.Couples-Holding-Hands/README.md rename to leetcode/0765.Couples-Holding-Hands/README.md diff --git a/Algorithms/0766.Toeplitz-Matrix/766. Toeplitz Matrix.go b/leetcode/0766.Toeplitz-Matrix/766. Toeplitz Matrix.go similarity index 100% rename from Algorithms/0766.Toeplitz-Matrix/766. Toeplitz Matrix.go rename to leetcode/0766.Toeplitz-Matrix/766. Toeplitz Matrix.go diff --git a/Algorithms/0766.Toeplitz-Matrix/766. Toeplitz Matrix_test.go b/leetcode/0766.Toeplitz-Matrix/766. Toeplitz Matrix_test.go similarity index 100% rename from Algorithms/0766.Toeplitz-Matrix/766. Toeplitz Matrix_test.go rename to leetcode/0766.Toeplitz-Matrix/766. Toeplitz Matrix_test.go diff --git a/Algorithms/0766.Toeplitz-Matrix/README.md b/leetcode/0766.Toeplitz-Matrix/README.md similarity index 100% rename from Algorithms/0766.Toeplitz-Matrix/README.md rename to leetcode/0766.Toeplitz-Matrix/README.md diff --git a/Algorithms/0767.Reorganize-String/767. Reorganize String.go b/leetcode/0767.Reorganize-String/767. Reorganize String.go similarity index 100% rename from Algorithms/0767.Reorganize-String/767. Reorganize String.go rename to leetcode/0767.Reorganize-String/767. Reorganize String.go diff --git a/Algorithms/0767.Reorganize-String/767. Reorganize String_test.go b/leetcode/0767.Reorganize-String/767. Reorganize String_test.go similarity index 100% rename from Algorithms/0767.Reorganize-String/767. Reorganize String_test.go rename to leetcode/0767.Reorganize-String/767. Reorganize String_test.go diff --git a/Algorithms/0767.Reorganize-String/README.md b/leetcode/0767.Reorganize-String/README.md similarity index 100% rename from Algorithms/0767.Reorganize-String/README.md rename to leetcode/0767.Reorganize-String/README.md diff --git a/Algorithms/0771.Jewels-and-Stones/771. Jewels and Stones.go b/leetcode/0771.Jewels-and-Stones/771. Jewels and Stones.go similarity index 100% rename from Algorithms/0771.Jewels-and-Stones/771. Jewels and Stones.go rename to leetcode/0771.Jewels-and-Stones/771. Jewels and Stones.go diff --git a/Algorithms/0771.Jewels-and-Stones/771. Jewels and Stones_test.go b/leetcode/0771.Jewels-and-Stones/771. Jewels and Stones_test.go similarity index 100% rename from Algorithms/0771.Jewels-and-Stones/771. Jewels and Stones_test.go rename to leetcode/0771.Jewels-and-Stones/771. Jewels and Stones_test.go diff --git a/Algorithms/0771.Jewels-and-Stones/README.md b/leetcode/0771.Jewels-and-Stones/README.md similarity index 100% rename from Algorithms/0771.Jewels-and-Stones/README.md rename to leetcode/0771.Jewels-and-Stones/README.md diff --git a/Algorithms/0778.Swim-in-Rising-Water/778. Swim in Rising Water.go b/leetcode/0778.Swim-in-Rising-Water/778. Swim in Rising Water.go similarity index 100% rename from Algorithms/0778.Swim-in-Rising-Water/778. Swim in Rising Water.go rename to leetcode/0778.Swim-in-Rising-Water/778. Swim in Rising Water.go diff --git a/Algorithms/0778.Swim-in-Rising-Water/778. Swim in Rising Water_test.go b/leetcode/0778.Swim-in-Rising-Water/778. Swim in Rising Water_test.go similarity index 100% rename from Algorithms/0778.Swim-in-Rising-Water/778. Swim in Rising Water_test.go rename to leetcode/0778.Swim-in-Rising-Water/778. Swim in Rising Water_test.go diff --git a/Algorithms/0778.Swim-in-Rising-Water/README.md b/leetcode/0778.Swim-in-Rising-Water/README.md similarity index 100% rename from Algorithms/0778.Swim-in-Rising-Water/README.md rename to leetcode/0778.Swim-in-Rising-Water/README.md diff --git a/Algorithms/0781.Rabbits-in-Forest/781. Rabbits in Forest.go b/leetcode/0781.Rabbits-in-Forest/781. Rabbits in Forest.go similarity index 100% rename from Algorithms/0781.Rabbits-in-Forest/781. Rabbits in Forest.go rename to leetcode/0781.Rabbits-in-Forest/781. Rabbits in Forest.go diff --git a/Algorithms/0781.Rabbits-in-Forest/781. Rabbits in Forest_test.go b/leetcode/0781.Rabbits-in-Forest/781. Rabbits in Forest_test.go similarity index 100% rename from Algorithms/0781.Rabbits-in-Forest/781. Rabbits in Forest_test.go rename to leetcode/0781.Rabbits-in-Forest/781. Rabbits in Forest_test.go diff --git a/Algorithms/0781.Rabbits-in-Forest/README.md b/leetcode/0781.Rabbits-in-Forest/README.md similarity index 100% rename from Algorithms/0781.Rabbits-in-Forest/README.md rename to leetcode/0781.Rabbits-in-Forest/README.md diff --git a/Algorithms/0784.Letter-Case-Permutation/784. Letter Case Permutation.go b/leetcode/0784.Letter-Case-Permutation/784. Letter Case Permutation.go similarity index 100% rename from Algorithms/0784.Letter-Case-Permutation/784. Letter Case Permutation.go rename to leetcode/0784.Letter-Case-Permutation/784. Letter Case Permutation.go diff --git a/Algorithms/0784.Letter-Case-Permutation/784. Letter Case Permutation_test.go b/leetcode/0784.Letter-Case-Permutation/784. Letter Case Permutation_test.go similarity index 100% rename from Algorithms/0784.Letter-Case-Permutation/784. Letter Case Permutation_test.go rename to leetcode/0784.Letter-Case-Permutation/784. Letter Case Permutation_test.go diff --git a/Algorithms/0784.Letter-Case-Permutation/README.md b/leetcode/0784.Letter-Case-Permutation/README.md similarity index 100% rename from Algorithms/0784.Letter-Case-Permutation/README.md rename to leetcode/0784.Letter-Case-Permutation/README.md diff --git a/Algorithms/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction.go b/leetcode/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction.go similarity index 100% rename from Algorithms/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction.go rename to leetcode/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction.go diff --git a/Algorithms/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction_test.go b/leetcode/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction_test.go similarity index 100% rename from Algorithms/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction_test.go rename to leetcode/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction_test.go diff --git a/Algorithms/0786.K-th-Smallest-Prime-Fraction/README.md b/leetcode/0786.K-th-Smallest-Prime-Fraction/README.md similarity index 100% rename from Algorithms/0786.K-th-Smallest-Prime-Fraction/README.md rename to leetcode/0786.K-th-Smallest-Prime-Fraction/README.md diff --git a/Algorithms/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function.go b/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function.go similarity index 100% rename from Algorithms/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function.go rename to leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function.go diff --git a/Algorithms/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function_test.go b/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function_test.go similarity index 100% rename from Algorithms/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function_test.go rename to leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function_test.go diff --git a/Algorithms/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md b/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md similarity index 100% rename from Algorithms/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md rename to leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md diff --git a/Algorithms/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States.go b/leetcode/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States.go similarity index 100% rename from Algorithms/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States.go rename to leetcode/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States.go diff --git a/Algorithms/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States_test.go b/leetcode/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States_test.go similarity index 100% rename from Algorithms/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States_test.go rename to leetcode/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States_test.go diff --git a/Algorithms/0802.Find-Eventual-Safe-States/README.md b/leetcode/0802.Find-Eventual-Safe-States/README.md similarity index 100% rename from Algorithms/0802.Find-Eventual-Safe-States/README.md rename to leetcode/0802.Find-Eventual-Safe-States/README.md diff --git a/Algorithms/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit.go b/leetcode/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit.go similarity index 100% rename from Algorithms/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit.go rename to leetcode/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit.go diff --git a/Algorithms/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit_test.go b/leetcode/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit_test.go similarity index 100% rename from Algorithms/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit_test.go rename to leetcode/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit_test.go diff --git a/Algorithms/0803.Bricks-Falling-When-Hit/README.md b/leetcode/0803.Bricks-Falling-When-Hit/README.md similarity index 100% rename from Algorithms/0803.Bricks-Falling-When-Hit/README.md rename to leetcode/0803.Bricks-Falling-When-Hit/README.md diff --git a/Algorithms/0811.Subdomain-Visit-Count/811. Subdomain Visit Count.go b/leetcode/0811.Subdomain-Visit-Count/811. Subdomain Visit Count.go similarity index 100% rename from Algorithms/0811.Subdomain-Visit-Count/811. Subdomain Visit Count.go rename to leetcode/0811.Subdomain-Visit-Count/811. Subdomain Visit Count.go diff --git a/Algorithms/0811.Subdomain-Visit-Count/811. Subdomain Visit Count_test.go b/leetcode/0811.Subdomain-Visit-Count/811. Subdomain Visit Count_test.go similarity index 100% rename from Algorithms/0811.Subdomain-Visit-Count/811. Subdomain Visit Count_test.go rename to leetcode/0811.Subdomain-Visit-Count/811. Subdomain Visit Count_test.go diff --git a/Algorithms/0811.Subdomain-Visit-Count/README.md b/leetcode/0811.Subdomain-Visit-Count/README.md similarity index 100% rename from Algorithms/0811.Subdomain-Visit-Count/README.md rename to leetcode/0811.Subdomain-Visit-Count/README.md diff --git a/Algorithms/0815.Bus-Routes/815. Bus Routes.go b/leetcode/0815.Bus-Routes/815. Bus Routes.go similarity index 100% rename from Algorithms/0815.Bus-Routes/815. Bus Routes.go rename to leetcode/0815.Bus-Routes/815. Bus Routes.go diff --git a/Algorithms/0815.Bus-Routes/815. Bus Routes_test.go b/leetcode/0815.Bus-Routes/815. Bus Routes_test.go similarity index 100% rename from Algorithms/0815.Bus-Routes/815. Bus Routes_test.go rename to leetcode/0815.Bus-Routes/815. Bus Routes_test.go diff --git a/Algorithms/0815.Bus-Routes/README.md b/leetcode/0815.Bus-Routes/README.md similarity index 100% rename from Algorithms/0815.Bus-Routes/README.md rename to leetcode/0815.Bus-Routes/README.md diff --git a/Algorithms/0817.Linked-List-Components/817. Linked List Components.go b/leetcode/0817.Linked-List-Components/817. Linked List Components.go similarity index 100% rename from Algorithms/0817.Linked-List-Components/817. Linked List Components.go rename to leetcode/0817.Linked-List-Components/817. Linked List Components.go diff --git a/Algorithms/0817.Linked-List-Components/817. Linked List Components_test.go b/leetcode/0817.Linked-List-Components/817. Linked List Components_test.go similarity index 100% rename from Algorithms/0817.Linked-List-Components/817. Linked List Components_test.go rename to leetcode/0817.Linked-List-Components/817. Linked List Components_test.go diff --git a/Algorithms/0817.Linked-List-Components/README.md b/leetcode/0817.Linked-List-Components/README.md similarity index 100% rename from Algorithms/0817.Linked-List-Components/README.md rename to leetcode/0817.Linked-List-Components/README.md diff --git a/Algorithms/0819.Most-Common-Word/819. Most Common Word.go b/leetcode/0819.Most-Common-Word/819. Most Common Word.go similarity index 100% rename from Algorithms/0819.Most-Common-Word/819. Most Common Word.go rename to leetcode/0819.Most-Common-Word/819. Most Common Word.go diff --git a/Algorithms/0819.Most-Common-Word/819. Most Common Word_test.go b/leetcode/0819.Most-Common-Word/819. Most Common Word_test.go similarity index 100% rename from Algorithms/0819.Most-Common-Word/819. Most Common Word_test.go rename to leetcode/0819.Most-Common-Word/819. Most Common Word_test.go diff --git a/Algorithms/0819.Most-Common-Word/README.md b/leetcode/0819.Most-Common-Word/README.md similarity index 100% rename from Algorithms/0819.Most-Common-Word/README.md rename to leetcode/0819.Most-Common-Word/README.md diff --git a/Algorithms/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work.go b/leetcode/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work.go similarity index 100% rename from Algorithms/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work.go rename to leetcode/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work.go diff --git a/Algorithms/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work_test.go b/leetcode/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work_test.go similarity index 100% rename from Algorithms/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work_test.go rename to leetcode/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work_test.go diff --git a/Algorithms/0826.Most-Profit-Assigning-Work/README.md b/leetcode/0826.Most-Profit-Assigning-Work/README.md similarity index 100% rename from Algorithms/0826.Most-Profit-Assigning-Work/README.md rename to leetcode/0826.Most-Profit-Assigning-Work/README.md diff --git a/Algorithms/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go b/leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go similarity index 100% rename from Algorithms/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go rename to leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String.go diff --git a/Algorithms/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go b/leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go similarity index 100% rename from Algorithms/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go rename to leetcode/0828.COPYRIGHT-PROBLEM-XXX/828. Unique Letter String_test.go diff --git a/Algorithms/0828.COPYRIGHT-PROBLEM-XXX/README.md b/leetcode/0828.COPYRIGHT-PROBLEM-XXX/README.md similarity index 100% rename from Algorithms/0828.COPYRIGHT-PROBLEM-XXX/README.md rename to leetcode/0828.COPYRIGHT-PROBLEM-XXX/README.md diff --git a/Algorithms/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree.go b/leetcode/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree.go similarity index 100% rename from Algorithms/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree.go rename to leetcode/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree.go diff --git a/Algorithms/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree_test.go b/leetcode/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree_test.go similarity index 100% rename from Algorithms/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree_test.go rename to leetcode/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree_test.go diff --git a/Algorithms/0834.Sum-of-Distances-in-Tree/README.md b/leetcode/0834.Sum-of-Distances-in-Tree/README.md similarity index 100% rename from Algorithms/0834.Sum-of-Distances-in-Tree/README.md rename to leetcode/0834.Sum-of-Distances-in-Tree/README.md diff --git a/Algorithms/0836.Rectangle-Overlap/836. Rectangle Overlap.go b/leetcode/0836.Rectangle-Overlap/836. Rectangle Overlap.go similarity index 100% rename from Algorithms/0836.Rectangle-Overlap/836. Rectangle Overlap.go rename to leetcode/0836.Rectangle-Overlap/836. Rectangle Overlap.go diff --git a/Algorithms/0836.Rectangle-Overlap/836. Rectangle Overlap_test.go b/leetcode/0836.Rectangle-Overlap/836. Rectangle Overlap_test.go similarity index 100% rename from Algorithms/0836.Rectangle-Overlap/836. Rectangle Overlap_test.go rename to leetcode/0836.Rectangle-Overlap/836. Rectangle Overlap_test.go diff --git a/Algorithms/0836.Rectangle-Overlap/README.md b/leetcode/0836.Rectangle-Overlap/README.md similarity index 100% rename from Algorithms/0836.Rectangle-Overlap/README.md rename to leetcode/0836.Rectangle-Overlap/README.md diff --git a/Algorithms/0838.Push-Dominoes/838. Push Dominoes.go b/leetcode/0838.Push-Dominoes/838. Push Dominoes.go similarity index 100% rename from Algorithms/0838.Push-Dominoes/838. Push Dominoes.go rename to leetcode/0838.Push-Dominoes/838. Push Dominoes.go diff --git a/Algorithms/0838.Push-Dominoes/838. Push Dominoes_test.go b/leetcode/0838.Push-Dominoes/838. Push Dominoes_test.go similarity index 100% rename from Algorithms/0838.Push-Dominoes/838. Push Dominoes_test.go rename to leetcode/0838.Push-Dominoes/838. Push Dominoes_test.go diff --git a/Algorithms/0838.Push-Dominoes/README.md b/leetcode/0838.Push-Dominoes/README.md similarity index 100% rename from Algorithms/0838.Push-Dominoes/README.md rename to leetcode/0838.Push-Dominoes/README.md diff --git a/Algorithms/0839.Similar-String-Groups/839. Similar String Groups.go b/leetcode/0839.Similar-String-Groups/839. Similar String Groups.go similarity index 100% rename from Algorithms/0839.Similar-String-Groups/839. Similar String Groups.go rename to leetcode/0839.Similar-String-Groups/839. Similar String Groups.go diff --git a/Algorithms/0839.Similar-String-Groups/839. Similar String Groups_test.go b/leetcode/0839.Similar-String-Groups/839. Similar String Groups_test.go similarity index 100% rename from Algorithms/0839.Similar-String-Groups/839. Similar String Groups_test.go rename to leetcode/0839.Similar-String-Groups/839. Similar String Groups_test.go diff --git a/Algorithms/0839.Similar-String-Groups/README.md b/leetcode/0839.Similar-String-Groups/README.md similarity index 100% rename from Algorithms/0839.Similar-String-Groups/README.md rename to leetcode/0839.Similar-String-Groups/README.md diff --git a/Algorithms/0841.Keys-and-Rooms/841. Keys and Rooms.go b/leetcode/0841.Keys-and-Rooms/841. Keys and Rooms.go similarity index 100% rename from Algorithms/0841.Keys-and-Rooms/841. Keys and Rooms.go rename to leetcode/0841.Keys-and-Rooms/841. Keys and Rooms.go diff --git a/Algorithms/0841.Keys-and-Rooms/841. Keys and Rooms_test.go b/leetcode/0841.Keys-and-Rooms/841. Keys and Rooms_test.go similarity index 100% rename from Algorithms/0841.Keys-and-Rooms/841. Keys and Rooms_test.go rename to leetcode/0841.Keys-and-Rooms/841. Keys and Rooms_test.go diff --git a/Algorithms/0841.Keys-and-Rooms/README.md b/leetcode/0841.Keys-and-Rooms/README.md similarity index 100% rename from Algorithms/0841.Keys-and-Rooms/README.md rename to leetcode/0841.Keys-and-Rooms/README.md diff --git a/Algorithms/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go b/leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go similarity index 100% rename from Algorithms/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go rename to leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go diff --git a/Algorithms/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence_test.go b/leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence_test.go similarity index 100% rename from Algorithms/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence_test.go rename to leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence_test.go diff --git a/Algorithms/0842.Split-Array-into-Fibonacci-Sequence/README.md b/leetcode/0842.Split-Array-into-Fibonacci-Sequence/README.md similarity index 100% rename from Algorithms/0842.Split-Array-into-Fibonacci-Sequence/README.md rename to leetcode/0842.Split-Array-into-Fibonacci-Sequence/README.md diff --git a/Algorithms/0844.Backspace-String-Compare/844. Backspace String Compare.go b/leetcode/0844.Backspace-String-Compare/844. Backspace String Compare.go similarity index 100% rename from Algorithms/0844.Backspace-String-Compare/844. Backspace String Compare.go rename to leetcode/0844.Backspace-String-Compare/844. Backspace String Compare.go diff --git a/Algorithms/0844.Backspace-String-Compare/844. Backspace String Compare_test.go b/leetcode/0844.Backspace-String-Compare/844. Backspace String Compare_test.go similarity index 100% rename from Algorithms/0844.Backspace-String-Compare/844. Backspace String Compare_test.go rename to leetcode/0844.Backspace-String-Compare/844. Backspace String Compare_test.go diff --git a/Algorithms/0844.Backspace-String-Compare/README.md b/leetcode/0844.Backspace-String-Compare/README.md similarity index 100% rename from Algorithms/0844.Backspace-String-Compare/README.md rename to leetcode/0844.Backspace-String-Compare/README.md diff --git a/Algorithms/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array.go b/leetcode/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array.go similarity index 100% rename from Algorithms/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array.go rename to leetcode/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array.go diff --git a/Algorithms/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array_test.go b/leetcode/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array_test.go similarity index 100% rename from Algorithms/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array_test.go rename to leetcode/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array_test.go diff --git a/Algorithms/0845.Longest-Mountain-in-Array/README.md b/leetcode/0845.Longest-Mountain-in-Array/README.md similarity index 100% rename from Algorithms/0845.Longest-Mountain-in-Array/README.md rename to leetcode/0845.Longest-Mountain-in-Array/README.md diff --git a/Algorithms/0850.Rectangle-Area-II/850. Rectangle Area II.go b/leetcode/0850.Rectangle-Area-II/850. Rectangle Area II.go similarity index 100% rename from Algorithms/0850.Rectangle-Area-II/850. Rectangle Area II.go rename to leetcode/0850.Rectangle-Area-II/850. Rectangle Area II.go diff --git a/Algorithms/0850.Rectangle-Area-II/850. Rectangle Area II_test.go b/leetcode/0850.Rectangle-Area-II/850. Rectangle Area II_test.go similarity index 100% rename from Algorithms/0850.Rectangle-Area-II/850. Rectangle Area II_test.go rename to leetcode/0850.Rectangle-Area-II/850. Rectangle Area II_test.go diff --git a/Algorithms/0850.Rectangle-Area-II/README.md b/leetcode/0850.Rectangle-Area-II/README.md similarity index 100% rename from Algorithms/0850.Rectangle-Area-II/README.md rename to leetcode/0850.Rectangle-Area-II/README.md diff --git a/Algorithms/0851.Loud-and-Rich/851. Loud and Rich.go b/leetcode/0851.Loud-and-Rich/851. Loud and Rich.go similarity index 100% rename from Algorithms/0851.Loud-and-Rich/851. Loud and Rich.go rename to leetcode/0851.Loud-and-Rich/851. Loud and Rich.go diff --git a/Algorithms/0851.Loud-and-Rich/851. Loud and Rich_test.go b/leetcode/0851.Loud-and-Rich/851. Loud and Rich_test.go similarity index 100% rename from Algorithms/0851.Loud-and-Rich/851. Loud and Rich_test.go rename to leetcode/0851.Loud-and-Rich/851. Loud and Rich_test.go diff --git a/Algorithms/0851.Loud-and-Rich/README.md b/leetcode/0851.Loud-and-Rich/README.md similarity index 100% rename from Algorithms/0851.Loud-and-Rich/README.md rename to leetcode/0851.Loud-and-Rich/README.md diff --git a/Algorithms/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array.go b/leetcode/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array.go similarity index 100% rename from Algorithms/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array.go rename to leetcode/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array.go diff --git a/Algorithms/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array_test.go b/leetcode/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array_test.go similarity index 100% rename from Algorithms/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array_test.go rename to leetcode/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array_test.go diff --git a/Algorithms/0852.Peak-Index-in-a-Mountain-Array/README.md b/leetcode/0852.Peak-Index-in-a-Mountain-Array/README.md similarity index 100% rename from Algorithms/0852.Peak-Index-in-a-Mountain-Array/README.md rename to leetcode/0852.Peak-Index-in-a-Mountain-Array/README.md diff --git a/Algorithms/0853.Car-Fleet/853. Car Fleet.go b/leetcode/0853.Car-Fleet/853. Car Fleet.go similarity index 100% rename from Algorithms/0853.Car-Fleet/853. Car Fleet.go rename to leetcode/0853.Car-Fleet/853. Car Fleet.go diff --git a/Algorithms/0853.Car-Fleet/853. Car Fleet_test.go b/leetcode/0853.Car-Fleet/853. Car Fleet_test.go similarity index 100% rename from Algorithms/0853.Car-Fleet/853. Car Fleet_test.go rename to leetcode/0853.Car-Fleet/853. Car Fleet_test.go diff --git a/Algorithms/0853.Car-Fleet/README.md b/leetcode/0853.Car-Fleet/README.md similarity index 100% rename from Algorithms/0853.Car-Fleet/README.md rename to leetcode/0853.Car-Fleet/README.md diff --git a/Algorithms/0856.Score-of-Parentheses/856. Score of Parentheses.go b/leetcode/0856.Score-of-Parentheses/856. Score of Parentheses.go similarity index 100% rename from Algorithms/0856.Score-of-Parentheses/856. Score of Parentheses.go rename to leetcode/0856.Score-of-Parentheses/856. Score of Parentheses.go diff --git a/Algorithms/0856.Score-of-Parentheses/856. Score of Parentheses_test.go b/leetcode/0856.Score-of-Parentheses/856. Score of Parentheses_test.go similarity index 100% rename from Algorithms/0856.Score-of-Parentheses/856. Score of Parentheses_test.go rename to leetcode/0856.Score-of-Parentheses/856. Score of Parentheses_test.go diff --git a/Algorithms/0856.Score-of-Parentheses/README.md b/leetcode/0856.Score-of-Parentheses/README.md similarity index 100% rename from Algorithms/0856.Score-of-Parentheses/README.md rename to leetcode/0856.Score-of-Parentheses/README.md diff --git a/Algorithms/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K.go b/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K.go similarity index 100% rename from Algorithms/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K.go rename to leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K.go diff --git a/Algorithms/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K_test.go b/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K_test.go similarity index 100% rename from Algorithms/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K_test.go rename to leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K_test.go diff --git a/Algorithms/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md b/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md similarity index 100% rename from Algorithms/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md rename to leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md diff --git a/Algorithms/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree.go b/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree.go similarity index 100% rename from Algorithms/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree.go rename to leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree.go diff --git a/Algorithms/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree_test.go b/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree_test.go similarity index 100% rename from Algorithms/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree_test.go rename to leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree_test.go diff --git a/Algorithms/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md b/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md similarity index 100% rename from Algorithms/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md rename to leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md diff --git a/Algorithms/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys.go b/leetcode/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys.go similarity index 100% rename from Algorithms/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys.go rename to leetcode/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys.go diff --git a/Algorithms/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys_test.go b/leetcode/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys_test.go similarity index 100% rename from Algorithms/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys_test.go rename to leetcode/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys_test.go diff --git a/Algorithms/0864.Shortest-Path-to-Get-All-Keys/README.md b/leetcode/0864.Shortest-Path-to-Get-All-Keys/README.md similarity index 100% rename from Algorithms/0864.Shortest-Path-to-Get-All-Keys/README.md rename to leetcode/0864.Shortest-Path-to-Get-All-Keys/README.md diff --git a/Algorithms/0867.Transpose-Matrix/867. Transpose Matrix.go b/leetcode/0867.Transpose-Matrix/867. Transpose Matrix.go similarity index 100% rename from Algorithms/0867.Transpose-Matrix/867. Transpose Matrix.go rename to leetcode/0867.Transpose-Matrix/867. Transpose Matrix.go diff --git a/Algorithms/0867.Transpose-Matrix/867. Transpose Matrix_test.go b/leetcode/0867.Transpose-Matrix/867. Transpose Matrix_test.go similarity index 100% rename from Algorithms/0867.Transpose-Matrix/867. Transpose Matrix_test.go rename to leetcode/0867.Transpose-Matrix/867. Transpose Matrix_test.go diff --git a/Algorithms/0867.Transpose-Matrix/README.md b/leetcode/0867.Transpose-Matrix/README.md similarity index 100% rename from Algorithms/0867.Transpose-Matrix/README.md rename to leetcode/0867.Transpose-Matrix/README.md diff --git a/Algorithms/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees.go b/leetcode/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees.go similarity index 100% rename from Algorithms/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees.go rename to leetcode/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees.go diff --git a/Algorithms/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees_test.go b/leetcode/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees_test.go similarity index 100% rename from Algorithms/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees_test.go rename to leetcode/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees_test.go diff --git a/Algorithms/0872.Leaf-Similar-Trees/README.md b/leetcode/0872.Leaf-Similar-Trees/README.md similarity index 100% rename from Algorithms/0872.Leaf-Similar-Trees/README.md rename to leetcode/0872.Leaf-Similar-Trees/README.md diff --git a/Algorithms/0875.Koko-Eating-Bananas/875. Koko Eating Bananas.go b/leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas.go similarity index 100% rename from Algorithms/0875.Koko-Eating-Bananas/875. Koko Eating Bananas.go rename to leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas.go diff --git a/Algorithms/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go b/leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go similarity index 100% rename from Algorithms/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go rename to leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go diff --git a/Algorithms/0875.Koko-Eating-Bananas/README.md b/leetcode/0875.Koko-Eating-Bananas/README.md similarity index 100% rename from Algorithms/0875.Koko-Eating-Bananas/README.md rename to leetcode/0875.Koko-Eating-Bananas/README.md diff --git a/Algorithms/0876.Middle-of-the-Linked-List/876. Middle of the Linked List.go b/leetcode/0876.Middle-of-the-Linked-List/876. Middle of the Linked List.go similarity index 100% rename from Algorithms/0876.Middle-of-the-Linked-List/876. Middle of the Linked List.go rename to leetcode/0876.Middle-of-the-Linked-List/876. Middle of the Linked List.go diff --git a/Algorithms/0876.Middle-of-the-Linked-List/876. Middle of the Linked List_test.go b/leetcode/0876.Middle-of-the-Linked-List/876. Middle of the Linked List_test.go similarity index 100% rename from Algorithms/0876.Middle-of-the-Linked-List/876. Middle of the Linked List_test.go rename to leetcode/0876.Middle-of-the-Linked-List/876. Middle of the Linked List_test.go diff --git a/Algorithms/0876.Middle-of-the-Linked-List/README.md b/leetcode/0876.Middle-of-the-Linked-List/README.md similarity index 100% rename from Algorithms/0876.Middle-of-the-Linked-List/README.md rename to leetcode/0876.Middle-of-the-Linked-List/README.md diff --git a/Algorithms/0878.Nth-Magical-Number/878. Nth Magical Number.go b/leetcode/0878.Nth-Magical-Number/878. Nth Magical Number.go similarity index 100% rename from Algorithms/0878.Nth-Magical-Number/878. Nth Magical Number.go rename to leetcode/0878.Nth-Magical-Number/878. Nth Magical Number.go diff --git a/Algorithms/0878.Nth-Magical-Number/878. Nth Magical Number_test.go b/leetcode/0878.Nth-Magical-Number/878. Nth Magical Number_test.go similarity index 100% rename from Algorithms/0878.Nth-Magical-Number/878. Nth Magical Number_test.go rename to leetcode/0878.Nth-Magical-Number/878. Nth Magical Number_test.go diff --git a/Algorithms/0878.Nth-Magical-Number/README.md b/leetcode/0878.Nth-Magical-Number/README.md similarity index 100% rename from Algorithms/0878.Nth-Magical-Number/README.md rename to leetcode/0878.Nth-Magical-Number/README.md diff --git a/Algorithms/0880.Decoded-String-at-Index/880. Decoded String at Index.go b/leetcode/0880.Decoded-String-at-Index/880. Decoded String at Index.go similarity index 100% rename from Algorithms/0880.Decoded-String-at-Index/880. Decoded String at Index.go rename to leetcode/0880.Decoded-String-at-Index/880. Decoded String at Index.go diff --git a/Algorithms/0880.Decoded-String-at-Index/880. Decoded String at Index_test.go b/leetcode/0880.Decoded-String-at-Index/880. Decoded String at Index_test.go similarity index 100% rename from Algorithms/0880.Decoded-String-at-Index/880. Decoded String at Index_test.go rename to leetcode/0880.Decoded-String-at-Index/880. Decoded String at Index_test.go diff --git a/Algorithms/0880.Decoded-String-at-Index/README.md b/leetcode/0880.Decoded-String-at-Index/README.md similarity index 100% rename from Algorithms/0880.Decoded-String-at-Index/README.md rename to leetcode/0880.Decoded-String-at-Index/README.md diff --git a/Algorithms/0881.Boats-to-Save-People/881. Boats to Save People.go b/leetcode/0881.Boats-to-Save-People/881. Boats to Save People.go similarity index 100% rename from Algorithms/0881.Boats-to-Save-People/881. Boats to Save People.go rename to leetcode/0881.Boats-to-Save-People/881. Boats to Save People.go diff --git a/Algorithms/0881.Boats-to-Save-People/881. Boats to Save People_test.go b/leetcode/0881.Boats-to-Save-People/881. Boats to Save People_test.go similarity index 100% rename from Algorithms/0881.Boats-to-Save-People/881. Boats to Save People_test.go rename to leetcode/0881.Boats-to-Save-People/881. Boats to Save People_test.go diff --git a/Algorithms/0881.Boats-to-Save-People/README.md b/leetcode/0881.Boats-to-Save-People/README.md similarity index 100% rename from Algorithms/0881.Boats-to-Save-People/README.md rename to leetcode/0881.Boats-to-Save-People/README.md diff --git a/Algorithms/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences.go b/leetcode/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences.go similarity index 100% rename from Algorithms/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences.go rename to leetcode/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences.go diff --git a/Algorithms/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences_test.go b/leetcode/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences_test.go similarity index 100% rename from Algorithms/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences_test.go rename to leetcode/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences_test.go diff --git a/Algorithms/0884.Uncommon-Words-from-Two-Sentences/README.md b/leetcode/0884.Uncommon-Words-from-Two-Sentences/README.md similarity index 100% rename from Algorithms/0884.Uncommon-Words-from-Two-Sentences/README.md rename to leetcode/0884.Uncommon-Words-from-Two-Sentences/README.md diff --git a/Algorithms/0885.Spiral-Matrix-III/885. Spiral Matrix III.go b/leetcode/0885.Spiral-Matrix-III/885. Spiral Matrix III.go similarity index 100% rename from Algorithms/0885.Spiral-Matrix-III/885. Spiral Matrix III.go rename to leetcode/0885.Spiral-Matrix-III/885. Spiral Matrix III.go diff --git a/Algorithms/0885.Spiral-Matrix-III/885. Spiral Matrix III_test.go b/leetcode/0885.Spiral-Matrix-III/885. Spiral Matrix III_test.go similarity index 100% rename from Algorithms/0885.Spiral-Matrix-III/885. Spiral Matrix III_test.go rename to leetcode/0885.Spiral-Matrix-III/885. Spiral Matrix III_test.go diff --git a/Algorithms/0885.Spiral-Matrix-III/README.md b/leetcode/0885.Spiral-Matrix-III/README.md similarity index 100% rename from Algorithms/0885.Spiral-Matrix-III/README.md rename to leetcode/0885.Spiral-Matrix-III/README.md diff --git a/Algorithms/0887.Super-Egg-Drop/887. Super Egg Drop.go b/leetcode/0887.Super-Egg-Drop/887. Super Egg Drop.go similarity index 100% rename from Algorithms/0887.Super-Egg-Drop/887. Super Egg Drop.go rename to leetcode/0887.Super-Egg-Drop/887. Super Egg Drop.go diff --git a/Algorithms/0887.Super-Egg-Drop/887. Super Egg Drop_test.go b/leetcode/0887.Super-Egg-Drop/887. Super Egg Drop_test.go similarity index 100% rename from Algorithms/0887.Super-Egg-Drop/887. Super Egg Drop_test.go rename to leetcode/0887.Super-Egg-Drop/887. Super Egg Drop_test.go diff --git a/Algorithms/0887.Super-Egg-Drop/README.md b/leetcode/0887.Super-Egg-Drop/README.md similarity index 100% rename from Algorithms/0887.Super-Egg-Drop/README.md rename to leetcode/0887.Super-Egg-Drop/README.md diff --git a/Algorithms/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go b/leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go similarity index 100% rename from Algorithms/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go rename to leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go diff --git a/Algorithms/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths_test.go b/leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths_test.go similarity index 100% rename from Algorithms/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths_test.go rename to leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths_test.go diff --git a/Algorithms/0891.Sum-of-Subsequence-Widths/README.md b/leetcode/0891.Sum-of-Subsequence-Widths/README.md similarity index 100% rename from Algorithms/0891.Sum-of-Subsequence-Widths/README.md rename to leetcode/0891.Sum-of-Subsequence-Widths/README.md diff --git a/Algorithms/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack.go b/leetcode/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack.go similarity index 100% rename from Algorithms/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack.go rename to leetcode/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack.go diff --git a/Algorithms/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack_test.go b/leetcode/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack_test.go similarity index 100% rename from Algorithms/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack_test.go rename to leetcode/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack_test.go diff --git a/Algorithms/0895.Maximum-Frequency-Stack/README.md b/leetcode/0895.Maximum-Frequency-Stack/README.md similarity index 100% rename from Algorithms/0895.Maximum-Frequency-Stack/README.md rename to leetcode/0895.Maximum-Frequency-Stack/README.md diff --git a/Algorithms/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree.go b/leetcode/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree.go similarity index 100% rename from Algorithms/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree.go rename to leetcode/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree.go diff --git a/Algorithms/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree_test.go b/leetcode/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree_test.go similarity index 100% rename from Algorithms/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree_test.go rename to leetcode/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree_test.go diff --git a/Algorithms/0897.Increasing-Order-Search-Tree/README.md b/leetcode/0897.Increasing-Order-Search-Tree/README.md similarity index 100% rename from Algorithms/0897.Increasing-Order-Search-Tree/README.md rename to leetcode/0897.Increasing-Order-Search-Tree/README.md diff --git a/Algorithms/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays.go b/leetcode/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays.go similarity index 100% rename from Algorithms/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays.go rename to leetcode/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays.go diff --git a/Algorithms/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays_test.go b/leetcode/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays_test.go similarity index 100% rename from Algorithms/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays_test.go rename to leetcode/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays_test.go diff --git a/Algorithms/0898.Bitwise-ORs-of-Subarrays/README.md b/leetcode/0898.Bitwise-ORs-of-Subarrays/README.md similarity index 100% rename from Algorithms/0898.Bitwise-ORs-of-Subarrays/README.md rename to leetcode/0898.Bitwise-ORs-of-Subarrays/README.md diff --git a/Algorithms/0901.Online-Stock-Span/901. Online Stock Span.go b/leetcode/0901.Online-Stock-Span/901. Online Stock Span.go similarity index 100% rename from Algorithms/0901.Online-Stock-Span/901. Online Stock Span.go rename to leetcode/0901.Online-Stock-Span/901. Online Stock Span.go diff --git a/Algorithms/0901.Online-Stock-Span/901. Online Stock Span_test.go b/leetcode/0901.Online-Stock-Span/901. Online Stock Span_test.go similarity index 100% rename from Algorithms/0901.Online-Stock-Span/901. Online Stock Span_test.go rename to leetcode/0901.Online-Stock-Span/901. Online Stock Span_test.go diff --git a/Algorithms/0901.Online-Stock-Span/README.md b/leetcode/0901.Online-Stock-Span/README.md similarity index 100% rename from Algorithms/0901.Online-Stock-Span/README.md rename to leetcode/0901.Online-Stock-Span/README.md diff --git a/Algorithms/0904.Fruit-Into-Baskets/904. Fruit Into Baskets.go b/leetcode/0904.Fruit-Into-Baskets/904. Fruit Into Baskets.go similarity index 100% rename from Algorithms/0904.Fruit-Into-Baskets/904. Fruit Into Baskets.go rename to leetcode/0904.Fruit-Into-Baskets/904. Fruit Into Baskets.go diff --git a/Algorithms/0904.Fruit-Into-Baskets/904. Fruit Into Baskets_test.go b/leetcode/0904.Fruit-Into-Baskets/904. Fruit Into Baskets_test.go similarity index 100% rename from Algorithms/0904.Fruit-Into-Baskets/904. Fruit Into Baskets_test.go rename to leetcode/0904.Fruit-Into-Baskets/904. Fruit Into Baskets_test.go diff --git a/Algorithms/0904.Fruit-Into-Baskets/README.md b/leetcode/0904.Fruit-Into-Baskets/README.md similarity index 100% rename from Algorithms/0904.Fruit-Into-Baskets/README.md rename to leetcode/0904.Fruit-Into-Baskets/README.md diff --git a/Algorithms/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums.go b/leetcode/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums.go similarity index 100% rename from Algorithms/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums.go rename to leetcode/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums.go diff --git a/Algorithms/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums_test.go b/leetcode/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums_test.go similarity index 100% rename from Algorithms/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums_test.go rename to leetcode/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums_test.go diff --git a/Algorithms/0907.Sum-of-Subarray-Minimums/README.md b/leetcode/0907.Sum-of-Subarray-Minimums/README.md similarity index 100% rename from Algorithms/0907.Sum-of-Subarray-Minimums/README.md rename to leetcode/0907.Sum-of-Subarray-Minimums/README.md diff --git a/Algorithms/0911.Online-Election/911. Online Election.go b/leetcode/0911.Online-Election/911. Online Election.go similarity index 100% rename from Algorithms/0911.Online-Election/911. Online Election.go rename to leetcode/0911.Online-Election/911. Online Election.go diff --git a/Algorithms/0911.Online-Election/911. Online Election_test.go b/leetcode/0911.Online-Election/911. Online Election_test.go similarity index 100% rename from Algorithms/0911.Online-Election/911. Online Election_test.go rename to leetcode/0911.Online-Election/911. Online Election_test.go diff --git a/Algorithms/0911.Online-Election/README.md b/leetcode/0911.Online-Election/README.md similarity index 100% rename from Algorithms/0911.Online-Election/README.md rename to leetcode/0911.Online-Election/README.md diff --git a/Algorithms/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go b/leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go similarity index 100% rename from Algorithms/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go rename to leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go diff --git a/Algorithms/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray_test.go b/leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray_test.go similarity index 100% rename from Algorithms/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray_test.go rename to leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray_test.go diff --git a/Algorithms/0918.Maximum-Sum-Circular-Subarray/README.md b/leetcode/0918.Maximum-Sum-Circular-Subarray/README.md similarity index 100% rename from Algorithms/0918.Maximum-Sum-Circular-Subarray/README.md rename to leetcode/0918.Maximum-Sum-Circular-Subarray/README.md diff --git a/Algorithms/0920.Number-of-Music-Playlists/920. Number of Music Playlists.go b/leetcode/0920.Number-of-Music-Playlists/920. Number of Music Playlists.go similarity index 100% rename from Algorithms/0920.Number-of-Music-Playlists/920. Number of Music Playlists.go rename to leetcode/0920.Number-of-Music-Playlists/920. Number of Music Playlists.go diff --git a/Algorithms/0920.Number-of-Music-Playlists/920. Number of Music Playlists_test.go b/leetcode/0920.Number-of-Music-Playlists/920. Number of Music Playlists_test.go similarity index 100% rename from Algorithms/0920.Number-of-Music-Playlists/920. Number of Music Playlists_test.go rename to leetcode/0920.Number-of-Music-Playlists/920. Number of Music Playlists_test.go diff --git a/Algorithms/0920.Number-of-Music-Playlists/README.md b/leetcode/0920.Number-of-Music-Playlists/README.md similarity index 100% rename from Algorithms/0920.Number-of-Music-Playlists/README.md rename to leetcode/0920.Number-of-Music-Playlists/README.md diff --git a/Algorithms/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid.go b/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid.go similarity index 100% rename from Algorithms/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid.go rename to leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid.go diff --git a/Algorithms/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid_test.go b/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid_test.go similarity index 100% rename from Algorithms/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid_test.go rename to leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid_test.go diff --git a/Algorithms/0921.Minimum-Add-to-Make-Parentheses-Valid/README.md b/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/README.md similarity index 100% rename from Algorithms/0921.Minimum-Add-to-Make-Parentheses-Valid/README.md rename to leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/README.md diff --git a/Algorithms/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II.go b/leetcode/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II.go similarity index 100% rename from Algorithms/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II.go rename to leetcode/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II.go diff --git a/Algorithms/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II_test.go b/leetcode/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II_test.go similarity index 100% rename from Algorithms/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II_test.go rename to leetcode/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II_test.go diff --git a/Algorithms/0922.Sort-Array-By-Parity-II/README.md b/leetcode/0922.Sort-Array-By-Parity-II/README.md similarity index 100% rename from Algorithms/0922.Sort-Array-By-Parity-II/README.md rename to leetcode/0922.Sort-Array-By-Parity-II/README.md diff --git a/Algorithms/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity.go b/leetcode/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity.go similarity index 100% rename from Algorithms/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity.go rename to leetcode/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity.go diff --git a/Algorithms/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity_test.go b/leetcode/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity_test.go similarity index 100% rename from Algorithms/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity_test.go rename to leetcode/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity_test.go diff --git a/Algorithms/0923.3Sum-With-Multiplicity/README.md b/leetcode/0923.3Sum-With-Multiplicity/README.md similarity index 100% rename from Algorithms/0923.3Sum-With-Multiplicity/README.md rename to leetcode/0923.3Sum-With-Multiplicity/README.md diff --git a/Algorithms/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go b/leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go similarity index 100% rename from Algorithms/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go rename to leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go diff --git a/Algorithms/0924.Minimize-Malware-Spread/924. Minimize Malware Spread_test.go b/leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread_test.go similarity index 100% rename from Algorithms/0924.Minimize-Malware-Spread/924. Minimize Malware Spread_test.go rename to leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread_test.go diff --git a/Algorithms/0924.Minimize-Malware-Spread/README.md b/leetcode/0924.Minimize-Malware-Spread/README.md similarity index 100% rename from Algorithms/0924.Minimize-Malware-Spread/README.md rename to leetcode/0924.Minimize-Malware-Spread/README.md diff --git a/Algorithms/0925.Long-Pressed-Name/925. Long Pressed Name.go b/leetcode/0925.Long-Pressed-Name/925. Long Pressed Name.go similarity index 100% rename from Algorithms/0925.Long-Pressed-Name/925. Long Pressed Name.go rename to leetcode/0925.Long-Pressed-Name/925. Long Pressed Name.go diff --git a/Algorithms/0925.Long-Pressed-Name/925. Long Pressed Name_test.go b/leetcode/0925.Long-Pressed-Name/925. Long Pressed Name_test.go similarity index 100% rename from Algorithms/0925.Long-Pressed-Name/925. Long Pressed Name_test.go rename to leetcode/0925.Long-Pressed-Name/925. Long Pressed Name_test.go diff --git a/Algorithms/0925.Long-Pressed-Name/README.md b/leetcode/0925.Long-Pressed-Name/README.md similarity index 100% rename from Algorithms/0925.Long-Pressed-Name/README.md rename to leetcode/0925.Long-Pressed-Name/README.md diff --git a/Algorithms/0927.Three-Equal-Parts/927. Three Equal Parts.go b/leetcode/0927.Three-Equal-Parts/927. Three Equal Parts.go similarity index 100% rename from Algorithms/0927.Three-Equal-Parts/927. Three Equal Parts.go rename to leetcode/0927.Three-Equal-Parts/927. Three Equal Parts.go diff --git a/Algorithms/0927.Three-Equal-Parts/927. Three Equal Parts_test.go b/leetcode/0927.Three-Equal-Parts/927. Three Equal Parts_test.go similarity index 100% rename from Algorithms/0927.Three-Equal-Parts/927. Three Equal Parts_test.go rename to leetcode/0927.Three-Equal-Parts/927. Three Equal Parts_test.go diff --git a/Algorithms/0927.Three-Equal-Parts/README.md b/leetcode/0927.Three-Equal-Parts/README.md similarity index 100% rename from Algorithms/0927.Three-Equal-Parts/README.md rename to leetcode/0927.Three-Equal-Parts/README.md diff --git a/Algorithms/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II.go b/leetcode/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II.go similarity index 100% rename from Algorithms/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II.go rename to leetcode/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II.go diff --git a/Algorithms/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II_test.go b/leetcode/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II_test.go similarity index 100% rename from Algorithms/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II_test.go rename to leetcode/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II_test.go diff --git a/Algorithms/0928.Minimize-Malware-Spread-II/README.md b/leetcode/0928.Minimize-Malware-Spread-II/README.md similarity index 100% rename from Algorithms/0928.Minimize-Malware-Spread-II/README.md rename to leetcode/0928.Minimize-Malware-Spread-II/README.md diff --git a/Algorithms/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum.go b/leetcode/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum.go similarity index 100% rename from Algorithms/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum.go rename to leetcode/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum.go diff --git a/Algorithms/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum_test.go b/leetcode/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum_test.go similarity index 100% rename from Algorithms/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum_test.go rename to leetcode/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum_test.go diff --git a/Algorithms/0930.Binary-Subarrays-With-Sum/README.md b/leetcode/0930.Binary-Subarrays-With-Sum/README.md similarity index 100% rename from Algorithms/0930.Binary-Subarrays-With-Sum/README.md rename to leetcode/0930.Binary-Subarrays-With-Sum/README.md diff --git a/Algorithms/0933.Number-of-Recent-Calls/933. Number of Recent Calls.go b/leetcode/0933.Number-of-Recent-Calls/933. Number of Recent Calls.go similarity index 100% rename from Algorithms/0933.Number-of-Recent-Calls/933. Number of Recent Calls.go rename to leetcode/0933.Number-of-Recent-Calls/933. Number of Recent Calls.go diff --git a/Algorithms/0933.Number-of-Recent-Calls/933. Number of Recent Calls_test.go b/leetcode/0933.Number-of-Recent-Calls/933. Number of Recent Calls_test.go similarity index 100% rename from Algorithms/0933.Number-of-Recent-Calls/933. Number of Recent Calls_test.go rename to leetcode/0933.Number-of-Recent-Calls/933. Number of Recent Calls_test.go diff --git a/Algorithms/0933.Number-of-Recent-Calls/README.md b/leetcode/0933.Number-of-Recent-Calls/README.md similarity index 100% rename from Algorithms/0933.Number-of-Recent-Calls/README.md rename to leetcode/0933.Number-of-Recent-Calls/README.md diff --git a/Algorithms/0942.DI-String-Match/942. DI String Match.go b/leetcode/0942.DI-String-Match/942. DI String Match.go similarity index 100% rename from Algorithms/0942.DI-String-Match/942. DI String Match.go rename to leetcode/0942.DI-String-Match/942. DI String Match.go diff --git a/Algorithms/0942.DI-String-Match/942. DI String Match_test.go b/leetcode/0942.DI-String-Match/942. DI String Match_test.go similarity index 100% rename from Algorithms/0942.DI-String-Match/942. DI String Match_test.go rename to leetcode/0942.DI-String-Match/942. DI String Match_test.go diff --git a/Algorithms/0942.DI-String-Match/README.md b/leetcode/0942.DI-String-Match/README.md similarity index 100% rename from Algorithms/0942.DI-String-Match/README.md rename to leetcode/0942.DI-String-Match/README.md diff --git a/Algorithms/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go b/leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go similarity index 100% rename from Algorithms/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go rename to leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go diff --git a/Algorithms/0946.Validate-Stack-Sequences/946. Validate Stack Sequences_test.go b/leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences_test.go similarity index 100% rename from Algorithms/0946.Validate-Stack-Sequences/946. Validate Stack Sequences_test.go rename to leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences_test.go diff --git a/Algorithms/0946.Validate-Stack-Sequences/README.md b/leetcode/0946.Validate-Stack-Sequences/README.md similarity index 100% rename from Algorithms/0946.Validate-Stack-Sequences/README.md rename to leetcode/0946.Validate-Stack-Sequences/README.md diff --git a/Algorithms/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column.go b/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column.go similarity index 100% rename from Algorithms/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column.go rename to leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column.go diff --git a/Algorithms/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column_test.go b/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column_test.go similarity index 100% rename from Algorithms/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column_test.go rename to leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column_test.go diff --git a/Algorithms/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md b/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md similarity index 100% rename from Algorithms/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md rename to leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md diff --git a/Algorithms/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor.go b/leetcode/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor.go similarity index 100% rename from Algorithms/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor.go rename to leetcode/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor.go diff --git a/Algorithms/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor_test.go b/leetcode/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor_test.go similarity index 100% rename from Algorithms/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor_test.go rename to leetcode/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor_test.go diff --git a/Algorithms/0952.Largest-Component-Size-by-Common-Factor/README.md b/leetcode/0952.Largest-Component-Size-by-Common-Factor/README.md similarity index 100% rename from Algorithms/0952.Largest-Component-Size-by-Common-Factor/README.md rename to leetcode/0952.Largest-Component-Size-by-Common-Factor/README.md diff --git a/Algorithms/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary.go b/leetcode/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary.go similarity index 100% rename from Algorithms/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary.go rename to leetcode/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary.go diff --git a/Algorithms/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary_test.go b/leetcode/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary_test.go similarity index 100% rename from Algorithms/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary_test.go rename to leetcode/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary_test.go diff --git a/Algorithms/0953.Verifying-an-Alien-Dictionary/README.md b/leetcode/0953.Verifying-an-Alien-Dictionary/README.md similarity index 100% rename from Algorithms/0953.Verifying-an-Alien-Dictionary/README.md rename to leetcode/0953.Verifying-an-Alien-Dictionary/README.md diff --git a/Algorithms/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes.go b/leetcode/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes.go similarity index 100% rename from Algorithms/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes.go rename to leetcode/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes.go diff --git a/Algorithms/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes_test.go b/leetcode/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes_test.go similarity index 100% rename from Algorithms/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes_test.go rename to leetcode/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes_test.go diff --git a/Algorithms/0959.Regions-Cut-By-Slashes/README.md b/leetcode/0959.Regions-Cut-By-Slashes/README.md similarity index 100% rename from Algorithms/0959.Regions-Cut-By-Slashes/README.md rename to leetcode/0959.Regions-Cut-By-Slashes/README.md diff --git a/Algorithms/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array.go b/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array.go similarity index 100% rename from Algorithms/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array.go rename to leetcode/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array.go diff --git a/Algorithms/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array_test.go b/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array_test.go similarity index 100% rename from Algorithms/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array_test.go rename to leetcode/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array_test.go diff --git a/Algorithms/0961.N-Repeated-Element-in-Size-2N-Array/README.md b/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/README.md similarity index 100% rename from Algorithms/0961.N-Repeated-Element-in-Size-2N-Array/README.md rename to leetcode/0961.N-Repeated-Element-in-Size-2N-Array/README.md diff --git a/Algorithms/0968.Binary-Tree-Cameras/968. Binary Tree Cameras.go b/leetcode/0968.Binary-Tree-Cameras/968. Binary Tree Cameras.go similarity index 100% rename from Algorithms/0968.Binary-Tree-Cameras/968. Binary Tree Cameras.go rename to leetcode/0968.Binary-Tree-Cameras/968. Binary Tree Cameras.go diff --git a/Algorithms/0968.Binary-Tree-Cameras/968. Binary Tree Cameras_test.go b/leetcode/0968.Binary-Tree-Cameras/968. Binary Tree Cameras_test.go similarity index 100% rename from Algorithms/0968.Binary-Tree-Cameras/968. Binary Tree Cameras_test.go rename to leetcode/0968.Binary-Tree-Cameras/968. Binary Tree Cameras_test.go diff --git a/Algorithms/0968.Binary-Tree-Cameras/README.md b/leetcode/0968.Binary-Tree-Cameras/README.md similarity index 100% rename from Algorithms/0968.Binary-Tree-Cameras/README.md rename to leetcode/0968.Binary-Tree-Cameras/README.md diff --git a/Algorithms/0969.Pancake-Sorting/969. Pancake Sorting.go b/leetcode/0969.Pancake-Sorting/969. Pancake Sorting.go similarity index 100% rename from Algorithms/0969.Pancake-Sorting/969. Pancake Sorting.go rename to leetcode/0969.Pancake-Sorting/969. Pancake Sorting.go diff --git a/Algorithms/0969.Pancake-Sorting/969. Pancake Sorting_test.go b/leetcode/0969.Pancake-Sorting/969. Pancake Sorting_test.go similarity index 100% rename from Algorithms/0969.Pancake-Sorting/969. Pancake Sorting_test.go rename to leetcode/0969.Pancake-Sorting/969. Pancake Sorting_test.go diff --git a/Algorithms/0969.Pancake-Sorting/README.md b/leetcode/0969.Pancake-Sorting/README.md similarity index 100% rename from Algorithms/0969.Pancake-Sorting/README.md rename to leetcode/0969.Pancake-Sorting/README.md diff --git a/Algorithms/0970.Powerful-Integers/970. Powerful Integers.go b/leetcode/0970.Powerful-Integers/970. Powerful Integers.go similarity index 100% rename from Algorithms/0970.Powerful-Integers/970. Powerful Integers.go rename to leetcode/0970.Powerful-Integers/970. Powerful Integers.go diff --git a/Algorithms/0970.Powerful-Integers/970. Powerful Integers_test.go b/leetcode/0970.Powerful-Integers/970. Powerful Integers_test.go similarity index 100% rename from Algorithms/0970.Powerful-Integers/970. Powerful Integers_test.go rename to leetcode/0970.Powerful-Integers/970. Powerful Integers_test.go diff --git a/Algorithms/0970.Powerful-Integers/README.md b/leetcode/0970.Powerful-Integers/README.md similarity index 100% rename from Algorithms/0970.Powerful-Integers/README.md rename to leetcode/0970.Powerful-Integers/README.md diff --git a/Algorithms/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin.go b/leetcode/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin.go similarity index 100% rename from Algorithms/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin.go rename to leetcode/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin.go diff --git a/Algorithms/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin_test.go b/leetcode/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin_test.go similarity index 100% rename from Algorithms/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin_test.go rename to leetcode/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin_test.go diff --git a/Algorithms/0973.K-Closest-Points-to-Origin/README.md b/leetcode/0973.K-Closest-Points-to-Origin/README.md similarity index 100% rename from Algorithms/0973.K-Closest-Points-to-Origin/README.md rename to leetcode/0973.K-Closest-Points-to-Origin/README.md diff --git a/Algorithms/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle.go b/leetcode/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle.go similarity index 100% rename from Algorithms/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle.go rename to leetcode/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle.go diff --git a/Algorithms/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle_test.go b/leetcode/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle_test.go similarity index 100% rename from Algorithms/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle_test.go rename to leetcode/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle_test.go diff --git a/Algorithms/0976.Largest-Perimeter-Triangle/README.md b/leetcode/0976.Largest-Perimeter-Triangle/README.md similarity index 100% rename from Algorithms/0976.Largest-Perimeter-Triangle/README.md rename to leetcode/0976.Largest-Perimeter-Triangle/README.md diff --git a/Algorithms/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array.go b/leetcode/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array.go similarity index 100% rename from Algorithms/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array.go rename to leetcode/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array.go diff --git a/Algorithms/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array_test.go b/leetcode/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array_test.go similarity index 100% rename from Algorithms/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array_test.go rename to leetcode/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array_test.go diff --git a/Algorithms/0977.Squares-of-a-Sorted-Array/README.md b/leetcode/0977.Squares-of-a-Sorted-Array/README.md similarity index 100% rename from Algorithms/0977.Squares-of-a-Sorted-Array/README.md rename to leetcode/0977.Squares-of-a-Sorted-Array/README.md diff --git a/Algorithms/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go b/leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go similarity index 100% rename from Algorithms/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go rename to leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go diff --git a/Algorithms/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray_test.go b/leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray_test.go similarity index 100% rename from Algorithms/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray_test.go rename to leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray_test.go diff --git a/Algorithms/0978.Longest-Turbulent-Subarray/README.md b/leetcode/0978.Longest-Turbulent-Subarray/README.md similarity index 100% rename from Algorithms/0978.Longest-Turbulent-Subarray/README.md rename to leetcode/0978.Longest-Turbulent-Subarray/README.md diff --git a/Algorithms/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree.go b/leetcode/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree.go similarity index 100% rename from Algorithms/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree.go rename to leetcode/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree.go diff --git a/Algorithms/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree_test.go b/leetcode/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree_test.go similarity index 100% rename from Algorithms/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree_test.go rename to leetcode/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree_test.go diff --git a/Algorithms/0979.Distribute-Coins-in-Binary-Tree/README.md b/leetcode/0979.Distribute-Coins-in-Binary-Tree/README.md similarity index 100% rename from Algorithms/0979.Distribute-Coins-in-Binary-Tree/README.md rename to leetcode/0979.Distribute-Coins-in-Binary-Tree/README.md diff --git a/Algorithms/0980.Unique-Paths-III/980. Unique Paths III.go b/leetcode/0980.Unique-Paths-III/980. Unique Paths III.go similarity index 100% rename from Algorithms/0980.Unique-Paths-III/980. Unique Paths III.go rename to leetcode/0980.Unique-Paths-III/980. Unique Paths III.go diff --git a/Algorithms/0980.Unique-Paths-III/980. Unique Paths III_test.go b/leetcode/0980.Unique-Paths-III/980. Unique Paths III_test.go similarity index 100% rename from Algorithms/0980.Unique-Paths-III/980. Unique Paths III_test.go rename to leetcode/0980.Unique-Paths-III/980. Unique Paths III_test.go diff --git a/Algorithms/0980.Unique-Paths-III/README.md b/leetcode/0980.Unique-Paths-III/README.md similarity index 100% rename from Algorithms/0980.Unique-Paths-III/README.md rename to leetcode/0980.Unique-Paths-III/README.md diff --git a/Algorithms/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store.go b/leetcode/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store.go similarity index 100% rename from Algorithms/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store.go rename to leetcode/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store.go diff --git a/Algorithms/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store_test.go b/leetcode/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store_test.go similarity index 100% rename from Algorithms/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store_test.go rename to leetcode/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store_test.go diff --git a/Algorithms/0981.Time-Based-Key-Value-Store/README.md b/leetcode/0981.Time-Based-Key-Value-Store/README.md similarity index 100% rename from Algorithms/0981.Time-Based-Key-Value-Store/README.md rename to leetcode/0981.Time-Based-Key-Value-Store/README.md diff --git a/Algorithms/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB.go b/leetcode/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB.go similarity index 100% rename from Algorithms/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB.go rename to leetcode/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB.go diff --git a/Algorithms/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB_test.go b/leetcode/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB_test.go similarity index 100% rename from Algorithms/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB_test.go rename to leetcode/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB_test.go diff --git a/Algorithms/0984.String-Without-AAA-or-BBB/README.md b/leetcode/0984.String-Without-AAA-or-BBB/README.md similarity index 100% rename from Algorithms/0984.String-Without-AAA-or-BBB/README.md rename to leetcode/0984.String-Without-AAA-or-BBB/README.md diff --git a/Algorithms/0986.Interval-List-Intersections/986. Interval List Intersections.go b/leetcode/0986.Interval-List-Intersections/986. Interval List Intersections.go similarity index 100% rename from Algorithms/0986.Interval-List-Intersections/986. Interval List Intersections.go rename to leetcode/0986.Interval-List-Intersections/986. Interval List Intersections.go diff --git a/Algorithms/0986.Interval-List-Intersections/986. Interval List Intersections_test.go b/leetcode/0986.Interval-List-Intersections/986. Interval List Intersections_test.go similarity index 100% rename from Algorithms/0986.Interval-List-Intersections/986. Interval List Intersections_test.go rename to leetcode/0986.Interval-List-Intersections/986. Interval List Intersections_test.go diff --git a/Algorithms/0986.Interval-List-Intersections/README.md b/leetcode/0986.Interval-List-Intersections/README.md similarity index 100% rename from Algorithms/0986.Interval-List-Intersections/README.md rename to leetcode/0986.Interval-List-Intersections/README.md diff --git a/Algorithms/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations.go b/leetcode/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations.go similarity index 100% rename from Algorithms/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations.go rename to leetcode/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations.go diff --git a/Algorithms/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations_test.go b/leetcode/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations_test.go similarity index 100% rename from Algorithms/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations_test.go rename to leetcode/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations_test.go diff --git a/Algorithms/0990.Satisfiability-of-Equality-Equations/README.md b/leetcode/0990.Satisfiability-of-Equality-Equations/README.md similarity index 100% rename from Algorithms/0990.Satisfiability-of-Equality-Equations/README.md rename to leetcode/0990.Satisfiability-of-Equality-Equations/README.md diff --git a/Algorithms/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers.go b/leetcode/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers.go similarity index 100% rename from Algorithms/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers.go rename to leetcode/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers.go diff --git a/Algorithms/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers_test.go b/leetcode/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers_test.go similarity index 100% rename from Algorithms/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers_test.go rename to leetcode/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers_test.go diff --git a/Algorithms/0992.Subarrays-with-K-Different-Integers/README.md b/leetcode/0992.Subarrays-with-K-Different-Integers/README.md similarity index 100% rename from Algorithms/0992.Subarrays-with-K-Different-Integers/README.md rename to leetcode/0992.Subarrays-with-K-Different-Integers/README.md diff --git a/Algorithms/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree.go b/leetcode/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree.go similarity index 100% rename from Algorithms/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree.go rename to leetcode/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree.go diff --git a/Algorithms/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree_test.go b/leetcode/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree_test.go similarity index 100% rename from Algorithms/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree_test.go rename to leetcode/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree_test.go diff --git a/Algorithms/0993.Cousins-in-Binary-Tree/README.md b/leetcode/0993.Cousins-in-Binary-Tree/README.md similarity index 100% rename from Algorithms/0993.Cousins-in-Binary-Tree/README.md rename to leetcode/0993.Cousins-in-Binary-Tree/README.md diff --git a/Algorithms/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips.go b/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips.go similarity index 100% rename from Algorithms/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips.go rename to leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips.go diff --git a/Algorithms/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips_test.go b/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips_test.go similarity index 100% rename from Algorithms/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips_test.go rename to leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips_test.go diff --git a/Algorithms/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md b/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md similarity index 100% rename from Algorithms/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md rename to leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md diff --git a/Algorithms/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays.go b/leetcode/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays.go similarity index 100% rename from Algorithms/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays.go rename to leetcode/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays.go diff --git a/Algorithms/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays_test.go b/leetcode/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays_test.go similarity index 100% rename from Algorithms/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays_test.go rename to leetcode/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays_test.go diff --git a/Algorithms/0996.Number-of-Squareful-Arrays/README.md b/leetcode/0996.Number-of-Squareful-Arrays/README.md similarity index 100% rename from Algorithms/0996.Number-of-Squareful-Arrays/README.md rename to leetcode/0996.Number-of-Squareful-Arrays/README.md diff --git a/Algorithms/1002.Find-Common-Characters/1002. Find Common Characters.go b/leetcode/1002.Find-Common-Characters/1002. Find Common Characters.go similarity index 100% rename from Algorithms/1002.Find-Common-Characters/1002. Find Common Characters.go rename to leetcode/1002.Find-Common-Characters/1002. Find Common Characters.go diff --git a/Algorithms/1002.Find-Common-Characters/1002. Find Common Characters_test.go b/leetcode/1002.Find-Common-Characters/1002. Find Common Characters_test.go similarity index 100% rename from Algorithms/1002.Find-Common-Characters/1002. Find Common Characters_test.go rename to leetcode/1002.Find-Common-Characters/1002. Find Common Characters_test.go diff --git a/Algorithms/1002.Find-Common-Characters/README.md b/leetcode/1002.Find-Common-Characters/README.md similarity index 100% rename from Algorithms/1002.Find-Common-Characters/README.md rename to leetcode/1002.Find-Common-Characters/README.md diff --git a/Algorithms/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions.go b/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions.go similarity index 100% rename from Algorithms/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions.go rename to leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions.go diff --git a/Algorithms/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions_test.go b/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions_test.go similarity index 100% rename from Algorithms/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions_test.go rename to leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions_test.go diff --git a/Algorithms/1003.Check-If-Word-Is-Valid-After-Substitutions/README.md b/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/README.md similarity index 100% rename from Algorithms/1003.Check-If-Word-Is-Valid-After-Substitutions/README.md rename to leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/README.md diff --git a/Algorithms/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III.go b/leetcode/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III.go similarity index 100% rename from Algorithms/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III.go rename to leetcode/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III.go diff --git a/Algorithms/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III_test.go b/leetcode/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III_test.go similarity index 100% rename from Algorithms/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III_test.go rename to leetcode/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III_test.go diff --git a/Algorithms/1004.Max-Consecutive-Ones-III/README.md b/leetcode/1004.Max-Consecutive-Ones-III/README.md similarity index 100% rename from Algorithms/1004.Max-Consecutive-Ones-III/README.md rename to leetcode/1004.Max-Consecutive-Ones-III/README.md diff --git a/Algorithms/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations.go b/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations.go similarity index 100% rename from Algorithms/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations.go rename to leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations.go diff --git a/Algorithms/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations_test.go b/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations_test.go similarity index 100% rename from Algorithms/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations_test.go rename to leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations_test.go diff --git a/Algorithms/1005.Maximize-Sum-Of-Array-After-K-Negations/README.md b/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/README.md similarity index 100% rename from Algorithms/1005.Maximize-Sum-Of-Array-After-K-Negations/README.md rename to leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/README.md diff --git a/Algorithms/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days.go b/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days.go similarity index 100% rename from Algorithms/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days.go rename to leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days.go diff --git a/Algorithms/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days_test.go b/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days_test.go similarity index 100% rename from Algorithms/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days_test.go rename to leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days_test.go diff --git a/Algorithms/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md b/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md similarity index 100% rename from Algorithms/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md rename to leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md diff --git a/Algorithms/1017.Convert-to-Base--2/1017. Convert to Base -2.go b/leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2.go similarity index 100% rename from Algorithms/1017.Convert-to-Base--2/1017. Convert to Base -2.go rename to leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2.go diff --git a/Algorithms/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go b/leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go similarity index 100% rename from Algorithms/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go rename to leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go diff --git a/Algorithms/1017.Convert-to-Base--2/README.md b/leetcode/1017.Convert-to-Base--2/README.md similarity index 100% rename from Algorithms/1017.Convert-to-Base--2/README.md rename to leetcode/1017.Convert-to-Base--2/README.md diff --git a/Algorithms/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go b/leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go similarity index 100% rename from Algorithms/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go rename to leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go diff --git a/Algorithms/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List_test.go b/leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List_test.go similarity index 100% rename from Algorithms/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List_test.go rename to leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List_test.go diff --git a/Algorithms/1019.Next-Greater-Node-In-Linked-List/README.md b/leetcode/1019.Next-Greater-Node-In-Linked-List/README.md similarity index 100% rename from Algorithms/1019.Next-Greater-Node-In-Linked-List/README.md rename to leetcode/1019.Next-Greater-Node-In-Linked-List/README.md diff --git a/Algorithms/1020.Number-of-Enclaves/1020. Number of Enclaves.go b/leetcode/1020.Number-of-Enclaves/1020. Number of Enclaves.go similarity index 100% rename from Algorithms/1020.Number-of-Enclaves/1020. Number of Enclaves.go rename to leetcode/1020.Number-of-Enclaves/1020. Number of Enclaves.go diff --git a/Algorithms/1020.Number-of-Enclaves/1020. Number of Enclaves_test.go b/leetcode/1020.Number-of-Enclaves/1020. Number of Enclaves_test.go similarity index 100% rename from Algorithms/1020.Number-of-Enclaves/1020. Number of Enclaves_test.go rename to leetcode/1020.Number-of-Enclaves/1020. Number of Enclaves_test.go diff --git a/Algorithms/1020.Number-of-Enclaves/README.md b/leetcode/1020.Number-of-Enclaves/README.md similarity index 100% rename from Algorithms/1020.Number-of-Enclaves/README.md rename to leetcode/1020.Number-of-Enclaves/README.md diff --git a/Algorithms/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses.go b/leetcode/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses.go similarity index 100% rename from Algorithms/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses.go rename to leetcode/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses.go diff --git a/Algorithms/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses_test.go b/leetcode/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses_test.go similarity index 100% rename from Algorithms/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses_test.go rename to leetcode/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses_test.go diff --git a/Algorithms/1021.Remove-Outermost-Parentheses/README.md b/leetcode/1021.Remove-Outermost-Parentheses/README.md similarity index 100% rename from Algorithms/1021.Remove-Outermost-Parentheses/README.md rename to leetcode/1021.Remove-Outermost-Parentheses/README.md diff --git a/Algorithms/1025.Divisor-Game/1025. Divisor Game.go b/leetcode/1025.Divisor-Game/1025. Divisor Game.go similarity index 100% rename from Algorithms/1025.Divisor-Game/1025. Divisor Game.go rename to leetcode/1025.Divisor-Game/1025. Divisor Game.go diff --git a/Algorithms/1025.Divisor-Game/1025. Divisor Game_test.go b/leetcode/1025.Divisor-Game/1025. Divisor Game_test.go similarity index 100% rename from Algorithms/1025.Divisor-Game/1025. Divisor Game_test.go rename to leetcode/1025.Divisor-Game/1025. Divisor Game_test.go diff --git a/Algorithms/1025.Divisor-Game/README.md b/leetcode/1025.Divisor-Game/README.md similarity index 100% rename from Algorithms/1025.Divisor-Game/README.md rename to leetcode/1025.Divisor-Game/README.md diff --git a/Algorithms/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor.go b/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor.go similarity index 100% rename from Algorithms/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor.go rename to leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor.go diff --git a/Algorithms/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor_test.go b/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor_test.go similarity index 100% rename from Algorithms/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor_test.go rename to leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor_test.go diff --git a/Algorithms/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md b/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md similarity index 100% rename from Algorithms/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md rename to leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md diff --git a/Algorithms/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go similarity index 100% rename from Algorithms/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go rename to leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go diff --git a/Algorithms/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal_test.go b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal_test.go similarity index 100% rename from Algorithms/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal_test.go rename to leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal_test.go diff --git a/Algorithms/1028.Recover-a-Tree-From-Preorder-Traversal/README.md b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/README.md similarity index 100% rename from Algorithms/1028.Recover-a-Tree-From-Preorder-Traversal/README.md rename to leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/README.md diff --git a/Algorithms/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order.go b/leetcode/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order.go similarity index 100% rename from Algorithms/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order.go rename to leetcode/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order.go diff --git a/Algorithms/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order_test.go b/leetcode/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order_test.go similarity index 100% rename from Algorithms/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order_test.go rename to leetcode/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order_test.go diff --git a/Algorithms/1030.Matrix-Cells-in-Distance-Order/README.md b/leetcode/1030.Matrix-Cells-in-Distance-Order/README.md similarity index 100% rename from Algorithms/1030.Matrix-Cells-in-Distance-Order/README.md rename to leetcode/1030.Matrix-Cells-in-Distance-Order/README.md diff --git a/Algorithms/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II.go b/leetcode/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II.go similarity index 100% rename from Algorithms/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II.go rename to leetcode/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II.go diff --git a/Algorithms/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II_test.go b/leetcode/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II_test.go similarity index 100% rename from Algorithms/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II_test.go rename to leetcode/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II_test.go diff --git a/Algorithms/1040.Moving-Stones-Until-Consecutive-II/README.md b/leetcode/1040.Moving-Stones-Until-Consecutive-II/README.md similarity index 100% rename from Algorithms/1040.Moving-Stones-Until-Consecutive-II/README.md rename to leetcode/1040.Moving-Stones-Until-Consecutive-II/README.md diff --git a/Algorithms/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String.go b/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String.go similarity index 100% rename from Algorithms/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String.go rename to leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String.go diff --git a/Algorithms/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String_test.go b/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String_test.go similarity index 100% rename from Algorithms/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String_test.go rename to leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String_test.go diff --git a/Algorithms/1047.Remove-All-Adjacent-Duplicates-In-String/README.md b/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/README.md similarity index 100% rename from Algorithms/1047.Remove-All-Adjacent-Duplicates-In-String/README.md rename to leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/README.md diff --git a/Algorithms/1049.Last-Stone-Weight-II/1049. Last Stone Weight II.go b/leetcode/1049.Last-Stone-Weight-II/1049. Last Stone Weight II.go similarity index 100% rename from Algorithms/1049.Last-Stone-Weight-II/1049. Last Stone Weight II.go rename to leetcode/1049.Last-Stone-Weight-II/1049. Last Stone Weight II.go diff --git a/Algorithms/1049.Last-Stone-Weight-II/1049. Last Stone Weight II_test.go b/leetcode/1049.Last-Stone-Weight-II/1049. Last Stone Weight II_test.go similarity index 100% rename from Algorithms/1049.Last-Stone-Weight-II/1049. Last Stone Weight II_test.go rename to leetcode/1049.Last-Stone-Weight-II/1049. Last Stone Weight II_test.go diff --git a/Algorithms/1049.Last-Stone-Weight-II/README.md b/leetcode/1049.Last-Stone-Weight-II/README.md similarity index 100% rename from Algorithms/1049.Last-Stone-Weight-II/README.md rename to leetcode/1049.Last-Stone-Weight-II/README.md diff --git a/Algorithms/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner.go b/leetcode/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner.go similarity index 100% rename from Algorithms/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner.go rename to leetcode/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner.go diff --git a/Algorithms/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner_test.go b/leetcode/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner_test.go similarity index 100% rename from Algorithms/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner_test.go rename to leetcode/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner_test.go diff --git a/Algorithms/1052.Grumpy-Bookstore-Owner/README.md b/leetcode/1052.Grumpy-Bookstore-Owner/README.md similarity index 100% rename from Algorithms/1052.Grumpy-Bookstore-Owner/README.md rename to leetcode/1052.Grumpy-Bookstore-Owner/README.md diff --git a/Algorithms/1054.Distant-Barcodes/1054. Distant Barcodes.go b/leetcode/1054.Distant-Barcodes/1054. Distant Barcodes.go similarity index 100% rename from Algorithms/1054.Distant-Barcodes/1054. Distant Barcodes.go rename to leetcode/1054.Distant-Barcodes/1054. Distant Barcodes.go diff --git a/Algorithms/1054.Distant-Barcodes/1054. Distant Barcodes_test.go b/leetcode/1054.Distant-Barcodes/1054. Distant Barcodes_test.go similarity index 100% rename from Algorithms/1054.Distant-Barcodes/1054. Distant Barcodes_test.go rename to leetcode/1054.Distant-Barcodes/1054. Distant Barcodes_test.go diff --git a/Algorithms/1054.Distant-Barcodes/README.md b/leetcode/1054.Distant-Barcodes/README.md similarity index 100% rename from Algorithms/1054.Distant-Barcodes/README.md rename to leetcode/1054.Distant-Barcodes/README.md diff --git a/Algorithms/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers.go b/leetcode/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers.go similarity index 100% rename from Algorithms/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers.go rename to leetcode/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers.go diff --git a/Algorithms/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers_test.go b/leetcode/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers_test.go similarity index 100% rename from Algorithms/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers_test.go rename to leetcode/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers_test.go diff --git a/Algorithms/1073.Adding-Two-Negabinary-Numbers/README.md b/leetcode/1073.Adding-Two-Negabinary-Numbers/README.md similarity index 100% rename from Algorithms/1073.Adding-Two-Negabinary-Numbers/README.md rename to leetcode/1073.Adding-Two-Negabinary-Numbers/README.md diff --git a/Algorithms/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target.go b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target.go similarity index 100% rename from Algorithms/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target.go rename to leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target.go diff --git a/Algorithms/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target_test.go b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target_test.go similarity index 100% rename from Algorithms/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target_test.go rename to leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target_test.go diff --git a/Algorithms/1074.Number-of-Submatrices-That-Sum-to-Target/README.md b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md similarity index 100% rename from Algorithms/1074.Number-of-Submatrices-That-Sum-to-Target/README.md rename to leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md diff --git a/Algorithms/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram.go b/leetcode/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram.go similarity index 100% rename from Algorithms/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram.go rename to leetcode/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram.go diff --git a/Algorithms/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram_test.go b/leetcode/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram_test.go similarity index 100% rename from Algorithms/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram_test.go rename to leetcode/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram_test.go diff --git a/Algorithms/1078.Occurrences-After-Bigram/README.md b/leetcode/1078.Occurrences-After-Bigram/README.md similarity index 100% rename from Algorithms/1078.Occurrences-After-Bigram/README.md rename to leetcode/1078.Occurrences-After-Bigram/README.md diff --git a/Algorithms/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities.go b/leetcode/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities.go similarity index 100% rename from Algorithms/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities.go rename to leetcode/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities.go diff --git a/Algorithms/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities_test.go b/leetcode/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities_test.go similarity index 100% rename from Algorithms/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities_test.go rename to leetcode/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities_test.go diff --git a/Algorithms/1079.Letter-Tile-Possibilities/README.md b/leetcode/1079.Letter-Tile-Possibilities/README.md similarity index 100% rename from Algorithms/1079.Letter-Tile-Possibilities/README.md rename to leetcode/1079.Letter-Tile-Possibilities/README.md diff --git a/Algorithms/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample.go b/leetcode/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample.go similarity index 100% rename from Algorithms/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample.go rename to leetcode/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample.go diff --git a/Algorithms/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample_test.go b/leetcode/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample_test.go similarity index 100% rename from Algorithms/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample_test.go rename to leetcode/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample_test.go diff --git a/Algorithms/1093.Statistics-from-a-Large-Sample/README.md b/leetcode/1093.Statistics-from-a-Large-Sample/README.md similarity index 100% rename from Algorithms/1093.Statistics-from-a-Large-Sample/README.md rename to leetcode/1093.Statistics-from-a-Large-Sample/README.md diff --git a/Algorithms/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves.go b/leetcode/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves.go similarity index 100% rename from Algorithms/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves.go rename to leetcode/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves.go diff --git a/Algorithms/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves_test.go b/leetcode/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves_test.go similarity index 100% rename from Algorithms/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves_test.go rename to leetcode/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves_test.go diff --git a/Algorithms/1105.Filling-Bookcase-Shelves/README.md b/leetcode/1105.Filling-Bookcase-Shelves/README.md similarity index 100% rename from Algorithms/1105.Filling-Bookcase-Shelves/README.md rename to leetcode/1105.Filling-Bookcase-Shelves/README.md diff --git a/Algorithms/1108.Defanging-an-IP-Address/1108. Defanging an IP Address.go b/leetcode/1108.Defanging-an-IP-Address/1108. Defanging an IP Address.go similarity index 100% rename from Algorithms/1108.Defanging-an-IP-Address/1108. Defanging an IP Address.go rename to leetcode/1108.Defanging-an-IP-Address/1108. Defanging an IP Address.go diff --git a/Algorithms/1108.Defanging-an-IP-Address/1108. Defanging an IP Address_test.go b/leetcode/1108.Defanging-an-IP-Address/1108. Defanging an IP Address_test.go similarity index 100% rename from Algorithms/1108.Defanging-an-IP-Address/1108. Defanging an IP Address_test.go rename to leetcode/1108.Defanging-an-IP-Address/1108. Defanging an IP Address_test.go diff --git a/Algorithms/1108.Defanging-an-IP-Address/README.md b/leetcode/1108.Defanging-an-IP-Address/README.md similarity index 100% rename from Algorithms/1108.Defanging-an-IP-Address/README.md rename to leetcode/1108.Defanging-an-IP-Address/README.md diff --git a/Algorithms/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest.go b/leetcode/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest.go similarity index 100% rename from Algorithms/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest.go rename to leetcode/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest.go diff --git a/Algorithms/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest_test.go b/leetcode/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest_test.go similarity index 100% rename from Algorithms/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest_test.go rename to leetcode/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest_test.go diff --git a/Algorithms/1110.Delete-Nodes-And-Return-Forest/README.md b/leetcode/1110.Delete-Nodes-And-Return-Forest/README.md similarity index 100% rename from Algorithms/1110.Delete-Nodes-And-Return-Forest/README.md rename to leetcode/1110.Delete-Nodes-And-Return-Forest/README.md diff --git a/Algorithms/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go b/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go similarity index 100% rename from Algorithms/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go rename to leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go diff --git a/Algorithms/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go b/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go similarity index 100% rename from Algorithms/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go rename to leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go diff --git a/Algorithms/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md b/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md similarity index 100% rename from Algorithms/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md rename to leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md diff --git a/Algorithms/1122.Relative-Sort-Array/1122. Relative Sort Array.go b/leetcode/1122.Relative-Sort-Array/1122. Relative Sort Array.go similarity index 100% rename from Algorithms/1122.Relative-Sort-Array/1122. Relative Sort Array.go rename to leetcode/1122.Relative-Sort-Array/1122. Relative Sort Array.go diff --git a/Algorithms/1122.Relative-Sort-Array/1122. Relative Sort Array_test.go b/leetcode/1122.Relative-Sort-Array/1122. Relative Sort Array_test.go similarity index 100% rename from Algorithms/1122.Relative-Sort-Array/1122. Relative Sort Array_test.go rename to leetcode/1122.Relative-Sort-Array/1122. Relative Sort Array_test.go diff --git a/Algorithms/1122.Relative-Sort-Array/README.md b/leetcode/1122.Relative-Sort-Array/README.md similarity index 100% rename from Algorithms/1122.Relative-Sort-Array/README.md rename to leetcode/1122.Relative-Sort-Array/README.md diff --git a/Algorithms/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves.go b/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves.go similarity index 100% rename from Algorithms/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves.go rename to leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves.go diff --git a/Algorithms/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves_test.go b/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves_test.go similarity index 100% rename from Algorithms/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves_test.go rename to leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves_test.go diff --git a/Algorithms/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md b/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md similarity index 100% rename from Algorithms/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md rename to leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md diff --git a/Algorithms/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs.go b/leetcode/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs.go similarity index 100% rename from Algorithms/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs.go rename to leetcode/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs.go diff --git a/Algorithms/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs_test.go b/leetcode/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs_test.go similarity index 100% rename from Algorithms/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs_test.go rename to leetcode/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs_test.go diff --git a/Algorithms/1128.Number-of-Equivalent-Domino-Pairs/README.md b/leetcode/1128.Number-of-Equivalent-Domino-Pairs/README.md similarity index 100% rename from Algorithms/1128.Number-of-Equivalent-Domino-Pairs/README.md rename to leetcode/1128.Number-of-Equivalent-Domino-Pairs/README.md diff --git a/Algorithms/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number.go b/leetcode/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number.go similarity index 100% rename from Algorithms/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number.go rename to leetcode/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number.go diff --git a/Algorithms/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number_test.go b/leetcode/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number_test.go similarity index 100% rename from Algorithms/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number_test.go rename to leetcode/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number_test.go diff --git a/Algorithms/1137.N-th-Tribonacci-Number/README.md b/leetcode/1137.N-th-Tribonacci-Number/README.md similarity index 100% rename from Algorithms/1137.N-th-Tribonacci-Number/README.md rename to leetcode/1137.N-th-Tribonacci-Number/README.md diff --git a/Algorithms/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game.go b/leetcode/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game.go similarity index 100% rename from Algorithms/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game.go rename to leetcode/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game.go diff --git a/Algorithms/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game_test.go b/leetcode/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game_test.go similarity index 100% rename from Algorithms/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game_test.go rename to leetcode/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game_test.go diff --git a/Algorithms/1145.Binary-Tree-Coloring-Game/README.md b/leetcode/1145.Binary-Tree-Coloring-Game/README.md similarity index 100% rename from Algorithms/1145.Binary-Tree-Coloring-Game/README.md rename to leetcode/1145.Binary-Tree-Coloring-Game/README.md diff --git a/Algorithms/1154.Day-of-the-Year/1154. Day of the Year.go b/leetcode/1154.Day-of-the-Year/1154. Day of the Year.go similarity index 100% rename from Algorithms/1154.Day-of-the-Year/1154. Day of the Year.go rename to leetcode/1154.Day-of-the-Year/1154. Day of the Year.go diff --git a/Algorithms/1154.Day-of-the-Year/1154. Day of the Year_test.go b/leetcode/1154.Day-of-the-Year/1154. Day of the Year_test.go similarity index 100% rename from Algorithms/1154.Day-of-the-Year/1154. Day of the Year_test.go rename to leetcode/1154.Day-of-the-Year/1154. Day of the Year_test.go diff --git a/Algorithms/1154.Day-of-the-Year/README.md b/leetcode/1154.Day-of-the-Year/README.md similarity index 100% rename from Algorithms/1154.Day-of-the-Year/README.md rename to leetcode/1154.Day-of-the-Year/README.md diff --git a/Algorithms/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray.go b/leetcode/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray.go similarity index 100% rename from Algorithms/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray.go rename to leetcode/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray.go diff --git a/Algorithms/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray_test.go b/leetcode/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray_test.go similarity index 100% rename from Algorithms/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray_test.go rename to leetcode/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray_test.go diff --git a/Algorithms/1157.Online-Majority-Element-In-Subarray/README.md b/leetcode/1157.Online-Majority-Element-In-Subarray/README.md similarity index 100% rename from Algorithms/1157.Online-Majority-Element-In-Subarray/README.md rename to leetcode/1157.Online-Majority-Element-In-Subarray/README.md diff --git a/Algorithms/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters.go b/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters.go similarity index 100% rename from Algorithms/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters.go rename to leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters.go diff --git a/Algorithms/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters_test.go b/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters_test.go similarity index 100% rename from Algorithms/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters_test.go rename to leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters_test.go diff --git a/Algorithms/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md b/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md similarity index 100% rename from Algorithms/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md rename to leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md diff --git a/Algorithms/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character.go b/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character.go similarity index 100% rename from Algorithms/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character.go rename to leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character.go diff --git a/Algorithms/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character_test.go b/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character_test.go similarity index 100% rename from Algorithms/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character_test.go rename to leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character_test.go diff --git a/Algorithms/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md b/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md similarity index 100% rename from Algorithms/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md rename to leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md diff --git a/Algorithms/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List.go b/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List.go similarity index 100% rename from Algorithms/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List.go rename to leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List.go diff --git a/Algorithms/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go b/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go similarity index 100% rename from Algorithms/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go rename to leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go diff --git a/Algorithms/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md b/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md similarity index 100% rename from Algorithms/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md rename to leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md diff --git a/Algorithms/1175.Prime-Arrangements/1175. Prime Arrangements.go b/leetcode/1175.Prime-Arrangements/1175. Prime Arrangements.go similarity index 100% rename from Algorithms/1175.Prime-Arrangements/1175. Prime Arrangements.go rename to leetcode/1175.Prime-Arrangements/1175. Prime Arrangements.go diff --git a/Algorithms/1175.Prime-Arrangements/1175. Prime Arrangements_test.go b/leetcode/1175.Prime-Arrangements/1175. Prime Arrangements_test.go similarity index 100% rename from Algorithms/1175.Prime-Arrangements/1175. Prime Arrangements_test.go rename to leetcode/1175.Prime-Arrangements/1175. Prime Arrangements_test.go diff --git a/Algorithms/1175.Prime-Arrangements/README.md b/leetcode/1175.Prime-Arrangements/README.md similarity index 100% rename from Algorithms/1175.Prime-Arrangements/README.md rename to leetcode/1175.Prime-Arrangements/README.md diff --git a/Algorithms/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops.go b/leetcode/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops.go similarity index 100% rename from Algorithms/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops.go rename to leetcode/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops.go diff --git a/Algorithms/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops_test.go b/leetcode/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops_test.go similarity index 100% rename from Algorithms/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops_test.go rename to leetcode/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops_test.go diff --git a/Algorithms/1184.Distance-Between-Bus-Stops/README.md b/leetcode/1184.Distance-Between-Bus-Stops/README.md similarity index 100% rename from Algorithms/1184.Distance-Between-Bus-Stops/README.md rename to leetcode/1184.Distance-Between-Bus-Stops/README.md diff --git a/Algorithms/1185.Day-of-the-Week/1185. Day of the Week.go b/leetcode/1185.Day-of-the-Week/1185. Day of the Week.go similarity index 100% rename from Algorithms/1185.Day-of-the-Week/1185. Day of the Week.go rename to leetcode/1185.Day-of-the-Week/1185. Day of the Week.go diff --git a/Algorithms/1185.Day-of-the-Week/1185. Day of the Week_test.go b/leetcode/1185.Day-of-the-Week/1185. Day of the Week_test.go similarity index 100% rename from Algorithms/1185.Day-of-the-Week/1185. Day of the Week_test.go rename to leetcode/1185.Day-of-the-Week/1185. Day of the Week_test.go diff --git a/Algorithms/1185.Day-of-the-Week/README.md b/leetcode/1185.Day-of-the-Week/README.md similarity index 100% rename from Algorithms/1185.Day-of-the-Week/README.md rename to leetcode/1185.Day-of-the-Week/README.md diff --git a/Algorithms/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons.go b/leetcode/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons.go similarity index 100% rename from Algorithms/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons.go rename to leetcode/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons.go diff --git a/Algorithms/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons_test.go b/leetcode/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons_test.go similarity index 100% rename from Algorithms/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons_test.go rename to leetcode/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons_test.go diff --git a/Algorithms/1189.Maximum-Number-of-Balloons/README.md b/leetcode/1189.Maximum-Number-of-Balloons/README.md similarity index 100% rename from Algorithms/1189.Maximum-Number-of-Balloons/README.md rename to leetcode/1189.Maximum-Number-of-Balloons/README.md diff --git a/Algorithms/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference.go b/leetcode/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference.go similarity index 100% rename from Algorithms/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference.go rename to leetcode/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference.go diff --git a/Algorithms/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference_test.go b/leetcode/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference_test.go similarity index 100% rename from Algorithms/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference_test.go rename to leetcode/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference_test.go diff --git a/Algorithms/1200.Minimum-Absolute-Difference/README.md b/leetcode/1200.Minimum-Absolute-Difference/README.md similarity index 100% rename from Algorithms/1200.Minimum-Absolute-Difference/README.md rename to leetcode/1200.Minimum-Absolute-Difference/README.md diff --git a/Algorithms/1201.Ugly-Number-III/1201. Ugly Number III.go b/leetcode/1201.Ugly-Number-III/1201. Ugly Number III.go similarity index 100% rename from Algorithms/1201.Ugly-Number-III/1201. Ugly Number III.go rename to leetcode/1201.Ugly-Number-III/1201. Ugly Number III.go diff --git a/Algorithms/1201.Ugly-Number-III/1201. Ugly Number III_test.go b/leetcode/1201.Ugly-Number-III/1201. Ugly Number III_test.go similarity index 100% rename from Algorithms/1201.Ugly-Number-III/1201. Ugly Number III_test.go rename to leetcode/1201.Ugly-Number-III/1201. Ugly Number III_test.go diff --git a/Algorithms/1201.Ugly-Number-III/README.md b/leetcode/1201.Ugly-Number-III/README.md similarity index 100% rename from Algorithms/1201.Ugly-Number-III/README.md rename to leetcode/1201.Ugly-Number-III/README.md diff --git a/Algorithms/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps.go b/leetcode/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps.go similarity index 100% rename from Algorithms/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps.go rename to leetcode/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps.go diff --git a/Algorithms/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps_test.go b/leetcode/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps_test.go similarity index 100% rename from Algorithms/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps_test.go rename to leetcode/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps_test.go diff --git a/Algorithms/1202.Smallest-String-With-Swaps/README.md b/leetcode/1202.Smallest-String-With-Swaps/README.md similarity index 100% rename from Algorithms/1202.Smallest-String-With-Swaps/README.md rename to leetcode/1202.Smallest-String-With-Swaps/README.md diff --git a/Algorithms/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences.go b/leetcode/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences.go similarity index 100% rename from Algorithms/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences.go rename to leetcode/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences.go diff --git a/Algorithms/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences_test.go b/leetcode/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences_test.go similarity index 100% rename from Algorithms/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences_test.go rename to leetcode/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences_test.go diff --git a/Algorithms/1207.Unique-Number-of-Occurrences/README.md b/leetcode/1207.Unique-Number-of-Occurrences/README.md similarity index 100% rename from Algorithms/1207.Unique-Number-of-Occurrences/README.md rename to leetcode/1207.Unique-Number-of-Occurrences/README.md diff --git a/Algorithms/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget.go b/leetcode/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget.go similarity index 100% rename from Algorithms/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget.go rename to leetcode/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget.go diff --git a/Algorithms/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget_test.go b/leetcode/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget_test.go similarity index 100% rename from Algorithms/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget_test.go rename to leetcode/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget_test.go diff --git a/Algorithms/1208.Get-Equal-Substrings-Within-Budget/README.md b/leetcode/1208.Get-Equal-Substrings-Within-Budget/README.md similarity index 100% rename from Algorithms/1208.Get-Equal-Substrings-Within-Budget/README.md rename to leetcode/1208.Get-Equal-Substrings-Within-Budget/README.md diff --git a/Algorithms/1217.Play-with-Chips/1217. Play with Chips.go b/leetcode/1217.Play-with-Chips/1217. Play with Chips.go similarity index 100% rename from Algorithms/1217.Play-with-Chips/1217. Play with Chips.go rename to leetcode/1217.Play-with-Chips/1217. Play with Chips.go diff --git a/Algorithms/1217.Play-with-Chips/1217. Play with Chips_test.go b/leetcode/1217.Play-with-Chips/1217. Play with Chips_test.go similarity index 100% rename from Algorithms/1217.Play-with-Chips/1217. Play with Chips_test.go rename to leetcode/1217.Play-with-Chips/1217. Play with Chips_test.go diff --git a/Algorithms/1217.Play-with-Chips/README.md b/leetcode/1217.Play-with-Chips/README.md similarity index 100% rename from Algorithms/1217.Play-with-Chips/README.md rename to leetcode/1217.Play-with-Chips/README.md diff --git a/Algorithms/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings.go b/leetcode/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings.go similarity index 100% rename from Algorithms/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings.go rename to leetcode/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings.go diff --git a/Algorithms/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings_test.go b/leetcode/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings_test.go similarity index 100% rename from Algorithms/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings_test.go rename to leetcode/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings_test.go diff --git a/Algorithms/1221.Split-a-String-in-Balanced-Strings/README.md b/leetcode/1221.Split-a-String-in-Balanced-Strings/README.md similarity index 100% rename from Algorithms/1221.Split-a-String-in-Balanced-Strings/README.md rename to leetcode/1221.Split-a-String-in-Balanced-Strings/README.md diff --git a/Algorithms/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line.go b/leetcode/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line.go similarity index 100% rename from Algorithms/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line.go rename to leetcode/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line.go diff --git a/Algorithms/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line_test.go b/leetcode/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line_test.go similarity index 100% rename from Algorithms/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line_test.go rename to leetcode/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line_test.go diff --git a/Algorithms/1232.Check-If-It-Is-a-Straight-Line/README.md b/leetcode/1232.Check-If-It-Is-a-Straight-Line/README.md similarity index 100% rename from Algorithms/1232.Check-If-It-Is-a-Straight-Line/README.md rename to leetcode/1232.Check-If-It-Is-a-Straight-Line/README.md diff --git a/Algorithms/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String.go b/leetcode/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String.go similarity index 100% rename from Algorithms/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String.go rename to leetcode/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String.go diff --git a/Algorithms/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String_test.go b/leetcode/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String_test.go similarity index 100% rename from Algorithms/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String_test.go rename to leetcode/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String_test.go diff --git a/Algorithms/1234.Replace-the-Substring-for-Balanced-String/README.md b/leetcode/1234.Replace-the-Substring-for-Balanced-String/README.md similarity index 100% rename from Algorithms/1234.Replace-the-Substring-for-Balanced-String/README.md rename to leetcode/1234.Replace-the-Substring-for-Balanced-String/README.md diff --git a/Algorithms/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling.go b/leetcode/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling.go similarity index 100% rename from Algorithms/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling.go rename to leetcode/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling.go diff --git a/Algorithms/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling_test.go b/leetcode/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling_test.go similarity index 100% rename from Algorithms/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling_test.go rename to leetcode/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling_test.go diff --git a/Algorithms/1235.Maximum-Profit-in-Job-Scheduling/README.md b/leetcode/1235.Maximum-Profit-in-Job-Scheduling/README.md similarity index 100% rename from Algorithms/1235.Maximum-Profit-in-Job-Scheduling/README.md rename to leetcode/1235.Maximum-Profit-in-Job-Scheduling/README.md diff --git a/Algorithms/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix.go b/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix.go similarity index 100% rename from Algorithms/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix.go rename to leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix.go diff --git a/Algorithms/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix_test.go b/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix_test.go similarity index 100% rename from Algorithms/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix_test.go rename to leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix_test.go diff --git a/Algorithms/1252.Cells-with-Odd-Values-in-a-Matrix/README.md b/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/README.md similarity index 100% rename from Algorithms/1252.Cells-with-Odd-Values-in-a-Matrix/README.md rename to leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/README.md diff --git a/Algorithms/1254.Number-of-Closed-Islands/1254. Number of Closed Islands.go b/leetcode/1254.Number-of-Closed-Islands/1254. Number of Closed Islands.go similarity index 100% rename from Algorithms/1254.Number-of-Closed-Islands/1254. Number of Closed Islands.go rename to leetcode/1254.Number-of-Closed-Islands/1254. Number of Closed Islands.go diff --git a/Algorithms/1254.Number-of-Closed-Islands/1254. Number of Closed Islands_test.go b/leetcode/1254.Number-of-Closed-Islands/1254. Number of Closed Islands_test.go similarity index 100% rename from Algorithms/1254.Number-of-Closed-Islands/1254. Number of Closed Islands_test.go rename to leetcode/1254.Number-of-Closed-Islands/1254. Number of Closed Islands_test.go diff --git a/Algorithms/1254.Number-of-Closed-Islands/README.md b/leetcode/1254.Number-of-Closed-Islands/README.md similarity index 100% rename from Algorithms/1254.Number-of-Closed-Islands/README.md rename to leetcode/1254.Number-of-Closed-Islands/README.md diff --git a/Algorithms/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points.go b/leetcode/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points.go similarity index 100% rename from Algorithms/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points.go rename to leetcode/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points.go diff --git a/Algorithms/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points_test.go b/leetcode/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points_test.go similarity index 100% rename from Algorithms/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points_test.go rename to leetcode/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points_test.go diff --git a/Algorithms/1266.Minimum-Time-Visiting-All-Points/README.md b/leetcode/1266.Minimum-Time-Visiting-All-Points/README.md similarity index 100% rename from Algorithms/1266.Minimum-Time-Visiting-All-Points/README.md rename to leetcode/1266.Minimum-Time-Visiting-All-Points/README.md diff --git a/Algorithms/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer.go b/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer.go similarity index 100% rename from Algorithms/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer.go rename to leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer.go diff --git a/Algorithms/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer_test.go b/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer_test.go similarity index 100% rename from Algorithms/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer_test.go rename to leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer_test.go diff --git a/Algorithms/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md b/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md similarity index 100% rename from Algorithms/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md rename to leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md diff --git a/Algorithms/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold.go b/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold.go similarity index 100% rename from Algorithms/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold.go rename to leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold.go diff --git a/Algorithms/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold_test.go b/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold_test.go similarity index 100% rename from Algorithms/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold_test.go rename to leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold_test.go diff --git a/Algorithms/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md b/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md similarity index 100% rename from Algorithms/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md rename to leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md diff --git a/Algorithms/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array.go b/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array.go similarity index 100% rename from Algorithms/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array.go rename to leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array.go diff --git a/Algorithms/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array_test.go b/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array_test.go similarity index 100% rename from Algorithms/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array_test.go rename to leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array_test.go diff --git a/Algorithms/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md b/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md similarity index 100% rename from Algorithms/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md rename to leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md diff --git a/Algorithms/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer.go b/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer.go similarity index 100% rename from Algorithms/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer.go rename to leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer.go diff --git a/Algorithms/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer_test.go b/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer_test.go similarity index 100% rename from Algorithms/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer_test.go rename to leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer_test.go diff --git a/Algorithms/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md b/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md similarity index 100% rename from Algorithms/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md rename to leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md diff --git a/Algorithms/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits.go b/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits.go similarity index 100% rename from Algorithms/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits.go rename to leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits.go diff --git a/Algorithms/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits_test.go b/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits_test.go similarity index 100% rename from Algorithms/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits_test.go rename to leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits_test.go diff --git a/Algorithms/1295.Find-Numbers-with-Even-Number-of-Digits/README.md b/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/README.md similarity index 100% rename from Algorithms/1295.Find-Numbers-with-Even-Number-of-Digits/README.md rename to leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/README.md diff --git a/Algorithms/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side.go b/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side.go similarity index 100% rename from Algorithms/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side.go rename to leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side.go diff --git a/Algorithms/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side_test.go b/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side_test.go similarity index 100% rename from Algorithms/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side_test.go rename to leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side_test.go diff --git a/Algorithms/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md b/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md similarity index 100% rename from Algorithms/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md rename to leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md diff --git a/Algorithms/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target.go b/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target.go similarity index 100% rename from Algorithms/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target.go rename to leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target.go diff --git a/Algorithms/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target_test.go b/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target_test.go similarity index 100% rename from Algorithms/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target_test.go rename to leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target_test.go diff --git a/Algorithms/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md b/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md similarity index 100% rename from Algorithms/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md rename to leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md diff --git a/Algorithms/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum.go b/leetcode/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum.go similarity index 100% rename from Algorithms/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum.go rename to leetcode/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum.go diff --git a/Algorithms/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum_test.go b/leetcode/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum_test.go similarity index 100% rename from Algorithms/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum_test.go rename to leetcode/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum_test.go diff --git a/Algorithms/1302.Deepest-Leaves-Sum/README.md b/leetcode/1302.Deepest-Leaves-Sum/README.md similarity index 100% rename from Algorithms/1302.Deepest-Leaves-Sum/README.md rename to leetcode/1302.Deepest-Leaves-Sum/README.md diff --git a/Algorithms/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero.go b/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero.go similarity index 100% rename from Algorithms/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero.go rename to leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero.go diff --git a/Algorithms/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero_test.go b/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero_test.go similarity index 100% rename from Algorithms/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero_test.go rename to leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero_test.go diff --git a/Algorithms/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md b/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md similarity index 100% rename from Algorithms/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md rename to leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md diff --git a/Algorithms/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go similarity index 100% rename from Algorithms/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go rename to leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go diff --git a/Algorithms/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go similarity index 100% rename from Algorithms/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go rename to leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go diff --git a/Algorithms/1305.All-Elements-in-Two-Binary-Search-Trees/README.md b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/README.md similarity index 100% rename from Algorithms/1305.All-Elements-in-Two-Binary-Search-Trees/README.md rename to leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/README.md diff --git a/Algorithms/1306.Jump-Game-III/1306. Jump Game III.go b/leetcode/1306.Jump-Game-III/1306. Jump Game III.go similarity index 100% rename from Algorithms/1306.Jump-Game-III/1306. Jump Game III.go rename to leetcode/1306.Jump-Game-III/1306. Jump Game III.go diff --git a/Algorithms/1306.Jump-Game-III/1306. Jump Game III_test.go b/leetcode/1306.Jump-Game-III/1306. Jump Game III_test.go similarity index 100% rename from Algorithms/1306.Jump-Game-III/1306. Jump Game III_test.go rename to leetcode/1306.Jump-Game-III/1306. Jump Game III_test.go diff --git a/Algorithms/1306.Jump-Game-III/README.md b/leetcode/1306.Jump-Game-III/README.md similarity index 100% rename from Algorithms/1306.Jump-Game-III/README.md rename to leetcode/1306.Jump-Game-III/README.md diff --git a/Topics/Backtracking.png b/topic/Backtracking.png similarity index 100% rename from Topics/Backtracking.png rename to topic/Backtracking.png diff --git a/Topics/Binary_Indexed_Tree.png b/topic/Binary_Indexed_Tree.png similarity index 100% rename from Topics/Binary_Indexed_Tree.png rename to topic/Binary_Indexed_Tree.png diff --git a/Topics/Bit_Manipulation.png b/topic/Bit_Manipulation.png similarity index 100% rename from Topics/Bit_Manipulation.png rename to topic/Bit_Manipulation.png diff --git a/Topics/Linked_List.png b/topic/Linked_List.png similarity index 100% rename from Topics/Linked_List.png rename to topic/Linked_List.png diff --git a/Topics/Segment_Tree.png b/topic/Segment_Tree.png similarity index 100% rename from Topics/Segment_Tree.png rename to topic/Segment_Tree.png diff --git a/Topics/Sliding_Window.png b/topic/Sliding_Window.png similarity index 100% rename from Topics/Sliding_Window.png rename to topic/Sliding_Window.png diff --git a/Topics/Sort.png b/topic/Sort.png similarity index 100% rename from Topics/Sort.png rename to topic/Sort.png diff --git a/Topics/Stack.png b/topic/Stack.png similarity index 100% rename from Topics/Stack.png rename to topic/Stack.png diff --git a/Topics/Two_pointers.png b/topic/Two_pointers.png similarity index 100% rename from Topics/Two_pointers.png rename to topic/Two_pointers.png diff --git a/Topics/Union_Find.png b/topic/Union_Find.png similarity index 100% rename from Topics/Union_Find.png rename to topic/Union_Find.png diff --git a/website/content/ChapterFour/0143. Reorder List.md b/website/content/ChapterFour/0143. Reorder List.md index 8abeb1de3..9383f56ea 100644 --- a/website/content/ChapterFour/0143. Reorder List.md +++ b/website/content/ChapterFour/0143. Reorder List.md @@ -35,7 +35,7 @@ Given 1->2->3->4->5, reorder it to 1->5->2->4->3. 更好的做法是结合之前几道题的操作：链表逆序，找中间结点。 -先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0092.%20Reverse%20Linked%20List%20II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。 +先找到链表的中间结点，然后利用逆序区间的操作，如 [第 92 题](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) 里的 reverseBetween() 操作，只不过这里的反转区间是从中点一直到末尾。最后利用 2 个指针，一个指向头结点，一个指向中间结点，开始拼接最终的结果。这种做法的时间复杂度是 O(n)，空间复杂度是 O(1)。 ## 代码 diff --git a/website/content/ChapterFour/0717. 1-bit and 2-bit Characters.md b/website/content/ChapterFour/0717. 1-bit and 2-bit Characters.md index a739cfa7f..923e5679d 100755 --- a/website/content/ChapterFour/0717. 1-bit and 2-bit Characters.md +++ b/website/content/ChapterFour/0717. 1-bit and 2-bit Characters.md @@ -1,4 +1,4 @@ -# 717. 1-bit and 2-bit Characters +# [717. 1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/) # 题目: diff --git a/website/content/ChapterOne/_index.md b/website/content/ChapterOne/_index.md index 47997b327..5227df0ad 100644 --- a/website/content/ChapterOne/_index.md +++ b/website/content/ChapterOne/_index.md @@ -48,7 +48,7 @@ type: docs ## 关于书中的代码 -代码都放在 [github repo](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms) 中，按题号可以搜索到题目。 +代码都放在 [github repo](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode) 中，按题号可以搜索到题目。 本书题目的代码都已经 beats 100% 了。没有 beats 100% 题解就没有放到本书中了。那些题目笔者会继续优化到 100% 再放进来。 有可能读者会问，为何要追求 beats 100%。笔者认为优化到 beats 100% 才算是把这题做出感觉了。有好几道 Hard 题，笔者都用暴力解法 AC 了，然后只 beats 了 5%。这题就如同没做一样。而且面试中如果给了这样的答案，面试官也不会满意，“还有没有更优解？”。如果通过自己的思考能给出更优解，面试官会更满意一些。 diff --git a/website/content/_index.md b/website/content/_index.md index b179ce0cb..c713f535d 100644 --- a/website/content/_index.md +++ b/website/content/_index.md @@ -48,7 +48,7 @@ type: docs ## 关于书中的代码 -代码都放在 [github repo](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms) 中，按题号可以搜索到题目。 +代码都放在 [github repo](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode) 中，按题号可以搜索到题目。 本书题目的代码都已经 beats 100% 了。没有 beats 100% 题解就没有放到本书中了。那些题目笔者会继续优化到 100% 再放进来。 有可能读者会问，为何要追求 beats 100%。笔者认为优化到 beats 100% 才算是把这题做出感觉了。有好几道 Hard 题，笔者都用暴力解法 AC 了，然后只 beats 了 5%。这题就如同没做一样。而且面试中如果给了这样的答案，面试官也不会满意，“还有没有更优解？”。如果通过自己的思考能给出更优解，面试官会更满意一些。