{"id":13702131,"url":"https://github.com/hitzzc/go-leetcode","last_synced_at":"2025-05-05T04:30:53.073Z","repository":{"id":50481390,"uuid":"67767558","full_name":"hitzzc/go-leetcode","owner":"hitzzc","description":"Golang solution for leetcode","archived":false,"fork":false,"pushed_at":"2019-12-11T06:12:25.000Z","size":203,"stargazers_count":461,"open_issues_count":1,"forks_count":116,"subscribers_count":30,"default_branch":"master","last_synced_at":"2024-11-13T09:40:41.017Z","etag":null,"topics":["go","golang","interview","leetcode","leetcode-golang"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hitzzc.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2016-09-09T05:09:36.000Z","updated_at":"2024-09-20T15:38:12.000Z","dependencies_parsed_at":"2022-09-10T19:30:20.263Z","dependency_job_id":null,"html_url":"https://github.com/hitzzc/go-leetcode","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hitzzc%2Fgo-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hitzzc%2Fgo-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hitzzc%2Fgo-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hitzzc%2Fgo-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hitzzc","download_url":"https://codeload.github.com/hitzzc/go-leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252439422,"owners_count":21748002,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["go","golang","interview","leetcode","leetcode-golang"],"created_at":"2024-08-02T21:00:31.578Z","updated_at":"2025-05-05T04:30:50.277Z","avatar_url":"https://github.com/hitzzc.png","language":"Go","readme":"go-leetcode\n===\nGolang solution for leetcode. For each problem, there is a simple *_test.go to test the solution, and you can run `go test` under corresponding folder.  \n\n#### [1. two sum](https://github.com/hitzzc/go-leetcode/tree/master/two_sum)\n#### [2. add two numbers](https://github.com/hitzzc/go-leetcode/tree/master/add_two_numbers)\n#### [3. longest substring without repeating characters](https://github.com/hitzzc/go-leetcode/tree/master/longest_substring_without_repeating_characters)\n#### [4. median of two sorted arrays](https://github.com/hitzzc/go-leetcode/tree/master/median_of_two_sorted_arrays)\n#### [5. longest palindromic substring](https://github.com/hitzzc/go-leetcode/tree/master/longest_palindromic_substring)\n#### [6. zigzag conversion](https://github.com/hitzzc/go-leetcode/tree/master/zigzag_conversion)\n#### [7. reverse integer](https://github.com/hitzzc/go-leetcode/tree/master/reverse_integer)\n#### [8. string to integer](https://github.com/hitzzc/go-leetcode/tree/master/string_to_integer)\n#### [9. palindrome number](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_number)\n#### [10. Regular Expression Matching](https://github.com/hitzzc/go-leetcode/tree/master/regular_expression_matching)\n#### [11. container with most water](https://github.com/hitzzc/go-leetcode/tree/master/container_with_most_water)\n#### [12. integer to roman](https://github.com/hitzzc/go-leetcode/tree/master/integer_to_roman)\n#### [13. roman to integer](https://github.com/hitzzc/go-leetcode/tree/master/roman_to_integer)\n#### [14. longest common prefix](https://github.com/hitzzc/go-leetcode/tree/master/longest_common_prefix)\n#### [15. 3sum](https://github.com/hitzzc/go-leetcode/tree/master/three_sum)\n#### [16. 3sum closest](https://github.com/hitzzc/go-leetcode/tree/master/three_sum_closest)\n#### [17. letter combinations of a phone number](https://github.com/hitzzc/go-leetcode/tree/master/letter_combinations_of_a_phone_number)\n#### [18. 4sum](https://github.com/hitzzc/go-leetcode/tree/master/four_sum)\n#### [19. remove nth node from end of list](https://github.com/hitzzc/go-leetcode/tree/master/remove_nth_node_from_end_of_list)\n#### [20. valid parentheses](https://github.com/hitzzc/go-leetcode/tree/master/valid_parentheses)\n#### [21. merge two sorted lists](https://github.com/hitzzc/go-leetcode/tree/master/merge_two_sorted_lists)\n#### [22. generate parentheses](https://github.com/hitzzc/go-leetcode/tree/master/generate_parentheses)\n#### [23. merge k sorted lists](https://github.com/hitzzc/go-leetcode/tree/master/merge_k_sorted_lists)\n#### [24. swap nodes in pairs](https://github.com/hitzzc/go-leetcode/tree/master/swap_nodes_in_pairs)\n#### [25. reverse nodes in k group](https://github.com/hitzzc/go-leetcode/tree/master/reverse_nodes_in_k_group)\n#### [26. Remove Duplicates from Sorted Array](https://github.com/hitzzc/go-leetcode/tree/master/remove_duplicates_from_sorted_array)\n#### [27. Remove Element](https://github.com/hitzzc/go-leetcode/tree/master/remove_element)\n#### [31. Next Permutation](https://github.com/hitzzc/go-leetcode/tree/master/next_permutation)\n#### [32. longest valid parentheses](https://github.com/hitzzc/go-leetcode/tree/master/longest_valid_parentheses)\n#### [33. search in rotated sorted array](https://github.com/hitzzc/go-leetcode/tree/master/search_in_rotated_sorted_array)\n#### [34. search for a range](https://github.com/hitzzc/go-leetcode/tree/master/search_for_a_range)\n#### [35. search insert position](https://github.com/hitzzc/go-leetcode/tree/master/search_insert_position)\n#### [36. valid sudoku](https://github.com/hitzzc/go-leetcode/tree/master/valid_sudoku)\n#### [38. count and say](https://github.com/hitzzc/go-leetcode/tree/master/count_and_say)\n#### [39. combination sum](https://github.com/hitzzc/go-leetcode/tree/master/combination_sum)\n#### [40. combination sum ii](https://github.com/hitzzc/go-leetcode/tree/master/combination_sum_II)\n#### [41. first missing positive](https://github.com/hitzzc/go-leetcode/tree/master/first_missing_positive)\n#### [42. trapping rain water](https://github.com/hitzzc/go-leetcode/tree/master/trapping_rain_water)\n#### [43. multiply strings](https://github.com/hitzzc/go-leetcode/tree/master/multiply_strings)\n#### [46. permutations](https://github.com/hitzzc/go-leetcode/tree/master/permutations)\n#### [47. permutations II](https://github.com/hitzzc/go-leetcode/tree/master/permutations_II)\n#### [48. rotate image](https://github.com/hitzzc/go-leetcode/tree/master/rotate_image)\n#### [49. group anagrams](https://github.com/hitzzc/go-leetcode/tree/master/group_anagrams)\n#### [50. pow(x,n)](https://github.com/hitzzc/go-leetcode/tree/master/pow_x_n)\n#### [51. n queens](https://github.com/hitzzc/go-leetcode/tree/master/n_queens)\n#### [52. n queens II](https://github.com/hitzzc/go-leetcode/tree/master/n_queens_II)\n#### [53. maximum subarray](https://github.com/hitzzc/go-leetcode/tree/master/maximum_subarray)\n#### [54. spiral matrix](https://github.com/hitzzc/go-leetcode/tree/master/spiral_matrix)\n#### [55. jump game](https://github.com/hitzzc/go-leetcode/tree/master/jump_game)\n#### [58. length of last word](https://github.com/hitzzc/go-leetcode/tree/master/length_of_last_word)\n#### [59. spiral matrix II](https://github.com/hitzzc/go-leetcode/tree/master/spiral_matrix_II)\n#### [60. permutation sequence](https://github.com/hitzzc/go-leetcode/tree/master/permutation_sequence)\n#### [61. rotate list](https://github.com/hitzzc/go-leetcode/tree/master/rotate_list)\n#### [62. unique paths](https://github.com/hitzzc/go-leetcode/tree/master/unique_paths)\n#### [63. unique paths II](https://github.com/hitzzc/go-leetcode/tree/master/unique_paths_II)\n#### [64. minimum path sum](https://github.com/hitzzc/go-leetcode/tree/master/minimum_path_sum)\n#### [65. valid number](https://github.com/hitzzc/go-leetcode/tree/master/valid_number)\n#### [66. plus one](https://github.com/hitzzc/go-leetcode/tree/master/plus_one)\n#### [67. add binary](https://github.com/hitzzc/go-leetcode/tree/master/add_binary)\n#### [70. climbing stairs](https://github.com/hitzzc/go-leetcode/tree/master/climbing_stairs)\n#### [72. edit distance](https://github.com/hitzzc/go-leetcode/tree/master/edit_distance)\n#### [73. set matrix zeroes](https://github.com/hitzzc/go-leetcode/tree/master/set_matrix_zeroes)\n#### [74. search a 2D matrix](https://github.com/hitzzc/go-leetcode/tree/master/search_a_2D_matrix)\n#### [75. sort colors](https://github.com/hitzzc/go-leetcode/tree/master/sort_colors)\n#### [76. minimum window substring](https://github.com/hitzzc/go-leetcode/tree/master/minimum_window_substring)\n#### [77. combinations](https://github.com/hitzzc/go-leetcode/tree/master/combinations)\n#### [78. subsets](https://github.com/hitzzc/go-leetcode/tree/master/subsets)\n#### [79. word search(not solved)](https://github.com/hitzzc/go-leetcode/tree/master/word_search)\n#### [80. Remove Duplicates from Sorted Array II](https://github.com/hitzzc/go-leetcode/tree/master/remove_duplicates_from_sorted_array_II)\n#### [81. Search in Rotated Sorted Array II](https://github.com/hitzzc/go-leetcode/tree/master/search_in_rotated_sorted_array_II)\n#### [82. remove duplicates from sorted list II](https://github.com/hitzzc/go-leetcode/tree/master/remove_duplicates_from_sorted_list_II)\n#### [83. remove duplicates from sorted list](https://github.com/hitzzc/go-leetcode/tree/master/remove_duplicates_from_sorted_list)\n#### [84. largest rectangle in histogram](https://github.com/hitzzc/go-leetcode/tree/master/largest_rectangle_in_histogram)\n#### [85. maximal rectangle](https://github.com/hitzzc/go-leetcode/tree/master/maximal_rectangle)\n#### [86. partition list](https://github.com/hitzzc/go-leetcode/tree/master/partition_list)\n#### [88. merge sorted array](https://github.com/hitzzc/go-leetcode/tree/master/merge_sorted_array)\n#### [89. gray code](https://github.com/hitzzc/go-leetcode/tree/master/gray_code)\n#### [90. subsets II](https://github.com/hitzzc/go-leetcode/tree/master/subsets_II)\n#### [91. decode ways](https://github.com/hitzzc/go-leetcode/tree/master/decode_ways)\n#### [92. reverse linked list II](https://github.com/hitzzc/go-leetcode/tree/master/reverse_linked_list_II)\n#### [93. Restore IP Addresses](https://github.com/hitzzc/go-leetcode/tree/master/restore_IP_addresses)\n#### [94. Binary Tree Inorder Traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_inorder_traversal)\n#### [95. Unique Binary Search Trees II](https://github.com/hitzzc/go-leetcode/tree/master/unique_binary_search_trees_II)\n#### [96. Unique Binary Search Trees](https://github.com/hitzzc/go-leetcode/tree/master/unique_binary_search_trees)\n#### [98. validate binary search tree](https://github.com/hitzzc/go-leetcode/tree/master/validate_binary_search_tree)\n#### [100. same tree](https://github.com/hitzzc/go-leetcode/tree/master/same_tree)\n#### [101. symmetric tree](https://github.com/hitzzc/go-leetcode/tree/master/symmetric_tree)\n#### [102. Binary Tree Level Order Traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_level_order_traversal)\n#### [103. Binary Tree Zigzag Level Order Traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_zigzag_level_order_traversal)\n#### [104. maximum depth of binary tree](https://github.com/hitzzc/go-leetcode/tree/master/maximum_depth_of_binary_tree)\n#### [105. construct binary tree from preorder and inorder traversal](https://github.com/hitzzc/go-leetcode/tree/master/construct_binary_tree_from_preorder_and_inorder_traversal)\n#### [106. construct binary tree from inorder and postorder traversal](https://github.com/hitzzc/go-leetcode/tree/master/construct_binary_tree_from_inorder_and_postorder_traversal)\n#### [107. Binary Tree Level Order Traversal II](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_level_order_traversal_II)\n#### [108. Convert Sorted Array to Binary Search Tree](https://github.com/hitzzc/go-leetcode/tree/master/convert_sorted_array_to_binary_search_tree)\n#### [109. Convert Sorted List to Binary Search Tree](https://github.com/hitzzc/go-leetcode/tree/master/convert_sorted_list_to_binary_search_tree)\n#### [110. Balanced Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/balanced_bianry_tree)\n#### [111. minimum depth of binary tree](https://github.com/hitzzc/go-leetcode/tree/master/minimum_depth_of_binary_tree)\n#### [112. path sum](https://github.com/hitzzc/go-leetcode/tree/master/path_sum)\n#### [113. path sum II](https://github.com/hitzzc/go-leetcode/tree/master/path_sum_II)\n#### [114. Flatten Binary Tree to Linked List](https://github.com/hitzzc/go-leetcode/tree/master/flatten_binary_tree_to_linked_list)\n#### [115. distinct subsequences](https://github.com/hitzzc/go-leetcode/tree/master/distinct_subsequences)\n#### [116. Populating Next Right Pointers in Each Node](https://github.com/hitzzc/go-leetcode/tree/master/populating_next_right_pointers_in_each_node)\n#### [117. Populating Next Right Pointers in Each Node II](https://github.com/hitzzc/go-leetcode/tree/master/populating_next_right_pointers_in_each_node_II)\n#### [118. pascal's triangle](https://github.com/hitzzc/go-leetcode/tree/master/pascals_triangle)\n#### [119. pascal's triangle II](https://github.com/hitzzc/go-leetcode/tree/master/pascals_triangle_II)\n#### [120. triangle](https://github.com/hitzzc/go-leetcode/tree/master/triangle)\n#### [121. Best Time to Buy and Sell Stock](https://github.com/hitzzc/go-leetcode/tree/master/best_time_to_buy_and_sell_stock)\n#### [122. Best Time to Buy and Sell Stock II](https://github.com/hitzzc/go-leetcode/tree/master/best_time_to_buy_and_sell_stock_II)\n#### [123. Best Time to Buy and Sell Stock III](https://github.com/hitzzc/go-leetcode/tree/master/best_time_to_buy_and_sell_stock_III)\n#### [124. binary tree maximum path sum](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_maximum_path_sum)\n#### [125. valid palindrome](https://github.com/hitzzc/go-leetcode/tree/master/valid_palindrome)\n#### [126. word ladder II](https://github.com/hitzzc/go-leetcode/tree/master/word_ladder_II)\n#### [127. word ladder](https://github.com/hitzzc/go-leetcode/tree/master/word_ladder)\n#### [128. longest consecutive sequence](https://github.com/hitzzc/go-leetcode/tree/master/longest_consecutive_sequence)\n#### [129. sum root to leaf numbers](https://github.com/hitzzc/go-leetcode/tree/master/sum_root_to_leaf_numbers)\n#### [130. surrounded regions](https://github.com/hitzzc/go-leetcode/tree/master/surrounded_regions)\n#### [131. palindrome partitioning](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_partitioning)\n#### [132. palindrome partitioning II](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_partitioning_II)\n#### [133. Clone Graph](https://github.com/hitzzc/go-leetcode/tree/master/clone_graph)\n#### [134. gas station](https://github.com/hitzzc/go-leetcode/tree/master/gas_station)\n#### [135. candy](https://github.com/hitzzc/go-leetcode/tree/master/candy)\n#### [136. single number](https://github.com/hitzzc/go-leetcode/tree/master/single_number)\n#### [137. single number II](https://github.com/hitzzc/go-leetcode/tree/master/single_number_II)\n#### [138. copy_list_with_random_pointer](https://github.com/hitzzc/go-leetcode/tree/master/copy_list_with_random_pointer)\n#### [139. word break](https://github.com/hitzzc/go-leetcode/tree/master/word_break)\n#### [140. word break II](https://github.com/hitzzc/go-leetcode/tree/master/word_break_II)\n#### [141. Linked List Cycle](https://github.com/hitzzc/go-leetcode/tree/master/linked_list_cycle)\n#### [142. Linked List Cycle II](https://github.com/hitzzc/go-leetcode/tree/master/linked_list_cycle_II)\n#### [143. reorder list](https://github.com/hitzzc/go-leetcode/tree/master/reorder_list)\n#### [144. binary tree preorder traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_preorder_traversal)\n#### [145. binary tree postorder traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_postorder_traversal)\n#### [146. LRU Cache](https://github.com/hitzzc/go-leetcode/tree/master/lru_cache)\n#### [147. insertion sort list](https://github.com/hitzzc/go-leetcode/tree/master/insertion_sort_list)\n#### [148. sort list](https://github.com/hitzzc/go-leetcode/tree/master/sort_list)\n#### [149. Max Points on a Line](https://github.com/hitzzc/go-leetcode/tree/master/max_points_on_a_line)\n#### [150. evaluate reverse polish notation](https://github.com/hitzzc/go-leetcode/tree/master/evaluate_reverse_polish_notation)\n#### [151. reverse words in a string](https://github.com/hitzzc/go-leetcode/tree/master/reverse_words_in_a_string)\n#### [152. maximum product subarray](https://github.com/hitzzc/go-leetcode/tree/master/maximum_product_subarray)\n#### [153. find minimum in rotated sorted array](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array)\n#### [154. find minimum in rotated sorted array II](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array_II)\n#### [155. Min Stack](https://github.com/hitzzc/go-leetcode/tree/master/min_stack)\n#### [160. Intersection of Two Linked Lists](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_linked_lists)\n#### [162. Find Peak Element](https://github.com/hitzzc/go-leetcode/tree/master/find_peak_element)\n#### [164. Maximum Gap](https://github.com/hitzzc/go-leetcode/tree/master/maximum_gap)\n#### [165. compare version numbers](https://github.com/hitzzc/go-leetcode/tree/master/compare_version_numbers)\n#### [166. Fraction to Recurring Decimal](https://github.com/hitzzc/go-leetcode/tree/master/fraction_to_recurring_decimal)\n#### [167. Two Sum II](https://github.com/hitzzc/go-leetcode/tree/master/two_sum_II)\n#### [168. Excel Sheet Column Title](https://github.com/hitzzc/go-leetcode/tree/master/excel_sheet_column_title)\n#### [169. Majority Element](https://github.com/hitzzc/go-leetcode/tree/master/majority_element)\n#### [171. Excel Sheet Column Number](https://github.com/hitzzc/go-leetcode/tree/master/excel_sheet_column_number)\n#### [172. Factorial Trailing Zeroes](https://github.com/hitzzc/go-leetcode/tree/master/factorial_trailing_zeroes)\n#### [173. Binary Search Tree Iterator](https://github.com/hitzzc/go-leetcode/tree/master/binary_search_tree_iterator)\n#### [174. Dungeon Game](https://github.com/hitzzc/go-leetcode/tree/master/dungeon_game)\n#### [179. Largest Number](https://github.com/hitzzc/go-leetcode/tree/master/largest_number)\n#### [187. Repeated DNA Sequences](https://github.com/hitzzc/go-leetcode/tree/master/repeated_dna_sequences)\n#### [188. Best Time to Buy and Sell Stock IV](https://github.com/hitzzc/go-leetcode/tree/master/best_time_to_buy_and_sell_stock_IV)\n#### [189. Rotate Array](https://github.com/hitzzc/go-leetcode/tree/master/rotate_array)\n#### [190. Reverse Bits](https://github.com/hitzzc/go-leetcode/tree/master/reverse_bits)\n#### [191. Number of 1 Bits](https://github.com/hitzzc/go-leetcode/tree/master/number_of_1bits)\n#### [198. House Robber](https://github.com/hitzzc/go-leetcode/tree/master/house_robber)\n#### [199. Binary Tree Right Side View](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_right_side_view)\n#### [200. Number of Islands](https://github.com/hitzzc/go-leetcode/tree/master/number_of_islands)\n#### [201. Bitwise AND of Numbers Range](https://github.com/hitzzc/go-leetcode/tree/master/bitwise_AND_of_numbers_range)\n#### [202. Happy Number](https://github.com/hitzzc/go-leetcode/tree/master/happy_number)\n#### [203. Remove Linked List Elements](https://github.com/hitzzc/go-leetcode/tree/master/remove_linked_list_elements)\n#### [204. Count Primes](https://github.com/hitzzc/go-leetcode/tree/master/count_primes)\n#### [205. Isomorphic Strings](https://github.com/hitzzc/go-leetcode/tree/master/isomorphic_strings)\n#### [206. Reverse Linked List](https://github.com/hitzzc/go-leetcode/tree/master/reverse_linked_list)\n#### [207. Course Schedule](https://github.com/hitzzc/go-leetcode/tree/master/course_schedule)\n#### [208. Implement Trie (Prefix Tree)](https://github.com/hitzzc/go-leetcode/tree/master/implement_trie)\n#### [209. Minimum Size Subarray Sum](https://github.com/hitzzc/go-leetcode/tree/master/minimum_size_subarray_sum)\n#### [210. Course Schedule II](https://github.com/hitzzc/go-leetcode/tree/master/course_schedule_II)\n#### [211. Add and Search Word - Data structure design](https://github.com/hitzzc/go-leetcode/tree/master/add_and_search_word)\n#### [213. House Robber II](https://github.com/hitzzc/go-leetcode/tree/master/add_and_search_word)\n#### [214. Shortest Palindrome (unsolved)](https://github.com/hitzzc/go-leetcode/tree/master/shortest_palindrome)\n#### [215. Kth Largest Element in an Array](https://github.com/hitzzc/go-leetcode/tree/master/kth_largest_element_in_an_array)\n#### [216. Combination Sum III](https://github.com/hitzzc/go-leetcode/tree/master/combinations_sum_III)\n#### [217. Contains Duplicate](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate)\n#### [219. Contains Duplicate II](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate_II)\n#### [220. Contains Duplicate III (unsolved)](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate_III)\n#### [221. Maximal Square](https://github.com/hitzzc/go-leetcode/tree/master/maximal_square)\n#### [222. Count Complete Tree Nodes](https://github.com/hitzzc/go-leetcode/tree/master/count_complete_tree_nodes)\n#### [223. Rectangle Area](https://github.com/hitzzc/go-leetcode/tree/master/rectangle_area)\n#### [224. Basic Calculator](https://github.com/hitzzc/go-leetcode/tree/master/basic_calculator)\n#### [225. Implement Stack using Queues](https://github.com/hitzzc/go-leetcode/tree/master/implement_stack_using_queues)\n#### [226. Invert Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/invert_binary_tree)\n#### [227. Basic Calculator II](https://github.com/hitzzc/go-leetcode/tree/master/basic_calculator_II)\n#### [228. Summary Ranges](https://github.com/hitzzc/go-leetcode/tree/master/summary_ranges)\n#### [229. Majority Element II](https://github.com/hitzzc/go-leetcode/tree/master/majority_element_II)\n#### [230. Kth Smallest Element in a BST](https://github.com/hitzzc/go-leetcode/tree/master/kth_smallest_element_in_a_BST)\n#### [231. Power of Two](https://github.com/hitzzc/go-leetcode/tree/master/power_of_two)\n#### [232. Implement Queue using Stacks](https://github.com/hitzzc/go-leetcode/tree/master/implement_queue_using_stacks)\n#### [234. Palindrome Linked List](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_lined_list)\n#### [235. Lowest Common Ancestor of a Binary Search Tree](https://github.com/hitzzc/go-leetcode/tree/master/lowest_common_ancestor_of_a_binary_search_tree)\n#### [236. Lowest Common Ancestor of a Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/lowest_common_ancestor_of_a_binary_tree)\n#### [237. Delete Node in a Linked List](https://github.com/hitzzc/go-leetcode/tree/master/delete_node_in_a_linked_list)\n#### [238. product of array except self](https://github.com/hitzzc/go-leetcode/tree/master/product_of_array_except_self)\n#### [239. Sliding Window Maximum](https://github.com/hitzzc/go-leetcode/tree/master/sliding_window_maximum)\n#### [240. Search a 2D Matrix II](https://github.com/hitzzc/go-leetcode/tree/master/search_a_2D_matrix_II)\n#### [241. Different Ways to Add Parentheses](https://github.com/hitzzc/go-leetcode/tree/master/different_ways_to_add_parentheses)\n#### [242. Valid Anagram](https://github.com/hitzzc/go-leetcode/tree/master/valid_anagram)\n#### [257. Binary Tree Paths](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_paths)\n#### [258. Add Digits](https://github.com/hitzzc/go-leetcode/tree/master/add_digits)\n#### [260. Single Number III](https://github.com/hitzzc/go-leetcode/tree/master/single_number_III)\n#### [263. Ugly Number](https://github.com/hitzzc/go-leetcode/tree/master/ugly_number)\n#### [264. Ugly Number II](https://github.com/hitzzc/go-leetcode/tree/master/ugly_number_II)\n#### [268. Missing Number](https://github.com/hitzzc/go-leetcode/tree/master/missing_number)\n#### [278. First Bad Version](https://github.com/hitzzc/go-leetcode/tree/master/missing_number)\n#### [279. Perfect Squares](https://github.com/hitzzc/go-leetcode/tree/master/perfect_squares)\n#### [282. Expression Add Operators](https://github.com/hitzzc/go-leetcode/tree/master/expression_add_operators)\n#### [283. Move Zeroes](https://github.com/hitzzc/go-leetcode/tree/master/expression_add_operators)\n#### [284. Peeking Iterator](https://github.com/hitzzc/go-leetcode/tree/master/peeking_iterator)\n#### [287. Find the Duplicate Number](https://github.com/hitzzc/go-leetcode/tree/master/find_the_duplicate_number)\n#### [290. Word Pattern](https://github.com/hitzzc/go-leetcode/tree/master/word_pattern)\n#### [292. Nim Game](https://github.com/hitzzc/go-leetcode/tree/master/nim_game)\n#### [295. Find Median from Data Stream](https://github.com/hitzzc/go-leetcode/tree/master/find_median_from_data_stream)\n#### [297. Serialize and Deserialize Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/serialize_and_deserialize_binary_tree)\n#### [299. Bulls and Cows](https://github.com/hitzzc/go-leetcode/tree/master/bulls_and_cows)\n#### [300. Longest Increasing Subsequence](https://github.com/hitzzc/go-leetcode/tree/master/longest_increasing_subsequence)\n#### [301. Remove Invalid Parentheses](https://github.com/hitzzc/go-leetcode/tree/master/remove_invalid_parentheses)\n#### [303. Range Sum Query - Immutable](https://github.com/hitzzc/go-leetcode/tree/master/range_sum_query_immutable)\n#### [304. Range Sum Query 2D - Immutable](https://github.com/hitzzc/go-leetcode/tree/master/range_sum_query_immutable)\n#### [306. Additive Number](https://github.com/hitzzc/go-leetcode/tree/master/additive_number)\n#### [307. Range Sum Query - Mutable](https://github.com/hitzzc/go-leetcode/tree/master/range_sum_query_mutable)\n#### [309. Best Time to Buy and Sell Stock with Cooldown](https://github.com/hitzzc/go-leetcode/tree/master/best_time_to_buy_and_sell_stock_with_cooldown)\n#### [312. Burst Balloons](https://github.com/hitzzc/go-leetcode/tree/master/burst_balloons)\n#### [313. Super Ugly Number](https://github.com/hitzzc/go-leetcode/tree/master/super_ugly_number)\n#### [315. Count of Smaller Numbers After Self](https://github.com/hitzzc/go-leetcode/tree/master/count_of_smaller_numbers_after_self)\n#### [316. Remove Duplicate Letters](https://github.com/hitzzc/go-leetcode/tree/master/remove_duplicate_letters)\n#### [318. Maximum Product of Word Lengths ](https://github.com/hitzzc/go-leetcode/tree/master/maximum_product_of_word_lengths)\n#### [319. Bulb Switcher](https://github.com/hitzzc/go-leetcode/tree/master/bulb_switcher)\n#### [322. Coin Change](https://github.com/hitzzc/go-leetcode/tree/master/coin_change)\n#### [326. Power of Three](https://github.com/hitzzc/go-leetcode/tree/master/power_of_three)\n#### [327. Count of Range Sum](https://github.com/hitzzc/go-leetcode/tree/master/count_of_range_sum)\n#### [329. Longest Increasing Path in a Matrix](https://github.com/hitzzc/go-leetcode/tree/master/longest_increasing_path_in_a_matrix)\n#### [331. Verify Preorder Serialization of a Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/verify_preorder_serialization_of_a_binary_tree)\n#### [332. Reconstruct Itinerary](https://github.com/hitzzc/go-leetcode/tree/master/reconstruct_ltinerary)\n#### [334. Increasing Triplet Subsequence](https://github.com/hitzzc/go-leetcode/tree/master/increasing_triplet_subsequence)\n#### [335. Self Crossing](https://github.com/hitzzc/go-leetcode/tree/master/self_crossing)\n#### [336. Palindrome Pairs](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_pairs)\n#### [337. House Robber III](https://github.com/hitzzc/go-leetcode/tree/master/house_robber_III)\n#### [338. Counting Bits](https://github.com/hitzzc/go-leetcode/tree/master/counting_bits)\n#### [341. Flatten Nested List Iterator](https://github.com/hitzzc/go-leetcode/tree/master/flatten_nested_list_iterator)\n#### [342. Power of Four](https://github.com/hitzzc/go-leetcode/tree/master/power_of_four)\n#### [343. Integer Break](https://github.com/hitzzc/go-leetcode/tree/master/integer_break)\n#### [344. Reverse String](https://github.com/hitzzc/go-leetcode/tree/master/reverse_string)\n#### [345. Reverse Vowels of a String](https://github.com/hitzzc/go-leetcode/tree/master/reverse_vowels_of_a_string)\n#### [347. Top K Frequent Elements](https://github.com/hitzzc/go-leetcode/tree/master/top_k_frequent_elements)\n#### [349. Intersection of Two Arrays](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_arrays)\n#### [350. Intersection of Two Arrays II](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_arrays_II)\n#### [354. Russian Doll Envelopes](https://github.com/hitzzc/go-leetcode/tree/master/russian_doll_envelopes)\n#### [367. Valid Perfect Square](https://github.com/hitzzc/go-leetcode/tree/master/valid_perfect_square)\n#### [368. Largest Divisible Subset](https://github.com/hitzzc/go-leetcode/tree/master/largest_divisible_subset)\n#### [371. Sum of Two Integers](https://github.com/hitzzc/go-leetcode/tree/master/sum_of_two_integers)\n#### [373. Find K Pairs with Smallest Sums](https://github.com/hitzzc/go-leetcode/tree/master/find_k_pairs_with_smallest_sums)\n#### [374. Guess Number Higher or Lower](https://github.com/hitzzc/go-leetcode/tree/master/guess_number_higher_or_lower)\n#### [375. Guess Number Higher or Lower II](https://github.com/hitzzc/go-leetcode/tree/master/guess_number_higher_or_lower_II)\n#### [376. Wiggle Subsequence](https://github.com/hitzzc/go-leetcode/tree/master/wiggle_subsequence)\n#### [377. Combination Sum IV](https://github.com/hitzzc/go-leetcode/tree/master/combination_sum_IV)\n#### [378. Kth Smallest Element in a Sorted Matrix](https://github.com/hitzzc/go-leetcode/tree/master/kth_smallest_element_in_a_sorted_matrix)\n#### [383. Ransom Note](https://github.com/hitzzc/go-leetcode/tree/master/ransom_note)\n#### [384. Shuffle an Array](https://github.com/hitzzc/go-leetcode/tree/master/shuffle_an_array)\n#### [386. Lexicographical Numbers](https://github.com/hitzzc/go-leetcode/tree/master/lexicographical_numbers)\n#### [387. First Unique Character in a String](https://github.com/hitzzc/go-leetcode/tree/master/first_unique_character_in_a_string)\n#### [388. Longest Absolute File Path](https://github.com/hitzzc/go-leetcode/tree/master/longest_absolute_file_path)\n#### [389. Find the Difference](https://github.com/hitzzc/go-leetcode/tree/master/find_the_difference)\n#### [390. Elimination Game](https://github.com/hitzzc/go-leetcode/tree/master/elimination_game)\n#### [391. Is Subsequence](https://github.com/hitzzc/go-leetcode/tree/master/is_subsequence)\n#### [394. Decode String](https://github.com/hitzzc/go-leetcode/tree/master/decode_string)\n#### [395. Longest Substring with At Least K Repeating Characters](https://github.com/hitzzc/go-leetcode/tree/master/longest_substring_with_at_least_k_repeating_characters)\n#### [396. Rotate Function](https://github.com/hitzzc/go-leetcode/tree/master/rotate_function)\n#### [400. Nth Digit](https://github.com/hitzzc/go-leetcode/tree/master/nth_digit)\n\n\n\n\n\n\n\n\n\n\n\n","funding_links":[],"categories":["Go"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhitzzc%2Fgo-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhitzzc%2Fgo-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhitzzc%2Fgo-leetcode/lists"}