go-leetcode

Golang 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.

Name		Name	Last commit message	Last commit date
Latest commit History 210 Commits
add_and_search_word		add_and_search_word
add_binary		add_binary
add_digits		add_digits
add_two_numbers		add_two_numbers
balanced_bianry_tree		balanced_bianry_tree
basic_calculator		basic_calculator
basic_calculator_II		basic_calculator_II
binary_search_tree_iterator		binary_search_tree_iterator
binary_tree_inorder_traversal		binary_tree_inorder_traversal
binary_tree_level_order_traversal		binary_tree_level_order_traversal
binary_tree_level_order_traversal_II		binary_tree_level_order_traversal_II
binary_tree_maximum_path_sum		binary_tree_maximum_path_sum
binary_tree_paths		binary_tree_paths
binary_tree_postorder_traversal		binary_tree_postorder_traversal
binary_tree_preorder_traversal		binary_tree_preorder_traversal
binary_tree_right_side_view		binary_tree_right_side_view
binary_tree_zigzag_level_order_traversal		binary_tree_zigzag_level_order_traversal
bitwise_AND_of_numbers_range		bitwise_AND_of_numbers_range
candy		candy
climbing_stairs		climbing_stairs
clone_graph		clone_graph
combination_sum		combination_sum
combination_sum_II		combination_sum_II
combinations< F438 /div>		combinations
combinations_sum_III		combinations_sum_III
compare_version_numbers		compare_version_numbers
construct_binary_tree_from_inorder_and_postorder_traversal		construct_binary_tree_from_inorder_and_postorder_traversal
construct_binary_tree_from_preorder_and_inorder_traversal		construct_binary_tree_from_preorder_and_inorder_traversal
container_with_most_water		container_with_most_water
contains_duplicate		contains_duplicate
contains_duplicate_II		contains_duplicate_II
contains_duplicate_III		contains_duplicate_III
convert_sorted_array_to_binary_search_tree		convert_sorted_array_to_binary_search_tree
convert_sorted_list_to_binary_search_tree		convert_sorted_list_to_binary_search_tree
copy_list_with_random_pointer		copy_list_with_random_pointer
count_and_say		count_and_say
count_complete_tree_nodes		count_complete_tree_nodes
count_primes		count_primes
course_schedule		course_schedule
course_schedule_II		course_schedule_II
decode_ways		decode_ways
delete_node_in_a_linked_list		delete_node_in_a_linked_list
different_ways_to_add_parentheses		different_ways_to_add_parentheses
distinct_subsequences		distinct_subsequences
dungeon_game		dungeon_game
edit_distance		edit_distance
evaluate_reverse_polish_notation		evaluate_reverse_polish_notation
excel_sheet_column_number		excel_sheet_column_number
excel_sheet_column_title		excel_sheet_column_title
factorial_trailing_zeroes		factorial_trailing_zeroes
find_minimum_in_rotated_sorted_array		find_minimum_in_rotated_sorted_array
find_minimum_in_rotated_sorted_array_II		find_minimum_in_rotated_sorted_array_II
find_peak_element		find_peak_element
first_bad_version		first_bad_version
first_missing_positive		first_missing_positive
flatten_binary_tree_to_linked_list		flatten_binary_tree_to_linked_list
four_sum		four_sum
fraction_to_recurring_decimal		fraction_to_recurring_decimal
gas_station		gas_station
generate_parentheses		generate_parentheses
gray_code		gray_code
group_anagrams		group_anagrams
happy_number		happy_number
house_robber		house_robber
house_robber_II		house_robber_II
implement_queue_using_stacks		implement_queue_using_stacks
implement_stack_using_queues		implement_stack_using_queues
implement_trie		implement_trie
insertion_sort_list		insertion_sort_list
integer_to_roman		integer_to_roman
intersection_of_two_linked_lists		intersection_of_two_linked_lists
invert_binary_tree		invert_binary_tree
isomorphic_strings		isomorphic_strings
jump_game		jump_game
kth_largest_element_in_an_array		kth_largest_element_in_an_array
kth_smallest_element_in_a_BST		kth_smallest_element_in_a_BST
largest_number		largest_number
largest_rectangle_in_histogram		largest_rectangle_in_histogram
length_of_last_word		length_of_last_word
letter_combinations_of_a_phone_number		letter_combinations_of_a_phone_number
linked_list_cycle		linked_list_cycle
linked_list_cycle_II		linked_list_cycle_II
longest_common_prefix		longest_common_prefix
longest_consecutive_sequence		longest_consecutive_sequence
longest_palindromic_substring		longest_palindromic_substring
longest_substring_without_repeating_characters		longest_substring_without_repeating_characters
longest_valid_parentheses		longest_valid_parentheses
lowest_common_ancestor_of_a_binary_search_tree		lowest_common_ancestor_of_a_binary_search_tree
lowest_common_ancestor_of_a_binary_tree		lowest_common_ancestor_of_a_binary_tree
lru_cache		lru_cache
majority_element		majority_element
majority_element_II		majority_element_II
max_points_on_a_line		max_points_on_a_line
maximal_rectangle		maximal_rectangle
maximal_square		maximal_square
maximum_depth_of_binary_tree		maximum_depth_of_binary_tree
maximum_gap		maximum_gap
maximum_product_subarray		maximum_product_subarray
maximum_subarray		maximum_subarray
median_of_two_sorted_arrays		median_of_two_sorted_arrays

hitzzc/go-leetcode

Folders and files

Latest commit

History

Repository files navigation

go-leetcode