LeetCode Golang 答案

Leetcode用golang实现的答案。全都会push到github上。
已经有的题目和答案链接如下：

Question	Solutioin
1.two sum	[1.two sum.py](https://github.com/NachtZ/leetcode/blob/master/1.two sum.py)
Add Two Numbers	[2. Add Two Numbers.py](https://github.com/NachtZ/leetcode/blob/master/2. Add Two Numbers.py)
Longest Substring Without Repeating Characters	[3. Longest Substring Without Repeating Characters.py](https://github.com/NachtZ/leetcode/blob/master/3. Longest Substring Without Repeating Characters.py)
Median of Two Sorted Arrays	[4. Median of Two Sorted Arrays.py](https://github.com/NachtZ/leetcode/blob/master/4. Median of Two Sorted Arrays.py)
Longest Palindromic Substring	[5. Longest Palindromic Substring.py](https://github.com/NachtZ/leetcode/blob/master/5. Longest Palindromic Substring.py)
ZigZag Conversion	[6. ZigZag Conversion.py](https://github.com/NachtZ/leetcode/blob/master/6. ZigZag Conversion.py)
Reverse Integer	[7. Reverse Integer.py](https://github.com/NachtZ/leetcode/blob/master/7. Reverse Integer.py)
String to Integer (atoi)	[8. String to Integer (atoi).cpp](https://github.com/NachtZ/leetcode/blob/master/8. String to Integer (atoi).cpp)
Palindrome Number	[9. Palindrome Number.go](https://github.com/NachtZ/leetcode/blob/master/9. Palindrome Number.go)
Regular Expression Matching	[10. Regular Expression Matching.go](https://github.com/NachtZ/leetcode/blob/master/10. Regular Expression Matching.go)
Container With Most Water	[11. Container With Most Water.go](https://github.com/NachtZ/leetcode/blob/master/11. Container With Most Water.go)
Integer to Roman	[12. Integer to Roman.go](https://github.com/NachtZ/leetcode/blob/master/12. Integer to Roman.go)
Roman to Integer	[13. Roman to Integer.go](https://github.com/NachtZ/leetcode/blob/master/13. Roman to Integer.go)
Longest Common Prefix	[14. Longest Common Prefix.go](https://github.com/NachtZ/leetcode/blob/master/14. Longest Common Prefix.go)
3Sum	[15. 3Sum.go](https://github.com/NachtZ/leetcode/blob/master/15. 3Sum.go)
3Sum Closest	[16. 3Sum Closest.go](https://github.com/NachtZ/leetcode/blob/master/16. 3Sum Closest.go)
Letter Combinations of a Phone Number	[17. Letter Combinations of a Phone Number.go](https://github.com/NachtZ/leetcode/blob/master/17. Letter Combinations of a Phone Number.go)
4Sum	[18. 4Sum.go](https://github.com/NachtZ/leetcode/blob/master/18. 4Sum.go)
Merge Two Sorted Lists	[21. Merge Two Sorted Lists.go](https://github.com/NachtZ/leetcode/blob/master/21. Merge Two Sorted Lists.go)
Generate Parentheses	[22. Generate Parentheses.go](https://github.com/NachtZ/leetcode/blob/master/22. Generate Parentheses.go)
Merge k Sorted Lists	[23. Merge k Sorted Lists.go](https://github.com/NachtZ/leetcode/blob/master/23. Merge k Sorted Lists.go)
Swap Nodes in Pairs	[24. Swap Nodes in Pairs.go](https://github.com/NachtZ/leetcode/blob/master/24. Swap Nodes in Pairs.go)
Reverse Nodes in k-Group	[25. Reverse Nodes in k-Group.go](https://github.com/NachtZ/leetcode/blob/master/25. Reverse Nodes in k-Group.go)
Remove Duplicates from Sorted Array	[26. Remove Duplicates from Sorted Array.go](https://github.com/NachtZ/leetcode/blob/master/26. Remove Duplicates from Sorted Array.go)
Remove Element	[27. Remove Element.go](https://github.com/NachtZ/leetcode/blob/master/27. Remove Element.go)
Implement strStr()	[28. Implement strStr().go](https://github.com/NachtZ/leetcode/blob/master/28. Implement strStr().go)
Divide Two Integers	[29. Divide Two Integers.md](https://github.com/NachtZ/leetcode/blob/master/29. Divide Two Integers.md)
Substring with Concatenation of All Words	[30. Substring with Concatenation of All Words.go](https://github.com/NachtZ/leetcode/blob/master/30. Substring with Concatenation of All Words.go)
Substring with Concatenation of All Words	[30. Substring with Concatenation of All Words.md](https://github.com/NachtZ/leetcode/blob/master/30. Substring with Concatenation of All Words.md)
Next Permutation	[31. Next Permutation.go](https://github.com/NachtZ/leetcode/blob/master/31. Next Permutation.go)
Longest Valid Parentheses	[32. Longest Valid Parentheses.go](https://github.com/NachtZ/leetcode/blob/master/32. Longest Valid Parentheses.go)
Search in Rotated Sorted Array	[33. Search in Rotated Sorted Array.go](https://github.com/NachtZ/leetcode/blob/master/33. Search in Rotated Sorted Array.go)
Search for a Range	[34. Search for a Range.go](https://github.com/NachtZ/leetcode/blob/master/34. Search for a Range.go)
Search Insert Position	[35. Search Insert Position.go](https://github.com/NachtZ/leetcode/blob/master/35. Search Insert Position.go)
Valid Sudoku	[36. Valid Sudoku.go](https://github.com/NachtZ/leetcode/blob/master/36. Valid Sudoku.go)
Sudoku Solver	[37. Sudoku Solver.go](https://github.com/NachtZ/leetcode/blob/master/37. Sudoku Solver.go)
Count and Say	[38. Count and Say.go](https://github.com/NachtZ/leetcode/blob/master/38. Count and Say.go)
Combination Sum	[39. Combination Sum.go](https://github.com/NachtZ/leetcode/blob/master/39. Combination Sum.go)
Combination Sum II	[40. Combination Sum II.go](https://github.com/NachtZ/leetcode/blob/master/40. Combination Sum II.go)
First Missing Positive	[41. First Missing Positive.go](https://github.com/NachtZ/leetcode/blob/master/41. First Missing Positive.go)
Trapping Rain Water	[42. Trapping Rain Water.go](https://github.com/NachtZ/leetcode/blob/master/42. Trapping Rain Water.go)
Multiply Strings	[43. Multiply Strings.go](https://github.com/NachtZ/leetcode/blob/master/43. Multiply Strings.go)
Wildcard Matching	[44. Wildcard Matching.go](https://github.com/NachtZ/leetcode/blob/master/44. Wildcard Matching.go)
Jump Game II	[45. Jump Game II.go](https://github.com/NachtZ/leetcode/blob/master/45. Jump Game II.go)
Permutations	[46. Permutations.go](https://github.com/NachtZ/leetcode/blob/master/46. Permutations.go)
Permutations II	[47. Permutations II.go](https://github.com/NachtZ/leetcode/blob/master/47. Permutations II.go)
Rotate Image	[48. Rotate Image.go](https://github.com/NachtZ/leetcode/blob/master/48. Rotate Image.go)
Group Anagrams	[49. Group Anagrams.go](https://github.com/NachtZ/leetcode/blob/master/49. Group Anagrams.go)
Pow(x, n)	[50. Pow(x, n).go](https://github.com/NachtZ/leetcode/blob/master/50. Pow(x, n).go)
N-Queens	[51. N-Queens.go](https://github.com/NachtZ/leetcode/blob/master/51. N-Queens.go)
N-Queens II	[52. N-Queens II.go](https://github.com/NachtZ/leetcode/blob/master/52. N-Queens II.go)
Maximum Subarray	[53. Maximum Subarray.go](https://github.com/NachtZ/leetcode/blob/master/53. Maximum Subarray.go)
Spiral Matrix	[54. Spiral Matrix.go](https://github.com/NachtZ/leetcode/blob/master/54. Spiral Matrix.go)
Jump Game	[55. Jump Game.go](https://github.com/NachtZ/leetcode/blob/master/55. Jump Game.go)
Merge Intervals QuestionEditorial Solution	[56. Merge Intervals QuestionEditorial Solution.go](https://github.com/NachtZ/leetcode/blob/master/56. Merge Intervals QuestionEditorial Solution.go)
Insert Interval	[57. Insert Interval.go](https://github.com/NachtZ/leetcode/blob/master/57. Insert Interval.go)
Length of Last Word	[58. Length of Last Word.go](https://github.com/NachtZ/leetcode/blob/master/58. Length of Last Word.go)
Spiral Matrix II	[59. Spiral Matrix II.go](https://github.com/NachtZ/leetcode/blob/master/59. Spiral Matrix II.go)
Permutation Sequence	[60. Permutation Sequence.go](https://github.com/NachtZ/leetcode/blob/master/60. Permutation Sequence.go)
Rotate List	[61. Rotate List.go](https://github.com/NachtZ/leetcode/blob/master/61. Rotate List.go)
Unique Paths	[62. Unique Paths.go](https://github.com/NachtZ/leetcode/blob/master/62. Unique Paths.go)
Unique Paths II	[63. Unique Paths II.go](https://github.com/NachtZ/leetcode/blob/master/63. Unique Paths II.go)
Minimum Path Sum	[64. Minimum Path Sum.go](https://github.com/NachtZ/leetcode/blob/master/64. Minimum Path Sum.go)
Valid Number	[65. Valid Number.go](https://github.com/NachtZ/leetcode/blob/master/65. Valid Number.go)
Valid Number	[65. Valid Number.md](https://github.com/NachtZ/leetcode/blob/master/65. Valid Number.md)
Plus One	[66. Plus One.go](https://github.com/NachtZ/leetcode/blob/master/66. Plus One.go)
Add Binary	[67. Add Binary.go](https://github.com/NachtZ/leetcode/blob/master/67. Add Binary.go)
Text Justification	[68. Text Justification.go](https://github.com/NachtZ/leetcode/blob/master/68. Text Justification.go)
Sqrt(x)	[69. Sqrt(x).go](https://github.com/NachtZ/leetcode/blob/master/69. Sqrt(x).go)
Climbing Stairs	[70. Climbing Stairs.go](https://github.com/NachtZ/leetcode/blob/master/70. Climbing Stairs.go)
Simplify Path	[71. Simplify Path.go](https://github.com/NachtZ/leetcode/blob/master/71. Simplify Path.go)
Edit Distance	[72. Edit Distance.go](https://github.com/NachtZ/leetcode/blob/master/72. Edit Distance.go)
Set Matrix Zeroes	[73. Set Matrix Zeroes.go](https://github.com/NachtZ/leetcode/blob/master/73. Set Matrix Zeroes.go)
Search a 2D Matrix	[74. Search a 2D Matrix.go](https://github.com/NachtZ/leetcode/blob/master/74. Search a 2D Matrix.go)
Sort Colors	[75. Sort Colors.go](https://github.com/NachtZ/leetcode/blob/master/75. Sort Colors.go)
Minimum Window Substring	[76. Minimum Window Substring.go](https://github.com/NachtZ/leetcode/blob/master/76. Minimum Window Substring.go)
Combinations	[77. Combinations.go](https://github.com/NachtZ/leetcode/blob/master/77. Combinations.go)
Subsets	[78. Subsets.go](https://github.com/NachtZ/leetcode/blob/master/78. Subsets.go)
Word Search	[79. Word Search.go](https://github.com/NachtZ/leetcode/blob/master/79. Word Search.go)
Remove Duplicates from Sorted Array II	[80. Remove Duplicates from Sorted Array II.go](https://github.com/NachtZ/leetcode/blob/master/80. Remove Duplicates from Sorted Array II.go)
Search in Rotated Sorted Array II	[81. Search in Rotated Sorted Array II.go](https://github.com/NachtZ/leetcode/blob/master/81. Search in Rotated Sorted Array II.go)
Remove Duplicates from Sorted List II	[82. Remove Duplicates from Sorted List II.go](https://github.com/NachtZ/leetcode/blob/master/82. Remove Duplicates from Sorted List II.go)
Remove Duplicates from Sorted List	[83. Remove Duplicates from Sorted List.go](https://github.com/NachtZ/leetcode/blob/master/83. Remove Duplicates from Sorted List.go)
Largest Rectangle in Histogram	[84. Largest Rectangle in Histogram.go](https://github.com/NachtZ/leetcode/blob/master/84. Largest Rectangle in Histogram.go)
Maximal Rectangle	[85. Maximal Rectangle.go](https://github.com/NachtZ/leetcode/blob/master/85. Maximal Rectangle.go)
Partition List	[86. Partition List.go](https://github.com/NachtZ/leetcode/blob/master/86. Partition List.go)
Scramble String	[87. Scramble String.go](https://github.com/NachtZ/leetcode/blob/master/87. Scramble String.go)
Merge Sorted Array	[88. Merge Sorted Array.go](https://github.com/NachtZ/leetcode/blob/master/88. Merge Sorted Array.go)
Gray Code	[89. Gray Code.go](https://github.com/NachtZ/leetcode/blob/master/89. Gray Code.go)
Subsets II	[90. Subsets II.go](https://github.com/NachtZ/leetcode/blob/master/90. Subsets II.go)
Decode Ways	[91. Decode Ways.go](https://github.com/NachtZ/leetcode/blob/master/91. Decode Ways.go)
Reverse Linked List II	[92. Reverse Linked List II.go](https://github.com/NachtZ/leetcode/blob/master/92. Reverse Linked List II.go)
Restore IP Addresses	[93. Restore IP Addresses.go](https://github.com/NachtZ/leetcode/blob/master/93. Restore IP Addresses.go)
Binary Tree Inorder Traversal	[94. Binary Tree Inorder Traversal.go](https://github.com/NachtZ/leetcode/blob/master/94. Binary Tree Inorder Traversal.go)
Unique Binary Search Trees II	[95. Unique Binary Search Trees II.go](https://github.com/NachtZ/leetcode/blob/master/95. Unique Binary Search Trees II.go)
Unique Binary Search Trees	[96. Unique Binary Search Trees.go](https://github.com/NachtZ/leetcode/blob/master/96. Unique Binary Search Trees.go)
Interleaving String	[97. Interleaving String.go](https://github.com/NachtZ/leetcode/blob/master/97. Interleaving String.go)
Validate Binary Search Tree	[98. Validate Binary Search Tree.go](https://github.com/NachtZ/leetcode/blob/master/98. Validate Binary Search Tree.go)
Recover Binary Search Tree	[99. Recover Binary Search Tree.go](https://github.com/NachtZ/leetcode/blob/master/99. Recover Binary Search Tree.go)
Same Tree	[100. Same Tree.go](https://github.com/NachtZ/leetcode/blob/master/100. Same Tree.go)
Symmetric Tree	[101. Symmetric Tree.go](https://github.com/NachtZ/leetcode/blob/master/101. Symmetric Tree.go)
Binary Tree Level Order Traversal	[102. Binary Tree Level Order Traversal.go](https://github.com/NachtZ/leetcode/blob/master/102. Binary Tree Level Order Traversal.go)
Binary Tree Zigzag Level Order Traversal	[103. Binary Tree Zigzag Level Order Traversal.go](https://github.com/NachtZ/leetcode/blob/master/103. Binary Tree Zigzag Level Order Traversal.go)
Maximum Depth of Binary Tree	[104. Maximum Depth of Binary Tree.go](https://github.com/NachtZ/leetcode/blob/master/104. Maximum Depth of Binary Tree.go)
Construct Binary Tree from Preorder and Inorder Traversal	[105. Construct Binary Tree from Preorder and Inorder Traversal.go](https://github.com/NachtZ/leetcode/blob/master/105. Construct Binary Tree from Preorder and Inorder Traversal.go)
Construct Binary Tree from Inorder and Postorder Traversal	[106. Construct Binary Tree from Inorder and Postorder Traversal.go](https://github.com/NachtZ/leetcode/blob/master/106. Construct Binary Tree from Inorder and Postorder Traversal.go)
Binary Tree Level Order Traversal II	[107. Binary Tree Level Order Traversal II.go](https://github.com/NachtZ/leetcode/blob/master/107. Binary Tree Level Order Traversal II.go)
Convert Sorted Array to Binary Search Tree	[108. Convert Sorted Array to Binary Search Tree.go](https://github.com/NachtZ/leetcode/blob/master/108. Convert Sorted Array to Binary Search Tree.go)
Convert Sorted List to Binary Search Tree	[109. Convert Sorted List to Binary Search Tree.go](https://github.com/NachtZ/leetcode/blob/master/109. Convert Sorted List to Binary Search Tree.go)
Balanced Binary Tree	[110. Balanced Binary Tree.go](https://github.com/NachtZ/leetcode/blob/master/110. Balanced Binary Tree.go)
Minimum Depth of Binary Tree	[111. Minimum Depth of Binary Tree.go](https://github.com/NachtZ/leetcode/blob/master/111. Minimum Depth of Binary Tree.go)
Path Sum	[112. Path Sum.go](https://github.com/NachtZ/leetcode/blob/master/112. Path Sum.go)
Path Sum II	[113. Path Sum II.go](https://github.com/NachtZ/leetcode/blob/master/113. Path Sum II.go)
Flatten Binary Tree to Linked List	[114. Flatten Binary Tree to Linked List.go](https://github.com/NachtZ/leetcode/blob/master/114. Flatten Binary Tree to Linked List.go)
Distinct Subsequences	[115. Distinct Subsequences.go](https://github.com/NachtZ/leetcode/blob/master/115. Distinct Subsequences.go)
Populating Next Right Pointers in Each Node	[116. Populating Next Right Pointers in Each Node.cpp](https://github.com/NachtZ/leetcode/blob/master/116. Populating Next Right Pointers in Each Node.cpp)
Populating Next Right Pointers in Each Node II	[117. Populating Next Right Pointers in Each Node II.cpp](https://github.com/NachtZ/leetcode/blob/master/117. Populating Next Right Pointers in Each Node II.cpp)
Pascal’s Triangle	[118. Pascal’s Triangle.go](https://github.com/NachtZ/leetcode/blob/master/118. Pascal’s Triangle.go)
Pascal’s Triangle II	[119. Pascal’s Triangle II.go](https://github.com/NachtZ/leetcode/blob/master/119. Pascal’s Triangle II.go)
Triangle	[120. Triangle.cpp](https://github.com/NachtZ/leetcode/blob/master/120. Triangle.cpp)
Best Time to Buy and Sell Stock	[121. Best Time to Buy and Sell Stock.go](https://github.com/NachtZ/leetcode/blob/master/121. Best Time to Buy and Sell Stock.go)
Best Time to Buy and Sell Stock II	[122. Best Time to Buy and Sell Stock II.go](https://github.com/NachtZ/leetcode/blob/master/122. Best Time to Buy and Sell Stock II.go)
Best Time to Buy and Sell Stock III	[123. Best Time to Buy and Sell Stock III.go](https://github.com/NachtZ/leetcode/blob/master/123. Best Time to Buy and Sell Stock III.go)
Binary Tree Maximum Path Sum	[124. Binary Tree Maximum Path Sum.go](https://github.com/NachtZ/leetcode/blob/master/124. Binary Tree Maximum Path Sum.go)
Valid Palindrome	[125. Valid Palindrome.go](https://github.com/NachtZ/leetcode/blob/master/125. Valid Palindrome.go)
Longest Consecutive Sequence	[128. Longest Consecutive Sequence.go](https://github.com/NachtZ/leetcode/blob/master/128. Longest Consecutive Sequence.go)
Sum Root to Leaf Numbers	[129. Sum Root to Leaf Numbers.go](https://github.com/NachtZ/leetcode/blob/master/129. Sum Root to Leaf Numbers.go)
Surrounded Regions	[130. Surrounded Regions.go](https://github.com/NachtZ/leetcode/blob/master/130. Surrounded Regions.go)
Palindrome Partitioning	[131. Palindrome Partitioning.cpp](https://github.com/NachtZ/leetcode/blob/master/131. Palindrome Partitioning.cpp)
Palindrome Partitioning II	[132. Palindrome Partitioning II.go](https://github.com/NachtZ/leetcode/blob/master/132. Palindrome Partitioning II.go)
Clone Graph	[133. Clone Graph.cpp](https://github.com/NachtZ/leetcode/blob/master/133. Clone Graph.cpp)
Gas Station	[134. Gas Station.go](https://github.com/NachtZ/leetcode/blob/master/134. Gas Station.go)
Candy	[135. Candy.go](https://github.com/NachtZ/leetcode/blob/master/135. Candy.go)
Single Number	[136. Single Number.go](https://github.com/NachtZ/leetcode/blob/master/136. Single Number.go)
Single Number II	[137. Single Number II.go](https://github.com/NachtZ/leetcode/blob/master/137. Single Number II.go)
Copy List with Random Pointer	[138. Copy List with Random Pointer.cpp](https://github.com/NachtZ/leetcode/blob/master/138. Copy List with Random Pointer.cpp)
Word Break	[139. Word Break.cpp](https://github.com/NachtZ/leetcode/blob/master/139. Word Break.cpp)
Word Break II	[140. Word Break II.cpp](https://github.com/NachtZ/leetcode/blob/master/140. Word Break II.cpp)
Linked List Cycle	[141. Linked List Cycle.cpp](https://github.com/NachtZ/leetcode/blob/master/141. Linked List Cycle.cpp)
Linked List Cycle II	[142. Linked List Cycle II.cpp](https://github.com/NachtZ/leetcode/blob/master/142. Linked List Cycle II.cpp)
Reorder List	[143. Reorder List.go](https://github.com/NachtZ/leetcode/blob/master/143. Reorder List.go)
Binary Tree Preorder Traversal	[144. Binary Tree Preorder Traversal.go](https://github.com/NachtZ/leetcode/blob/master/144. Binary Tree Preorder Traversal.go)
Binary Tree Postorder Traversal	[145. Binary Tree Postorder Traversal.go](https://github.com/NachtZ/leetcode/blob/master/145. Binary Tree Postorder Traversal.go)
LRU Cache	[146. LRU Cache.cpp](https://github.com/NachtZ/leetcode/blob/master/146. LRU Cache.cpp)
Insertion Sort List	[147. Insertion Sort List.go](https://github.com/NachtZ/leetcode/blob/master/147. Insertion Sort List.go)
Sort List	[148. Sort List.go](https://github.com/NachtZ/leetcode/blob/master/148. Sort List.go)
Max Points on a Line	[149. Max Points on a Line.go](https://github.com/NachtZ/leetcode/blob/master/149. Max Points on a Line.go)
Evaluate Reverse Polish Notation	[150. Evaluate Reverse Polish Notation.go](https://github.com/NachtZ/leetcode/blob/master/150. Evaluate Reverse Polish Notation.go)
Reverse Words in a String	[151. Reverse Words in a String.cpp](https://github.com/NachtZ/leetcode/blob/master/151. Reverse Words in a String.cpp)
Maximum Product Subarray	[152. Maximum Product Subarray.go](https://github.com/NachtZ/leetcode/blob/master/152. Maximum Product Subarray.go)
Find Minimum in Rotated Sorted Array	[153. Find Minimum in Rotated Sorted Array.go](https://github.com/NachtZ/leetcode/blob/master/153. Find Minimum in Rotated Sorted Array.go)
Min Stack	[155. Min Stack.cpp](https://github.com/NachtZ/leetcode/blob/master/155. Min Stack.cpp)
Intersection of Two Linked Lists	[160. Intersection of Two Linked Lists.c](https://github.com/NachtZ/leetcode/blob/master/160. Intersection of Two Linked Lists.c)
Find Peak Element	[162. Find Peak Element.go](https://github.com/NachtZ/leetcode/blob/master/162. Find Peak Element.go)
Maximum Gap	[164. Maximum Gap.go](https://github.com/NachtZ/leetcode/blob/master/164. Maximum Gap.go)
Compare Version Numbers	[165. Compare Version Numbers.go](https://github.com/NachtZ/leetcode/blob/master/165. Compare Version Numbers.go)
Fraction to Recurring Decimal	[166. Fraction to Recurring Decimal.go](https://github.com/NachtZ/leetcode/blob/master/166. Fraction to Recurring Decimal.go)
Two Sum II - Input array is sorted	[167. Two Sum II - Input array is sorted.go](https://github.com/NachtZ/leetcode/blob/master/167. Two Sum II - Input array is sorted.go)
Excel Sheet Column Title	[168. Excel Sheet Column Title.go](https://github.com/NachtZ/leetcode/blob/master/168. Excel Sheet Column Title.go)
Majority Element	[169. Majority Element.go](https://github.com/NachtZ/leetcode/blob/master/169. Majority Element.go)
Excel Sheet Column Number	[171. Excel Sheet Column Number.go](https://github.com/NachtZ/leetcode/blob/master/171. Excel Sheet Column Number.go)
Factorial Trailing Zeroes	[172. Factorial Trailing Zeroes.go](https://github.com/NachtZ/leetcode/blob/master/172. Factorial Trailing Zeroes.go)
Binary Search Tree Iterator	[173. Binary Search Tree Iterator.cpp](https://github.com/NachtZ/leetcode/blob/master/173. Binary Search Tree Iterator.cpp)
Dungeon Game	[174. Dungeon Game.go](https://github.com/NachtZ/leetcode/blob/master/174. Dungeon Game.go)
Largest Number	[179. Largest Number.go](https://github.com/NachtZ/leetcode/blob/master/179. Largest Number.go)
Repeated DNA Sequences	[187. Repeated DNA Sequences.go](https://github.com/NachtZ/leetcode/blob/master/187. Repeated DNA Sequences.go)
Best Time to Buy and Sell Stock IV	[188. Best Time to Buy and Sell Stock IV.go](https://github.com/NachtZ/leetcode/blob/master/188. Best Time to Buy and Sell Stock IV.go)
Rotate Array	[189. Rotate Array.go](https://github.com/NachtZ/leetcode/blob/master/189. Rotate Array.go)
Reverse Bits	[190. Reverse Bits.c](https://github.com/NachtZ/leetcode/blob/master/190. Reverse Bits.c)
Number of 1 Bits	[191. Number of 1 Bits.c](https://github.com/NachtZ/leetcode/blob/master/191. Number of 1 Bits.c)
House Robber	[198. House Robber.go](https://github.com/NachtZ/leetcode/blob/master/198. House Robber.go)
Binary Tree Right Side View	[199. Binary Tree Right Side View.go](https://github.com/NachtZ/leetcode/blob/master/199. Binary Tree Right Side View.go)
Number of Islands	[200. Number of Islands.go](https://github.com/NachtZ/leetcode/blob/master/200. Number of Islands.go)
Bitwise AND of Numbers Range	[201. Bitwise AND of Numbers Range.go](https://github.com/NachtZ/leetcode/blob/master/201. Bitwise AND of Numbers Range.go)
Happy Number	[202. Happy Number.go](https://github.com/NachtZ/leetcode/blob/master/202. Happy Number.go)
Remove Linked List Elements	[203. Remove Linked List Elements.go](https://github.com/NachtZ/leetcode/blob/master/203. Remove Linked List Elements.go)
Count Primes	[204. Count Primes.go](https://github.com/NachtZ/leetcode/blob/master/204. Count Primes.go)
Isomorphic Strings	[205. Isomorphic Strings.go](https://github.com/NachtZ/leetcode/blob/master/205. Isomorphic Strings.go)
Reverse Linked List	[206. Reverse Linked List.go](https://github.com/NachtZ/leetcode/blob/master/206. Reverse Linked List.go)
Course Schedule	[207. Course Schedule.go](https://github.com/NachtZ/leetcode/blob/master/207. Course Schedule.go)
Implement Trie (Prefix Tree)	[208. Implement Trie (Prefix Tree).cpp](https://github.com/NachtZ/leetcode/blob/master/208. Implement Trie (Prefix Tree).cpp)
Minimum Size Subarray Sum	[209. Minimum Size Subarray Sum.go](https://github.com/NachtZ/leetcode/blob/master/209. Minimum Size Subarray Sum.go)
Course Schedule II	[210. Course Schedule II.go](https://github.com/NachtZ/leetcode/blob/master/210. Course Schedule II.go)
Add and Search Word - Data structure design	[211. Add and Search Word - Data structure design.cpp](https://github.com/NachtZ/leetcode/blob/master/211. Add and Search Word - Data structure design.cpp)
House Robber II	[213. House Robber II.go](https://github.com/NachtZ/leetcode/blob/master/213. House Robber II.go)
Shortest Palindrome	[214. Shortest Palindrome.go](https://github.com/NachtZ/leetcode/blob/master/214. Shortest Palindrome.go)
Kth Largest Element in an Array	[215. Kth Largest Element in an Array.go](https://github.com/NachtZ/leetcode/blob/master/215. Kth Largest Element in an Array.go)
Combination Sum III	[216. Combination Sum III.go](https://github.com/NachtZ/leetcode/blob/master/216. Combination Sum III.go)
Contains Duplicate	[217. Contains Duplicate.go](https://github.com/NachtZ/leetcode/blob/master/217. Contains Duplicate.go)
Contains Duplicate II	[219. Contains Duplicate II.go](https://github.com/NachtZ/leetcode/blob/master/219. Contains Duplicate II.go)
Contains Duplicate III	[220. Contains Duplicate III.go](https://github.com/NachtZ/leetcode/blob/master/220. Contains Duplicate III.go)
Maximal Square	[221. Maximal Square.go](https://github.com/NachtZ/leetcode/blob/master/221. Maximal Square.go)
Count Complete Tree Nodes	[222. Count Complete Tree Nodes.cpp](https://github.com/NachtZ/leetcode/blob/master/222. Count Complete Tree Nodes.cpp)
Rectangle Area	[223. Rectangle Area.go](https://github.com/NachtZ/leetcode/blob/master/223. Rectangle Area.go)
Basic Calculator	[224. Basic Calculator.go](https://github.com/NachtZ/leetcode/blob/master/224. Basic Calculator.go)
Implement Stack using Queues	[225. Implement Stack using Queues.cpp](https://github.com/NachtZ/leetcode/blob/master/225. Implement Stack using Queues.cpp)
Invert Binary Tree	[226. Invert Binary Tree.go](https://github.com/NachtZ/leetcode/blob/master/226. Invert Binary Tree.go)
Basic Calculator II	[227. Basic Calculator II.go](https://github.com/NachtZ/leetcode/blob/master/227. Basic Calculator II.go)
Summary Ranges	[228. Summary Ranges.go](https://github.com/NachtZ/leetcode/blob/master/228. Summary Ranges.go)
Majority Element II	[229. Majority Element II.go](https://github.com/NachtZ/leetcode/blob/master/229. Majority Element II.go)
Kth Smallest Element in a BST	[230. Kth Smallest Element in a BST.go](https://github.com/NachtZ/leetcode/blob/master/230. Kth Smallest Element in a BST.go)
Power of Two	[231. Power of Two.go](https://github.com/NachtZ/leetcode/blob/master/231. Power of Two.go)
Implement Queue using Stacks	[232. Implement Queue using Stacks.cpp](https://github.com/NachtZ/leetcode/blob/master/232. Implement Queue using Stacks.cpp)
Number of Digit One	[233. Number of Digit One.go](https://github.com/NachtZ/leetcode/blob/master/233. Number of Digit One.go)
Palindrome Linked List	[234. Palindrome Linked List.go](https://github.com/NachtZ/leetcode/blob/master/234. Palindrome Linked List.go)
Lowest Common Ancestor of a Binary Search Tree	[235. Lowest Common Ancestor of a Binary Search Tree.cpp](https://github.com/NachtZ/leetcode/blob/master/235. Lowest Common Ancestor of a Binary Search Tree.cpp)
Lowest Common Ancestor of a Binary Tree	[236. Lowest Common Ancestor of a Binary Tree.cpp](https://github.com/NachtZ/leetcode/blob/master/236. Lowest Common Ancestor of a Binary Tree.cpp)
Delete Node in a Linked List	[237. Delete Node in a Linked List.cpp](https://github.com/NachtZ/leetcode/blob/master/237. Delete Node in a Linked List.cpp)
Product of Array Except Self	[238. Product of Array Except Self.go](https://github.com/NachtZ/leetcode/blob/master/238. Product of Array Except Self.go)
Sliding Window Maximum	[239. Sliding Window Maximum.go](https://github.com/NachtZ/leetcode/blob/master/239. Sliding Window Maximum.go)
Search a 2D Matrix II	[240. Search a 2D Matrix II.go](https://github.com/NachtZ/leetcode/blob/master/240. Search a 2D Matrix II.go)
Different Ways to Add Parentheses	[241. Different Ways to Add Parentheses.go](https://github.com/NachtZ/leetcode/blob/master/241. Different Ways to Add Parentheses.go)
Valid Anagram	[242. Valid Anagram.go](https://github.com/NachtZ/leetcode/blob/master/242. Valid Anagram.go)
Binary Tree Paths	[257. Binary Tree Paths.go](https://github.com/NachtZ/leetcode/blob/master/257. Binary Tree Paths.go)
Add Digits	[258. Add Digits.go](https://github.com/NachtZ/leetcode/blob/master/258. Add Digits.go)
Ugly Number	[263. Ugly Number.go](https://github.com/NachtZ/leetcode/blob/master/263. Ugly Number.go)
Ugly Number II	[264. Ugly Number II.go](https://github.com/NachtZ/leetcode/blob/master/264. Ugly Number II.go)
Missing Number	[268. Missing Number.go](https://github.com/NachtZ/leetcode/blob/master/268. Missing Number.go)
Integer to English Words	[273. Integer to English Words.go](https://github.com/NachtZ/leetcode/blob/master/273. Integer to English Words.go)
H-Index	[274. H-Index.go](https://github.com/NachtZ/leetcode/blob/master/274. H-Index.go)
H-Index II	[275. H-Index II.go](https://github.com/NachtZ/leetcode/blob/master/275. H-Index II.go)
First Bad Version	[278. First Bad Version.cpp](https://github.com/NachtZ/leetcode/blob/master/278. First Bad Version.cpp)
Perfect Squares	[279. Perfect Squares.cpp](https://github.com/NachtZ/leetcode/blob/master/279. Perfect Squares.cpp)
Expression Add Operators	[282. Expression Add Operators.cpp](https://github.com/NachtZ/leetcode/blob/master/282. Expression Add Operators.cpp)
Move Zeroes	[283. Move Zeroes.cpp](https://github.com/NachtZ/leetcode/blob/master/283. Move Zeroes.cpp)
Peeking Iterator	[284. Peeking Iterator.cpp](https://github.com/NachtZ/leetcode/blob/master/284. Peeking Iterator.cpp)
Find the Duplicate Number	[287. Find the Duplicate Number.cpp](https://github.com/NachtZ/leetcode/blob/master/287. Find the Duplicate Number.cpp)
Game of Life	[289. Game of Life.cpp](https://github.com/NachtZ/leetcode/blob/master/289. Game of Life.cpp)
Wiggle Sort II	[324. Wiggle Sort II.go](https://github.com/NachtZ/leetcode/blob/master/324. Wiggle Sort II.go)
Counting Bits	[338. Counting Bits.go](https://github.com/NachtZ/leetcode/blob/master/338. Counting Bits.go)
Power of Four	[342. Power of Four.go](https://github.com/NachtZ/leetcode/blob/master/342. Power of Four.go)
Integer Break	[343. Integer Break.go](https://github.com/NachtZ/leetcode/blob/master/343. Integer Break.go)
Reverse String	[344. Reverse String.go](https://github.com/NachtZ/leetcode/blob/master/344. Reverse String.go)
Reverse Vowels of a String	[345. Reverse Vowels of a String.go](https://github.com/NachtZ/leetcode/blob/master/345. Reverse Vowels of a String.go)
Top K Frequent Elements	[347. Top K Frequent Elements.go](https://github.com/NachtZ/leetcode/blob/master/347. Top K Frequent Elements.go)
Intersection of Two Arrays	[349. Intersection of Two Arrays.go](https://github.com/NachtZ/leetcode/blob/master/349. Intersection of Two Arrays.go)
Intersection of Two Arrays II	[350. Intersection of Two Arrays II.go](https://github.com/NachtZ/leetcode/blob/master/350. Intersection of Two Arrays II.go)
Data Stream as Disjoint Intervals	[352. Data Stream as Disjoint Intervals.go](https://github.com/NachtZ/leetcode/blob/master/352. Data Stream as Disjoint Intervals.go)
Russian Doll Envelopes	[354. Russian Doll Envelopes.go](https://github.com/NachtZ/leetcode/blob/master/354. Russian Doll Envelopes.go)
Design Twitter	[355. Design Twitter.go](https://github.com/NachtZ/leetcode/blob/master/355. Design Twitter.go)
Count Numbers with Unique Digits	[357. Count Numbers with Unique Digits.go](https://github.com/NachtZ/leetcode/blob/master/357. Count Numbers with Unique Digits.go)
Water and Jug Problem	[365. Water and Jug Problem.go](https://github.com/NachtZ/leetcode/blob/master/365. Water and Jug Problem.go)
Valid Perfect Square	[367. Valid Perfect Square.go](https://github.com/NachtZ/leetcode/blob/master/367. Valid Perfect Square.go)
Sum of Two Integers	[371. Sum of Two Integers.go](https://github.com/NachtZ/leetcode/blob/master/371. Sum of Two Integers.go)
Super Pow	[372. Super Pow.go](https://github.com/NachtZ/leetcode/blob/master/372. Super Pow.go)
Find K Pairs with Smallest Sums	[373. Find K Pairs with Smallest Sums.go](https://github.com/NachtZ/leetcode/blob/master/373. Find K Pairs with Smallest Sums.go)
Guess Number Higher or Lower	[374. Guess Number Higher or Lower.cpp](https://github.com/NachtZ/leetcode/blob/master/374. Guess Number Higher or Lower.cpp)
Guess Number Higher or Lower II	[375. Guess Number Higher or Lower II.go](https://github.com/NachtZ/leetcode/blob/master/375. Guess Number Higher or Lower II.go)
Wiggle Subsequence	[376. Wiggle Subsequence.go](https://github.com/NachtZ/leetcode/blob/master/376. Wiggle Subsequence.go)
Combination Sum IV	[377. Combination Sum IV.go](https://github.com/NachtZ/leetcode/blob/master/377. Combination Sum IV.go)
Kth Smallest Element in a Sorted Matrix	[378. Kth Smallest Element in a Sorted Matrix.go](https://github.com/NachtZ/leetcode/blob/master/378. Kth Smallest Element in a Sorted Matrix.go)
Insert Delete GetRandom O(1)	[380. Insert Delete GetRandom O(1).go](https://github.com/NachtZ/leetcode/blob/master/380. Insert Delete GetRandom O(1).go)
Insert Delete GetRandom O(1) - Duplicates allowed	[381. Insert Delete GetRandom O(1) - Duplicates allowed.go](https://github.com/NachtZ/leetcode/blob/master/381. Insert Delete GetRandom O(1) - Duplicates allowed.go)
Linked List Random Node	[382. Linked List Random Node.go](https://github.com/NachtZ/leetcode/blob/master/382. Linked List Random Node.go)
Ransom Note	[383. Ransom Note.go](https://github.com/NachtZ/leetcode/blob/master/383. Ransom Note.go)
Shuffle an Array	[384. Shuffle an Array.go](https://github.com/NachtZ/leetcode/blob/master/384. Shuffle an Array.go)
Mini Parser	[385. Mini Parser.go](https://github.com/NachtZ/leetcode/blob/master/385. Mini Parser.go)
Lexicographical Numbers	[386. Lexicographical Numbers.cpp](https://github.com/NachtZ/leetcode/blob/master/386. Lexicographical Numbers.cpp)
First Unique Character in a String	[387. First Unique Character in a String.go](https://github.com/NachtZ/leetcode/blob/master/387. First Unique Character in a String.go)
Longest Absolute File Path	[388. Longest Absolute File Path.go](https://github.com/NachtZ/leetcode/blob/master/388. Longest Absolute File Path.go)
Find the Difference	[389. Find the Difference.cpp](https://github.com/NachtZ/leetcode/blob/master/389. Find the Difference.cpp)
Elimination Game	[390. Elimination Game.go](https://github.com/NachtZ/leetcode/blob/master/390. Elimination Game.go)
Perfect Rectangle	[391. Perfect Rectangle.go](https://github.com/NachtZ/leetcode/blob/master/391. Perfect Rectangle.go)
Is Subsequence	[392. Is Subsequence.go](https://github.com/NachtZ/leetcode/blob/master/392. Is Subsequence.go)
UTF-8 Validation	[393. UTF-8 Validation.go](https://github.com/NachtZ/leetcode/blob/master/393. UTF-8 Validation.go)
Decode String	[394. Decode String.go](https://github.com/NachtZ/leetcode/blob/master/394. Decode String.go)
Longest Substring with At Least K Repeating Characters	[395. Longest Substring with At Least K Repeating Characters.go](https://github.com/NachtZ/leetcode/blob/master/395. Longest Substring with At Least K Repeating Characters.go)
Rotate Function	[396. Rotate Function.go](https://github.com/NachtZ/leetcode/blob/master/396. Rotate Function.go)
Integer Replacement	[397. Integer Replacement.go](https://github.com/NachtZ/leetcode/blob/master/397. Integer Replacement.go)
Random Pick Index	[398. Random Pick Index.cpp](https://github.com/NachtZ/leetcode/blob/master/398. Random Pick Index.cpp)
Evaluate Division	[399. Evaluate Division.go](https://github.com/NachtZ/leetcode/blob/master/399. Evaluate Division.go)
Nth Digit	[400. Nth Digit.go](https://github.com/NachtZ/leetcode/blob/master/400. Nth Digit.go)
Binary Watch	[401. Binary Watch.go](https://github.com/NachtZ/leetcode/blob/master/401. Binary Watch.go)
Remove K Digits	[402. Remove K Digits.go](https://github.com/NachtZ/leetcode/blob/master/402. Remove K Digits.go)
Frog Jump	[403. Frog Jump.go](https://github.com/NachtZ/leetcode/blob/master/403. Frog Jump.go)
Sum of Left Leaves	[404. Sum of Left Leaves.go](https://github.com/NachtZ/leetcode/blob/master/404. Sum of Left Leaves.go)
Convert a Number to Hexadecimal	[405. Convert a Number to Hexadecimal.cpp](https://github.com/NachtZ/leetcode/blob/master/405. Convert a Number to Hexadecimal.cpp)
Queue Reconstruction by Height	[406. Queue Reconstruction by Height.go](https://github.com/NachtZ/leetcode/blob/master/406. Queue Reconstruction by Height.go)
Trapping Rain Water II	[407. Trapping Rain Water II.cpp](https://github.com/NachtZ/leetcode/blob/master/407. Trapping Rain Water II.cpp)
Longest Palindrome	[409. Longest Palindrome.cpp](https://github.com/NachtZ/leetcode/blob/master/409. Longest Palindrome.cpp)
Split Array Largest Sum	[410. Split Array Largest Sum.cpp](https://github.com/NachtZ/leetcode/blob/master/410. Split Array Largest Sum.cpp)
Fizz Buzz	[412. Fizz Buzz.go](https://github.com/NachtZ/leetcode/blob/master/412. Fizz Buzz.go)
Arithmetic Slices	[413. Arithmetic Slices.go](https://github.com/NachtZ/leetcode/blob/master/413. Arithmetic Slices.go)
Third Maximum Number	[414. Third Maximum Number.go](https://github.com/NachtZ/leetcode/blob/master/414. Third Maximum Number.go)
Add Strings	[415. Add Strings.go](https://github.com/NachtZ/leetcode/blob/master/415. Add Strings.go)
Partition Equal Subset Sum	[416. Partition Equal Subset Sum.go](https://github.com/NachtZ/leetcode/blob/master/416. Partition Equal Subset Sum.go)
Pacific Atlantic Water Flow	[417. Pacific Atlantic Water Flow.go](https://github.com/NachtZ/leetcode/blob/master/417. Pacific Atlantic Water Flow.go)
Sentence Screen Fitting	[418. Sentence Screen Fitting.go](https://github.com/NachtZ/leetcode/blob/master/418. Sentence Screen Fitting.go)
Battleships in a board	[419. Battleships in a board.go](https://github.com/NachtZ/leetcode/blob/master/419. Battleships in a board.go)
Valid Word Square	[422. Valid Word Square.go](https://github.com/NachtZ/leetcode/blob/master/422. Valid Word Square.go)
Reconstruct Original Digits from English	[423. Reconstruct Original Digits from English.go](https://github.com/NachtZ/leetcode/blob/master/423. Reconstruct Original Digits from English.go)
Longest Repeating Character Replacement	[424. Longest Repeating Character Replacement.go](https://github.com/NachtZ/leetcode/blob/master/424. Longest Repeating Character Replacement.go)
All O`one Data Structure	[432. All Oone Data Structure.go](https://github.com/NachtZ/leetcode/blob/master/432. All Oone Data Structure.go)
Number of Segments in a String	[434. Number of Segments in a String.go](https://github.com/NachtZ/leetcode/blob/master/434. Number of Segments in a String.go)
Path Sum III	[437. Path Sum III.go](https://github.com/NachtZ/leetcode/blob/master/437. Path Sum III.go)
Find All Anagrams in a String	[438. Find All Anagrams in a String.go](https://github.com/NachtZ/leetcode/blob/master/438. Find All Anagrams in a String.go)
Ternary Expression Parser	[439. Ternary Expression Parser.go](https://github.com/NachtZ/leetcode/blob/master/439. Ternary Expression Parser.go)
K-th Smallest in Lexicographical Order	[440. K-th Smallest in Lexicographical Order.go](https://github.com/NachtZ/leetcode/blob/master/440. K-th Smallest in Lexicographical Order.go)
Add Two Numbers II	[445. Add Two Numbers II.go](https://github.com/NachtZ/leetcode/blob/master/445. Add Two Numbers II.go)
Arithmetic Slices II - Subsequence	[446. Arithmetic Slices II - Subsequence.go](https://github.com/NachtZ/leetcode/blob/master/446. Arithmetic Slices II - Subsequence.go)
Repeated Substring Pattern	[459. Repeated Substring Pattern.go](https://github.com/NachtZ/leetcode/blob/master/459. Repeated Substring Pattern.go)
Sliding Window Median	[480. Sliding Window Median.go](https://github.com/NachtZ/leetcode/blob/master/480. Sliding Window Median.go)
Magical String	[481. Magical String.go](https://github.com/NachtZ/leetcode/blob/master/481. Magical String.go)
License Key Formatting	[482. License Key Formatting.go](https://github.com/NachtZ/leetcode/blob/master/482. License Key Formatting.go)
Smallest Good Base	[483. Smallest Good Base.go](https://github.com/NachtZ/leetcode/blob/master/483. Smallest Good Base.go)
Max Consecutive Ones	[485. Max Consecutive Ones.go](https://github.com/NachtZ/leetcode/blob/master/485. Max Consecutive Ones.go)
Predict the Winner	[486. Predict the Winner.go](https://github.com/NachtZ/leetcode/blob/master/486. Predict the Winner.go)
Zuma Game	[488. Zuma Game.go](https://github.com/NachtZ/leetcode/blob/master/488. Zuma Game.go)
Construct the Rectangle	[492. Construct the Rectangle.go](https://github.com/NachtZ/leetcode/blob/master/492. Construct the Rectangle.go)
Reverse Pairs	[493. Reverse Pairs.go](https://github.com/NachtZ/leetcode/blob/master/493. Reverse Pairs.go)
Target Sum	[494. Target Sum.go](https://github.com/NachtZ/leetcode/blob/master/494. Target Sum.go)
Teemo Attacking	[495. Teemo Attacking.go](https://github.com/NachtZ/leetcode/blob/master/495. Teemo Attacking.go)
Diagonal Traverse	[498. Diagonal Traverse.go](https://github.com/NachtZ/leetcode/blob/master/498. Diagonal Traverse.go)
Keyboard Row	[500. Keyboard Row.go](https://github.com/NachtZ/leetcode/blob/master/500. Keyboard Row.go)
Find Mode in Binary Search Tree	[501. Find Mode in Binary Search Tree.go](https://github.com/NachtZ/leetcode/blob/master/501. Find Mode in Binary Search Tree.go)
IPO	[502. IPO.go](https://github.com/NachtZ/leetcode/blob/master/502. IPO.go)
Next Greater Element II	[503. Next Greater Element II.go](https://github.com/NachtZ/leetcode/blob/master/503. Next Greater Element II.go)
Base 7	[504. Base 7.go](https://github.com/NachtZ/leetcode/blob/master/504. Base 7.go)
Relative Ranks	[506. Relative Ranks.go](https://github.com/NachtZ/leetcode/blob/master/506. Relative Ranks.go)
Most Frequent Subtree Sum	[508. Most Frequent Subtree Sum.go](https://github.com/NachtZ/leetcode/blob/master/508. Most Frequent Subtree Sum.go)
Find Bottom Left Tree Value	[513. Find Bottom Left Tree Value.go](https://github.com/NachtZ/leetcode/blob/master/513. Find Bottom Left Tree Value.go)
Freedom Trail_dfs	[514. Freedom Trail_dfs.go](https://github.com/NachtZ/leetcode/blob/master/514. Freedom Trail_dfs.go)
Find Largest Value in Each Tree Row	[515. Find Largest Value in Each Tree Row.go](https://github.com/NachtZ/leetcode/blob/master/515. Find Largest Value in Each Tree Row.go)
Longest Palindromic Subsequence	[516. Longest Palindromic Subsequence.go](https://github.com/NachtZ/leetcode/blob/master/516. Longest Palindromic Subsequence.go)
Super Washing Machines	[517. Super Washing Machines.go](https://github.com/NachtZ/leetcode/blob/master/517. Super Washing Machines.go)
Detect Capital	[520. Detect Capital.go](https://github.com/NachtZ/leetcode/blob/master/520. Detect Capital.go)
Continuous Subarray Sum	[523. Continuous Subarray Sum.go](https://github.com/NachtZ/leetcode/blob/master/523. Continuous Subarray Sum.go)
Longest Word in Dictionary through Deleting	[524. Longest Word in Dictionary through Deleting.go](https://github.com/NachtZ/leetcode/blob/master/524. Longest Word in Dictionary through Deleting.go)
Contiguous Array	[525. Contiguous Array.go](https://github.com/NachtZ/leetcode/blob/master/525. Contiguous Array.go)
Beautiful Arrangement	[526. Beautiful Arrangement.go](https://github.com/NachtZ/leetcode/blob/master/526. Beautiful Arrangement.go)
Minesweeper	[529. Minesweeper.go](https://github.com/NachtZ/leetcode/blob/master/529. Minesweeper.go)
Minimum Absolute Difference in BST	[530. Minimum Absolute Difference in BST.go](https://github.com/NachtZ/leetcode/blob/master/530. Minimum Absolute Difference in BST.go)
Lonely Pixel I	[531. Lonely Pixel I.go](https://github.com/NachtZ/leetcode/blob/master/531. Lonely Pixel I.go)
K-diff Pairs in an Array	[532. K-diff Pairs in an Array.go](https://github.com/NachtZ/leetcode/blob/master/532. K-diff Pairs in an Array.go)
Lonely Pixel II	[533. Lonely Pixel II.go](https://github.com/NachtZ/leetcode/blob/master/533. Lonely Pixel II.go)
Minimum Time Difference	[539. Minimum Time Difference.go](https://github.com/NachtZ/leetcode/blob/master/539. Minimum Time Difference.go)
Reverse String II	[541. Reverse String II.go](https://github.com/NachtZ/leetcode/blob/master/541. Reverse String II.go)