algorithms-go

module
v0.0.0-...-72b1152 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Mar 17, 2024 License: None detected not legal advice

Directories

Path Synopsis
03_StacksAndQueues
01_Stack
02_StackArray
04_LinkedList
04_LinkedList/singly
05_LinkedList_with_Sentinel
06_search
04_TreesAndGraphs
adjgraph
adjgraphBFS
old/AdjacencyList
old/AdjacencyListWrong
old/BreadthFirstSearchForGraph
old/DepthFirstSearchForGraph
all_patterns
01_sliding_window/00_introduction
01_sliding_window/01_maximum_sum_subarray_of_size_k
01_sliding_window/02_smallest_subarray_with_a_greater_sum
01_sliding_window/03_longest_substring_with_maximum_k_distinct_characters
01_sliding_window/04_fruits_into_baskets
01_sliding_window/05_longest_substring_with_distinct_characters
01_sliding_window/06_longest_substring_with_same_letters_after_replacement
01_sliding_window/07_longest_subarray_with_ones_after_replacement
01_sliding_window/08_permutation_in_a_string
01_sliding_window/09_string_anagrams
01_sliding_window/10_smallest_window_containing_substring
01_sliding_window/11_words_concatenation
02_Two_Pointers/01_pair_with_target_sum
02_Two_Pointers/02_remove_duplicates
02_Two_Pointers/03_squaring_sorted_array
02_Two_Pointers/04_triplet_sum_to_zero
02_Two_Pointers/05_triplet_sum_close_to_target
02_Two_Pointers/06_triplets_with_smaller_sum
02_Two_Pointers/07_subarrays_with_product_less_than_a_target
02_Two_Pointers/08_dutch_national_flag_problem
02_Two_Pointers/09_quadruple_sum_to_target
02_Two_Pointers/10_comparing_strings_containing_backspaces
03_fast_and_slow_pointers/01_linked_list_cycle
03_fast_and_slow_pointers/02_start_of_linked_list_cycle
03_fast_and_slow_pointers/03_happy_number
03_fast_and_slow_pointers/04_middle_of_the_linked_list
03_fast_and_slow_pointers/05_palindrome_linked_list
03_fast_and_slow_pointers/06_rearrange_a_linked_list
04_merge_intervals/01_merge_intervals
04_merge_intervals/02_insert_interval
04_merge_intervals/03_intervals_intersection
04_merge_intervals/04_conflicting_appointments
04_merge_intervals/05_minimum_meeting_rooms
04_merge_intervals/06_maximum_cpu_load
04_merge_intervals/07_employee_free_time
05_cyclic_sort/1_cyclic_sort
05_cyclic_sort/2_find_the_missing_number
05_cyclic_sort/3_find_all_missing_numbers
05_cyclic_sort/4_find_the_duplicate_number
05_cyclic_sort/5_find_all_duplicate_numbers
05_cyclic_sort/6_find_the_corrupt_pair
05_cyclic_sort/7_first_missing_positive
05_cyclic_sort/8_find_the_first_k_missing_positive_numbers
06_in_place_reversal_linked_list/04_reverse_alternating_k-element_sub-list
06_in_place_reversal_linked_list/1_reverse_linked_list
06_in_place_reversal_linked_list/2_reverse_sub_list
06_in_place_reversal_linked_list/3_reverse_every_k-element_sub-list
06_in_place_reversal_linked_list/5_rotate_a_linked_list
07_tree_breadth_first_search/01_binary_tree_level_order_traversal
07_tree_breadth_first_search/02_reverse_level_order_traversal
07_tree_breadth_first_search/03_zigzag_traversal
07_tree_breadth_first_search/04_level_averages_in_a_binary_tree
07_tree_breadth_first_search/05_minimum_depth_of_a_binary_tree
07_tree_breadth_first_search/6_level_order_successor
08_tree_depth_first_search/1_binary_tree_path_sum
08_tree_depth_first_search/2_all_paths_for_a_sum
08_tree_depth_first_search/3_sum_of_path_numbers
08_tree_depth_first_search/4_path_with_given_sequence
08_tree_depth_first_search/5_count_pahts_for_a_sum
08_tree_depth_first_search/6_tree_diameter
08_tree_depth_first_search/7_path_with_maximum_sum
09_two_heaps/1_find_the_median_of_a_number_stream
09_two_heaps/2_sliding_window_median
09_two_heaps/3_next_interval
09_two_heaps/4_maximaze_capital
10_subsets/1_subsets
10_subsets/2_subsets_with_duplicates
10_subsets/3_permutations
10_subsets/4_string_permutations_by_changing_case
10_subsets/5_balanced_parentheses
10_subsets/6_unique_generalized_abbreviations
10_subsets/7_evaluate_expression
10_subsets/8_structurally_unique_binary_search_trees
11_modified_binary_search/01_order-agnostic_binary_search
11_modified_binary_search/02_ceiling_of_a_number
11_modified_binary_search/03_next_letter
11_modified_binary_search/04_number_range
11_modified_binary_search/05_search_in_a_sorted_infinite_array
11_modified_binary_search/06_minimum_difference_element
11_modified_binary_search/07_bitonic_array_maximum
11_modified_binary_search/08_search_in_bitonic_array
11_modified_binary_search/09_search_in_rotated_array
11_modified_binary_search/10_Rotation_count
12_bitwise_xor/0_Introduction
12_bitwise_xor/1_single_number
12_bitwise_xor/2_two_single_numbers
12_bitwise_xor/3_complement_of_base_10_number
12_bitwise_xor/4_flip_and_inverse_binary_matrix
13_top_k_elements/01_top_k_numbers
13_top_k_elements/02_kth_smallest_number
13_top_k_elements/03_k_closest_points_to_the_origin
13_top_k_elements/04_connect_ropes
13_top_k_elements/05_top_k_frequent_numbers
13_top_k_elements/06_frequency_sort
13_top_k_elements/07_kth_largest_element_in_a_stream
13_top_k_elements/08_find_k_closest_elements
13_top_k_elements/09_maximum_distinct_elements
13_top_k_elements/10_sum_of_elements
13_top_k_elements/11_rearrange_string
13_top_k_elements/12_rearrange_string_k_distance_apart
13_top_k_elements/13_scheduling_task
13_top_k_elements/14_frequency_stack
14_k-way_merge/1_merge_k_sorted_lists
14_k-way_merge/2_kth_smallest_number_in_m_sorted_lists
14_k-way_merge/3_kth_smalles_number_in_a_sorted_matrix
14_k-way_merge/4_smallest_number_range
14_k-way_merge/5_k_pairs_with_largest_sums
16_topological_sort/01_topological_sort
16_topological_sort/02_task_scheduling
16_topological_sort/03_task_scheduling_order
16_topological_sort/04_all_tasks_scheduling_orders
16_topological_sort/05_alien_dictionary
16_topological_sort/06_reconstructing_a_sequence
18_design/01_api_rate_limiter
18_design/02_load_balancer
18_design/03_pubsub/simple
18_design/03_pubsub/with_groups
18_design/04_tiny_url
18_design/05_lru_cache
24_knowing_what_to_track/01_palindrome_permutation
base
array
b_tree
binaryTree
bst
dp/0_fibonacci
dp/1_0-1_knapsack
graph
graph/bigInput
graph/old
heap
kdtree
queue
search
sorting
spanningTree
trie
unionFind
canonical_tasks
graph/03_calculcate_the_number_of_nodes_in_a_given_graph_level
greedy/00_activity_scheduling_problem
greedy/01_counting_money
permutations/lexicographic_rank_of_string
permutations/lexicographic_rank_of_string_with_duplicates
sorting_and_searching/02_connecting_n_pipes_with_minimum_cost
dp_patterns
P1_0-1_Knapsack/0_1_Khapsack
P1_0-1_Knapsack/1_equal_subset_sum_partition
P1_0-1_Knapsack/2_subset_sum
P1_0-1_Knapsack/3_minimum_subset_sum_difference
P1_0-1_Knapsack/4_count_of_subset_sum
P1_0-1_Knapsack/5_Target_Sum
P2_Unbounded_Knapsack/1_Unbounded_Knapsack
P2_Unbounded_Knapsack/2_Rod_Cutting
P2_Unbounded_Knapsack/3_coin_change
P2_Unbounded_Knapsack/4_minimum_coin_change
P2_Unbounded_Knapsack/5_maximum_ribbon_cut
P3_fibonacci_numbers/1_fibonacci_numbers
P3_fibonacci_numbers/2_staircase
P3_fibonacci_numbers/3_number_factors
P3_fibonacci_numbers/4_minimum_jumps_to_reach_the_end
P3_fibonacci_numbers/5_minimum_jumps_with_fee
P3_fibonacci_numbers/6_house_thief
P4_Palindromic_Subsequence/1_longest_palindromic_subsequence
P4_Palindromic_Subsequence/2_longest_palindromic_substring
P4_Palindromic_Subsequence/3_count_of_palindromic_substrings
P4_Palindromic_Subsequence/4_minimum_deletions_in_a_string_to_make_it_palindrome
P4_Palindromic_Subsequence/5_palindromic_partitioning
P5_longest_common_substring/01_longest_common_substring
P5_longest_common_substring/02_longest_common_subsequence
P5_longest_common_substring/03_minimum_deletions_and_insertions_to_transform_string_to_another
P5_longest_common_substring/04_longest_increasing_subsequence
P5_longest_common_substring/05_maximum_sum_increasing_subsequence
P5_longest_common_substring/06_shortest_common_super-sequence
P5_longest_common_substring/07_minimum_deletions_to_make_sequence_sorted
P5_longest_common_substring/08_longest_repeating_subsequence
P5_longest_common_substring/09_subsequent_pattern_matching
P5_longest_common_substring/10_longest_bitonic_subsequence
P5_longest_common_substring/11_longest_alternating_subsequence
P5_longest_common_substring/12_edit_distance
P5_longest_common_substring/13_string_interleaving
dyx
contests/contest_27049_22_may_2021/task_1
contests/contest_27049_22_may_2021/task_2
contests/contest_27049_22_may_2021/task_3
contests/contest_27049_22_may_2021/task_4
contests/contest_27049_22_may_2021/task_5
contests/contest_27049_22_may_2021/task_5/variant_without_channel
inputs_and_outputs/console
inputs_and_outputs/file_2_3
inputs_and_outputs/file_nums_col
inputs_and_outputs/file_two_lines
output
parse
sample/A
hackerrank
algorithms/sorting/insertion_sort_part_1
algorithms/sorting/insertion_sort_part_2
algorithms/sorting/quick_sort_partition_1
algorithms/sorting/running_time_of_algorithm
minimum_distance
repeated_string
test/1
test/2
leet
0-99/0001_two_sum
0-99/0002_add_two_numbers
0-99/0003_lenOfLongestSubStr
0-99/0004_median_of_two_sorted_arrays
0-99/0005_longest_palindromic_substring
0-99/0007_reverse_integer
0-99/0008_string_to_integer
0-99/0011_container_with_most_water
0-99/0013_Roman_to_integer
0-99/0014_Longest_Common_Prefix
0-99/0015_3Sum
0-99/0016_3sum_closest
0-99/0017_letter_combinations
0-99/0018_4sum
0-99/0019_remove_nth_node_from_end_of_list
0-99/0020_valid_parentheses
0-99/0021_merge_two_sorted_lists
0-99/0022_generate_parentheses
0-99/0025_reverse_nodes_in_k-group
0-99/0026_remove_duplicates
0-99/0028_strStr
0-99/0029_divide_two_integers
0-99/0030_substring_with_concatenation_of_all_words
0-99/0031_next_permutation
0-99/0033_search_in_rotated_sorted_array
0-99/0034_find_first_and_last_pos_element_in_sorted_arr
0-99/0036_valid_sudoku
0-99/0038_Count_And_Say
0-99/0039_combinations_sum
0-99/0041_first_missing_positive
0-99/0043_multiply_strings
0-99/0044_wildcard_matching
0-99/0045_jump_game_ii
0-99/0046_permutations
0-99/0048_rotate_image
0-99/0049_group_anagrams
0-99/0050_pow
0-99/0051_n-queens
0-99/0053_Maximum_Subbarray
0-99/0053_maxium_subarray
0-99/0054_spiral_matrix
0-99/0055_jump_game
0-99/0056_merge_intervals
0-99/0057_insert_interval
0-99/0058_length_of_last_word
0-99/0061_rotate_list
0-99/0062_unique_paths
0-99/0066_Plus_One
0-99/0069_Sqrt_x
0-99/0070_climbing_stairs
0-99/0072_edit_distance
0-99/0073_set_matrix_zeroes
0-99/0075_sort_colors
0-99/0076_minimum_window_substring
0-99/0077_combinations
0-99/0078_subsets
0-99/0079_word_search
0-99/0081_search_in_rotated_sorted_array_ii
0-99/0084_largest_rectangle_in_histogram
0-99/0088_merge_sorted_array
0-99/0090_subsets_ii
0-99/0091_decode_ways
0-99/0092_reverse_linked_list_ii
0-99/0094_binary_tree_inorder_traversal
0-99/0095_unique_binary_search_trees_ii
0-99/0096_unique_binary_search_trees
0-99/0097_interleaving_string
0-99/0098_validate_binary_search_tree
0-99/023_merge_k_sorted_lists
0-99/35_search_insert_position
100-499/0101_symmetric_tree
100-499/0102_binary_tree_level_order_traversal
100-499/0103_binary_tree_zigzag_level_order_traversal
100-499/0104_maximum_depth_of_binary_tree
100-499/0105_construct_binary_tree_from_preorder_and_inorder_traversal
100-499/0107_binary_tree_level_rder_traversal_ii
100-499/0108_sorted_array_to_BST
100-499/0110_balanced_binary_tree
100-499/0111_minimum_depth_of_binary_tree
100-499/0112_path_sum
100-499/0113_path_sum_ii
100-499/0116_populating_next_right_pointers_in_each_node
100-499/0118_Pascals_Triangle
100-499/0119_Pascals_Triangle_2
100-499/0121_best_time_to_buy_and_sell_stock
100-499/0122_best_time_to_buy_and_sel_stock_II
100-499/0122_best_time_to_buy_and_sell_stock_2
100-499/0124_binary_tree_maximum_path_sum
100-499/0125_valid_palindrome
100-499/0127_word_ladder
100-499/0128_longest_consecutive_sequence
100-499/0129_sum_root_to_leaf_numbers
100-499/0130_surrounded_regions
100-499/0131_palindrome_partitioning
100-499/0132_palindromic_partitioning_ii
100-499/0134_gas_station
100-499/0136_single_number
100-499/0138_copy_list_with_random_pointer
100-499/0139_word_break
100-499/0141_linked_list_cycle
100-499/0142_start_linked_list_cycle
100-499/0143_reorder_list
100-499/0146_lru_cache
100-499/0148_sort_list
100-499/0150_evaluate_reverse_polish_notation
100-499/0151_reverse_words_in_a_string
100-499/0152_maximum_product_subarray
100-499/0153_find_minimum_in_rotated_sorted_array
100-499/0154_find_minimum_in_rotated_sorted_array_ii
100-499/0155_min_stack
100-499/0160_intersection_of_two_linked_lists
100-499/0162_find_peak_element
100-499/0165_compare_version_numbers
100-499/0166_fraction_to_recurring_decimal
100-499/0167_two_sum_ii_input_array_is_sorted
100-499/0168_excel_sheet_column_title
100-499/0169_majority_element
100-499/0171_excel_sheet_column_number
100-499/0172_factorial_trailing_zeroes
100-499/0179_largest_number
100-499/0189_rotate_array.go
100-499/0190_reverse_bits
100-499/0191_number_of_1_bits
100-499/0198_house_robber
100-499/0200_number_of_islands
100-499/0201_Bitwise_And_of_Numbers_Range
100-499/0202_happy_number
100-499/0203_remove_linked_list_elements
100-499/0204_count_primes
100-499/0206_reverse_linked_list
100-499/0207_course_schedule
100-499/0208_implement_trie_prefix_tree
100-499/0209_minimum_size_subarray_sum
100-499/0210_course_schedule_2
100-499/0215_kth_largest_element_in_array
100-499/0217_contains_duplicate
100-499/0219_contains_duplicate_2
100-499/0220_contains_duplicate_iii
100-499/0224_basic_calculator
100-499/0227_basic_calculator_II
100-499/0228_summary_ranges
100-499/0230_kth_smallest_element_in_bst
100-499/0231_power_of_two
100-499/0232_implement_queue_using_stacks/approach1-two_stacks_ON
100-499/0232_implement_queue_using_stacks/approach2-two_stacks_O1
100-499/0232_implement_queue_using_stacks/memoryLeak
100-499/0234_palindrome_linked_list
100-499/0235_lowest_common_ancestor_bst
100-499/0238_product_of_array_except_self
100-499/0239_sliding_window_maximum
100-499/0240_search_a_2d_matrix_ii
100-499/0241_different_ways_to_add_parentheses
100-499/0242_valid_anagram
100-499/0247_strobogrammatic_number_ii
100-499/0253_meeting_rooms_ii
100-499/0260_single_number_III
100-499/0268_missing_number
100-499/0273_delete_node_in_a_linked_list
100-499/0278_first_bad_version
100-499/0279_perfect_squares
100-499/0283_move_zeroes
100-499/0287_find_the_duplicate_number
100-499/0289_game_of_life
100-499/0290_word_pattern
100-499/0292_nim_game
100-499/0295_find_median_from_data_stream
100-499/0299_bulls_and_cows
100-499/0300_longest_increasing_subsequence
100-499/0322_coin_change
100-499/0324_wiggle_sort_2
100-499/0326_power_of_three
100-499/0328_odd_even_linked_list
100-499/0334_increasing_triplet_subsequence
100-499/0341_flatten_nested_list_iterator
100-499/0342_power_of_four
100-499/0343_integer_break
100-499/0344_reverse_string
100-499/0347_top_k_frequent_elements
100-499/0350_intersection_of_two_arrays_2
100-499/0362_design_hit_counter
100-499/0365_water_and_jug_problem
100-499/0366_find_leaves_of_binary_tree
100-499/0367_valid_perfect_square
100-499/0371_sum_of_two_integers
100-499/0373_find_k_pairs_with_smalles_sums
100-499/0376_wiggle_subsequence
100-499/0378_kth_smallest_element_in_sorted_matrix
100-499/0380_insert_delete_getrandom_o1
100-499/0383_ransom_note
100-499/0384_shuffle_an_array
100-499/0387_first_unique_character_in_string
100-499/0392_is_subsequence
100-499/0401_binary_watch
100-499/0401_binary_watch/helper
100-499/0406_queue_reconstruction_by_height
100-499/0412_fizz_buzz
100-499/0414_third_maximum_number
100-499/0416_partition_equal_subset_sum
100-499/0418_sentence_screen_fitting
100-499/0429_n-ary-tree-level-order-traversal
100-499/0434_number_of_segments_in_a_string
100-499/0435_non-overlapping_intervals
100-499/0436_find_right_interval
100-499/0437_path_sum_iii
100-499/0438_find_all_anagrams_in_a_string
100-499/0441_arranging_coins
100-499/0442_find_all_duplicates_in_an_array
100-499/0444_sequence_reconstruction
100-499/0448_find_all_numbers_disappeared_In_an_array
100-499/0450_delete_node_in_a_bst
100-499/0451_sort_characters_by_frequency
100-499/0454_4sum_ii
100-499/0459_repeated_substring_pattern
100-499/0461_hamming_distance
100-499/0470_implemend_rand10_using_rand7
100-499/0475_heaters
100-499/0480_sliding_window_median
100-499/0482_license_key_formatting
100-499/0489_robot_cleaner
100-499/0490_the_mase
100-499/0496_next_greater_element_i
100-499/424_longest_repeating_character_replacement
100-499/494_target_sum
1000-1499/1004_max_consecutive_ones_iii
1000-1499/1009_complement_of_base_10_integer
1000-1499/1013_partition_array_into_three_parts_with_equal_sum
1000-1499/1018_binary_prefix_divisible_by_5
1000-1499/1021_remove_outermost_parentheses
1000-1499/1025_divisor_game
1000-1499/1046_last_stone_weight
1000-1499/1047_remove_all_adjacent_duplicates_in_string
1000-1499/1049_last_stone_weight_ii
1000-1499/1062_longest_repeating_substring
1000-1499/1071_greatest_common_divisor_of_strings
1000-1499/1089_duplicate_zeroes
1000-1499/1095_find_in_mountain_array
1000-1499/1101_the_earliest_moment_when_everyone_become_friends
1000-1499/1108_defanging_IP_address
1000-1499/1110_delete_nodes_and_return_forest
1000-1499/1125_smallest_sufficient_team
1000-1499/1136_parallel_courses
1000-1499/1146_snapshot_array
1000-1499/1154_day_of_the_year
1000-1499/1161_maximum_level_sum_of_a_binary_tree
1000-1499/1175_prime_arrangements
1000-1499/1200_minimum_absolute_difference
1000-1499/1221_split_string_in_balanced_strings
1000-1499/1249_minimum_remove_to_make_valid_parentheses
1000-1499/1254_number_of_closed_islands
1000-1499/1275_find_winner_on_a_tic_tac_toe_game
1000-1499/1277_count_square_submatrices_with_all_ones
1000-1499/1281_substract_the_product_and_sum_digits_integer
1000-1499/1314_matrix_block_sum
1000-1499/1323_Maximum_69_Number
1000-1499/1324_Print_words_vertically
1000-1499/1325_delete_leaves_with_a_given_value
1000-1499/1332_remove_palindromic_subsequences
1000-1499/1333_filter_restaurants_by_vegan_price_and_distance
1000-1499/1334_find_city_with_smallest_number_neighbors_and_distance
1000-1499/1339_maximum_product_of_splitted_binary_tree
1000-1499/1342_number_of_steps_to_reduce_number_to_zero
1000-1499/1346_check_if_n_and_its_double_exist
1000-1499/1348_Tweet_Counts_Per_Frequency
1000-1499/1351_count_negative_numbers_in_sorted_matrix
1000-1499/1360_numbers_of_days_between_two_dates
1000-1499/1361_validate_btree_nodes
1000-1499/1362_closest_divisors
1000-1499/1365_how_many_numbers_are_smaller_than_the_curr_num
1000-1499/1366_rank_teams_by_votes
1000-1499/1375_Bulb_switcher_3
1000-1499/1376_time_needed_to_inform_all_employers
1000-1499/1381_design_a_stack_with_increment_operation
1000-1499/1386_cinema_seat_allocation
1000-1499/1391_check-if-there-is-a-valid-path-in-a-grid
1000-1499/1395_count_number_of_teams
1000-1499/1409_queries-on-a-permutation-with-key
1000-1499/1417_reformat_the_string
1000-1499/1422_maximum_score_after_splitting_a_string
1000-1499/1480_running_sum_of_1d_array
1000-1499/1496_path_crossing
1000-1499/1497_check_if_array_pairs_are_divisible_by_k
1500-1799/1509_min_diff_between_largest_and_smallest
1500-1799/1512_number_of_good_pairs
1500-1799/1523_count-odd-numbers-in-an-interval-range
1500-1799/1528_shuffle_string
1500-1799/1539_kth_missing_positive_number
1500-1799/1544_make-the-string-great
1500-1799/1556_thousand_separator
1500-1799/1560_most_visited_sector_in_a_circular_track
1500-1799/1601_maximum_number_of_achievable_transfer_requests
1500-1799/1603_design_parking_system
1500-1799/1619_mean_of_array_after_removing_some_elements
1500-1799/1624_largest_substring_between_two_equal_characters
1500-1799/1624_largest_substring_between_two_equal_chars
1500-1799/1626_best_team_with_no_conflicts
1500-1799/1629_slowest_key
1500-1799/1637_widest_vertical_area_between_two_points_containing_no_points
1500-1799/1641_count_sorted_vowel_strings
1500-1799/1668_maximum_repeatin_substring
1500-1799/1712_ways-to-split-array-into-three-subarrays
1500-1799/1722_minimize-hamming-distance-after-swap-operations
1500-1799/1727-largest-submatrix-with-rearrangements
1500-1799/1730_shortest_path_to_get_food
1500-1799/1736_latest_time_by_replacing_hidden_digits
1500-1799/1737_change_minimum_characters_to_satisfy_one_of_three_conditions
1500-1799/1738_find_kth_largest_xor_coordinate_value
1500-1799/1740_find_distance_in_binary_tree
1500-1799/1742_maximum_number_of_bals_in_a_box
1500-1799/1743_restore_the_array_from_adjacent_pairs
1500-1799/1744_can_you_eat_your_favorite_candy_on_your_favorite_day
1500-1799/1752_check_if_array_is_sorted_and_rotated
1500-1799/1753_maximum_score_from_removing_stones
1500-1799/1754_largest_merge_of_two_strings
1500-1799/1758_minimum_changes_to_make_alternating_binary_string
1500-1799/1759_count_number_of_homogenous_substrings
1500-1799/1760_minimum_limit_of_balls_in_a_bag
1500-1799/1768_merge_strings_alternately
1500-1799/1769_minimum-number-of-operations-to-move-all-balls-to-each-box
1500-1799/1770_maximum-score-from-performing-multiplication-operations
1500-1799/1773_count_items_matching_a_rule
1500-1799/1774_closest_dessert_cost
1500-1799/1775_equal-sum-arrays-with-minimum-number-of-operations
1500-1799/1784_check_if_binary_string_has_at_most_one_segment_of_ones
1500-1799/1785_minimum-elements-to-add-to-form-a-given-sum
1500-1799/1786_number-of-restricted-paths-from-first-to-last-node
1500-1799/1790_check-if-one-string-swap-can-make-strings-equal
1500-1799/1791_find_center_of_star_graph
1500-1799/1792_maximum-average-pass-ratio
1500-1799/1794_maximum_score_of_a_good_subarray
1800-1899/1801_number_of_orders_in_the_backlog
1800-1899/1802_maximum-value-at-a-given-index-in-a-bounded-array
1800-1899/1803_count_pairs_with_xor_in_a_range
1800-1899/1805_number-of-different-integers-in-a-string
1800-1899/1806_minimum-number-of-operations-to-reinitialize-a-permutation
1800-1899/1807_evaluate-the-bracket-pairs-of-a-string
1800-1899/1808_maximize-number-of-nice-divisors
1800-1899/1816_truncate-sentence
1800-1899/1817_finding_the_users_active_minutes
1800-1899/1818_min_absolute_sum_difference
1800-1899/1819_number-of-different-subsequences-gcds
1800-1899/1823_find_the_winner_of_the_circular_game
1800-1899/1824_minimum_sideway_jumps
1800-1899/1825_finding-mk-average
1800-1899/1825_finding-mk-average/tleInput
1800-1899/1825_finding-mk-average/tle_and_not_success_solutions
1800-1899/1830_minimum_number_of_operations_to_make_string_sorted
1800-1899/1832_check-if-the-sentence-is-pangram
1800-1899/1833_maximum_ice_cream_bars
1800-1899/1834_single-threaded-cpu
1800-1899/1835_find-xor-sum-of-all-pairs-bitwise-and
1800-1899/1837_sum_of_digits_in_base_k
1800-1899/1838_frequency_of_the_most_frequent_element
1800-1899/1839_longest_substring_of_al_vowels_in_order
1800-1899/1840_maximum_builing_height
1800-1899/1848_minimum_distance_to_the_target_element
1800-1899/1849_splitting-a-string-into-descending-consecutive-values
1800-1899/1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number
1800-1899/1851_minimum_interval_to_include_each_query
1800-1899/1854_maximum_population_year
1800-1899/1855_maximum_distance_between_a_pair_of_values
1800-1899/1856_maximum_subarray_min-product
1800-1899/1857_largest_color_value_in_a_directed_graph
1800-1899/1863_sum_of_all_subset_xor_totals
1800-1899/1864_minimum_number_of_swaps_to_make_the_binary_string_alternating
1800-1899/1865_finding_pairs_with_a_certain_sum
1800-1899/1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible
1800-1899/1869_longer_contiguous_segments_of_ones_than_zeroes
1800-1899/1870_minimum_speed_to_arrive_on_time
1800-1899/1871_jump_game_vii
1800-1899/1872_stone_game_viii
1800-1899/1880_check_if_word_equals_summation_of_two_words
1800-1899/1881_maximum_value_after_insertion
1800-1899/1882_process_tasks_using_servers
1800-1899/1883_minimum_skips_to_arrive_at_meeting_on_time
1800-1899/1886_determine_whether_matrix_can_be_obtained_by_rotation
1800-1899/1887_reduction_operations_to_make_the_array_elements_equal
1800-1899/1888_miminum_number_of_flips_to_make_the_binary_string_alternating
1800-1899/1889_minimum_space_wasted_from_packaging
1800-1899/1898_maximum_number_of_removable_characters
1800-1899/1899_merge_triplets_to_form_target_triplet
1900-1999/1900_the_earliest_and_latest_rounds_where_players_compete
1900-1999/1901_find_a_peak_element_ii
1900-1999/1903_largest_odd_number_in_string
1900-1999/1904_the_number_of_full_rounds_you_have_played
1900-1999/1905_count_sub_islands
1900-1999/1906_minimum_absolute_difference_queries
1900-1999/1930_unique_length-3_palindromic_subsequences
1900-1999/1932_merge_bsts_to_create_single_bst
1900-1999/1954_minimum_garden_perimeter_to_collect_enough_apples
1900-1999/1955_count_number_of_special_subsequences
1900-1999/1962_remove_stones_to_minimize_the_total
1900-1999/1963_minimum_number_of_swaps_to_make_the_string_balanced
1900-1999/1964_find_the_longest_valid_obstacle_course_at_each_position
1900-1999/1967_number_of_strings_that_appear_as_substring
1900-1999/1970_last_day_where_you_can_still_cross
1900-1999/1982_find_array_given_subset_sums
2000-2499/2007_Find_Original_Array_From_Doubled_Array
2000-2499/2013_detect_squares
2000-2499/2018_check_if_word_can_be_placed_in_crossword
2000-2499/2029_stone_game_ix
2000-2499/2030_smallest-k-length-subsequence-with-occurrences-of-a-letter
2000-2499/2069_walking_robot_simulation_ii
2000-2499/2074_reverse_nodes_in_even_length_groups
2000-2499/2080_range_frequency_queries
2000-2499/2087_minimum_cost_homecoming_of_a_robot_in_a_grid
2000-2499/2088_count_fertile_pyramids_in_a_land
2000-2499/2091_Removing_Minimum_and_Maximum_From_Array
2000-2499/2092_find_all_people_with_secret
2000-2499/2097_valid_arrangement_of_pairs
2000-2499/2101_detonate_the_maximum_bombs
2000-2499/2115_find_all_possible_recipes_from_given_suppliers
2000-2499/2116_check_if_a_parentheses_string_can_be_valid
2000-2499/2117_abbreviating_the_product_of_a_range
2000-2499/2122_recover_the_original_array
2000-2499/2127
2000-2499/2131_longest_palindrome_by_concatenating_two_letter_words
2000-2499/2132_stamping_the_grid
2000-2499/2136_earliest_possible_day_full_bloom
2000-2499/2141_maximum_running_time_of_N_computers
2000-2499/2147_numbers_of_ways_to_divide_long_corridor
2000-2499/2151_max_good_people_based_on_statements
2000-2499/2156_find_substring_with_given_hash_value
2000-2499/2157_groups_of_strings
2000-2499/2163_minimum_difference_in_sums_after_removal_of_elements
2000-2499/2166_design_bitset
2000-2499/2167_minimum_time_to_remove_all_cars_containing_illegal_goods
2000-2499/2172_maximum_and_sum_of_array
2000-2499/2176_count_equal_and_divisible_pairs_in_an_array
2000-2499/2179_count_good_triplets_in_array
2000-2499/2183_count_array_pairs_divisible_by_k
2000-2499/2188_minimum_time_to_finish_the_race
2000-2499/2193_minimum_number_moves_to_make_palindrome
2000-2499/2197_replace_non_coprime_numbers_in_array
2000-2499/2203_minimum_weighted_subgraph_with_the_required_paths
2000-2499/2209_minimum_white_tiles_after_covering_with_carpets
2000-2499/2213_longest_subsring_of_one_repeating_character
2000-2499/2265_count_nodes_equal_to_average_of_subtree
2000-2499/2316_count_Unreachable_pairs_of_node_in_undirected_graph
2000-2499/2332_the_latest_time_tim_catch_a_bus
2000-2499/2366_minimum_replacements_to_sort_the_array
2000-2499/2369_check_if_there_is_a_valid_partition_for_the_array
2000-2499/2402_meeting_rooms_iii
2000-2499/2437_number_of_valid_clock_times
2000-2499/2458_height_of_binary_tree_after_subtree_removal_queries
2000-2499/2713_maximum-strictly-increasing-cells-in-a-matrix
2500-2999/2842_count-k-subsequences-of-a-string-with-maximum-beauty
2500-2999/2863_maximum_lengh_of_semi_decreasing_subarrays
500-999/0502_ipo
500-999/0503_next_greater_element_ii
500-999/0507_perfect_number
500-999/0518_coin_change_2
500-999/0521_longest_uncommon_subsequence_I
500-999/0528_random_pick_with_weight
500-999/0535_encode_and_decode_tinyURL
500-999/0537_complex-number-multiplication
500-999/0543_tree_diameter
500-999/0560_subarray_sum_equals_k
500-999/0563_binary_tree_tilt
500-999/0564_find-the-closest-palindrome
500-999/0567_permutation_in_string
500-999/0581_shortest_unsorted_continuous_subarray
500-999/0632_smallest_range_covering_elements_from_k_lists
500-999/0637_average_of_levels_in_binary_tree
500-999/0643_maximum-average-subarray-i
500-999/0645_set_mismatch
500-999/0658_find_k_closest_elements
500-999/0671_second_minimum_node_in_a_binary_tree
500-999/0674_longest_continuous_increasing_subsequence
500-999/0681_next_cosest_time
500-999/0703_kth_largest_element_in_a_stream
500-999/0706_design_hashmap
500-999/0713_subarray_product_less_than_k
500-999/0715_range_module
500-999/0718_maximum_length_of_repeated_subarray
500-999/0720_longest_word_in_dictionary
500-999/0724_find_pivot_index
500-999/0728_self_dividing_numbers
500-999/0739_daily_temperatures
500-999/0744_find_smallest_letter_greater_than_target
500-999/0746_min_cost_climbing_stairs
500-999/0759_employee_free_time
500-999/0767_reorganize_string
500-999/0771_jewels_and_stones
500-999/0784_letter_case_permutation
500-999/0792_number_of_matching_subsequences
500-999/0796_rotate_string
500-999/0797_all_paths_from_source_to_target
500-999/0818_race_car
500-999/0819_most_common_word
500-999/0832_flipping_an_image
500-999/0833_find_and_replace_in_string
500-999/0834_sum_of_distances_in_tree
500-999/0836_rectangle_overlap
500-999/0843_guess_the_word
500-999/0844_backspace_string_compare
500-999/0859_byddy_strings
500-999/0860_lemonade_change
500-999/0862_shortest_subbarray_with_sum_at_least_k
500-999/0874_walking_robot_simulation
500-999/0876_middle_of_the_linked_list
500-999/0888_fair_candy_swap
500-999/0890_find-and-replace-pattern
500-999/0895_maximum_frequency_stack
500-999/0897_increasing_order_search_tree
500-999/0900_RLE_Iterator
500-999/0911_online_election
500-999/0912_sort_an_array
500-999/0914_x_of_a_kind_in_a_deck_of_cards
500-999/0921_minimum-add-to-make-parentheses-valid
500-999/0925_long_pressed_name
500-999/0931_minimum_failing_path_sum
500-999/0934_shortest_bridge
500-999/0939_miminum_area_rectangle
500-999/0941_valid_mountain_array
500-999/0950_reveal_cards_in_increasing_order
500-999/0975_odd_even_jump
500-999/0976_largest_perimeter_triangel
500-999/0977_squares_of_a_sorted_array
500-999/0986_interval_list_intersection
500-999/0993_cousins_in_binary_tree
500-999/0997_find_the_town_judge
500-999/621_task_scheduler
500-999/665_non_decreasing_array
500-999/679_24_game
500-999/747_largest-number-at-least-twice-of-others
500-999/814_binary-tree-pruning
500-999/861_score-after-flipping-matrix
500-999/904_fruit_into_baskets
500-999/973_k_closest_points_to_origin
other
001_minimum_operations_to_sort_array
parallel_algorithms
educative/02_prefix_sum

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.