{"id":16779466,"url":"https://github.com/vvatanabe/go-leetcode","last_synced_at":"2025-03-16T19:44:37.857Z","repository":{"id":54168563,"uuid":"301085540","full_name":"vvatanabe/go-leetcode","owner":"vvatanabe","description":"leetcode in Go","archived":false,"fork":false,"pushed_at":"2021-03-05T20:20:56.000Z","size":272,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-01-23T06:27:11.095Z","etag":null,"topics":["go","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.com/","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/vvatanabe.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-10-04T09:10:55.000Z","updated_at":"2023-03-04T06:17:07.000Z","dependencies_parsed_at":"2022-08-13T08:10:40.697Z","dependency_job_id":null,"html_url":"https://github.com/vvatanabe/go-leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vvatanabe%2Fgo-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vvatanabe%2Fgo-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vvatanabe%2Fgo-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vvatanabe%2Fgo-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/vvatanabe","download_url":"https://codeload.github.com/vvatanabe/go-leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243923612,"owners_count":20369573,"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","leetcode"],"created_at":"2024-10-13T07:30:06.152Z","updated_at":"2025-03-16T19:44:37.831Z","avatar_url":"https://github.com/vvatanabe.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# go-leetcode ![Go](https://github.com/vvatanabe/go-leetcode/workflows/Go/badge.svg)\n\n[leetcode](https://leetcode.com/) in Go\n\n## Table Contents\n\n### Basic\n\n- [Binary Search](basic/binary_search/main.go)\n- [Bubble Sort](basic/bubble_sort/main.go)\n- [Selection Sort](basic/selection_sort/main.go)\n- [Insertion Sort](basic/insertion_sort/main.go)\n- [Heap Sort](basic/heap_sort/main.go)\n- [Merge Sort](basic/merge_sort/main.go)\n- [Hash Table](basic/hash_table/main.go)\n- [Singly Linked List](basic/singly_linked_list/main.go)\n\n### Problem Set\n\n- [Two Sum](problemset/two_sum/main.go)\n- [Reverse Integer](problemset/reverse_integer/main.go)\n- [Palindrome Number](problemset/palindrome_number/main.go)\n- [Roman to Integer](problemset/roman_to_integer/main.go)\n- [Longest Common Prefix](problemset/longest_common_prefix/main.go)\n- [3Sum](problemset/three_sum/main.go)\n- [Valid Parentheses](problemset/valid_parentheses/main.go)\n- [Merge Two Sorted Lists](problemset/merge_two_sorted_lists/main.go)\n- [Remove Duplicates from Sorted Array](problemset/remove_duplicates_from_sorted_array/main.go)\n- [Remove Element](problemset/remove_element/main.go)\n- [Implement strStr()](problemset/implement_strstr/main.go)\n- [Search Insert Position](problemset/search_insert_position/main.go)\n- [Length of Last Word](problemset/length_of_last_word/main.go)\n- [Plus One](problemset/plus_one/main.go)\n- [Maximum Subarray](problemset/maximum_subarray/main.go)\n- [Add Binary](problemset/add_binary/main.go)\n- [Sqrt(x)](problemset/sqrtx/main.go)\n- [Climbing Stairs](problemset/climbing_stairs/main.go)\n- [Merge Sorted Array](problemset/merge_sorted_array/main.go)\n- [Same Tree](problemset/same_tree/main.go)\n- [Maximum Depth of Binary Tree](problemset/maximum_depth_of_binary_tree/main.go)\n- [Binary Tree Level Order Traversal II](problemset/binary_tree_level_order_traversal_ii/main.go)\n- [Convert Sorted Array to Binary Search Tree](problemset/convert_sorted_array_to_binary_search_tree/main.go)\n- [Pascal's Triangle](problemset/pascals_triangle/main.go)\n- [Pascal's Triangle II](problemset/pascals_triangle_ii/main.go)\n- [Best Time to Buy and Sell Stock](problemset/best_time_to_buy_and_sell_stock/main.go)\n- [Best Time to Buy and Sell Stock II](problemset/best_time_to_buy_and_sell_stock_ii/main.go)\n- [Valid Palindrome](problemset/valid_palindrome/main.go)\n- [Single Number](problemset/single_number/main.go)\n- [Linked List Cycle](problemset/linked_list_cycle/main.go)\n- [Min Stack](problemset/min_stack/main.go)\n- [Two Sum II - Input array is sorted](problemset/two_sum_ii_input_array_is_sorted/main.go)\n- [Excel Sheet Column Title](problemset/excel_sheet_column_title/main.go)\n- [Majority Element](problemset/majority_element/main.go)\n- [Excel Sheet Column Number](problemset/excel_sheet_column_number/main.go)\n- [Factorial Trailing Zeroes](problemset/factorial_trailing_zeroes/main.go)\n- [Reverse Bits](problemset/reverse_bits/main.go)\n- [Number of 1 Bits](problemset/number_of_1_bits/main.go)\n- [Reverse Linked List](problemset/reverse_linked_list/main.go)\n- [Contains Duplicate](problemset/contains_duplicate/main.go)\n- [Contains Duplicate II](problemset/contains_duplicate_ii/main.go)\n- [Implement Stack using Queues](problemset/implement_stack_using_queues/main.go)\n- [Invert Binary Tree](problemset/invert_binary_tree/main.go)\n- [Power of Two](problemset/power_of_two/main.go)\n- [Implement Queue using Stacks](problemset/implement_queue_using_stacks/main.go)\n- [LRU Cache](problemset/lru_cache/main.go)\n- [Delete Node in a Linked List](problemset/lru_cache/main.go)\n- [Valid Anagram](problemset/valid_anagram/main.go)\n- [Binary Tree Paths](problemset/binary_tree_paths/main.go)\n- [Ugly Number](problemset/ugly_number/main.go)\n- [Missing Number](problemset/missing_number/main.go)\n- [First Bad Version](problemset/first_bad_version/main.go)\n- [Move Zeroes](problemset/move_zeroes/main.go)\n- [Word Pattern](problemset/word_pattern/main.go)\n- [Nim Game](problemset/nim_game/main.go)\n- [Power of Three](problemset/power_of_three/main.go)\n- [Power of Four](problemset/power_of_four/main.go)\n- [Reverse String](problemset/reverse_string/main.go)\n- [Reverse Vowels of a String](problemset/reverse_vowels_of_a_string/main.go)\n- [Intersection of Two Arrays](problemset/intersection_of_two_arrays/main.go)\n- [Intersection of Two Arrays II](problemset/intersection_of_two_arrays_ii/main.go)\n- [Valid Perfect Square](problemset/valid_perfect_square/main.go)\n- [Guess Number Higher or Lower](problemset/guess_number_higher_or_lower/main.go)\n- [Ransom Note](problemset/ransom_note/main.go)\n- [First Unique Character in a String](problemset/first_unique_character_in_a_string/main.go)\n- [Find the Difference](problemset/find_the_difference/main.go)\n- [Linked List Cycle II](problemset/linked_list_cycle_ii/main.go)\n- [Remove Duplicates from Sorted List II](problemset/remove_duplicates_from_sorted_list_ii/main.go)\n- [Unique Email Addresses](problemset/unique_email_addresses/main.go)\n- [Is Subsequence](problemset/is_subsequence/main.go)\n- [Sum of Left Leaves](problemset/sum_of_left_leaves/main.go)\n- [Longest Palindrome](problemset/longest_palindrome/main.go)\n- [Convert a Number to Hexadecimal](problemset/convert_a_number_to_hexadecimal/main.go)\n- [Fizz Buzz](problemset/fizz_buzz/main.go)\n- [Third Maximum Number](problemset/third_maximum_number/main.go)\n- [Number of Segments in a String](problemset/number_of_segments_in_a_string/main.go)\n- [Find All Numbers Disappeared in an Array](problemset/find_all_numbers_disappeared_in_an_array/main.go)\n- [Number Complement](problemset/number_complement/main.go)\n- [Island Perimeter](problemset/island_perimeter/main.go)\n- [License Key Formatting](problemset/license_key_formatting/main.go)\n- [Max Consecutive Ones](problemset/max_consecutive_ones/main.go)\n- [Construct the Rectangle](problemset/construct_the_rectangle/main.go)\n- [Next Greater Element I](problemset/next_greater_element_i/main.go)\n- [Keyboard Row](problemset/keyboard_row/main.go)\n- [Base 7](problemset/base_7/main.go)\n- [Relative Ranks](problemset/relative_ranks/main.go)\n- [Fibonacci Number](./problemset/fibonacci_number/main.go)\n- [Perfect Number](./problemset/perfect_number/main.go)\n- [Detect Capital](./problemset/detect_capital/main.go)\n- [Minimum Absolute Difference in BST](./problemset/minimum_absolute_difference_in_bst/main.go)\n- [Reverse String II](./problemset/reverse_string_ii/main.go)\n- [Diameter of Binary Tree](./problemset/diameter_of_binary_tree/main.go)\n- [Student Attendance Record I](./problemset/student_attendance_record_i/main.go)\n- [Reverse Words in a String III](./problemset/reverse_words_in_a_string_iii/main.go)\n- [Maximum Depth of N-ary Tree](./problemset/maximum_depth_of_n_ary_tree/main.go)\n- [N-ary Tree Preorder Traversal](./problemset/n_ary_tree_preorder_traversal/main.go)\n- [N-ary Tree Postorder Traversal](./problemset/n_ary_tree_postorder_traversal/main.go)\n- [Array Partition I](./problemset/array_partition_i/main.go)\n- [Reshape the Matrix](./problemset/reshape_the_matrix/main.go)\n- [Remove Duplicates from Sorted List](./problemset/remove_duplicates_from_sorted_list/main.go)\n- [Add Two Numbers](./problemset/add_two_numbers/main.go)\n- [Longest Substring Without Repeating Characters](./problemset/longest_substring_without_repeating_characters/main.go)\n- [Maximum Product of Three Numbers](./problemset/maximum_product_of_three_numbers/main.go)\n- [Longest Word in Dictionary through Deleting](./problemset/longest_word_in_dictionary_through_deleting/main.go)\n- [Longest Uncommon Subsequence I](./problemset/longest_uncommon_subsequence_i/main.go)\n- [Intersection of Two Linked Lists](./problemset/intersection_of_two_linked_lists/main.go)\n- [Average of Levels in Binary Tree](./problemset/average_of_levels_in_binary_tree/main.go)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvvatanabe%2Fgo-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvvatanabe%2Fgo-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvvatanabe%2Fgo-leetcode/lists"}