leetcode

module

v0.0.0-...-185123c Latest Latest Go to latest Published: Jan 14, 2023 License: MIT

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/holyshared/leetcode

Links

Open Source Insights

README ¶

leetcode

Directories ¶

Path	Synopsis
104_maximum_depth_of_binary_tree
107_binary_tree_level_order_traversal_2
108_convert_sorted_array_to_binary_search_tree
154_find_minimum_in_rotated_sorted_array_2
3sum_with_multiplicity
add_one_row_to_tree
add_two_numbers
advantage_shuffle
average_of_levels_in_binary_tree
balanced_binary_tree
beautiful_arrangement_2
best_time_to_buy_and_sell_stock_with_transaction_fee
binary_search
binary_tree_inorder_traversal
binary_tree_level_order_traversal
binary_tree_longest_consecutive_sequence
binary_tree_longest_consecutive_sequence_2
binary_tree_postorder_traversal
binary_tree_preorder_traversal
binary_tree_right_side_view
binary_tree_vertical_order_traversal
binary_trees_with_factors
bitweekly
q1
q2
q3
brick_wall
check_if_a_string_contains_all_binary_codes_of_size_k
check_if_n_and_its_double_exist
climbing_stairs
closest_binary_search_tree_value
coin_change
combination_sum_3
combination_sum_4
concatenation_of_consecutive_binary_numbers
construct_binary_tree_from_inorder_and_postorder_traversal
construct_binary_tree_from_preorder_and_inorder_traversal
construct_binary_tree_from_string
construct_string_from_binary_tree
copy_list_with_random_pointer
count_binary_substrings
count_good_nodes_in_binary_tree
count_of_smaller_numbers_after_self
count_univalue_subtrees
course_schedule_3
deepest_leaves_sum
delete_the_middle_node_of_a_linked_list
design_circular_queue
design_hash_map
design_linked_list
design_underground_system
determine_if_string_halves_are_alike
distribute_candies
encode_and_decode_tiny_url
evaluate_reverse_polish_notation
fibonacci_number
find_all_numbers_disappeared_in_an_array
find_and_replace_pattern
find_closest_node_to_given_two_nodes
find_duplicate_file_in_system
find_first_and_last_position_of_element_in_sorted_array
find_k-th_smallest_pair_distance
find_leaves_of_binary_tree
find_minimum_in_rotated_sorted_array
find_peak_element
find_permutation
find_smallest_common_element_in_all_rows
find_the_duplicate_number
flatten_2d_vector
flatten_a_multilevel_doubly_linked_list
flatten_binary_tree_to_linked_list
flatten_nested_list_iterator
flip_binary_tree_to_match_preorder_traversal
furthest_building_you_can_reach
generate_random_point_in_a_circle
global_and_local_inversions
graph
alien_dictionary
all_paths_from_source_lead_to_destination
all_paths_from_source_to_target
cheapest_flights_within_k_stops
clone_graph
course_schedule_2
evaluate_division
find_if_path_exists_in_graph
min_cost_to_connect_all_points
min_cost_to_connect_all_points_prims_algorithm
minimum_height_trees
n-ary_tree_level_order_traversal
network_delay_time
number_of_connected_components_in_an_undirected_graph
number_of_provinces
optimize_water_distribution_in_a_village
path_with_minimum_effort
populating_next_right_pointers_in_each_node
reconstruct_itinerary
rotting_oranges
shortest_path_in_binary_matrix
smallest_string_with_swaps
the_earliest_moment_when_everyone_become_friends
valid_tree
guess_number_higher_or_lower
height_checker
inorder_successor_in_bst
insert_into_a_cyclic_sorted_list
integer_to_roman
interleaving_string
intersection_of_two_arrays
intersection_of_two_arrays_2
intersection_of_two_linked_lists
k_inverse_pairs_array
keys_and_rooms
kill_process
kth_smallest_element_in_a_sorted_matrix
kth_symbol_in_grammar
largest_unique_number
letter_combinations_of_a_phone_number
lexicographically_smallest_equivalent_string
linked_list_cycle1
linked_list_cycle2
longest_increasing_path_in_a_matrix
longest_increasing_subsequence
longest_palindromic_substring
longest_valid_parentheses
lowest_common_ancestor_of_a_binary_tree
matchsticks_to_square
max_consecutive_ones2
maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts
maximum_length_of_repeated_subarray
maximum_performance_of_a_team
maximum_points_you_can_obtain_from_cards
maximum_units_on_a_truck
median_of_two_sorted_arrays
meeting_scheduler
merge_sorted_array_solution
merge_two_sorted_lists
min_cost_climbing_stairs
min_max_heap
find_median_from_data_stream
furthest_building_you_can_reach
k_closest_points_to_origin
k_weakest_rows
kth_largest_element_in_a_stream
kth_largest_element_in_an_array
kth_smallest_element_in_a_sorted_matrix
last_stone_weight
meeting_rooms_2
minimum_cost_to_connect_sticks
top_k_frequent_elements
minimum_deletions_to_make_character_frequencies_unique
minimum_depth_of_binary_tree
minimum_knight_moves
minimum_moves_to_equal_array_elements_2
minimum_number_of_refueling_stops
minimum_operations_to_make_array_equal
minimum_swaps_to_group_all_1_together
missing_number
missing_number_in_arithmetic_progression
missing_ranges
move_zeroes
my_calendar_i
nary_tree_preorder_traversal
non-decreasing-array
number_of_connected_components_in_an_undirected_graph
number_of_matching_subsequences
number_of_submatrices_that_sum_to_target
numbers_with_same_consecutive_differences
odd_even_linked_list
ones_and_zeroes
out_of_boundary_paths
pacific_atlantic_water_flow
paint_house
palindrome_linked_list
palindrome_pairs
palindromic_substrings
parallel_courses
partition_list
pascals_triangle2
path_sum
path_sum_2
populating_next_right_pointers_in_each_node
pow_x_n
power_of_three
powerful_integers
prefix_and_suffix_search
push_dominoes
put_boxes_into_the_warehouse_1
queue_reconstruction_by_height
range_sum_query
reconstruct_original_digits_from_english
reduce_array_size_to_the_half
remove-duplicates
remove-element
remove_interval
remove_linked_list_elements
remove_nth_node_from_end_of_list
remove_palindromic_subsequences
reordered_power_of_2
replace_elements_with_greatest_element_on_right_side
reverse_linked_list
reverse_linked_list_2
reverse_string
reverse_words_in_a_string_3
rotate_list
running_sum_of_1d_array
russian_doll_envelopes
satisfiability_of_equality_equations
search_a_2d_matrix_2
search_in_a_binary_search_tree
search_in_a_sorted_array_of_unknown_size
search_in_rotated_sorted_array
serialize_and_deserialize_binary_tree
set_mismatch
short_encoding_of_words
shortest_distance_to_target_color
single-row-keyboard
sort_array_by_parity
sort_the_matrix_diagonally
split_array_into_consecutive_subsequences
split_array_largest_sum
sqrt_x
squirrel_simulation
stamping_the_sequence
strobogrammatic_number
swap_nodes_in_pairs
swapping_nodes_in_a_linked_list
symmetric_tree
the_maze_2
third_maximum_number
triangle
two_sum_2_input_array_is_sorted
unique_binary_search_trees_2
unique_morse_code_words
unique_paths
unique_paths_2
valid_anagram
valid_mountain_array
valid_palindrome
validate_binary_search_tree
verifying_an_alien_dictionary
vowel_spellchecker
weekly_contest
318/q1
320/q2
weekly_contest_305/check_if_there_is_a_valid_partition_for_the_array
weekly_contest_305/longest_ideal_subsequence
weekly_contest_305/number_of_arithmetic_triplets
weekly_contest_305/reachable_nodes_with_restrictions
weekly_contest_306/largest_local_values_in_a_matrix
weekly_contest_306/node_with_highest_edge_score
weekly_contest_307/largest_palindromic_number
weekly_contest_307/minimum_hours_of_training_to_win_a_competition
weekly_contest_308/q1
weekly_contest_308/q2
weekly_contest_308/q3
weekly_contest_312/q1
weekly_contest_312/q2
weekly_contest_312/q3
weekly_contest_314/q1
weekly_contest_314/q2
weekly_contest_314/q3
wiggle_subsequence
word_subsets

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL