Download leetcode-in-java JAR 1.38 with all dependencies
Java-based LeetCode algorithm problem solutions, regularly updated
Files of the artifact leetcode-in-java version 1.38 from the group com.github.javadev.
Test
Artifact leetcode-in-java
Group com.github.javadev
Version 1.38
Last update 01. December 2024
Tags: based regularly java problem solutions leetcode updated algorithm
Organization not specified
URL https://github.com/javadev/LeetCode-in-Java
License The MIT License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.javadev
Version 1.38
Last update 01. December 2024
Tags: based regularly java problem solutions leetcode updated algorithm
Organization not specified
URL https://github.com/javadev/LeetCode-in-Java
License The MIT License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
The newest version!
Show all versions of leetcode-in-java Show documentation
Please rate this JAR file. Is it a good library?
0 downloads
Source code of leetcode-in-java version 1.38
META-INF
META-INF.maven.com.github.javadev.leetcode-in-java
com_github_leetcode
com_github_leetcode.left_right
com_github_leetcode.random
g0001_0100.s0001_two_sum
g0001_0100.s0002_add_two_numbers
g0001_0100.s0003_longest_substring_without_repeating_characters
g0001_0100.s0004_median_of_two_sorted_arrays
g0001_0100.s0005_longest_palindromic_substring
g0001_0100.s0006_zigzag_conversion
g0001_0100.s0007_reverse_integer
g0001_0100.s0008_string_to_integer_atoi
g0001_0100.s0009_palindrome_number
g0001_0100.s0010_regular_expression_matching
g0001_0100.s0011_container_with_most_water
g0001_0100.s0012_integer_to_roman
g0001_0100.s0013_roman_to_integer
g0001_0100.s0014_longest_common_prefix
g0001_0100.s0015_3sum
g0001_0100.s0016_3sum_closest
g0001_0100.s0017_letter_combinations_of_a_phone_number
g0001_0100.s0018_4sum
g0001_0100.s0019_remove_nth_node_from_end_of_list
g0001_0100.s0020_valid_parentheses
g0001_0100.s0021_merge_two_sorted_lists
g0001_0100.s0022_generate_parentheses
g0001_0100.s0023_merge_k_sorted_lists
g0001_0100.s0024_swap_nodes_in_pairs
g0001_0100.s0025_reverse_nodes_in_k_group
g0001_0100.s0026_remove_duplicates_from_sorted_array
g0001_0100.s0027_remove_element
g0001_0100.s0028_find_the_index_of_the_first_occurrence_in_a_string
g0001_0100.s0029_divide_two_integers
g0001_0100.s0030_substring_with_concatenation_of_all_words
g0001_0100.s0031_next_permutation
g0001_0100.s0032_longest_valid_parentheses
g0001_0100.s0033_search_in_rotated_sorted_array
g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array
g0001_0100.s0035_search_insert_position
g0001_0100.s0036_valid_sudoku
g0001_0100.s0037_sudoku_solver
g0001_0100.s0038_count_and_say
g0001_0100.s0039_combination_sum
g0001_0100.s0040_combination_sum_ii
g0001_0100.s0041_first_missing_positive
g0001_0100.s0042_trapping_rain_water
g0001_0100.s0043_multiply_strings
g0001_0100.s0044_wildcard_matching
g0001_0100.s0045_jump_game_ii
g0001_0100.s0046_permutations
g0001_0100.s0047_permutations_ii
g0001_0100.s0048_rotate_image
g0001_0100.s0049_group_anagrams
g0001_0100.s0050_powx_n
g0001_0100.s0051_n_queens
g0001_0100.s0052_n_queens_ii
g0001_0100.s0053_maximum_subarray
g0001_0100.s0054_spiral_matrix
g0001_0100.s0055_jump_game
g0001_0100.s0056_merge_intervals
g0001_0100.s0057_insert_interval
g0001_0100.s0058_length_of_last_word
g0001_0100.s0059_spiral_matrix_ii
g0001_0100.s0060_permutation_sequence
g0001_0100.s0061_rotate_list
g0001_0100.s0062_unique_paths
g0001_0100.s0063_unique_paths_ii
g0001_0100.s0064_minimum_path_sum
g0001_0100.s0065_valid_number
g0001_0100.s0066_plus_one
g0001_0100.s0067_add_binary
g0001_0100.s0068_text_justification
g0001_0100.s0069_sqrtx
g0001_0100.s0070_climbing_stairs
g0001_0100.s0071_simplify_path
g0001_0100.s0072_edit_distance
g0001_0100.s0073_set_matrix_zeroes
g0001_0100.s0074_search_a_2d_matrix
g0001_0100.s0075_sort_colors
g0001_0100.s0076_minimum_window_substring
g0001_0100.s0077_combinations
g0001_0100.s0078_subsets
g0001_0100.s0079_word_search
g0001_0100.s0080_remove_duplicates_from_sorted_array_ii
g0001_0100.s0081_search_in_rotated_sorted_array_ii
g0001_0100.s0082_remove_duplicates_from_sorted_list_ii
g0001_0100.s0083_remove_duplicates_from_sorted_list
g0001_0100.s0084_largest_rectangle_in_histogram
g0001_0100.s0085_maximal_rectangle
g0001_0100.s0086_partition_list
g0001_0100.s0087_scramble_string
g0001_0100.s0088_merge_sorted_array
g0001_0100.s0089_gray_code
g0001_0100.s0090_subsets_ii
g0001_0100.s0091_decode_ways
g0001_0100.s0092_reverse_linked_list_ii
g0001_0100.s0093_restore_ip_addresses
g0001_0100.s0094_binary_tree_inorder_traversal
g0001_0100.s0095_unique_binary_search_trees_ii
g0001_0100.s0096_unique_binary_search_trees
g0001_0100.s0097_interleaving_string
g0001_0100.s0098_validate_binary_search_tree
g0001_0100.s0099_recover_binary_search_tree
g0001_0100.s0100_same_tree
g0101_0200.s0101_symmetric_tree
g0101_0200.s0102_binary_tree_level_order_traversal
g0101_0200.s0103_binary_tree_zigzag_level_order_traversal
g0101_0200.s0104_maximum_depth_of_binary_tree
g0101_0200.s0104_maximum_depth_of_binary_tree.g0101_0200.s0104_maximum_depth_of_binary_tree.Solution
g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal
g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal
g0101_0200.s0107_binary_tree_level_order_traversal_ii
g0101_0200.s0108_convert_sorted_array_to_binary_search_tree
g0101_0200.s0109_convert_sorted_list_to_binary_search_tree
g0101_0200.s0110_balanced_binary_tree
g0101_0200.s0111_minimum_depth_of_binary_tree
g0101_0200.s0111_minimum_depth_of_binary_tree.g0101_0200.s0111_minimum_depth_of_binary_tree.Solution
g0101_0200.s0112_path_sum
g0101_0200.s0113_path_sum_ii
g0101_0200.s0114_flatten_binary_tree_to_linked_list
g0101_0200.s0115_distinct_subsequences
g0101_0200.s0116_populating_next_right_pointers_in_each_node
g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii
g0101_0200.s0118_pascals_triangle
g0101_0200.s0119_pascals_triangle_ii
g0101_0200.s0120_triangle
g0101_0200.s0121_best_time_to_buy_and_sell_stock
g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii
g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii
g0101_0200.s0124_binary_tree_maximum_path_sum
g0101_0200.s0124_binary_tree_maximum_path_sum.g0101_0200.s0124_binary_tree_maximum_path_sum.Solution
g0101_0200.s0125_valid_palindrome
g0101_0200.s0126_word_ladder_ii
g0101_0200.s0127_word_ladder
g0101_0200.s0128_longest_consecutive_sequence
g0101_0200.s0128_longest_consecutive_sequence.g0101_0200.s0128_longest_consecutive_sequence.Solution
g0101_0200.s0129_sum_root_to_leaf_numbers
g0101_0200.s0130_surrounded_regions
g0101_0200.s0131_palindrome_partitioning
g0101_0200.s0132_palindrome_partitioning_ii
g0101_0200.s0133_clone_graph
g0101_0200.s0134_gas_station
g0101_0200.s0135_candy
g0101_0200.s0136_single_number
g0101_0200.s0137_single_number_ii
g0101_0200.s0138_copy_list_with_random_pointer
g0101_0200.s0139_word_break
g0101_0200.s0140_word_break_ii
g0101_0200.s0141_linked_list_cycle
g0101_0200.s0142_linked_list_cycle_ii
g0101_0200.s0143_reorder_list
g0101_0200.s0144_binary_tree_preorder_traversal
g0101_0200.s0145_binary_tree_postorder_traversal
g0101_0200.s0146_lru_cache
g0101_0200.s0147_insertion_sort_list
g0101_0200.s0148_sort_list
g0101_0200.s0149_max_points_on_a_line
g0101_0200.s0150_evaluate_reverse_polish_notation
g0101_0200.s0151_reverse_words_in_a_string
g0101_0200.s0152_maximum_product_subarray
g0101_0200.s0153_find_minimum_in_rotated_sorted_array
g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii
g0101_0200.s0155_min_stack
g0101_0200.s0160_intersection_of_two_linked_lists
g0101_0200.s0162_find_peak_element
g0101_0200.s0164_maximum_gap
g0101_0200.s0165_compare_version_numbers
g0101_0200.s0166_fraction_to_recurring_decimal
g0101_0200.s0167_two_sum_ii_input_array_is_sorted
g0101_0200.s0168_excel_sheet_column_title
g0101_0200.s0169_majority_element
g0101_0200.s0171_excel_sheet_column_number
g0101_0200.s0172_factorial_trailing_zeroes
g0101_0200.s0173_binary_search_tree_iterator
g0101_0200.s0174_dungeon_game
g0101_0200.s0175_combine_two_tables
g0101_0200.s0176_second_highest_salary
g0101_0200.s0177_nth_highest_salary
g0101_0200.s0178_rank_scores
g0101_0200.s0179_largest_number
g0101_0200.s0180_consecutive_numbers
g0101_0200.s0181_employees_earning_more_than_their_managers
g0101_0200.s0182_duplicate_emails
g0101_0200.s0183_customers_who_never_order
g0101_0200.s0184_department_highest_salary
g0101_0200.s0185_department_top_three_salaries
g0101_0200.s0187_repeated_dna_sequences
g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv
g0101_0200.s0189_rotate_array
g0101_0200.s0190_reverse_bits
g0101_0200.s0191_number_of_1_bits
g0101_0200.s0192_word_frequency
g0101_0200.s0193_valid_phone_numbers
g0101_0200.s0194_transpose_file
g0101_0200.s0195_tenth_line
g0101_0200.s0196_delete_duplicate_emails
g0101_0200.s0197_rising_temperature
g0101_0200.s0198_house_robber
g0101_0200.s0199_binary_tree_right_side_view
g0101_0200.s0200_number_of_islands
g0201_0300.s0201_bitwise_and_of_numbers_range
g0201_0300.s0201_bitwise_and_of_numbers_range.g0201_0300.s0201_bitwise_and_of_numbers_range.Solution
g0201_0300.s0202_happy_number
g0201_0300.s0203_remove_linked_list_elements
g0201_0300.s0204_count_primes
g0201_0300.s0205_isomorphic_strings
g0201_0300.s0206_reverse_linked_list
g0201_0300.s0207_course_schedule
g0201_0300.s0208_implement_trie_prefix_tree
g0201_0300.s0209_minimum_size_subarray_sum
g0201_0300.s0210_course_schedule_ii
g0201_0300.s0211_design_add_and_search_words_data_structure
g0201_0300.s0212_word_search_ii
g0201_0300.s0213_house_robber_ii
g0201_0300.s0214_shortest_palindrome
g0201_0300.s0215_kth_largest_element_in_an_array
g0201_0300.s0216_combination_sum_iii
g0201_0300.s0217_contains_duplicate
g0201_0300.s0218_the_skyline_problem
g0201_0300.s0219_contains_duplicate_ii
g0201_0300.s0220_contains_duplicate_iii
g0201_0300.s0221_maximal_square
g0201_0300.s0222_count_complete_tree_nodes
g0201_0300.s0223_rectangle_area
g0201_0300.s0224_basic_calculator
g0201_0300.s0225_implement_stack_using_queues
g0201_0300.s0226_invert_binary_tree
g0201_0300.s0227_basic_calculator_ii
g0201_0300.s0228_summary_ranges
g0201_0300.s0229_majority_element_ii
g0201_0300.s0230_kth_smallest_element_in_a_bst
g0201_0300.s0231_power_of_two
g0201_0300.s0232_implement_queue_using_stacks
g0201_0300.s0233_number_of_digit_one
g0201_0300.s0234_palindrome_linked_list
g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree
g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree
g0201_0300.s0237_delete_node_in_a_linked_list
g0201_0300.s0237_delete_node_in_a_linked_list.g0201_0300.s0237_delete_node_in_a_linked_list.Solution
g0201_0300.s0238_product_of_array_except_self
g0201_0300.s0238_product_of_array_except_self.g0201_0300.s0238_product_of_array_except_self.Solution
g0201_0300.s0239_sliding_window_maximum
g0201_0300.s0240_search_a_2d_matrix_ii
g0201_0300.s0241_different_ways_to_add_parentheses
g0201_0300.s0242_valid_anagram
g0201_0300.s0257_binary_tree_paths
g0201_0300.s0258_add_digits
g0201_0300.s0260_single_number_iii
g0201_0300.s0262_trips_and_users
g0201_0300.s0263_ugly_number
g0201_0300.s0264_ugly_number_ii
g0201_0300.s0268_missing_number
g0201_0300.s0273_integer_to_english_words
g0201_0300.s0274_h_index
g0201_0300.s0275_h_index_ii
g0201_0300.s0278_first_bad_version
g0201_0300.s0279_perfect_squares
g0201_0300.s0282_expression_add_operators
g0201_0300.s0283_move_zeroes
g0201_0300.s0284_peeking_iterator
g0201_0300.s0287_find_the_duplicate_number
g0201_0300.s0289_game_of_life
g0201_0300.s0290_word_pattern
g0201_0300.s0292_nim_game
g0201_0300.s0295_find_median_from_data_stream
g0201_0300.s0297_serialize_and_deserialize_binary_tree
g0201_0300.s0299_bulls_and_cows
g0201_0300.s0300_longest_increasing_subsequence
g0301_0400.s0301_remove_invalid_parentheses
g0301_0400.s0303_range_sum_query_immutable
g0301_0400.s0304_range_sum_query_2d_immutable
g0301_0400.s0306_additive_number
g0301_0400.s0307_range_sum_query_mutable
g0301_0400.s0309_best_time_to_buy_and_sell_stock_with_cooldown
g0301_0400.s0310_minimum_height_trees
g0301_0400.s0312_burst_balloons
g0301_0400.s0313_super_ugly_number
g0301_0400.s0315_count_of_smaller_numbers_after_self
g0301_0400.s0316_remove_duplicate_letters
g0301_0400.s0318_maximum_product_of_word_lengths
g0301_0400.s0319_bulb_switcher
g0301_0400.s0321_create_maximum_number
g0301_0400.s0322_coin_change
g0301_0400.s0324_wiggle_sort_ii
g0301_0400.s0326_power_of_three
g0301_0400.s0327_count_of_range_sum
g0301_0400.s0328_odd_even_linked_list
g0301_0400.s0329_longest_increasing_path_in_a_matrix
g0301_0400.s0330_patching_array
g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree
g0301_0400.s0332_reconstruct_itinerary
g0301_0400.s0334_increasing_triplet_subsequence
g0301_0400.s0335_self_crossing
g0301_0400.s0336_palindrome_pairs
g0301_0400.s0337_house_robber_iii
g0301_0400.s0338_counting_bits
g0301_0400.s0341_flatten_nested_list_iterator
g0301_0400.s0342_power_of_four
g0301_0400.s0343_integer_break
g0301_0400.s0344_reverse_string
g0301_0400.s0345_reverse_vowels_of_a_string
g0301_0400.s0347_top_k_frequent_elements
g0301_0400.s0349_intersection_of_two_arrays
g0301_0400.s0350_intersection_of_two_arrays_ii
g0301_0400.s0352_data_stream_as_disjoint_intervals
g0301_0400.s0354_russian_doll_envelopes
g0301_0400.s0355_design_twitter
g0301_0400.s0357_count_numbers_with_unique_digits
g0301_0400.s0363_max_sum_of_rectangle_no_larger_than_k
g0301_0400.s0365_water_and_jug_problem
g0301_0400.s0367_valid_perfect_square
g0301_0400.s0368_largest_divisible_subset
g0301_0400.s0371_sum_of_two_integers
g0301_0400.s0372_super_pow
g0301_0400.s0373_find_k_pairs_with_smallest_sums
g0301_0400.s0374_guess_number_higher_or_lower
g0301_0400.s0374_guess_number_higher_or_lower.g0301_0400.s0374_guess_number_higher_or_lower.Solution
g0301_0400.s0375_guess_number_higher_or_lower_ii
g0301_0400.s0376_wiggle_subsequence
g0301_0400.s0377_combination_sum_iv
g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix
g0301_0400.s0380_insert_delete_getrandom_o1
g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed
g0301_0400.s0382_linked_list_random_node
g0301_0400.s0383_ransom_note
g0301_0400.s0384_shuffle_an_array
g0301_0400.s0385_mini_parser
g0301_0400.s0386_lexicographical_numbers
g0301_0400.s0387_first_unique_character_in_a_string
g0301_0400.s0388_longest_absolute_file_path
g0301_0400.s0389_find_the_difference
g0301_0400.s0390_elimination_game
g0301_0400.s0391_perfect_rectangle
g0301_0400.s0392_is_subsequence
g0301_0400.s0393_utf_8_validation
g0301_0400.s0394_decode_string
g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters
g0301_0400.s0396_rotate_function
g0301_0400.s0397_integer_replacement
g0301_0400.s0398_random_pick_index
g0301_0400.s0399_evaluate_division
g0301_0400.s0400_nth_digit
g0401_0500.s0401_binary_watch
g0401_0500.s0402_remove_k_digits
g0401_0500.s0403_frog_jump
g0401_0500.s0404_sum_of_left_leaves
g0401_0500.s0405_convert_a_number_to_hexadecimal
g0401_0500.s0406_queue_reconstruction_by_height
g0401_0500.s0407_trapping_rain_water_ii
g0401_0500.s0409_longest_palindrome
g0401_0500.s0410_split_array_largest_sum
g0401_0500.s0412_fizz_buzz
g0401_0500.s0413_arithmetic_slices
g0401_0500.s0414_third_maximum_number
g0401_0500.s0415_add_strings
g0401_0500.s0416_partition_equal_subset_sum
g0401_0500.s0417_pacific_atlantic_water_flow
g0401_0500.s0419_battleships_in_a_board
g0401_0500.s0420_strong_password_checker
g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array
g0401_0500.s0423_reconstruct_original_digits_from_english
g0401_0500.s0424_longest_repeating_character_replacement
g0401_0500.s0427_construct_quad_tree
g0401_0500.s0429_n_ary_tree_level_order_traversal
g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list
g0401_0500.s0432_all_oone_data_structure
g0401_0500.s0433_minimum_genetic_mutation
g0401_0500.s0434_number_of_segments_in_a_string
g0401_0500.s0435_non_overlapping_intervals
g0401_0500.s0436_find_right_interval
g0401_0500.s0437_path_sum_iii
g0401_0500.s0438_find_all_anagrams_in_a_string
g0401_0500.s0440_k_th_smallest_in_lexicographical_order
g0401_0500.s0441_arranging_coins
g0401_0500.s0442_find_all_duplicates_in_an_array
g0401_0500.s0443_string_compression
g0401_0500.s0445_add_two_numbers_ii
g0401_0500.s0446_arithmetic_slices_ii_subsequence
g0401_0500.s0447_number_of_boomerangs
g0401_0500.s0448_find_all_numbers_disappeared_in_an_array
g0401_0500.s0449_serialize_and_deserialize_bst
g0401_0500.s0450_delete_node_in_a_bst
g0401_0500.s0451_sort_characters_by_frequency
g0401_0500.s0451_sort_characters_by_frequency.g0401_0500.s0451_sort_characters_by_frequency.Solution
g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons
g0401_0500.s0453_minimum_moves_to_equal_array_elements
g0401_0500.s0454_4sum_ii
g0401_0500.s0455_assign_cookies
g0401_0500.s0456_132_pattern
g0401_0500.s0457_circular_array_loop
g0401_0500.s0458_poor_pigs
g0401_0500.s0459_repeated_substring_pattern
g0401_0500.s0460_lfu_cache
g0401_0500.s0461_hamming_distance
g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii
g0401_0500.s0463_island_perimeter
g0401_0500.s0464_can_i_win
g0401_0500.s0466_count_the_repetitions
g0401_0500.s0467_unique_substrings_in_wraparound_string
g0401_0500.s0468_validate_ip_address
g0401_0500.s0470_implement_rand10_using_rand7
g0401_0500.s0470_implement_rand10_using_rand7.g0401_0500.s0470_implement_rand10_using_rand7.Solution
g0401_0500.s0472_concatenated_words
g0401_0500.s0473_matchsticks_to_square
g0401_0500.s0474_ones_and_zeroes
g0401_0500.s0475_heaters
g0401_0500.s0476_number_complement
g0401_0500.s0477_total_hamming_distance
g0401_0500.s0478_generate_random_point_in_a_circle
g0401_0500.s0479_largest_palindrome_product
g0401_0500.s0480_sliding_window_median
g0401_0500.s0481_magical_string
g0401_0500.s0482_license_key_formatting
g0401_0500.s0483_smallest_good_base
g0401_0500.s0485_max_consecutive_ones
g0401_0500.s0486_predict_the_winner
g0401_0500.s0488_zuma_game
g0401_0500.s0491_increasing_subsequences
g0401_0500.s0492_construct_the_rectangle
g0401_0500.s0493_reverse_pairs
g0401_0500.s0494_target_sum
g0401_0500.s0495_teemo_attacking
g0401_0500.s0496_next_greater_element_i
g0401_0500.s0497_random_point_in_non_overlapping_rectangles
g0401_0500.s0498_diagonal_traverse
g0401_0500.s0500_keyboard_row
g0501_0600.s0501_find_mode_in_binary_search_tree
g0501_0600.s0502_ipo
g0501_0600.s0503_next_greater_element_ii
g0501_0600.s0504_base_7
g0501_0600.s0506_relative_ranks
g0501_0600.s0507_perfect_number
g0501_0600.s0508_most_frequent_subtree_sum
g0501_0600.s0509_fibonacci_number
g0501_0600.s0511_game_play_analysis_i
g0501_0600.s0513_find_bottom_left_tree_value
g0501_0600.s0514_freedom_trail
g0501_0600.s0515_find_largest_value_in_each_tree_row
g0501_0600.s0516_longest_palindromic_subsequence
g0501_0600.s0517_super_washing_machines
g0501_0600.s0518_coin_change_2
g0501_0600.s0519_random_flip_matrix
g0501_0600.s0520_detect_capital
g0501_0600.s0521_longest_uncommon_subsequence_i
g0501_0600.s0522_longest_uncommon_subsequence_ii
g0501_0600.s0523_continuous_subarray_sum
g0501_0600.s0524_longest_word_in_dictionary_through_deleting
g0501_0600.s0525_contiguous_array
g0501_0600.s0526_beautiful_arrangement
g0501_0600.s0528_random_pick_with_weight
g0501_0600.s0529_minesweeper
g0501_0600.s0530_minimum_absolute_difference_in_bst
g0501_0600.s0532_k_diff_pairs_in_an_array
g0501_0600.s0535_encode_and_decode_tinyurl
g0501_0600.s0537_complex_number_multiplication
g0501_0600.s0538_convert_bst_to_greater_tree
g0501_0600.s0539_minimum_time_difference
g0501_0600.s0540_single_element_in_a_sorted_array
g0501_0600.s0541_reverse_string_ii
g0501_0600.s0542_01_matrix
g0501_0600.s0543_diameter_of_binary_tree
g0501_0600.s0546_remove_boxes
g0501_0600.s0547_number_of_provinces
g0501_0600.s0550_game_play_analysis_iv
g0501_0600.s0551_student_attendance_record_i
g0501_0600.s0552_student_attendance_record_ii
g0501_0600.s0552_student_attendance_record_ii.g0501_0600.s0552_student_attendance_record_ii.Solution
g0501_0600.s0553_optimal_division
g0501_0600.s0554_brick_wall
g0501_0600.s0556_next_greater_element_iii
g0501_0600.s0557_reverse_words_in_a_string_iii
g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees
g0501_0600.s0559_maximum_depth_of_n_ary_tree
g0501_0600.s0560_subarray_sum_equals_k
g0501_0600.s0561_array_partition_i
g0501_0600.s0563_binary_tree_tilt
g0501_0600.s0564_find_the_closest_palindrome
g0501_0600.s0565_array_nesting
g0501_0600.s0566_reshape_the_matrix
g0501_0600.s0567_permutation_in_string
g0501_0600.s0570_managers_with_at_least_5_direct_reports
g0501_0600.s0572_subtree_of_another_tree
g0501_0600.s0575_distribute_candies
g0501_0600.s0576_out_of_boundary_paths
g0501_0600.s0577_employee_bonus
g0501_0600.s0581_shortest_unsorted_continuous_subarray
g0501_0600.s0583_delete_operation_for_two_strings
g0501_0600.s0584_find_customer_referee
g0501_0600.s0585_investments_in_2016
g0501_0600.s0586_customer_placing_the_largest_number_of_orders
g0501_0600.s0587_erect_the_fence
g0501_0600.s0589_n_ary_tree_preorder_traversal
g0501_0600.s0590_n_ary_tree_postorder_traversal
g0501_0600.s0591_tag_validator
g0501_0600.s0592_fraction_addition_and_subtraction
g0501_0600.s0593_valid_square
g0501_0600.s0594_longest_harmonious_subsequence
g0501_0600.s0595_big_countries
g0501_0600.s0596_classes_more_than_5_students
g0501_0600.s0598_range_addition_ii
g0501_0600.s0599_minimum_index_sum_of_two_lists
g0501_0600.s0600_non_negative_integers_without_consecutive_ones
g0601_0700.s0601_human_traffic_of_stadium
g0601_0700.s0602_friend_requests_ii_who_has_the_most_friends
g0601_0700.s0605_can_place_flowers
g0601_0700.s0606_construct_string_from_binary_tree
g0601_0700.s0607_sales_person
g0601_0700.s0608_tree_node
g0601_0700.s0609_find_duplicate_file_in_system
g0601_0700.s0610_triangle_judgement
g0601_0700.s0611_valid_triangle_number
g0601_0700.s0617_merge_two_binary_trees
g0601_0700.s0619_biggest_single_number
g0601_0700.s0620_not_boring_movies
g0601_0700.s0621_task_scheduler
g0601_0700.s0622_design_circular_queue
g0601_0700.s0623_add_one_row_to_tree
g0601_0700.s0626_exchange_seats
g0601_0700.s0627_swap_salary
g0601_0700.s0628_maximum_product_of_three_numbers
g0601_0700.s0629_k_inverse_pairs_array
g0601_0700.s0630_course_schedule_iii
g0601_0700.s0632_smallest_range_covering_elements_from_k_lists
g0601_0700.s0633_sum_of_square_numbers
g0601_0700.s0636_exclusive_time_of_functions
g0601_0700.s0637_average_of_levels_in_binary_tree
g0601_0700.s0638_shopping_offers
g0601_0700.s0639_decode_ways_ii
g0601_0700.s0640_solve_the_equation
g0601_0700.s0641_design_circular_deque
g0601_0700.s0643_maximum_average_subarray_i
g0601_0700.s0645_set_mismatch
g0601_0700.s0646_maximum_length_of_pair_chain
g0601_0700.s0646_maximum_length_of_pair_chain.g0601_0700.s0646_maximum_length_of_pair_chain.Solution
g0601_0700.s0647_palindromic_substrings
g0601_0700.s0648_replace_words
g0601_0700.s0649_dota2_senate
g0601_0700.s0650_2_keys_keyboard
g0601_0700.s0652_find_duplicate_subtrees
g0601_0700.s0653_two_sum_iv_input_is_a_bst
g0601_0700.s0654_maximum_binary_tree
g0601_0700.s0655_print_binary_tree
g0601_0700.s0657_robot_return_to_origin
g0601_0700.s0658_find_k_closest_elements
g0601_0700.s0659_split_array_into_consecutive_subsequences
g0601_0700.s0661_image_smoother
g0601_0700.s0662_maximum_width_of_binary_tree
g0601_0700.s0662_maximum_width_of_binary_tree.g0601_0700.s0662_maximum_width_of_binary_tree.Solution
g0601_0700.s0664_strange_printer
g0601_0700.s0665_non_decreasing_array
g0601_0700.s0667_beautiful_arrangement_ii
g0601_0700.s0668_kth_smallest_number_in_multiplication_table
g0601_0700.s0669_trim_a_binary_search_tree
g0601_0700.s0670_maximum_swap
g0601_0700.s0671_second_minimum_node_in_a_binary_tree
g0601_0700.s0672_bulb_switcher_ii
g0601_0700.s0673_number_of_longest_increasing_subsequence
g0601_0700.s0674_longest_continuous_increasing_subsequence
g0601_0700.s0675_cut_off_trees_for_golf_event
g0601_0700.s0675_cut_off_trees_for_golf_event.g0601_0700.s0675_cut_off_trees_for_golf_event.Solution
g0601_0700.s0676_implement_magic_dictionary
g0601_0700.s0677_map_sum_pairs
g0601_0700.s0678_valid_parenthesis_string
g0601_0700.s0679_24_game
g0601_0700.s0680_valid_palindrome_ii
g0601_0700.s0682_baseball_game
g0601_0700.s0684_redundant_connection
g0601_0700.s0685_redundant_connection_ii
g0601_0700.s0686_repeated_string_match
g0601_0700.s0687_longest_univalue_path
g0601_0700.s0688_knight_probability_in_chessboard
g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays
g0601_0700.s0690_employee_importance
g0601_0700.s0691_stickers_to_spell_word
g0601_0700.s0692_top_k_frequent_words
g0601_0700.s0693_binary_number_with_alternating_bits
g0601_0700.s0695_max_area_of_island
g0601_0700.s0696_count_binary_substrings
g0601_0700.s0697_degree_of_an_array
g0601_0700.s0698_partition_to_k_equal_sum_subsets
g0601_0700.s0699_falling_squares
g0601_0700.s0700_search_in_a_binary_search_tree
g0701_0800.s0701_insert_into_a_binary_search_tree
g0701_0800.s0703_kth_largest_element_in_a_stream
g0701_0800.s0704_binary_search
g0701_0800.s0705_design_hashset
g0701_0800.s0706_design_hashmap
g0701_0800.s0707_design_linked_list
g0701_0800.s0709_to_lower_case
g0701_0800.s0710_random_pick_with_blacklist
g0701_0800.s0712_minimum_ascii_delete_sum_for_two_strings
g0701_0800.s0713_subarray_product_less_than_k
g0701_0800.s0713_subarray_product_less_than_k.g0701_0800.s0713_subarray_product_less_than_k.Solution
g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee
g0701_0800.s0715_range_module
g0701_0800.s0717_1_bit_and_2_bit_characters
g0701_0800.s0718_maximum_length_of_repeated_subarray
g0701_0800.s0719_find_k_th_smallest_pair_distance
g0701_0800.s0720_longest_word_in_dictionary
g0701_0800.s0721_accounts_merge
g0701_0800.s0722_remove_comments
g0701_0800.s0724_find_pivot_index
g0701_0800.s0725_split_linked_list_in_parts
g0701_0800.s0726_number_of_atoms
g0701_0800.s0728_self_dividing_numbers
g0701_0800.s0729_my_calendar_i
g0701_0800.s0730_count_different_palindromic_subsequences
g0701_0800.s0731_my_calendar_ii
g0701_0800.s0732_my_calendar_iii
g0701_0800.s0733_flood_fill
g0701_0800.s0735_asteroid_collision
g0701_0800.s0736_parse_lisp_expression
g0701_0800.s0738_monotone_increasing_digits
g0701_0800.s0739_daily_temperatures
g0701_0800.s0740_delete_and_earn
g0701_0800.s0741_cherry_pickup
g0701_0800.s0743_network_delay_time
g0701_0800.s0744_find_smallest_letter_greater_than_target
g0701_0800.s0745_prefix_and_suffix_search
g0701_0800.s0746_min_cost_climbing_stairs
g0701_0800.s0747_largest_number_at_least_twice_of_others
g0701_0800.s0748_shortest_completing_word
g0701_0800.s0749_contain_virus
g0701_0800.s0752_open_the_lock
g0701_0800.s0753_cracking_the_safe
g0701_0800.s0754_reach_a_number
g0701_0800.s0756_pyramid_transition_matrix
g0701_0800.s0757_set_intersection_size_at_least_two
g0701_0800.s0761_special_binary_string
g0701_0800.s0762_prime_number_of_set_bits_in_binary_representation
g0701_0800.s0763_partition_labels
g0701_0800.s0764_largest_plus_sign
g0701_0800.s0765_couples_holding_hands
g0701_0800.s0766_toeplitz_matrix
g0701_0800.s0767_reorganize_string
g0701_0800.s0768_max_chunks_to_make_sorted_ii
g0701_0800.s0768_max_chunks_to_make_sorted_ii.g0701_0800.s0768_max_chunks_to_make_sorted_ii.Solution
g0701_0800.s0769_max_chunks_to_make_sorted
g0701_0800.s0770_basic_calculator_iv
g0701_0800.s0771_jewels_and_stones
g0701_0800.s0773_sliding_puzzle
g0701_0800.s0775_global_and_local_inversions
g0701_0800.s0777_swap_adjacent_in_lr_string
g0701_0800.s0778_swim_in_rising_water
g0701_0800.s0779_k_th_symbol_in_grammar
g0701_0800.s0780_reaching_points
g0701_0800.s0781_rabbits_in_forest
g0701_0800.s0782_transform_to_chessboard
g0701_0800.s0783_minimum_distance_between_bst_nodes
g0701_0800.s0784_letter_case_permutation
g0701_0800.s0785_is_graph_bipartite
g0701_0800.s0786_k_th_smallest_prime_fraction
g0701_0800.s0786_k_th_smallest_prime_fraction.g0701_0800.s0786_k_th_smallest_prime_fraction.Solution
g0701_0800.s0787_cheapest_flights_within_k_stops
g0701_0800.s0788_rotated_digits
g0701_0800.s0789_escape_the_ghosts
g0701_0800.s0790_domino_and_tromino_tiling
g0701_0800.s0791_custom_sort_string
g0701_0800.s0792_number_of_matching_subsequences
g0701_0800.s0793_preimage_size_of_factorial_zeroes_function
g0701_0800.s0794_valid_tic_tac_toe_state
g0701_0800.s0795_number_of_subarrays_with_bounded_maximum
g0701_0800.s0796_rotate_string
g0701_0800.s0797_all_paths_from_source_to_target
g0701_0800.s0798_smallest_rotation_with_highest_score
g0701_0800.s0799_champagne_tower
g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing
g0801_0900.s0802_find_eventual_safe_states
g0801_0900.s0803_bricks_falling_when_hit
g0801_0900.s0804_unique_morse_code_words
g0801_0900.s0805_split_array_with_same_average
g0801_0900.s0806_number_of_lines_to_write_string
g0801_0900.s0807_max_increase_to_keep_city_skyline
g0801_0900.s0808_soup_servings
g0801_0900.s0809_expressive_words
g0801_0900.s0810_chalkboard_xor_game
g0801_0900.s0811_subdomain_visit_count
g0801_0900.s0812_largest_triangle_area
g0801_0900.s0813_largest_sum_of_averages
g0801_0900.s0814_binary_tree_pruning
g0801_0900.s0815_bus_routes
g0801_0900.s0816_ambiguous_coordinates
g0801_0900.s0817_linked_list_components
g0801_0900.s0818_race_car
g0801_0900.s0819_most_common_word
g0801_0900.s0820_short_encoding_of_words
g0801_0900.s0821_shortest_distance_to_a_character
g0801_0900.s0822_card_flipping_game
g0801_0900.s0823_binary_trees_with_factors
g0801_0900.s0824_goat_latin
g0801_0900.s0825_friends_of_appropriate_ages
g0801_0900.s0826_most_profit_assigning_work
g0801_0900.s0827_making_a_large_island
g0801_0900.s0828_count_unique_characters_of_all_substrings_of_a_given_string
g0801_0900.s0829_consecutive_numbers_sum
g0801_0900.s0830_positions_of_large_groups
g0801_0900.s0831_masking_personal_information
g0801_0900.s0831_masking_personal_information.g0801_0900.s0831_masking_personal_information.Solution
g0801_0900.s0832_flipping_an_image
g0801_0900.s0833_find_and_replace_in_string
g0801_0900.s0834_sum_of_distances_in_tree
g0801_0900.s0835_image_overlap
g0801_0900.s0836_rectangle_overlap
g0801_0900.s0837_new_21_game
g0801_0900.s0838_push_dominoes
g0801_0900.s0839_similar_string_groups
g0801_0900.s0840_magic_squares_in_grid
g0801_0900.s0841_keys_and_rooms
g0801_0900.s0842_split_array_into_fibonacci_sequence
g0801_0900.s0843_guess_the_word
g0801_0900.s0844_backspace_string_compare
g0801_0900.s0845_longest_mountain_in_array
g0801_0900.s0846_hand_of_straights
g0801_0900.s0847_shortest_path_visiting_all_nodes
g0801_0900.s0848_shifting_letters
g0801_0900.s0849_maximize_distance_to_closest_person
g0801_0900.s0850_rectangle_area_ii
g0801_0900.s0851_loud_and_rich
g0801_0900.s0852_peak_index_in_a_mountain_array
g0801_0900.s0853_car_fleet
g0801_0900.s0854_k_similar_strings
g0801_0900.s0855_exam_room
g0801_0900.s0856_score_of_parentheses
g0801_0900.s0857_minimum_cost_to_hire_k_workers
g0801_0900.s0858_mirror_reflection
g0801_0900.s0859_buddy_strings
g0801_0900.s0860_lemonade_change
g0801_0900.s0861_score_after_flipping_matrix
g0801_0900.s0862_shortest_subarray_with_sum_at_least_k
g0801_0900.s0863_all_nodes_distance_k_in_binary_tree
g0801_0900.s0864_shortest_path_to_get_all_keys
g0801_0900.s0865_smallest_subtree_with_all_the_deepest_nodes
g0801_0900.s0866_prime_palindrome
g0801_0900.s0867_transpose_matrix
g0801_0900.s0868_binary_gap
g0801_0900.s0869_reordered_power_of_2
g0801_0900.s0870_advantage_shuffle
g0801_0900.s0871_minimum_number_of_refueling_stops
g0801_0900.s0872_leaf_similar_trees
g0801_0900.s0873_length_of_longest_fibonacci_subsequence
g0801_0900.s0874_walking_robot_simulation
g0801_0900.s0875_koko_eating_bananas
g0801_0900.s0876_middle_of_the_linked_list
g0801_0900.s0877_stone_game
g0801_0900.s0878_nth_magical_number
g0801_0900.s0879_profitable_schemes
g0801_0900.s0880_decoded_string_at_index
g0801_0900.s0881_boats_to_save_people
g0801_0900.s0882_reachable_nodes_in_subdivided_graph
g0801_0900.s0883_projection_area_of_3d_shapes
g0801_0900.s0883_projection_area_of_3d_shapes.g0801_0900.s0883_projection_area_of_3d_shapes.Solution
g0801_0900.s0884_uncommon_words_from_two_sentences
g0801_0900.s0885_spiral_matrix_iii
g0801_0900.s0886_possible_bipartition
g0801_0900.s0887_super_egg_drop
g0801_0900.s0888_fair_candy_swap
g0801_0900.s0889_construct_binary_tree_from_preorder_and_postorder_traversal
g0801_0900.s0890_find_and_replace_pattern
g0801_0900.s0891_sum_of_subsequence_widths
g0801_0900.s0892_surface_area_of_3d_shapes
g0801_0900.s0893_groups_of_special_equivalent_strings
g0801_0900.s0894_all_possible_full_binary_trees
g0801_0900.s0895_maximum_frequency_stack
g0801_0900.s0896_monotonic_array
g0801_0900.s0897_increasing_order_search_tree
g0801_0900.s0897_increasing_order_search_tree.g0801_0900.s0897_increasing_order_search_tree.Solution
g0801_0900.s0898_bitwise_ors_of_subarrays
g0801_0900.s0899_orderly_queue
g0801_0900.s0900_rle_iterator
g0901_1000.s0901_online_stock_span
g0901_1000.s0902_numbers_at_most_n_given_digit_set
g0901_1000.s0903_valid_permutations_for_di_sequence
g0901_1000.s0904_fruit_into_baskets
g0901_1000.s0905_sort_array_by_parity
g0901_1000.s0906_super_palindromes
g0901_1000.s0907_sum_of_subarray_minimums
g0901_1000.s0908_smallest_range_i
g0901_1000.s0909_snakes_and_ladders
g0901_1000.s0910_smallest_range_ii
g0901_1000.s0911_online_election
g0901_1000.s0912_sort_an_array
g0901_1000.s0913_cat_and_mouse
g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards
g0901_1000.s0915_partition_array_into_disjoint_intervals
g0901_1000.s0916_word_subsets
g0901_1000.s0917_reverse_only_letters
g0901_1000.s0918_maximum_sum_circular_subarray
g0901_1000.s0919_complete_binary_tree_inserter
g0901_1000.s0920_number_of_music_playlists
g0901_1000.s0921_minimum_add_to_make_parentheses_valid
g0901_1000.s0922_sort_array_by_parity_ii
g0901_1000.s0923_3sum_with_multiplicity
g0901_1000.s0924_minimize_malware_spread
g0901_1000.s0925_long_pressed_name
g0901_1000.s0926_flip_string_to_monotone_increasing
g0901_1000.s0927_three_equal_parts
g0901_1000.s0928_minimize_malware_spread_ii
g0901_1000.s0929_unique_email_addresses
g0901_1000.s0930_binary_subarrays_with_sum
g0901_1000.s0931_minimum_falling_path_sum
g0901_1000.s0932_beautiful_array
g0901_1000.s0933_number_of_recent_calls
g0901_1000.s0934_shortest_bridge
g0901_1000.s0935_knight_dialer
g0901_1000.s0936_stamping_the_sequence
g0901_1000.s0937_reorder_data_in_log_files
g0901_1000.s0938_range_sum_of_bst
g0901_1000.s0939_minimum_area_rectangle
g0901_1000.s0940_distinct_subsequences_ii
g0901_1000.s0941_valid_mountain_array
g0901_1000.s0942_di_string_match
g0901_1000.s0943_find_the_shortest_superstring
g0901_1000.s0944_delete_columns_to_make_sorted
g0901_1000.s0945_minimum_increment_to_make_array_unique
g0901_1000.s0946_validate_stack_sequences
g0901_1000.s0947_most_stones_removed_with_same_row_or_column
g0901_1000.s0948_bag_of_tokens
g0901_1000.s0949_largest_time_for_given_digits
g0901_1000.s0950_reveal_cards_in_increasing_order
g0901_1000.s0951_flip_equivalent_binary_trees
g0901_1000.s0951_flip_equivalent_binary_trees.g0901_1000.s0951_flip_equivalent_binary_trees.Solution
g0901_1000.s0952_largest_component_size_by_common_factor
g0901_1000.s0953_verifying_an_alien_dictionary
g0901_1000.s0954_array_of_doubled_pairs
g0901_1000.s0955_delete_columns_to_make_sorted_ii
g0901_1000.s0956_tallest_billboard
g0901_1000.s0957_prison_cells_after_n_days
g0901_1000.s0958_check_completeness_of_a_binary_tree
g0901_1000.s0959_regions_cut_by_slashes
g0901_1000.s0960_delete_columns_to_make_sorted_iii
g0901_1000.s0961_n_repeated_element_in_size_2n_array
g0901_1000.s0962_maximum_width_ramp
g0901_1000.s0963_minimum_area_rectangle_ii
g0901_1000.s0964_least_operators_to_express_number
g0901_1000.s0965_univalued_binary_tree
g0901_1000.s0966_vowel_spellchecker
g0901_1000.s0967_numbers_with_same_consecutive_differences
g0901_1000.s0968_binary_tree_cameras
g0901_1000.s0969_pancake_sorting
g0901_1000.s0970_powerful_integers
g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal
g0901_1000.s0972_equal_rational_numbers
g0901_1000.s0973_k_closest_points_to_origin
g0901_1000.s0974_subarray_sums_divisible_by_k
g0901_1000.s0974_subarray_sums_divisible_by_k.g0901_1000.s0974_subarray_sums_divisible_by_k.Solution
g0901_1000.s0975_odd_even_jump
g0901_1000.s0976_largest_perimeter_triangle
g0901_1000.s0977_squares_of_a_sorted_array
g0901_1000.s0978_longest_turbulent_subarray
g0901_1000.s0979_distribute_coins_in_binary_tree
g0901_1000.s0980_unique_paths_iii
g0901_1000.s0981_time_based_key_value_store
g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero
g0901_1000.s0983_minimum_cost_for_tickets
g0901_1000.s0984_string_without_aaa_or_bbb
g0901_1000.s0985_sum_of_even_numbers_after_queries
g0901_1000.s0986_interval_list_intersections
g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree
g0901_1000.s0988_smallest_string_starting_from_leaf
g0901_1000.s0989_add_to_array_form_of_integer
g0901_1000.s0989_add_to_array_form_of_integer.g0901_1000.s0989_add_to_array_form_of_integer.Solution
g0901_1000.s0990_satisfiability_of_equality_equations
g0901_1000.s0991_broken_calculator
g0901_1000.s0992_subarrays_with_k_different_integers
g0901_1000.s0993_cousins_in_binary_tree
g0901_1000.s0994_rotting_oranges
g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips
g0901_1000.s0996_number_of_squareful_arrays
g0901_1000.s0997_find_the_town_judge
g0901_1000.s0998_maximum_binary_tree_ii
g0901_1000.s0999_available_captures_for_rook
g0901_1000.s1000_minimum_cost_to_merge_stones
g0901_1000.s1000_minimum_cost_to_merge_stones.g0901_1000.s1000_minimum_cost_to_merge_stones.Solution
g1001_1100.s1001_grid_illumination
g1001_1100.s1002_find_common_characters
g1001_1100.s1003_check_if_word_is_valid_after_substitutions
g1001_1100.s1004_max_consecutive_ones_iii
g1001_1100.s1005_maximize_sum_of_array_after_k_negations
g1001_1100.s1006_clumsy_factorial
g1001_1100.s1007_minimum_domino_rotations_for_equal_row
g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal
g1001_1100.s1009_complement_of_base_10_integer
g1001_1100.s1010_pairs_of_songs_with_total_durations_divisible_by_60
g1001_1100.s1011_capacity_to_ship_packages_within_d_days
g1001_1100.s1012_numbers_with_repeated_digits
g1001_1100.s1012_numbers_with_repeated_digits.g1001_1100.s1012_numbers_with_repeated_digits.Solution
g1001_1100.s1013_partition_array_into_three_parts_with_equal_sum
g1001_1100.s1014_best_sightseeing_pair
g1001_1100.s1015_smallest_integer_divisible_by_k
g1001_1100.s1016_binary_string_with_substrings_representing_1_to_n
g1001_1100.s1017_convert_to_base_2
g1001_1100.s1018_binary_prefix_divisible_by_5
g1001_1100.s1018_binary_prefix_divisible_by_5.g1001_1100.s1018_binary_prefix_divisible_by_5.Solution
g1001_1100.s1019_next_greater_node_in_linked_list
g1001_1100.s1020_number_of_enclaves
g1001_1100.s1021_remove_outermost_parentheses
g1001_1100.s1021_remove_outermost_parentheses.g1001_1100.s1021_remove_outermost_parentheses.Solution
g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers
g1001_1100.s1023_camelcase_matching
g1001_1100.s1024_video_stitching
g1001_1100.s1025_divisor_game
g1001_1100.s1026_maximum_difference_between_node_and_ancestor
g1001_1100.s1027_longest_arithmetic_subsequence
g1001_1100.s1028_recover_a_tree_from_preorder_traversal
g1001_1100.s1029_two_city_scheduling
g1001_1100.s1030_matrix_cells_in_distance_order
g1001_1100.s1031_maximum_sum_of_two_non_overlapping_subarrays
g1001_1100.s1032_stream_of_characters
g1001_1100.s1033_moving_stones_until_consecutive
g1001_1100.s1034_coloring_a_border
g1001_1100.s1035_uncrossed_lines
g1001_1100.s1036_escape_a_large_maze
g1001_1100.s1037_valid_boomerang
g1001_1100.s1038_binary_search_tree_to_greater_sum_tree
g1001_1100.s1039_minimum_score_triangulation_of_polygon
g1001_1100.s1040_moving_stones_until_consecutive_ii
g1001_1100.s1041_robot_bounded_in_circle
g1001_1100.s1042_flower_planting_with_no_adjacent
g1001_1100.s1043_partition_array_for_maximum_sum
g1001_1100.s1044_longest_duplicate_substring
g1001_1100.s1045_customers_who_bought_all_products
g1001_1100.s1046_last_stone_weight
g1001_1100.s1047_remove_all_adjacent_duplicates_in_string
g1001_1100.s1048_longest_string_chain
g1001_1100.s1049_last_stone_weight_ii
g1001_1100.s1050_actors_and_directors_who_cooperated_at_least_three_times
g1001_1100.s1051_height_checker
g1001_1100.s1052_grumpy_bookstore_owner
g1001_1100.s1053_previous_permutation_with_one_swap
g1001_1100.s1054_distant_barcodes
g1001_1100.s1061_lexicographically_smallest_equivalent_string
g1001_1100.s1068_product_sales_analysis_i
g1001_1100.s1070_product_sales_analysis_iii
g1001_1100.s1071_greatest_common_divisor_of_strings
g1001_1100.s1072_flip_columns_for_maximum_number_of_equal_rows
g1001_1100.s1073_adding_two_negabinary_numbers
g1001_1100.s1074_number_of_submatrices_that_sum_to_target
g1001_1100.s1075_project_employees_i
g1001_1100.s1078_occurrences_after_bigram
g1001_1100.s1079_letter_tile_possibilities
g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths
g1001_1100.s1081_smallest_subsequence_of_distinct_characters
g1001_1100.s1084_sales_analysis_iii
g1001_1100.s1089_duplicate_zeros
g1001_1100.s1090_largest_values_from_labels
g1001_1100.s1091_shortest_path_in_binary_matrix
g1001_1100.s1092_shortest_common_supersequence
g1001_1100.s1093_statistics_from_a_large_sample
g1001_1100.s1094_car_pooling
g1001_1100.s1095_find_in_mountain_array
g1001_1100.s1096_brace_expansion_ii
g1101_1200.s1103_distribute_candies_to_people
g1101_1200.s1103_distribute_candies_to_people.g1101_1200.s1103_distribute_candies_to_people.Solution
g1101_1200.s1104_path_in_zigzag_labelled_binary_tree
g1101_1200.s1105_filling_bookcase_shelves
g1101_1200.s1106_parsing_a_boolean_expression
g1101_1200.s1106_parsing_a_boolean_expression.g1101_1200.s1106_parsing_a_boolean_expression.Solution
g1101_1200.s1108_defanging_an_ip_address
g1101_1200.s1109_corporate_flight_bookings
g1101_1200.s1110_delete_nodes_and_return_forest
g1101_1200.s1111_maximum_nesting_depth_of_two_valid_parentheses_strings
g1101_1200.s1114_print_in_order
g1101_1200.s1115_print_foobar_alternately
g1101_1200.s1116_print_zero_even_odd
g1101_1200.s1117_building_h2o
g1101_1200.s1122_relative_sort_array
g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves
g1101_1200.s1124_longest_well_performing_interval
g1101_1200.s1125_smallest_sufficient_team
g1101_1200.s1128_number_of_equivalent_domino_pairs
g1101_1200.s1129_shortest_path_with_alternating_colors
g1101_1200.s1130_minimum_cost_tree_from_leaf_values
g1101_1200.s1131_maximum_of_absolute_value_expression
g1101_1200.s1137_n_th_tribonacci_number
g1101_1200.s1138_alphabet_board_path
g1101_1200.s1139_largest_1_bordered_square
g1101_1200.s1140_stone_game_ii
g1101_1200.s1141_user_activity_for_the_past_30_days_i
g1101_1200.s1143_longest_common_subsequence
g1101_1200.s1144_decrease_elements_to_make_array_zigzag
g1101_1200.s1145_binary_tree_coloring_game
g1101_1200.s1146_snapshot_array
g1101_1200.s1147_longest_chunked_palindrome_decomposition
g1101_1200.s1148_article_views_i
g1101_1200.s1154_day_of_the_year
g1101_1200.s1155_number_of_dice_rolls_with_target_sum
g1101_1200.s1156_swap_for_longest_repeated_character_substring
g1101_1200.s1157_online_majority_element_in_subarray
g1101_1200.s1158_market_analysis_i
g1101_1200.s1160_find_words_that_can_be_formed_by_characters
g1101_1200.s1161_maximum_level_sum_of_a_binary_tree
g1101_1200.s1162_as_far_from_land_as_possible
g1101_1200.s1162_as_far_from_land_as_possible.g1101_1200.s1162_as_far_from_land_as_possible.Solution
g1101_1200.s1163_last_substring_in_lexicographical_order
g1101_1200.s1164_product_price_at_a_given_date
g1101_1200.s1169_invalid_transactions
g1101_1200.s1170_compare_strings_by_frequency_of_the_smallest_character
g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list
g1101_1200.s1172_dinner_plate_stacks
g1101_1200.s1174_immediate_food_delivery_ii
g1101_1200.s1175_prime_arrangements
g1101_1200.s1177_can_make_palindrome_from_substring
g1101_1200.s1178_number_of_valid_words_for_each_puzzle
g1101_1200.s1179_reformat_department_table
g1101_1200.s1184_distance_between_bus_stops
g1101_1200.s1185_day_of_the_week
g1101_1200.s1186_maximum_subarray_sum_with_one_deletion
g1101_1200.s1187_make_array_strictly_increasing
g1101_1200.s1189_maximum_number_of_balloons
g1101_1200.s1190_reverse_substrings_between_each_pair_of_parentheses
g1101_1200.s1191_k_concatenation_maximum_sum
g1101_1200.s1192_critical_connections_in_a_network
g1101_1200.s1193_monthly_transactions_i
g1101_1200.s1195_fizz_buzz_multithreaded
g1101_1200.s1200_minimum_absolute_difference
g1201_1300.s1201_ugly_number_iii
g1201_1300.s1202_smallest_string_with_swaps
g1201_1300.s1203_sort_items_by_groups_respecting_dependencies
g1201_1300.s1204_last_person_to_fit_in_the_bus
g1201_1300.s1206_design_skiplist
g1201_1300.s1207_unique_number_of_occurrences
g1201_1300.s1207_unique_number_of_occurrences.g1201_1300.s1207_unique_number_of_occurrences.Solution
g1201_1300.s1208_get_equal_substrings_within_budget
g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_ii
g1201_1300.s1210_minimum_moves_to_reach_target_with_rotations
g1201_1300.s1211_queries_quality_and_percentage
g1201_1300.s1217_minimum_cost_to_move_chips_to_the_same_position
g1201_1300.s1218_longest_arithmetic_subsequence_of_given_difference
g1201_1300.s1219_path_with_maximum_gold
g1201_1300.s1220_count_vowels_permutation
g1201_1300.s1221_split_a_string_in_balanced_strings
g1201_1300.s1222_queens_that_can_attack_the_king
g1201_1300.s1223_dice_roll_simulation
g1201_1300.s1224_maximum_equal_frequency
g1201_1300.s1226_the_dining_philosophers
g1201_1300.s1226_the_dining_philosophers.g1201_1300.s1226_the_dining_philosophers.DiningPhilosophers
g1201_1300.s1227_airplane_seat_assignment_probability
g1201_1300.s1232_check_if_it_is_a_straight_line
g1201_1300.s1233_remove_sub_folders_from_the_filesystem
g1201_1300.s1234_replace_the_substring_for_balanced_string
g1201_1300.s1235_maximum_profit_in_job_scheduling
g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation
g1201_1300.s1238_circular_permutation_in_binary_representation
g1201_1300.s1239_maximum_length_of_a_concatenated_string_with_unique_characters
g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares
g1201_1300.s1247_minimum_swaps_to_make_strings_equal
g1201_1300.s1248_count_number_of_nice_subarrays
g1201_1300.s1249_minimum_remove_to_make_valid_parentheses
g1201_1300.s1250_check_if_it_is_a_good_array
g1201_1300.s1251_average_selling_price
g1201_1300.s1252_cells_with_odd_values_in_a_matrix
g1201_1300.s1253_reconstruct_a_2_row_binary_matrix
g1201_1300.s1254_number_of_closed_islands
g1201_1300.s1255_maximum_score_words_formed_by_letters
g1201_1300.s1260_shift_2d_grid
g1201_1300.s1261_find_elements_in_a_contaminated_binary_tree
g1201_1300.s1262_greatest_sum_divisible_by_three
g1201_1300.s1263_minimum_moves_to_move_a_box_to_their_target_location
g1201_1300.s1266_minimum_time_visiting_all_points
g1201_1300.s1267_count_servers_that_communicate
g1201_1300.s1268_search_suggestions_system
g1201_1300.s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps
g1201_1300.s1275_find_winner_on_a_tic_tac_toe_game
g1201_1300.s1276_number_of_burgers_with_no_waste_of_ingredients
g1201_1300.s1277_count_square_submatrices_with_all_ones
g1201_1300.s1278_palindrome_partitioning_iii
g1201_1300.s1280_students_and_examinations
g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer
g1201_1300.s1282_group_the_people_given_the_group_size_they_belong_to
g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold
g1201_1300.s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix
g1201_1300.s1286_iterator_for_combination
g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array
g1201_1300.s1288_remove_covered_intervals
g1201_1300.s1289_minimum_falling_path_sum_ii
g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer
g1201_1300.s1291_sequential_digits
g1201_1300.s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold
g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination
g1201_1300.s1295_find_numbers_with_even_number_of_digits
g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers
g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring
g1201_1300.s1298_maximum_candies_you_can_get_from_boxes
g1201_1300.s1299_replace_elements_with_greatest_element_on_right_side
g1201_1300.s1300_sum_of_mutated_array_closest_to_target
g1301_1400.s1301_number_of_paths_with_max_score
g1301_1400.s1302_deepest_leaves_sum
g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero
g1301_1400.s1305_all_elements_in_two_binary_search_trees
g1301_1400.s1306_jump_game_iii
g1301_1400.s1307_verbal_arithmetic_puzzle
g1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping
g1301_1400.s1310_xor_queries_of_a_subarray
g1301_1400.s1311_get_watched_videos_by_your_friends
g1301_1400.s1312_minimum_insertion_steps_to_make_a_string_palindrome
g1301_1400.s1313_decompress_run_length_encoded_list
g1301_1400.s1314_matrix_block_sum
g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent
g1301_1400.s1316_distinct_echo_substrings
g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers
g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c
g1301_1400.s1319_number_of_operations_to_make_network_connected
g1301_1400.s1320_minimum_distance_to_type_a_word_using_two_fingers
g1301_1400.s1321_restaurant_growth
g1301_1400.s1323_maximum_69_number
g1301_1400.s1324_print_words_vertically
g1301_1400.s1325_delete_leaves_with_a_given_value
g1301_1400.s1326_minimum_number_of_taps_to_open_to_water_a_garden
g1301_1400.s1327_list_the_products_ordered_in_a_period
g1301_1400.s1328_break_a_palindrome
g1301_1400.s1329_sort_the_matrix_diagonally
g1301_1400.s1330_reverse_subarray_to_maximize_array_value
g1301_1400.s1331_rank_transform_of_an_array
g1301_1400.s1332_remove_palindromic_subsequences
g1301_1400.s1333_filter_restaurants_by_vegan_friendly_price_and_distance
g1301_1400.s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance
g1301_1400.s1335_minimum_difficulty_of_a_job_schedule
g1301_1400.s1337_the_k_weakest_rows_in_a_matrix
g1301_1400.s1338_reduce_array_size_to_the_half
g1301_1400.s1339_maximum_product_of_splitted_binary_tree
g1301_1400.s1340_jump_game_v
g1301_1400.s1341_movie_rating
g1301_1400.s1342_number_of_steps_to_reduce_a_number_to_zero
g1301_1400.s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold
g1301_1400.s1344_angle_between_hands_of_a_clock
g1301_1400.s1345_jump_game_iv
g1301_1400.s1346_check_if_n_and_its_double_exist
g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram
g1301_1400.s1348_tweet_counts_per_frequency
g1301_1400.s1349_maximum_students_taking_exam
g1301_1400.s1349_maximum_students_taking_exam.g1301_1400.s1349_maximum_students_taking_exam.Solution
g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix
g1301_1400.s1352_product_of_the_last_k_numbers
g1301_1400.s1353_maximum_number_of_events_that_can_be_attended
g1301_1400.s1354_construct_target_array_with_multiple_sums
g1301_1400.s1356_sort_integers_by_the_number_of_1_bits
g1301_1400.s1357_apply_discount_every_n_orders
g1301_1400.s1358_number_of_substrings_containing_all_three_characters
g1301_1400.s1359_count_all_valid_pickup_and_delivery_options
g1301_1400.s1360_number_of_days_between_two_dates
g1301_1400.s1361_validate_binary_tree_nodes
g1301_1400.s1362_closest_divisors
g1301_1400.s1363_largest_multiple_of_three
g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number
g1301_1400.s1366_rank_teams_by_votes
g1301_1400.s1367_linked_list_in_binary_tree
g1301_1400.s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid
g1301_1400.s1370_increasing_decreasing_string
g1301_1400.s1370_increasing_decreasing_string.g1301_1400.s1370_increasing_decreasing_string.Solution
g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts
g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree
g1301_1400.s1373_maximum_sum_bst_in_binary_tree
g1301_1400.s1374_generate_a_string_with_characters_that_have_odd_counts
g1301_1400.s1375_number_of_times_binary_string_is_prefix_aligned
g1301_1400.s1376_time_needed_to_inform_all_employees
g1301_1400.s1377_frog_position_after_t_seconds
g1301_1400.s1378_replace_employee_id_with_the_unique_identifier
g1301_1400.s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree
g1301_1400.s1380_lucky_numbers_in_a_matrix
g1301_1400.s1381_design_a_stack_with_increment_operation
g1301_1400.s1382_balance_a_binary_search_tree
g1301_1400.s1382_balance_a_binary_search_tree.g1301_1400.s1382_balance_a_binary_search_tree.Solution
g1301_1400.s1383_maximum_performance_of_a_team
g1301_1400.s1385_find_the_distance_value_between_two_arrays
g1301_1400.s1386_cinema_seat_allocation
g1301_1400.s1387_sort_integers_by_the_power_value
g1301_1400.s1388_pizza_with_3n_slices
g1301_1400.s1389_create_target_array_in_the_given_order
g1301_1400.s1390_four_divisors
g1301_1400.s1391_check_if_there_is_a_valid_path_in_a_grid
g1301_1400.s1392_longest_happy_prefix
g1301_1400.s1393_capital_gainloss
g1301_1400.s1394_find_lucky_integer_in_an_array
g1301_1400.s1395_count_number_of_teams
g1301_1400.s1396_design_underground_system
g1301_1400.s1397_find_all_good_strings
g1301_1400.s1399_count_largest_group
g1301_1400.s1400_construct_k_palindrome_strings
g1401_1500.s1401_circle_and_rectangle_overlapping
g1401_1500.s1402_reducing_dishes
g1401_1500.s1403_minimum_subsequence_in_non_increasing_order
g1401_1500.s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one
g1401_1500.s1405_longest_happy_string
g1401_1500.s1406_stone_game_iii
g1401_1500.s1407_top_travellers
g1401_1500.s1408_string_matching_in_an_array
g1401_1500.s1409_queries_on_a_permutation_with_key
g1401_1500.s1410_html_entity_parser
g1401_1500.s1411_number_of_ways_to_paint_n_3_grid
g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum
g1401_1500.s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k
g1401_1500.s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n
g1401_1500.s1416_restore_the_array
g1401_1500.s1417_reformat_the_string
g1401_1500.s1418_display_table_of_food_orders_in_a_restaurant
g1401_1500.s1419_minimum_number_of_frogs_croaking
g1401_1500.s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons
g1401_1500.s1422_maximum_score_after_splitting_a_string
g1401_1500.s1423_maximum_points_you_can_obtain_from_cards
g1401_1500.s1424_diagonal_traverse_ii
g1401_1500.s1425_constrained_subsequence_sum
g1401_1500.s1431_kids_with_the_greatest_number_of_candies
g1401_1500.s1432_max_difference_you_can_get_from_changing_an_integer
g1401_1500.s1433_check_if_a_string_can_break_another_string
g1401_1500.s1434_number_of_ways_to_wear_different_hats_to_each_other
g1401_1500.s1436_destination_city
g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away
g1401_1500.s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit
g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows
g1401_1500.s1441_build_an_array_with_stack_operations
g1401_1500.s1442_count_triplets_that_can_form_two_arrays_of_equal_xor
g1401_1500.s1443_minimum_time_to_collect_all_apples_in_a_tree
g1401_1500.s1444_number_of_ways_of_cutting_a_pizza
g1401_1500.s1446_consecutive_characters
g1401_1500.s1447_simplified_fractions
g1401_1500.s1448_count_good_nodes_in_binary_tree
g1401_1500.s1449_form_largest_integer_with_digits_that_add_up_to_target
g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time
g1401_1500.s1451_rearrange_words_in_a_sentence
g1401_1500.s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list
g1401_1500.s1453_maximum_number_of_darts_inside_of_a_circular_dartboard
g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence
g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length
g1401_1500.s1457_pseudo_palindromic_paths_in_a_binary_tree
g1401_1500.s1458_max_dot_product_of_two_subsequences
g1401_1500.s1460_make_two_arrays_equal_by_reversing_sub_arrays
g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k
g1401_1500.s1462_course_schedule_iv
g1401_1500.s1463_cherry_pickup_ii
g1401_1500.s1464_maximum_product_of_two_elements_in_an_array
g1401_1500.s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts
g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero
g1401_1500.s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls
g1401_1500.s1470_shuffle_the_array
g1401_1500.s1471_the_k_strongest_values_in_an_array
g1401_1500.s1472_design_browser_history
g1401_1500.s1473_paint_house_iii
g1401_1500.s1475_final_prices_with_a_special_discount_in_a_shop
g1401_1500.s1476_subrectangle_queries
g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum
g1401_1500.s1478_allocate_mailboxes
g1401_1500.s1480_running_sum_of_1d_array
g1401_1500.s1481_least_number_of_unique_integers_after_k_removals
g1401_1500.s1482_minimum_number_of_days_to_make_m_bouquets
g1401_1500.s1483_kth_ancestor_of_a_tree_node
g1401_1500.s1484_group_sold_products_by_the_date
g1401_1500.s1486_xor_operation_in_an_array
g1401_1500.s1487_making_file_names_unique
g1401_1500.s1488_avoid_flood_in_the_city
g1401_1500.s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree
g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary
g1401_1500.s1492_the_kth_factor_of_n
g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element
g1401_1500.s1494_parallel_courses_ii
g1401_1500.s1496_path_crossing
g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k
g1401_1500.s1498_number_of_subsequences_that_satisfy_the_given_sum_condition
g1401_1500.s1499_max_value_of_equation
g1501_1600.s1502_can_make_arithmetic_progression_from_sequence
g1501_1600.s1503_last_moment_before_all_ants_fall_out_of_a_plank
g1501_1600.s1504_count_submatrices_with_all_ones
g1501_1600.s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits
g1501_1600.s1507_reformat_date
g1501_1600.s1508_range_sum_of_sorted_subarray_sums
g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves
g1501_1600.s1510_stone_game_iv
g1501_1600.s1512_number_of_good_pairs
g1501_1600.s1513_number_of_substrings_with_only_1s
g1501_1600.s1514_path_with_maximum_probability
g1501_1600.s1515_best_position_for_a_service_centre
g1501_1600.s1517_find_users_with_valid_e_mails
g1501_1600.s1518_water_bottles
g1501_1600.s1519_number_of_nodes_in_the_sub_tree_with_the_same_label
g1501_1600.s1520_maximum_number_of_non_overlapping_substrings
g1501_1600.s1521_find_a_value_of_a_mysterious_function_closest_to_target
g1501_1600.s1523_count_odd_numbers_in_an_interval_range
g1501_1600.s1524_number_of_sub_arrays_with_odd_sum
g1501_1600.s1525_number_of_good_ways_to_split_a_string
g1501_1600.s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array
g1501_1600.s1527_patients_with_a_condition
g1501_1600.s1528_shuffle_string
g1501_1600.s1529_bulb_switcher_iv
g1501_1600.s1530_number_of_good_leaf_nodes_pairs
g1501_1600.s1531_string_compression_ii
g1501_1600.s1534_count_good_triplets
g1501_1600.s1535_find_the_winner_of_an_array_game
g1501_1600.s1536_minimum_swaps_to_arrange_a_binary_grid
g1501_1600.s1537_get_the_maximum_score
g1501_1600.s1539_kth_missing_positive_number
g1501_1600.s1540_can_convert_string_in_k_moves
g1501_1600.s1541_minimum_insertions_to_balance_a_parentheses_string
g1501_1600.s1542_find_longest_awesome_substring
g1501_1600.s1544_make_the_string_great
g1501_1600.s1545_find_kth_bit_in_nth_binary_string
g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target
g1501_1600.s1547_minimum_cost_to_cut_a_stick
g1501_1600.s1550_three_consecutive_odds
g1501_1600.s1551_minimum_operations_to_make_array_equal
g1501_1600.s1552_magnetic_force_between_two_balls
g1501_1600.s1553_minimum_number_of_days_to_eat_n_oranges
g1501_1600.s1556_thousand_separator
g1501_1600.s1557_minimum_number_of_vertices_to_reach_all_nodes
g1501_1600.s1558_minimum_numbers_of_function_calls_to_make_target_array
g1501_1600.s1559_detect_cycles_in_2d_grid
g1501_1600.s1560_most_visited_sector_in_a_circular_track
g1501_1600.s1561_maximum_number_of_coins_you_can_get
g1501_1600.s1562_find_latest_group_of_size_m
g1501_1600.s1563_stone_game_v
g1501_1600.s1566_detect_pattern_of_length_m_repeated_k_or_more_times
g1501_1600.s1567_maximum_length_of_subarray_with_positive_product
g1501_1600.s1568_minimum_number_of_days_to_disconnect_island
g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst
g1501_1600.s1572_matrix_diagonal_sum
g1501_1600.s1573_number_of_ways_to_split_a_string
g1501_1600.s1574_shortest_subarray_to_be_removed_to_make_array_sorted
g1501_1600.s1575_count_all_possible_routes
g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters
g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers
g1501_1600.s1578_minimum_time_to_make_rope_colorful
g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable
g1501_1600.s1581_customer_who_visited_but_did_not_make_any_transactions
g1501_1600.s1582_special_positions_in_a_binary_matrix
g1501_1600.s1583_count_unhappy_friends
g1501_1600.s1584_min_cost_to_connect_all_points
g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations
g1501_1600.s1587_bank_account_summary_ii
g1501_1600.s1588_sum_of_all_odd_length_subarrays
g1501_1600.s1589_maximum_sum_obtained_of_any_permutation
g1501_1600.s1590_make_sum_divisible_by_p
g1501_1600.s1591_strange_printer_ii
g1501_1600.s1592_rearrange_spaces_between_words
g1501_1600.s1593_split_a_string_into_the_max_number_of_unique_substrings
g1501_1600.s1594_maximum_non_negative_product_in_a_matrix
g1501_1600.s1595_minimum_cost_to_connect_two_groups_of_points
g1501_1600.s1598_crawler_log_folder
g1501_1600.s1599_maximum_profit_of_operating_a_centennial_wheel
g1501_1600.s1600_throne_inheritance
g1601_1700.s1601_maximum_number_of_achievable_transfer_requests
g1601_1700.s1603_design_parking_system
g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period
g1601_1700.s1605_find_valid_matrix_given_row_and_column_sums
g1601_1700.s1606_find_servers_that_handled_most_number_of_requests
g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x
g1601_1700.s1609_even_odd_tree
g1601_1700.s1610_maximum_number_of_visible_points
g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero
g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses
g1601_1700.s1615_maximal_network_rank
g1601_1700.s1616_split_two_strings_to_make_palindrome
g1601_1700.s1617_count_subtrees_with_max_distance_between_cities
g1601_1700.s1619_mean_of_array_after_removing_some_elements
g1601_1700.s1620_coordinate_with_maximum_network_quality
g1601_1700.s1621_number_of_sets_of_k_non_overlapping_line_segments
g1601_1700.s1622_fancy_sequence
g1601_1700.s1624_largest_substring_between_two_equal_characters
g1601_1700.s1625_lexicographically_smallest_string_after_applying_operations
g1601_1700.s1626_best_team_with_no_conflicts
g1601_1700.s1627_graph_connectivity_with_threshold
g1601_1700.s1629_slowest_key
g1601_1700.s1630_arithmetic_subarrays
g1601_1700.s1631_path_with_minimum_effort
g1601_1700.s1632_rank_transform_of_a_matrix
g1601_1700.s1633_percentage_of_users_attended_a_contest
g1601_1700.s1636_sort_array_by_increasing_frequency
g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points
g1601_1700.s1638_count_substrings_that_differ_by_one_character
g1601_1700.s1639_number_of_ways_to_form_a_target_string_given_a_dictionary
g1601_1700.s1640_check_array_formation_through_concatenation
g1601_1700.s1641_count_sorted_vowel_strings
g1601_1700.s1642_furthest_building_you_can_reach
g1601_1700.s1643_kth_smallest_instructions
g1601_1700.s1646_get_maximum_in_generated_array
g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique
g1601_1700.s1648_sell_diminishing_valued_colored_balls
g1601_1700.s1649_create_sorted_array_through_instructions
g1601_1700.s1652_defuse_the_bomb
g1601_1700.s1653_minimum_deletions_to_make_string_balanced
g1601_1700.s1654_minimum_jumps_to_reach_home
g1601_1700.s1655_distribute_repeating_integers
g1601_1700.s1656_design_an_ordered_stream
g1601_1700.s1657_determine_if_two_strings_are_close
g1601_1700.s1658_minimum_operations_to_reduce_x_to_zero
g1601_1700.s1659_maximize_grid_happiness
g1601_1700.s1661_average_time_of_process_per_machine
g1601_1700.s1662_check_if_two_string_arrays_are_equivalent
g1601_1700.s1663_smallest_string_with_a_given_numeric_value
g1601_1700.s1664_ways_to_make_a_fair_array
g1601_1700.s1665_minimum_initial_energy_to_finish_tasks
g1601_1700.s1667_fix_names_in_a_table
g1601_1700.s1668_maximum_repeating_substring
g1601_1700.s1669_merge_in_between_linked_lists
g1601_1700.s1670_design_front_middle_back_queue
g1601_1700.s1671_minimum_number_of_removals_to_make_mountain_array
g1601_1700.s1672_richest_customer_wealth
g1601_1700.s1673_find_the_most_competitive_subsequence
g1601_1700.s1674_minimum_moves_to_make_array_complementary
g1601_1700.s1675_minimize_deviation_in_array
g1601_1700.s1678_goal_parser_interpretation
g1601_1700.s1679_max_number_of_k_sum_pairs
g1601_1700.s1680_concatenation_of_consecutive_binary_numbers
g1601_1700.s1681_minimum_incompatibility
g1601_1700.s1683_invalid_tweets
g1601_1700.s1684_count_the_number_of_consistent_strings
g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array
g1601_1700.s1686_stone_game_vi
g1601_1700.s1687_delivering_boxes_from_storage_to_ports
g1601_1700.s1688_count_of_matches_in_tournament
g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers
g1601_1700.s1690_stone_game_vii
g1601_1700.s1691_maximum_height_by_stacking_cuboids
g1601_1700.s1693_daily_leads_and_partners
g1601_1700.s1694_reformat_phone_number
g1601_1700.s1695_maximum_erasure_value
g1601_1700.s1696_jump_game_vi
g1601_1700.s1697_checking_existence_of_edge_length_limited_paths
g1601_1700.s1700_number_of_students_unable_to_eat_lunch
g1701_1800.s1701_average_waiting_time
g1701_1800.s1702_maximum_binary_string_after_change
g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones
g1701_1800.s1704_determine_if_string_halves_are_alike
g1701_1800.s1705_maximum_number_of_eaten_apples
g1701_1800.s1706_where_will_the_ball_fall
g1701_1800.s1707_maximum_xor_with_an_element_from_array
g1701_1800.s1710_maximum_units_on_a_truck
g1701_1800.s1711_count_good_meals
g1701_1800.s1712_ways_to_split_array_into_three_subarrays
g1701_1800.s1713_minimum_operations_to_make_a_subsequence
g1701_1800.s1716_calculate_money_in_leetcode_bank
g1701_1800.s1717_maximum_score_from_removing_substrings
g1701_1800.s1718_construct_the_lexicographically_largest_valid_sequence
g1701_1800.s1719_number_of_ways_to_reconstruct_a_tree
g1701_1800.s1720_decode_xored_array
g1701_1800.s1721_swapping_nodes_in_a_linked_list
g1701_1800.s1722_minimize_hamming_distance_after_swap_operations
g1701_1800.s1723_find_minimum_time_to_finish_all_jobs
g1701_1800.s1725_number_of_rectangles_that_can_form_the_largest_square
g1701_1800.s1726_tuple_with_same_product
g1701_1800.s1727_largest_submatrix_with_rearrangements
g1701_1800.s1728_cat_and_mouse_ii
g1701_1800.s1729_find_followers_count
g1701_1800.s1731_the_number_of_employees_which_report_to_each_employee
g1701_1800.s1732_find_the_highest_altitude
g1701_1800.s1733_minimum_number_of_people_to_teach
g1701_1800.s1734_decode_xored_permutation
g1701_1800.s1735_count_ways_to_make_array_with_product
g1701_1800.s1736_latest_time_by_replacing_hidden_digits
g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions
g1701_1800.s1738_find_kth_largest_xor_coordinate_value
g1701_1800.s1739_building_boxes
g1701_1800.s1741_find_total_time_spent_by_each_employee
g1701_1800.s1742_maximum_number_of_balls_in_a_box
g1701_1800.s1743_restore_the_array_from_adjacent_pairs
g1701_1800.s1744_can_you_eat_your_favorite_candy_on_your_favorite_day
g1701_1800.s1745_palindrome_partitioning_iv
g1701_1800.s1748_sum_of_unique_elements
g1701_1800.s1749_maximum_absolute_sum_of_any_subarray
g1701_1800.s1750_minimum_length_of_string_after_deleting_similar_ends
g1701_1800.s1751_maximum_number_of_events_that_can_be_attended_ii
g1701_1800.s1752_check_if_array_is_sorted_and_rotated
g1701_1800.s1753_maximum_score_from_removing_stones
g1701_1800.s1754_largest_merge_of_two_strings
g1701_1800.s1754_largest_merge_of_two_strings.g1701_1800.s1754_largest_merge_of_two_strings.Solution
g1701_1800.s1755_closest_subsequence_sum
g1701_1800.s1757_recyclable_and_low_fat_products
g1701_1800.s1758_minimum_changes_to_make_alternating_binary_string
g1701_1800.s1759_count_number_of_homogenous_substrings
g1701_1800.s1760_minimum_limit_of_balls_in_a_bag
g1701_1800.s1761_minimum_degree_of_a_connected_trio_in_a_graph
g1701_1800.s1763_longest_nice_substring
g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array
g1701_1800.s1765_map_of_highest_peak
g1701_1800.s1766_tree_of_coprimes
g1701_1800.s1768_merge_strings_alternately
g1701_1800.s1769_minimum_number_of_operations_to_move_all_balls_to_each_box
g1701_1800.s1770_maximum_score_from_performing_multiplication_operations
g1701_1800.s1771_maximize_palindrome_length_from_subsequences
g1701_1800.s1773_count_items_matching_a_rule
g1701_1800.s1774_closest_dessert_cost
g1701_1800.s1775_equal_sum_arrays_with_minimum_number_of_operations
g1701_1800.s1776_car_fleet_ii
g1701_1800.s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate
g1701_1800.s1780_check_if_number_is_a_sum_of_powers_of_three
g1701_1800.s1781_sum_of_beauty_of_all_substrings
g1701_1800.s1782_count_pairs_of_nodes
g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones
g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum
g1701_1800.s1786_number_of_restricted_paths_from_first_to_last_node
g1701_1800.s1787_make_the_xor_of_all_segments_equal_to_zero
g1701_1800.s1789_primary_department_for_each_employee
g1701_1800.s1790_check_if_one_string_swap_can_make_strings_equal
g1701_1800.s1791_find_center_of_star_graph
g1701_1800.s1792_maximum_average_pass_ratio
g1701_1800.s1793_maximum_score_of_a_good_subarray
g1701_1800.s1795_rearrange_products_table
g1701_1800.s1796_second_largest_digit_in_a_string
g1701_1800.s1797_design_authentication_manager
g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make
g1701_1800.s1799_maximize_score_after_n_operations
g1701_1800.s1800_maximum_ascending_subarray_sum
g1801_1900.s1801_number_of_orders_in_the_backlog
g1801_1900.s1802_maximum_value_at_a_given_index_in_a_bounded_array
g1801_1900.s1803_count_pairs_with_xor_in_a_range
g1801_1900.s1805_number_of_different_integers_in_a_string
g1801_1900.s1806_minimum_number_of_operations_to_reinitialize_a_permutation
g1801_1900.s1807_evaluate_the_bracket_pairs_of_a_string
g1801_1900.s1808_maximize_number_of_nice_divisors
g1801_1900.s1812_determine_color_of_a_chessboard_square
g1801_1900.s1813_sentence_similarity_iii
g1801_1900.s1814_count_nice_pairs_in_an_array
g1801_1900.s1814_count_nice_pairs_in_an_array.g1801_1900.s1814_count_nice_pairs_in_an_array.Solution
g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts
g1801_1900.s1816_truncate_sentence
g1801_1900.s1817_finding_the_users_active_minutes
g1801_1900.s1818_minimum_absolute_sum_difference
g1801_1900.s1819_number_of_different_subsequences_gcds
g1801_1900.s1822_sign_of_the_product_of_an_array
g1801_1900.s1823_find_the_winner_of_the_circular_game
g1801_1900.s1824_minimum_sideway_jumps
g1801_1900.s1825_finding_mk_average
g1801_1900.s1827_minimum_operations_to_make_the_array_increasing
g1801_1900.s1828_queries_on_number_of_points_inside_a_circle
g1801_1900.s1829_maximum_xor_for_each_query
g1801_1900.s1830_minimum_number_of_operations_to_make_string_sorted
g1801_1900.s1832_check_if_the_sentence_is_pangram
g1801_1900.s1833_maximum_ice_cream_bars
g1801_1900.s1834_single_threaded_cpu
g1801_1900.s1835_find_xor_sum_of_all_pairs_bitwise_and
g1801_1900.s1837_sum_of_digits_in_base_k
g1801_1900.s1838_frequency_of_the_most_frequent_element
g1801_1900.s1839_longest_substring_of_all_vowels_in_order
g1801_1900.s1840_maximum_building_height
g1801_1900.s1844_replace_all_digits_with_characters
g1801_1900.s1845_seat_reservation_manager
g1801_1900.s1846_maximum_element_after_decreasing_and_rearranging
g1801_1900.s1847_closest_room
g1801_1900.s1848_minimum_distance_to_the_target_element
g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values
g1801_1900.s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number
g1801_1900.s1851_minimum_interval_to_include_each_query
g1801_1900.s1854_maximum_population_year
g1801_1900.s1855_maximum_distance_between_a_pair_of_values
g1801_1900.s1856_maximum_subarray_min_product
g1801_1900.s1856_maximum_subarray_min_product.g1801_1900.s1856_maximum_subarray_min_product.Solution
g1801_1900.s1857_largest_color_value_in_a_directed_graph
g1801_1900.s1859_sorting_the_sentence
g1801_1900.s1860_incremental_memory_leak
g1801_1900.s1861_rotating_the_box
g1801_1900.s1862_sum_of_floored_pairs
g1801_1900.s1863_sum_of_all_subset_xor_totals
g1801_1900.s1863_sum_of_all_subset_xor_totals.g1801_1900.s1863_sum_of_all_subset_xor_totals.Solution
g1801_1900.s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating
g1801_1900.s1865_finding_pairs_with_a_certain_sum
g1801_1900.s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible
g1801_1900.s1869_longer_contiguous_segments_of_ones_than_zeros
g1801_1900.s1870_minimum_speed_to_arrive_on_time
g1801_1900.s1871_jump_game_vii
g1801_1900.s1872_stone_game_viii
g1801_1900.s1873_calculate_special_bonus
g1801_1900.s1876_substrings_of_size_three_with_distinct_characters
g1801_1900.s1877_minimize_maximum_pair_sum_in_array
g1801_1900.s1878_get_biggest_three_rhombus_sums_in_a_grid
g1801_1900.s1879_minimum_xor_sum_of_two_arrays
g1801_1900.s1880_check_if_word_equals_summation_of_two_words
g1801_1900.s1881_maximum_value_after_insertion
g1801_1900.s1882_process_tasks_using_servers
g1801_1900.s1883_minimum_skips_to_arrive_at_meeting_on_time
g1801_1900.s1884_egg_drop_with_2_eggs_and_n_floors
g1801_1900.s1886_determine_whether_matrix_can_be_obtained_by_rotation
g1801_1900.s1887_reduction_operations_to_make_the_array_elements_equal
g1801_1900.s1888_minimum_number_of_flips_to_make_the_binary_string_alternating
g1801_1900.s1889_minimum_space_wasted_from_packaging
g1801_1900.s1890_the_latest_login_in_2020
g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered
g1801_1900.s1894_find_the_student_that_will_replace_the_chalk
g1801_1900.s1895_largest_magic_square
g1801_1900.s1896_minimum_cost_to_change_the_final_value_of_expression
g1801_1900.s1897_redistribute_characters_to_make_all_strings_equal
g1801_1900.s1898_maximum_number_of_removable_characters
g1801_1900.s1899_merge_triplets_to_form_target_triplet
g1801_1900.s1900_the_earliest_and_latest_rounds_where_players_compete
g1901_2000.s1901_find_a_peak_element_ii
g1901_2000.s1903_largest_odd_number_in_string
g1901_2000.s1903_largest_odd_number_in_string.g1901_2000.s1903_largest_odd_number_in_string.Solution
g1901_2000.s1904_the_number_of_full_rounds_you_have_played
g1901_2000.s1905_count_sub_islands
g1901_2000.s1906_minimum_absolute_difference_queries
g1901_2000.s1907_count_salary_categories
g1901_2000.s1909_remove_one_element_to_make_the_array_strictly_increasing
g1901_2000.s1910_remove_all_occurrences_of_a_substring
g1901_2000.s1911_maximum_alternating_subsequence_sum
g1901_2000.s1912_design_movie_rental_system
g1901_2000.s1913_maximum_product_difference_between_two_pairs
g1901_2000.s1914_cyclically_rotating_a_grid
g1901_2000.s1915_number_of_wonderful_substrings
g1901_2000.s1916_count_ways_to_build_rooms_in_an_ant_colony
g1901_2000.s1920_build_array_from_permutation
g1901_2000.s1920_build_array_from_permutation.g1901_2000.s1920_build_array_from_permutation.Solution
g1901_2000.s1921_eliminate_maximum_number_of_monsters
g1901_2000.s1922_count_good_numbers
g1901_2000.s1923_longest_common_subpath
g1901_2000.s1925_count_square_sum_triples
g1901_2000.s1926_nearest_exit_from_entrance_in_maze
g1901_2000.s1927_sum_game
g1901_2000.s1928_minimum_cost_to_reach_destination_in_time
g1901_2000.s1929_concatenation_of_array
g1901_2000.s1930_unique_length_3_palindromic_subsequences
g1901_2000.s1931_painting_a_grid_with_three_different_colors
g1901_2000.s1932_merge_bsts_to_create_single_bst
g1901_2000.s1934_confirmation_rate
g1901_2000.s1935_maximum_number_of_words_you_can_type
g1901_2000.s1936_add_minimum_number_of_rungs
g1901_2000.s1937_maximum_number_of_points_with_cost
g1901_2000.s1938_maximum_genetic_difference_query
g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences
g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair
g1901_2000.s1943_describe_the_painting
g1901_2000.s1944_number_of_visible_people_in_a_queue
g1901_2000.s1945_sum_of_digits_of_string_after_convert
g1901_2000.s1946_largest_number_after_mutating_substring
g1901_2000.s1947_maximum_compatibility_score_sum
g1901_2000.s1948_delete_duplicate_folders_in_system
g1901_2000.s1952_three_divisors
g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work
g1901_2000.s1954_minimum_garden_perimeter_to_collect_enough_apples
g1901_2000.s1955_count_number_of_special_subsequences
g1901_2000.s1957_delete_characters_to_make_fancy_string
g1901_2000.s1958_check_if_move_is_legal
g1901_2000.s1959_minimum_total_space_wasted_with_k_resizing_operations
g1901_2000.s1960_maximum_product_of_the_length_of_two_palindromic_substrings
g1901_2000.s1961_check_if_string_is_a_prefix_of_array
g1901_2000.s1962_remove_stones_to_minimize_the_total
g1901_2000.s1963_minimum_number_of_swaps_to_make_the_string_balanced
g1901_2000.s1964_find_the_longest_valid_obstacle_course_at_each_position
g1901_2000.s1965_employees_with_missing_information
g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word
g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors
g1901_2000.s1969_minimum_non_zero_product_of_the_array_elements
g1901_2000.s1970_last_day_where_you_can_still_cross
g1901_2000.s1971_find_if_path_exists_in_graph
g1901_2000.s1971_find_if_path_exists_in_graph.g1901_2000.s1971_find_if_path_exists_in_graph.Solution
g1901_2000.s1974_minimum_time_to_type_word_using_special_typewriter
g1901_2000.s1975_maximum_matrix_sum
g1901_2000.s1976_number_of_ways_to_arrive_at_destination
g1901_2000.s1977_number_of_ways_to_separate_numbers
g1901_2000.s1978_employees_whose_manager_left_the_company
g1901_2000.s1979_find_greatest_common_divisor_of_array
g1901_2000.s1980_find_unique_binary_string
g1901_2000.s1981_minimize_the_difference_between_target_and_chosen_elements
g1901_2000.s1982_find_array_given_subset_sums
g1901_2000.s1982_find_array_given_subset_sums.g1901_2000.s1982_find_array_given_subset_sums.Solution
g1901_2000.s1984_minimum_difference_between_highest_and_lowest_of_k_scores
g1901_2000.s1985_find_the_kth_largest_integer_in_the_array
g1901_2000.s1986_minimum_number_of_work_sessions_to_finish_the_tasks
g1901_2000.s1987_number_of_unique_good_subsequences
g1901_2000.s1991_find_the_middle_index_in_array
g1901_2000.s1992_find_all_groups_of_farmland
g1901_2000.s1993_operations_on_tree
g1901_2000.s1994_the_number_of_good_subsets
g1901_2000.s1995_count_special_quadruplets
g1901_2000.s1996_the_number_of_weak_characters_in_the_game
g1901_2000.s1997_first_day_where_you_have_been_in_all_the_rooms
g1901_2000.s1998_gcd_sort_of_an_array
g1901_2000.s2000_reverse_prefix_of_word
g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles
g2001_2100.s2002_maximum_product_of_the_length_of_two_palindromic_subsequences
g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree
g2001_2100.s2006_count_number_of_pairs_with_absolute_difference_k
g2001_2100.s2007_find_original_array_from_doubled_array
g2001_2100.s2008_maximum_earnings_from_taxi
g2001_2100.s2009_minimum_number_of_operations_to_make_array_continuous
g2001_2100.s2011_final_value_of_variable_after_performing_operations
g2001_2100.s2012_sum_of_beauty_in_the_array
g2001_2100.s2013_detect_squares
g2001_2100.s2014_longest_subsequence_repeated_k_times
g2001_2100.s2016_maximum_difference_between_increasing_elements
g2001_2100.s2017_grid_game
g2001_2100.s2018_check_if_word_can_be_placed_in_crossword
g2001_2100.s2019_the_score_of_students_solving_math_expression
g2001_2100.s2022_convert_1d_array_into_2d_array
g2001_2100.s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target
g2001_2100.s2024_maximize_the_confusion_of_an_exam
g2001_2100.s2025_maximum_number_of_ways_to_partition_an_array
g2001_2100.s2027_minimum_moves_to_convert_string
g2001_2100.s2028_find_missing_observations
g2001_2100.s2029_stone_game_ix
g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter
g2001_2100.s2032_two_out_of_three
g2001_2100.s2033_minimum_operations_to_make_a_uni_value_grid
g2001_2100.s2034_stock_price_fluctuation
g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference
g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone
g2001_2100.s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color
g2001_2100.s2039_the_time_when_the_network_becomes_idle
g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays
g2001_2100.s2042_check_if_numbers_are_ascending_in_a_sentence
g2001_2100.s2043_simple_bank_system
g2001_2100.s2044_count_number_of_maximum_bitwise_or_subsets
g2001_2100.s2045_second_minimum_time_to_reach_destination
g2001_2100.s2047_number_of_valid_words_in_a_sentence
g2001_2100.s2048_next_greater_numerically_balanced_number
g2001_2100.s2049_count_nodes_with_the_highest_score
g2001_2100.s2050_parallel_courses_iii
g2001_2100.s2053_kth_distinct_string_in_an_array
g2001_2100.s2054_two_best_non_overlapping_events
g2001_2100.s2055_plates_between_candles
g2001_2100.s2056_number_of_valid_move_combinations_on_chessboard
g2001_2100.s2057_smallest_index_with_equal_value
g2001_2100.s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points
g2001_2100.s2059_minimum_operations_to_convert_number
g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings
g2001_2100.s2062_count_vowel_substrings_of_a_string
g2001_2100.s2063_vowels_of_all_substrings
g2001_2100.s2064_minimized_maximum_of_products_distributed_to_any_store
g2001_2100.s2065_maximum_path_quality_of_a_graph
g2001_2100.s2068_check_whether_two_strings_are_almost_equivalent
g2001_2100.s2069_walking_robot_simulation_ii
g2001_2100.s2070_most_beautiful_item_for_each_query
g2001_2100.s2071_maximum_number_of_tasks_you_can_assign
g2001_2100.s2073_time_needed_to_buy_tickets
g2001_2100.s2074_reverse_nodes_in_even_length_groups
g2001_2100.s2075_decode_the_slanted_ciphertext
g2001_2100.s2076_process_restricted_friend_requests
g2001_2100.s2078_two_furthest_houses_with_different_colors
g2001_2100.s2079_watering_plants
g2001_2100.s2080_range_frequency_queries
g2001_2100.s2081_sum_of_k_mirror_numbers
g2001_2100.s2085_count_common_words_with_one_occurrence
g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses
g2001_2100.s2087_minimum_cost_homecoming_of_a_robot_in_a_grid
g2001_2100.s2088_count_fertile_pyramids_in_a_land
g2001_2100.s2089_find_target_indices_after_sorting_array
g2001_2100.s2090_k_radius_subarray_averages
g2001_2100.s2091_removing_minimum_and_maximum_from_array
g2001_2100.s2092_find_all_people_with_secret
g2001_2100.s2094_finding_3_digit_even_numbers
g2001_2100.s2094_finding_3_digit_even_numbers.g2001_2100.s2094_finding_3_digit_even_numbers.Solution
g2001_2100.s2095_delete_the_middle_node_of_a_linked_list
g2001_2100.s2096_step_by_step_directions_from_a_binary_tree_node_to_another
g2001_2100.s2097_valid_arrangement_of_pairs
g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum
g2001_2100.s2100_find_good_days_to_rob_the_bank
g2101_2200.s2101_detonate_the_maximum_bombs
g2101_2200.s2102_sequentially_ordinal_rank_tracker
g2101_2200.s2103_rings_and_rods
g2101_2200.s2104_sum_of_subarray_ranges
g2101_2200.s2105_watering_plants_ii
g2101_2200.s2106_maximum_fruits_harvested_after_at_most_k_steps
g2101_2200.s2108_find_first_palindromic_string_in_the_array
g2101_2200.s2109_adding_spaces_to_a_string
g2101_2200.s2110_number_of_smooth_descent_periods_of_a_stock
g2101_2200.s2111_minimum_operations_to_make_the_array_k_increasing
g2101_2200.s2114_maximum_number_of_words_found_in_sentences
g2101_2200.s2115_find_all_possible_recipes_from_given_supplies
g2101_2200.s2116_check_if_a_parentheses_string_can_be_valid
g2101_2200.s2117_abbreviating_the_product_of_a_range
g2101_2200.s2119_a_number_after_a_double_reversal
g2101_2200.s2120_execution_of_all_suffix_instructions_staying_in_a_grid
g2101_2200.s2121_intervals_between_identical_elements
g2101_2200.s2122_recover_the_original_array
g2101_2200.s2124_check_if_all_as_appears_before_all_bs
g2101_2200.s2125_number_of_laser_beams_in_a_bank
g2101_2200.s2126_destroying_asteroids
g2101_2200.s2127_maximum_employees_to_be_invited_to_a_meeting
g2101_2200.s2129_capitalize_the_title
g2101_2200.s2130_maximum_twin_sum_of_a_linked_list
g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words
g2101_2200.s2132_stamping_the_grid
g2101_2200.s2133_check_if_every_row_and_column_contains_all_numbers
g2101_2200.s2134_minimum_swaps_to_group_all_1s_together_ii
g2101_2200.s2135_count_words_obtained_after_adding_a_letter
g2101_2200.s2136_earliest_possible_day_of_full_bloom
g2101_2200.s2138_divide_a_string_into_groups_of_size_k
g2101_2200.s2139_minimum_moves_to_reach_target_score
g2101_2200.s2140_solving_questions_with_brainpower
g2101_2200.s2141_maximum_running_time_of_n_computers
g2101_2200.s2144_minimum_cost_of_buying_candies_with_discount
g2101_2200.s2145_count_the_hidden_sequences
g2101_2200.s2146_k_highest_ranked_items_within_a_price_range
g2101_2200.s2147_number_of_ways_to_divide_a_long_corridor
g2101_2200.s2148_count_elements_with_strictly_smaller_and_greater_elements
g2101_2200.s2149_rearrange_array_elements_by_sign
g2101_2200.s2150_find_all_lonely_numbers_in_the_array
g2101_2200.s2151_maximum_good_people_based_on_statements
g2101_2200.s2154_keep_multiplying_found_values_by_two
g2101_2200.s2155_all_divisions_with_the_highest_score_of_a_binary_array
g2101_2200.s2156_find_substring_with_given_hash_value
g2101_2200.s2157_groups_of_strings
g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits
g2101_2200.s2161_partition_array_according_to_given_pivot
g2101_2200.s2162_minimum_cost_to_set_cooking_time
g2101_2200.s2163_minimum_difference_in_sums_after_removal_of_elements
g2101_2200.s2164_sort_even_and_odd_indices_independently
g2101_2200.s2165_smallest_value_of_the_rearranged_number
g2101_2200.s2166_design_bitset
g2101_2200.s2167_minimum_time_to_remove_all_cars_containing_illegal_goods
g2101_2200.s2169_count_operations_to_obtain_zero
g2101_2200.s2170_minimum_operations_to_make_the_array_alternating
g2101_2200.s2171_removing_minimum_number_of_magic_beans
g2101_2200.s2172_maximum_and_sum_of_array
g2101_2200.s2176_count_equal_and_divisible_pairs_in_an_array
g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number
g2101_2200.s2178_maximum_split_of_positive_even_integers
g2101_2200.s2179_count_good_triplets_in_an_array
g2101_2200.s2180_count_integers_with_even_digit_sum
g2101_2200.s2181_merge_nodes_in_between_zeros
g2101_2200.s2181_merge_nodes_in_between_zeros.g2101_2200.s2181_merge_nodes_in_between_zeros.Solution
g2101_2200.s2182_construct_string_with_repeat_limit
g2101_2200.s2183_count_array_pairs_divisible_by_k
g2101_2200.s2185_counting_words_with_a_given_prefix
g2101_2200.s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii
g2101_2200.s2187_minimum_time_to_complete_trips
g2101_2200.s2188_minimum_time_to_finish_the_race
g2101_2200.s2190_most_frequent_number_following_key_in_an_array
g2101_2200.s2191_sort_the_jumbled_numbers
g2101_2200.s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph
g2101_2200.s2193_minimum_number_of_moves_to_make_palindrome
g2101_2200.s2194_cells_in_a_range_on_an_excel_sheet
g2101_2200.s2195_append_k_integers_with_minimal_sum
g2101_2200.s2196_create_binary_tree_from_descriptions
g2101_2200.s2197_replace_non_coprime_numbers_in_array
g2101_2200.s2200_find_all_k_distant_indices_in_an_array
g2201_2300.s2201_count_artifacts_that_can_be_extracted
g2201_2300.s2202_maximize_the_topmost_element_after_k_moves
g2201_2300.s2203_minimum_weighted_subgraph_with_the_required_paths
g2201_2300.s2206_divide_array_into_equal_pairs
g2201_2300.s2207_maximize_number_of_subsequences_in_a_string
g2201_2300.s2208_minimum_operations_to_halve_array_sum
g2201_2300.s2209_minimum_white_tiles_after_covering_with_carpets
g2201_2300.s2210_count_hills_and_valleys_in_an_array
g2201_2300.s2211_count_collisions_on_a_road
g2201_2300.s2212_maximum_points_in_an_archery_competition
g2201_2300.s2213_longest_substring_of_one_repeating_character
g2201_2300.s2215_find_the_difference_of_two_arrays
g2201_2300.s2216_minimum_deletions_to_make_array_beautiful
g2201_2300.s2217_find_palindrome_with_fixed_length
g2201_2300.s2218_maximum_value_of_k_coins_from_piles
g2201_2300.s2220_minimum_bit_flips_to_convert_number
g2201_2300.s2221_find_triangular_sum_of_an_array
g2201_2300.s2222_number_of_ways_to_select_buildings
g2201_2300.s2223_sum_of_scores_of_built_strings
g2201_2300.s2224_minimum_number_of_operations_to_convert_time
g2201_2300.s2225_find_players_with_zero_or_one_losses
g2201_2300.s2226_maximum_candies_allocated_to_k_children
g2201_2300.s2227_encrypt_and_decrypt_strings
g2201_2300.s2231_largest_number_after_digit_swaps_by_parity
g2201_2300.s2232_minimize_result_by_adding_parentheses_to_expression
g2201_2300.s2233_maximum_product_after_k_increments
g2201_2300.s2234_maximum_total_beauty_of_the_gardens
g2201_2300.s2235_add_two_integers
g2201_2300.s2236_root_equals_sum_of_children
g2201_2300.s2239_find_closest_number_to_zero
g2201_2300.s2240_number_of_ways_to_buy_pens_and_pencils
g2201_2300.s2241_design_an_atm_machine
g2201_2300.s2242_maximum_score_of_a_node_sequence
g2201_2300.s2243_calculate_digit_sum_of_a_string
g2201_2300.s2244_minimum_rounds_to_complete_all_tasks
g2201_2300.s2245_maximum_trailing_zeros_in_a_cornered_path
g2201_2300.s2246_longest_path_with_different_adjacent_characters
g2201_2300.s2248_intersection_of_multiple_arrays
g2201_2300.s2249_count_lattice_points_inside_a_circle
g2201_2300.s2250_count_number_of_rectangles_containing_each_point
g2201_2300.s2251_number_of_flowers_in_full_bloom
g2201_2300.s2255_count_prefixes_of_a_given_string
g2201_2300.s2256_minimum_average_difference
g2201_2300.s2257_count_unguarded_cells_in_the_grid
g2201_2300.s2258_escape_the_spreading_fire
g2201_2300.s2259_remove_digit_from_number_to_maximize_result
g2201_2300.s2260_minimum_consecutive_cards_to_pick_up
g2201_2300.s2261_k_divisible_elements_subarrays
g2201_2300.s2262_total_appeal_of_a_string
g2201_2300.s2264_largest_3_same_digit_number_in_string
g2201_2300.s2265_count_nodes_equal_to_average_of_subtree
g2201_2300.s2266_count_number_of_texts
g2201_2300.s2267_check_if_there_is_a_valid_parentheses_string_path
g2201_2300.s2269_find_the_k_beauty_of_a_number
g2201_2300.s2270_number_of_ways_to_split_array
g2201_2300.s2271_maximum_white_tiles_covered_by_a_carpet
g2201_2300.s2272_substring_with_largest_variance
g2201_2300.s2273_find_resultant_array_after_removing_anagrams
g2201_2300.s2274_maximum_consecutive_floors_without_special_floors
g2201_2300.s2275_largest_combination_with_bitwise_and_greater_than_zero
g2201_2300.s2276_count_integers_in_intervals
g2201_2300.s2278_percentage_of_letter_in_string
g2201_2300.s2279_maximum_bags_with_full_capacity_of_rocks
g2201_2300.s2280_minimum_lines_to_represent_a_line_chart
g2201_2300.s2281_sum_of_total_strength_of_wizards
g2201_2300.s2283_check_if_number_has_equal_digit_count_and_digit_value
g2201_2300.s2284_sender_with_largest_word_count
g2201_2300.s2285_maximum_total_importance_of_roads
g2201_2300.s2286_booking_concert_tickets_in_groups
g2201_2300.s2287_rearrange_characters_to_make_target_string
g2201_2300.s2288_apply_discount_to_prices
g2201_2300.s2289_steps_to_make_array_non_decreasing
g2201_2300.s2290_minimum_obstacle_removal_to_reach_corner
g2201_2300.s2293_min_max_game
g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k
g2201_2300.s2295_replace_elements_in_an_array
g2201_2300.s2295_replace_elements_in_an_array.g2201_2300.s2295_replace_elements_in_an_array.Solution
g2201_2300.s2296_design_a_text_editor
g2201_2300.s2299_strong_password_checker_ii
g2201_2300.s2300_successful_pairs_of_spells_and_potions
g2301_2400.s2301_match_substring_after_replacement
g2301_2400.s2302_count_subarrays_with_score_less_than_k
g2301_2400.s2303_calculate_amount_paid_in_taxes
g2301_2400.s2304_minimum_path_cost_in_a_grid
g2301_2400.s2305_fair_distribution_of_cookies
g2301_2400.s2305_fair_distribution_of_cookies.g2301_2400.s2305_fair_distribution_of_cookies.Solution
g2301_2400.s2306_naming_a_company
g2301_2400.s2309_greatest_english_letter_in_upper_and_lower_case
g2301_2400.s2310_sum_of_numbers_with_units_digit_k
g2301_2400.s2311_longest_binary_subsequence_less_than_or_equal_to_k
g2301_2400.s2312_selling_pieces_of_wood
g2301_2400.s2315_count_asterisks
g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph
g2301_2400.s2317_maximum_xor_after_operations
g2301_2400.s2317_maximum_xor_after_operations.g2301_2400.s2317_maximum_xor_after_operations.Solution
g2301_2400.s2318_number_of_distinct_roll_sequences
g2301_2400.s2319_check_if_matrix_is_x_matrix
g2301_2400.s2320_count_number_of_ways_to_place_houses
g2301_2400.s2321_maximum_score_of_spliced_array
g2301_2400.s2322_minimum_score_after_removals_on_a_tree
g2301_2400.s2325_decode_the_message
g2301_2400.s2326_spiral_matrix_iv
g2301_2400.s2327_number_of_people_aware_of_a_secret
g2301_2400.s2328_number_of_increasing_paths_in_a_grid
g2301_2400.s2331_evaluate_boolean_binary_tree
g2301_2400.s2331_evaluate_boolean_binary_tree.g2301_2400.s2331_evaluate_boolean_binary_tree.Solution
g2301_2400.s2332_the_latest_time_to_catch_a_bus
g2301_2400.s2333_minimum_sum_of_squared_difference
g2301_2400.s2334_subarray_with_elements_greater_than_varying_threshold
g2301_2400.s2335_minimum_amount_of_time_to_fill_cups
g2301_2400.s2336_smallest_number_in_infinite_set
g2301_2400.s2337_move_pieces_to_obtain_a_string
g2301_2400.s2338_count_the_number_of_ideal_arrays
g2301_2400.s2341_maximum_number_of_pairs_in_array
g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits
g2301_2400.s2343_query_kth_smallest_trimmed_number
g2301_2400.s2344_minimum_deletions_to_make_array_divisible
g2301_2400.s2347_best_poker_hand
g2301_2400.s2348_number_of_zero_filled_subarrays
g2301_2400.s2349_design_a_number_container_system
g2301_2400.s2350_shortest_impossible_sequence_of_rolls
g2301_2400.s2351_first_letter_to_appear_twice
g2301_2400.s2351_first_letter_to_appear_twice.g2301_2400.s2351_first_letter_to_appear_twice.Solution
g2301_2400.s2352_equal_row_and_column_pairs
g2301_2400.s2353_design_a_food_rating_system
g2301_2400.s2354_number_of_excellent_pairs
g2301_2400.s2356_number_of_unique_subjects_taught_by_each_teacher
g2301_2400.s2357_make_array_zero_by_subtracting_equal_amounts
g2301_2400.s2358_maximum_number_of_groups_entering_a_competition
g2301_2400.s2359_find_closest_node_to_given_two_nodes
g2301_2400.s2360_longest_cycle_in_a_graph
g2301_2400.s2363_merge_similar_items
g2301_2400.s2364_count_number_of_bad_pairs
g2301_2400.s2365_task_scheduler_ii
g2301_2400.s2366_minimum_replacements_to_sort_the_array
g2301_2400.s2367_number_of_arithmetic_triplets
g2301_2400.s2368_reachable_nodes_with_restrictions
g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array
g2301_2400.s2370_longest_ideal_subsequence
g2301_2400.s2373_largest_local_values_in_a_matrix
g2301_2400.s2374_node_with_highest_edge_score
g2301_2400.s2374_node_with_highest_edge_score.g2301_2400.s2374_node_with_highest_edge_score.Solution
g2301_2400.s2375_construct_smallest_number_from_di_string
g2301_2400.s2376_count_special_integers
g2301_2400.s2379_minimum_recolors_to_get_k_consecutive_black_blocks
g2301_2400.s2380_time_needed_to_rearrange_a_binary_string
g2301_2400.s2381_shifting_letters_ii
g2301_2400.s2382_maximum_segment_sum_after_removals
g2301_2400.s2383_minimum_hours_of_training_to_win_a_competition
g2301_2400.s2384_largest_palindromic_number
g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected
g2301_2400.s2386_find_the_k_sum_of_an_array
g2301_2400.s2389_longest_subsequence_with_limited_sum
g2301_2400.s2390_removing_stars_from_a_string
g2301_2400.s2390_removing_stars_from_a_string.g2301_2400.s2390_removing_stars_from_a_string.Solution
g2301_2400.s2391_minimum_amount_of_time_to_collect_garbage
g2301_2400.s2392_build_a_matrix_with_conditions
g2301_2400.s2395_find_subarrays_with_equal_sum
g2301_2400.s2396_strictly_palindromic_number
g2301_2400.s2397_maximum_rows_covered_by_columns
g2301_2400.s2398_maximum_number_of_robots_within_budget
g2301_2400.s2399_check_distances_between_same_letters
g2301_2400.s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps
g2401_2500.s2401_longest_nice_subarray
g2401_2500.s2402_meeting_rooms_iii
g2401_2500.s2404_most_frequent_even_element
g2401_2500.s2405_optimal_partition_of_string
g2401_2500.s2406_divide_intervals_into_minimum_number_of_groups
g2401_2500.s2407_longest_increasing_subsequence_ii
g2401_2500.s2409_count_days_spent_together
g2401_2500.s2410_maximum_matching_of_players_with_trainers
g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or
g2401_2500.s2412_minimum_money_required_before_transactions
g2401_2500.s2413_smallest_even_multiple
g2401_2500.s2414_length_of_the_longest_alphabetical_continuous_substring
g2401_2500.s2415_reverse_odd_levels_of_binary_tree
g2401_2500.s2416_sum_of_prefix_scores_of_strings
g2401_2500.s2418_sort_the_people
g2401_2500.s2419_longest_subarray_with_maximum_bitwise_and
g2401_2500.s2420_find_all_good_indices
g2401_2500.s2421_number_of_good_paths
g2401_2500.s2423_remove_letter_to_equalize_frequency
g2401_2500.s2424_longest_uploaded_prefix
g2401_2500.s2425_bitwise_xor_of_all_pairings
g2401_2500.s2426_number_of_pairs_satisfying_inequality
g2401_2500.s2427_number_of_common_factors
g2401_2500.s2428_maximum_sum_of_an_hourglass
g2401_2500.s2429_minimize_xor
g2401_2500.s2430_maximum_deletions_on_a_string
g2401_2500.s2432_the_employee_that_worked_on_the_longest_task
g2401_2500.s2433_find_the_original_array_of_prefix_xor
g2401_2500.s2434_using_a_robot_to_print_the_lexicographically_smallest_string
g2401_2500.s2435_paths_in_matrix_whose_sum_is_divisible_by_k
g2401_2500.s2437_number_of_valid_clock_times
g2401_2500.s2438_range_product_queries_of_powers
g2401_2500.s2439_minimize_maximum_of_array
g2401_2500.s2440_create_components_with_same_value
g2401_2500.s2441_largest_positive_integer_that_exists_with_its_negative
g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations
g2401_2500.s2443_sum_of_number_and_its_reverse
g2401_2500.s2444_count_subarrays_with_fixed_bounds
g2401_2500.s2446_determine_if_two_events_have_conflict
g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k
g2401_2500.s2448_minimum_cost_to_make_array_equal
g2401_2500.s2449_minimum_number_of_operations_to_make_arrays_similar
g2401_2500.s2451_odd_string_difference
g2401_2500.s2452_words_within_two_edits_of_dictionary
g2401_2500.s2453_destroy_sequential_targets
g2401_2500.s2454_next_greater_element_iv
g2401_2500.s2455_average_value_of_even_numbers_that_are_divisible_by_three
g2401_2500.s2456_most_popular_video_creator
g2401_2500.s2457_minimum_addition_to_make_integer_beautiful
g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries
g2401_2500.s2460_apply_operations_to_an_array
g2401_2500.s2460_apply_operations_to_an_array.g2401_2500.s2460_apply_operations_to_an_array.Solution
g2401_2500.s2461_maximum_sum_of_distinct_subarrays_with_length_k
g2401_2500.s2462_total_cost_to_hire_k_workers
g2401_2500.s2462_total_cost_to_hire_k_workers.g2401_2500.s2462_total_cost_to_hire_k_workers.Solution
g2401_2500.s2463_minimum_total_distance_traveled
g2401_2500.s2465_number_of_distinct_averages
g2401_2500.s2466_count_ways_to_build_good_strings
g2401_2500.s2467_most_profitable_path_in_a_tree
g2401_2500.s2468_split_message_based_on_limit
g2401_2500.s2468_split_message_based_on_limit.g2401_2500.s2468_split_message_based_on_limit.Solution
g2401_2500.s2469_convert_the_temperature
g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k
g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level
g2401_2500.s2472_maximum_number_of_non_overlapping_palindrome_substrings
g2401_2500.s2475_number_of_unequal_triplets_in_array
g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree
g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital
g2401_2500.s2478_number_of_beautiful_partitions
g2401_2500.s2481_minimum_cuts_to_divide_a_circle
g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column
g2401_2500.s2483_minimum_penalty_for_a_shop
g2401_2500.s2484_count_palindromic_subsequences
g2401_2500.s2485_find_the_pivot_integer
g2401_2500.s2486_append_characters_to_string_to_make_subsequence
g2401_2500.s2487_remove_nodes_from_linked_list
g2401_2500.s2488_count_subarrays_with_median_k
g2401_2500.s2490_circular_sentence
g2401_2500.s2491_divide_players_into_teams_of_equal_skill
g2401_2500.s2492_minimum_score_of_a_path_between_two_cities
g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups
g2401_2500.s2496_maximum_value_of_a_string_in_an_array
g2401_2500.s2497_maximum_star_sum_of_a_graph
g2401_2500.s2498_frog_jump_ii
g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal
g2401_2500.s2500_delete_greatest_value_in_each_row
g2501_2600.s2501_longest_square_streak_in_an_array
g2501_2600.s2502_design_memory_allocator
g2501_2600.s2503_maximum_number_of_points_from_grid_queries
g2501_2600.s2506_count_pairs_of_similar_strings
g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors
g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even
g2501_2600.s2509_cycle_length_queries_in_a_tree
g2501_2600.s2511_maximum_enemy_forts_that_can_be_captured
g2501_2600.s2512_reward_top_k_students
g2501_2600.s2513_minimize_the_maximum_of_two_arrays
g2501_2600.s2514_count_anagrams
g2501_2600.s2515_shortest_distance_to_target_string_in_a_circular_array
g2501_2600.s2516_take_k_of_each_character_from_left_and_right
g2501_2600.s2517_maximum_tastiness_of_candy_basket
g2501_2600.s2518_number_of_great_partitions
g2501_2600.s2520_count_the_digits_that_divide_a_number
g2501_2600.s2521_distinct_prime_factors_of_product_of_array
g2501_2600.s2522_partition_string_into_substrings_with_values_at_most_k
g2501_2600.s2523_closest_prime_numbers_in_range
g2501_2600.s2525_categorize_box_according_to_criteria
g2501_2600.s2526_find_consecutive_integers_from_a_data_stream
g2501_2600.s2527_find_xor_beauty_of_array
g2501_2600.s2528_maximize_the_minimum_powered_city
g2501_2600.s2529_maximum_count_of_positive_integer_and_negative_integer
g2501_2600.s2530_maximal_score_after_applying_k_operations
g2501_2600.s2531_make_number_of_distinct_characters_equal
g2501_2600.s2532_time_to_cross_a_bridge
g2501_2600.s2535_difference_between_element_sum_and_digit_sum_of_an_array
g2501_2600.s2536_increment_submatrices_by_one
g2501_2600.s2536_increment_submatrices_by_one.g2501_2600.s2536_increment_submatrices_by_one.Solution
g2501_2600.s2537_count_the_number_of_good_subarrays
g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum
g2501_2600.s2540_minimum_common_value
g2501_2600.s2541_minimum_operations_to_make_array_equal_ii
g2501_2600.s2542_maximum_subsequence_score
g2501_2600.s2543_check_if_point_is_reachable
g2501_2600.s2544_alternating_digit_sum
g2501_2600.s2545_sort_the_students_by_their_kth_score
g2501_2600.s2546_apply_bitwise_operations_to_make_strings_equal
g2501_2600.s2547_minimum_cost_to_split_an_array
g2501_2600.s2549_count_distinct_numbers_on_board
g2501_2600.s2550_count_collisions_of_monkeys_on_a_polygon
g2501_2600.s2551_put_marbles_in_bags
g2501_2600.s2552_count_increasing_quadruplets
g2501_2600.s2552_count_increasing_quadruplets.g2501_2600.s2552_count_increasing_quadruplets.Solution
g2501_2600.s2553_separate_the_digits_in_an_array
g2501_2600.s2554_maximum_number_of_integers_to_choose_from_a_range_i
g2501_2600.s2555_maximize_win_from_two_segments
g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip
g2501_2600.s2558_take_gifts_from_the_richest_pile
g2501_2600.s2559_count_vowel_strings_in_ranges
g2501_2600.s2560_house_robber_iv
g2501_2600.s2561_rearranging_fruits
g2501_2600.s2562_find_the_array_concatenation_value
g2501_2600.s2563_count_the_number_of_fair_pairs
g2501_2600.s2564_substring_xor_queries
g2501_2600.s2565_subsequence_with_the_minimum_score
g2501_2600.s2566_maximum_difference_by_remapping_a_digit
g2501_2600.s2567_minimum_score_by_changing_two_elements
g2501_2600.s2568_minimum_impossible_or
g2501_2600.s2569_handling_sum_queries_after_update
g2501_2600.s2570_merge_two_2d_arrays_by_summing_values
g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0
g2501_2600.s2572_count_the_number_of_square_free_subsets
g2501_2600.s2573_find_the_string_with_lcp
g2501_2600.s2574_left_and_right_sum_differences
g2501_2600.s2575_find_the_divisibility_array_of_a_string
g2501_2600.s2576_find_the_maximum_number_of_marked_indices
g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid
g2501_2600.s2578_split_with_minimum_sum
g2501_2600.s2579_count_total_number_of_colored_cells
g2501_2600.s2580_count_ways_to_group_overlapping_ranges
g2501_2600.s2581_count_number_of_possible_root_nodes
g2501_2600.s2582_pass_the_pillow
g2501_2600.s2583_kth_largest_sum_in_a_binary_tree
g2501_2600.s2584_split_the_array_to_make_coprime_products
g2501_2600.s2585_number_of_ways_to_earn_points
g2501_2600.s2586_count_the_number_of_vowel_strings_in_range
g2501_2600.s2587_rearrange_array_to_maximize_prefix_score
g2501_2600.s2588_count_the_number_of_beautiful_subarrays
g2501_2600.s2589_minimum_time_to_complete_all_tasks
g2501_2600.s2591_distribute_money_to_maximum_children
g2501_2600.s2592_maximize_greatness_of_an_array
g2501_2600.s2593_find_score_of_an_array_after_marking_all_elements
g2501_2600.s2594_minimum_time_to_repair_cars
g2501_2600.s2595_number_of_even_and_odd_bits
g2501_2600.s2596_check_knight_tour_configuration
g2501_2600.s2597_the_number_of_beautiful_subsets
g2501_2600.s2598_smallest_missing_non_negative_integer_after_operations
g2501_2600.s2600_k_items_with_the_maximum_sum
g2501_2600.s2600_k_items_with_the_maximum_sum.g2501_2600.s2600_k_items_with_the_maximum_sum.Solution
g2601_2700.s2601_prime_subtraction_operation
g2601_2700.s2602_minimum_operations_to_make_all_array_elements_equal
g2601_2700.s2603_collect_coins_in_a_tree
g2601_2700.s2605_form_smallest_number_from_two_digit_arrays
g2601_2700.s2606_find_the_substring_with_maximum_cost
g2601_2700.s2607_make_k_subarray_sums_equal
g2601_2700.s2608_shortest_cycle_in_a_graph
g2601_2700.s2609_find_the_longest_balanced_substring_of_a_binary_string
g2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions
g2601_2700.s2611_mice_and_cheese
g2601_2700.s2612_minimum_reverse_operations
g2601_2700.s2614_prime_in_diagonal
g2601_2700.s2615_sum_of_distances
g2601_2700.s2616_minimize_the_maximum_difference_of_pairs
g2601_2700.s2617_minimum_number_of_visited_cells_in_a_grid
g2601_2700.s2618_check_if_object_instance_of_class
g2601_2700.s2619_array_prototype_last
g2601_2700.s2620_counter
g2601_2700.s2621_sleep
g2601_2700.s2622_cache_with_time_limit
g2601_2700.s2623_memoize
g2601_2700.s2624_snail_traversal
g2601_2700.s2625_flatten_deeply_nested_array
g2601_2700.s2626_array_reduce_transformation
g2601_2700.s2627_debounce
g2601_2700.s2629_function_composition
g2601_2700.s2630_memoize_ii
g2601_2700.s2631_group_by
g2601_2700.s2634_filter_elements_from_array
g2601_2700.s2635_apply_transform_over_each_element_in_array
g2601_2700.s2637_promise_time_limit
g2601_2700.s2639_find_the_width_of_columns_of_a_grid
g2601_2700.s2640_find_the_score_of_all_prefixes_of_an_array
g2601_2700.s2641_cousins_in_binary_tree_ii
g2601_2700.s2642_design_graph_with_shortest_path_calculator
g2601_2700.s2643_row_with_maximum_ones
g2601_2700.s2644_find_the_maximum_divisibility_score
g2601_2700.s2645_minimum_additions_to_make_valid_string
g2601_2700.s2646_minimize_the_total_price_of_the_trips
g2601_2700.s2648_generate_fibonacci_sequence
g2601_2700.s2649_nested_array_generator
g2601_2700.s2650_design_cancellable_function
g2601_2700.s2651_calculate_delayed_arrival_time
g2601_2700.s2652_sum_multiples
g2601_2700.s2653_sliding_subarray_beauty
g2601_2700.s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1
g2601_2700.s2656_maximum_sum_with_exactly_k_elements
g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays
g2601_2700.s2658_maximum_number_of_fish_in_a_grid
g2601_2700.s2659_make_array_empty
g2601_2700.s2660_determine_the_winner_of_a_bowling_game
g2601_2700.s2661_first_completely_painted_row_or_column
g2601_2700.s2662_minimum_cost_of_a_path_with_special_roads
g2601_2700.s2663_lexicographically_smallest_beautiful_string
g2601_2700.s2665_counter_ii
g2601_2700.s2666_allow_one_function_call
g2601_2700.s2667_create_hello_world_function
g2601_2700.s2670_find_the_distinct_difference_array
g2601_2700.s2671_frequency_tracker
g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color
g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree
g2601_2700.s2677_chunk_array
g2601_2700.s2678_number_of_senior_citizens
g2601_2700.s2679_sum_in_a_matrix
g2601_2700.s2680_maximum_or
g2601_2700.s2681_power_of_heroes
g2601_2700.s2682_find_the_losers_of_the_circular_game
g2601_2700.s2683_neighboring_bitwise_xor
g2601_2700.s2684_maximum_number_of_moves_in_a_grid
g2601_2700.s2685_count_the_number_of_complete_components
g2601_2700.s2693_call_function_with_custom_context
g2601_2700.s2694_event_emitter
g2601_2700.s2695_array_wrapper
g2601_2700.s2696_minimum_string_length_after_removing_substrings
g2601_2700.s2697_lexicographically_smallest_palindrome
g2601_2700.s2698_find_the_punishment_number_of_an_integer
g2601_2700.s2699_modify_graph_edge_weights
g2701_2800.s2703_return_length_of_arguments_passed
g2701_2800.s2704_to_be_or_not_to_be
g2701_2800.s2705_compact_object
g2701_2800.s2706_buy_two_chocolates
g2701_2800.s2707_extra_characters_in_a_string
g2701_2800.s2707_extra_characters_in_a_string.g2701_2800.s2707_extra_characters_in_a_string.Solution
g2701_2800.s2708_maximum_strength_of_a_group
g2701_2800.s2709_greatest_common_divisor_traversal
g2701_2800.s2710_remove_trailing_zeros_from_a_string
g2701_2800.s2711_difference_of_number_of_distinct_values_on_diagonals
g2701_2800.s2712_minimum_cost_to_make_all_characters_equal
g2701_2800.s2713_maximum_strictly_increasing_cells_in_a_matrix
g2701_2800.s2715_timeout_cancellation
g2701_2800.s2716_minimize_string_length
g2701_2800.s2717_semi_ordered_permutation
g2701_2800.s2718_sum_of_matrix_after_queries
g2701_2800.s2719_count_of_integers
g2701_2800.s2721_execute_asynchronous_functions_in_parallel
g2701_2800.s2722_join_two_arrays_by_id
g2701_2800.s2723_add_two_promises
g2701_2800.s2724_sort_by
g2701_2800.s2725_interval_cancellation
g2701_2800.s2726_calculator_with_method_chaining
g2701_2800.s2727_is_object_empty
g2701_2800.s2729_check_if_the_number_is_fascinating
g2701_2800.s2730_find_the_longest_semi_repetitive_substring
g2701_2800.s2731_movement_of_robots
g2701_2800.s2732_find_a_good_subset_of_the_matrix
g2701_2800.s2733_neither_minimum_nor_maximum
g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation
g2701_2800.s2735_collecting_chocolates
g2701_2800.s2736_maximum_sum_queries
g2701_2800.s2739_total_distance_traveled
g2701_2800.s2740_find_the_value_of_the_partition
g2701_2800.s2741_special_permutations
g2701_2800.s2742_painting_the_walls
g2701_2800.s2744_find_maximum_number_of_string_pairs
g2701_2800.s2745_construct_the_longest_new_string
g2701_2800.s2746_decremental_string_concatenation
g2701_2800.s2747_count_zero_request_servers
g2701_2800.s2748_number_of_beautiful_pairs
g2701_2800.s2749_minimum_operations_to_make_the_integer_zero
g2701_2800.s2750_ways_to_split_array_into_good_subarrays
g2701_2800.s2751_robot_collisions
g2701_2800.s2760_longest_even_odd_subarray_with_threshold
g2701_2800.s2761_prime_pairs_with_target_sum
g2701_2800.s2762_continuous_subarrays
g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays
g2701_2800.s2765_longest_alternating_subarray
g2701_2800.s2765_longest_alternating_subarray.g2701_2800.s2765_longest_alternating_subarray.Solution
g2701_2800.s2766_relocate_marbles
g2701_2800.s2767_partition_string_into_minimum_beautiful_substrings
g2701_2800.s2768_number_of_black_blocks
g2701_2800.s2769_find_the_maximum_achievable_number
g2701_2800.s2770_maximum_number_of_jumps_to_reach_the_last_index
g2701_2800.s2771_longest_non_decreasing_subarray_from_two_arrays
g2701_2800.s2772_apply_operations_to_make_all_array_elements_equal_to_zero
g2701_2800.s2778_sum_of_squares_of_special_elements
g2701_2800.s2779_maximum_beauty_of_an_array_after_applying_operation
g2701_2800.s2780_minimum_index_of_a_valid_split
g2701_2800.s2781_length_of_the_longest_valid_substring
g2701_2800.s2784_check_if_array_is_good
g2701_2800.s2785_sort_vowels_in_a_string
g2701_2800.s2786_visit_array_positions_to_maximize_score
g2701_2800.s2787_ways_to_express_an_integer_as_sum_of_powers
g2701_2800.s2788_split_strings_by_separator
g2701_2800.s2789_largest_element_in_an_array_after_merge_operations
g2701_2800.s2790_maximum_number_of_groups_with_increasing_length
g2701_2800.s2791_count_paths_that_can_form_a_palindrome_in_a_tree
g2701_2800.s2798_number_of_employees_who_met_the_target
g2701_2800.s2799_count_complete_subarrays_in_an_array
g2701_2800.s2800_shortest_string_that_contains_three_strings
g2801_2900.s2801_count_stepping_numbers_in_range
g2801_2900.s2806_account_balance_after_rounded_purchase
g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list
g2801_2900.s2808_minimum_seconds_to_equalize_a_circular_array
g2801_2900.s2809_minimum_time_to_make_array_sum_at_most_x
g2801_2900.s2810_faulty_keyboard
g2801_2900.s2811_check_if_it_is_possible_to_split_array
g2801_2900.s2812_find_the_safest_path_in_a_grid
g2801_2900.s2813_maximum_elegance_of_a_k_length_subsequence
g2801_2900.s2815_max_pair_sum_in_an_array
g2801_2900.s2816_double_a_number_represented_as_a_linked_list
g2801_2900.s2817_minimum_absolute_difference_between_elements_with_constraint
g2801_2900.s2818_apply_operations_to_maximize_score
g2801_2900.s2824_count_pairs_whose_sum_is_less_than_target
g2801_2900.s2825_make_string_a_subsequence_using_cyclic_increments
g2801_2900.s2826_sorting_three_groups
g2801_2900.s2827_number_of_beautiful_integers_in_the_range
g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words
g2801_2900.s2829_determine_the_minimum_sum_of_a_k_avoiding_array
g2801_2900.s2830_maximize_the_profit_as_the_salesman
g2801_2900.s2831_find_the_longest_equal_subarray
g2801_2900.s2833_furthest_point_from_origin
g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array
g2801_2900.s2835_minimum_operations_to_form_subsequence_with_target_sum
g2801_2900.s2836_maximize_value_of_function_in_a_ball_passing_game
g2801_2900.s2839_check_if_strings_can_be_made_equal_with_operations_i
g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii
g2801_2900.s2841_maximum_sum_of_almost_unique_subarray
g2801_2900.s2842_count_k_subsequences_of_a_string_with_maximum_beauty
g2801_2900.s2843_count_symmetric_integers
g2801_2900.s2844_minimum_operations_to_make_a_special_number
g2801_2900.s2845_count_of_interesting_subarrays
g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree
g2801_2900.s2848_points_that_intersect_with_cars
g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time
g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid
g2801_2900.s2851_string_transformation
g2801_2900.s2855_minimum_right_shifts_to_sort_the_array
g2801_2900.s2856_minimum_array_length_after_pair_removals
g2801_2900.s2857_count_pairs_of_points_with_distance_k
g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable
g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits
g2801_2900.s2860_happy_students
g2801_2900.s2861_maximum_number_of_alloys
g2801_2900.s2862_maximum_element_sum_of_a_complete_subset_of_indices
g2801_2900.s2864_maximum_odd_binary_number
g2801_2900.s2865_beautiful_towers_i
g2801_2900.s2866_beautiful_towers_ii
g2801_2900.s2867_count_valid_paths_in_a_tree
g2801_2900.s2869_minimum_operations_to_collect_elements
g2801_2900.s2870_minimum_number_of_operations_to_make_array_empty
g2801_2900.s2871_split_array_into_maximum_number_of_subarrays
g2801_2900.s2872_maximum_number_of_k_divisible_components
g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i
g2801_2900.s2874_maximum_value_of_an_ordered_triplet_ii
g2801_2900.s2875_minimum_size_subarray_in_infinite_array
g2801_2900.s2876_count_visited_nodes_in_a_directed_graph
g2801_2900.s2877_create_a_dataframe_from_list
g2801_2900.s2878_get_the_size_of_a_dataframe
g2801_2900.s2879_display_the_first_three_rows
g2801_2900.s2880_select_data
g2801_2900.s2881_create_a_new_column
g2801_2900.s2882_drop_duplicate_rows
g2801_2900.s2883_drop_missing_data
g2801_2900.s2884_modify_columns
g2801_2900.s2885_rename_columns
g2801_2900.s2886_change_data_type
g2801_2900.s2887_fill_missing_data
g2801_2900.s2888_reshape_data_concatenate
g2801_2900.s2889_reshape_data_pivot
g2801_2900.s2890_reshape_data_melt
g2801_2900.s2891_method_chaining
g2801_2900.s2894_divisible_and_non_divisible_sums_difference
g2801_2900.s2895_minimum_processing_time
g2801_2900.s2896_apply_operations_to_make_two_strings_equal
g2801_2900.s2897_apply_operations_on_array_to_maximize_sum_of_squares
g2801_2900.s2899_last_visited_integers
g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i
g2901_3000.s2901_longest_unequal_adjacent_groups_subsequence_ii
g2901_3000.s2902_count_of_sub_multisets_with_bounded_sum
g2901_3000.s2903_find_indices_with_index_and_value_difference_i
g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string
g2901_3000.s2905_find_indices_with_index_and_value_difference_ii
g2901_3000.s2906_construct_product_matrix
g2901_3000.s2908_minimum_sum_of_mountain_triplets_i
g2901_3000.s2909_minimum_sum_of_mountain_triplets_ii
g2901_3000.s2910_minimum_number_of_groups_to_create_a_valid_assignment
g2901_3000.s2911_minimum_changes_to_make_k_semi_palindromes
g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i
g2901_3000.s2914_minimum_number_of_changes_to_make_binary_string_beautiful
g2901_3000.s2915_length_of_the_longest_subsequence_that_sums_to_target
g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii
g2901_3000.s2917_find_the_k_or_of_an_array
g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros
g2901_3000.s2919_minimum_increment_operations_to_make_array_beautiful
g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes
g2901_3000.s2923_find_champion_i
g2901_3000.s2924_find_champion_ii
g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree
g2901_3000.s2926_maximum_balanced_subsequence_sum
g2901_3000.s2928_distribute_candies_among_children_i
g2901_3000.s2929_distribute_candies_among_children_ii
g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring
g2901_3000.s2931_maximum_spending_after_buying_items
g2901_3000.s2932_maximum_strong_pair_xor_i
g2901_3000.s2933_high_access_employees
g2901_3000.s2934_minimum_operations_to_maximize_last_elements_in_arrays
g2901_3000.s2935_maximum_strong_pair_xor_ii
g2901_3000.s2937_make_three_strings_equal
g2901_3000.s2938_separate_black_and_white_balls
g2901_3000.s2939_maximum_xor_product
g2901_3000.s2940_find_building_where_alice_and_bob_can_meet
g2901_3000.s2942_find_words_containing_character
g2901_3000.s2943_maximize_area_of_square_hole_in_grid
g2901_3000.s2944_minimum_number_of_coins_for_fruits
g2901_3000.s2945_find_maximum_non_decreasing_array_length
g2901_3000.s2946_matrix_similarity_after_cyclic_shifts
g2901_3000.s2947_count_beautiful_substrings_i
g2901_3000.s2947_count_beautiful_substrings_i.g2901_3000.s2947_count_beautiful_substrings_i.Solution
g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements
g2901_3000.s2949_count_beautiful_substrings_ii
g2901_3000.s2951_find_the_peaks
g2901_3000.s2952_minimum_number_of_coins_to_be_added
g2901_3000.s2953_count_complete_substrings
g2901_3000.s2954_count_the_number_of_infection_sequences
g2901_3000.s2956_find_common_elements_between_two_arrays
g2901_3000.s2957_remove_adjacent_almost_equal_characters
g2901_3000.s2958_length_of_longest_subarray_with_at_most_k_frequency
g2901_3000.s2959_number_of_possible_sets_of_closing_branches
g2901_3000.s2960_count_tested_devices_after_test_operations
g2901_3000.s2961_double_modular_exponentiation
g2901_3000.s2962_count_subarrays_where_max_element_appears_at_least_k_times
g2901_3000.s2963_count_the_number_of_good_partitions
g2901_3000.s2965_find_missing_and_repeated_values
g2901_3000.s2966_divide_array_into_arrays_with_max_difference
g2901_3000.s2967_minimum_cost_to_make_array_equalindromic
g2901_3000.s2968_apply_operations_to_maximize_frequency_score
g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i
g2901_3000.s2971_find_polygon_with_the_largest_perimeter
g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii
g2901_3000.s2973_find_number_of_coins_to_place_in_tree_nodes
g2901_3000.s2974_minimum_number_game
g2901_3000.s2975_maximum_square_area_by_removing_fences_from_a_field
g2901_3000.s2976_minimum_cost_to_convert_string_i
g2901_3000.s2977_minimum_cost_to_convert_string_ii
g2901_3000.s2980_check_if_bitwise_or_has_trailing_zeros
g2901_3000.s2981_find_longest_special_substring_that_occurs_thrice_i
g2901_3000.s2982_find_longest_special_substring_that_occurs_thrice_ii
g2901_3000.s2983_palindrome_rearrangement_queries
g2901_3000.s2996_smallest_missing_integer_greater_than_sequential_prefix_sum
g2901_3000.s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k
g2901_3000.s2998_minimum_number_of_operations_to_make_x_and_y_equal
g2901_3000.s2999_count_the_number_of_powerful_integers
g2901_3000.s3000_maximum_area_of_longest_diagonal_rectangle
g3001_3100.s3001_minimum_moves_to_capture_the_queen
g3001_3100.s3002_maximum_size_of_a_set_after_removals
g3001_3100.s3003_maximize_the_number_of_partitions_after_operations
g3001_3100.s3005_count_elements_with_maximum_frequency
g3001_3100.s3006_find_beautiful_indices_in_the_given_array_i
g3001_3100.s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k
g3001_3100.s3008_find_beautiful_indices_in_the_given_array_ii
g3001_3100.s3010_divide_an_array_into_subarrays_with_minimum_cost_i
g3001_3100.s3011_find_if_array_can_be_sorted
g3001_3100.s3012_minimize_length_of_array_using_operations
g3001_3100.s3013_divide_an_array_into_subarrays_with_minimum_cost_ii
g3001_3100.s3014_minimum_number_of_pushes_to_type_word_i
g3001_3100.s3015_count_the_number_of_houses_at_a_certain_distance_i
g3001_3100.s3016_minimum_number_of_pushes_to_type_word_ii
g3001_3100.s3017_count_the_number_of_houses_at_a_certain_distance_ii
g3001_3100.s3019_number_of_changing_keys
g3001_3100.s3020_find_the_maximum_number_of_elements_in_subset
g3001_3100.s3021_alice_and_bob_playing_flower_game
g3001_3100.s3022_minimize_or_of_remaining_elements_using_operations
g3001_3100.s3024_type_of_triangle
g3001_3100.s3025_find_the_number_of_ways_to_place_people_i
g3001_3100.s3026_maximum_good_subarray_sum
g3001_3100.s3027_find_the_number_of_ways_to_place_people_ii
g3001_3100.s3028_ant_on_the_boundary
g3001_3100.s3029_minimum_time_to_revert_word_to_initial_state_i
g3001_3100.s3030_find_the_grid_of_region_average
g3001_3100.s3031_minimum_time_to_revert_word_to_initial_state_ii
g3001_3100.s3033_modify_the_matrix
g3001_3100.s3034_number_of_subarrays_that_match_a_pattern_i
g3001_3100.s3035_maximum_palindromes_after_operations
g3001_3100.s3036_number_of_subarrays_that_match_a_pattern_ii
g3001_3100.s3038_maximum_number_of_operations_with_the_same_score_i
g3001_3100.s3039_apply_operations_to_make_string_empty
g3001_3100.s3040_maximum_number_of_operations_with_the_same_score_ii
g3001_3100.s3041_maximize_consecutive_elements_in_an_array_after_modification
g3001_3100.s3042_count_prefix_and_suffix_pairs_i
g3001_3100.s3043_find_the_length_of_the_longest_common_prefix
g3001_3100.s3044_most_frequent_prime
g3001_3100.s3045_count_prefix_and_suffix_pairs_ii
g3001_3100.s3046_split_the_array
g3001_3100.s3047_find_the_largest_area_of_square_inside_two_rectangles
g3001_3100.s3048_earliest_second_to_mark_indices_i
g3001_3100.s3049_earliest_second_to_mark_indices_ii
g3001_3100.s3065_minimum_operations_to_exceed_threshold_value_i
g3001_3100.s3066_minimum_operations_to_exceed_threshold_value_ii
g3001_3100.s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network
g3001_3100.s3068_find_the_maximum_sum_of_node_values
g3001_3100.s3069_distribute_elements_into_two_arrays_i
g3001_3100.s3070_count_submatrices_with_top_left_element_and_sum_less_than_k
g3001_3100.s3071_minimum_operations_to_write_the_letter_y_on_a_grid
g3001_3100.s3072_distribute_elements_into_two_arrays_ii
g3001_3100.s3074_apple_redistribution_into_boxes
g3001_3100.s3075_maximize_happiness_of_selected_children
g3001_3100.s3076_shortest_uncommon_substring_in_an_array
g3001_3100.s3077_maximum_strength_of_k_disjoint_subarrays
g3001_3100.s3079_find_the_sum_of_encrypted_integers
g3001_3100.s3080_mark_elements_on_array_by_performing_queries
g3001_3100.s3081_replace_question_marks_in_string_to_minimize_its_value
g3001_3100.s3082_find_the_sum_of_the_power_of_all_subsequences
g3001_3100.s3083_existence_of_a_substring_in_a_string_and_its_reverse
g3001_3100.s3084_count_substrings_starting_and_ending_with_given_character
g3001_3100.s3085_minimum_deletions_to_make_string_k_special
g3001_3100.s3086_minimum_moves_to_pick_k_ones
g3001_3100.s3086_minimum_moves_to_pick_k_ones.g3001_3100.s3086_minimum_moves_to_pick_k_ones.Solution
g3001_3100.s3090_maximum_length_substring_with_two_occurrences
g3001_3100.s3091_apply_operations_to_make_sum_of_array_greater_than_or_equal_to_k
g3001_3100.s3092_most_frequent_ids
g3001_3100.s3093_longest_common_suffix_queries
g3001_3100.s3095_shortest_subarray_with_or_at_least_k_i
g3001_3100.s3096_minimum_levels_to_gain_more_points
g3001_3100.s3097_shortest_subarray_with_or_at_least_k_ii
g3001_3100.s3098_find_the_sum_of_subsequence_powers
g3001_3100.s3099_harshad_number
g3001_3100.s3100_water_bottles_ii
g3101_3200.s3101_count_alternating_subarrays
g3101_3200.s3102_minimize_manhattan_distances
g3101_3200.s3102_minimize_manhattan_distances.g3101_3200.s3102_minimize_manhattan_distances.Solution
g3101_3200.s3105_longest_strictly_increasing_or_strictly_decreasing_subarray
g3101_3200.s3106_lexicographically_smallest_string_after_operations_with_constraint
g3101_3200.s3107_minimum_operations_to_make_median_of_array_equal_to_k
g3101_3200.s3108_minimum_cost_walk_in_weighted_graph
g3101_3200.s3110_score_of_a_string
g3101_3200.s3111_minimum_rectangles_to_cover_points
g3101_3200.s3112_minimum_time_to_visit_disappearing_nodes
g3101_3200.s3113_find_the_number_of_subarrays_where_boundary_elements_are_maximum
g3101_3200.s3114_latest_time_you_can_obtain_after_replacing_characters
g3101_3200.s3115_maximum_prime_difference
g3101_3200.s3116_kth_smallest_amount_with_single_denomination_combination
g3101_3200.s3117_minimum_sum_of_values_by_dividing_array
g3101_3200.s3120_count_the_number_of_special_characters_i
g3101_3200.s3121_count_the_number_of_special_characters_ii
g3101_3200.s3122_minimum_number_of_operations_to_satisfy_conditions
g3101_3200.s3123_find_edges_in_shortest_paths
g3101_3200.s3123_find_edges_in_shortest_paths.g3101_3200.s3123_find_edges_in_shortest_paths.Solution
g3101_3200.s3127_make_a_square_with_the_same_color
g3101_3200.s3128_right_triangles
g3101_3200.s3129_find_all_possible_stable_binary_arrays_i
g3101_3200.s3130_find_all_possible_stable_binary_arrays_ii
g3101_3200.s3131_find_the_integer_added_to_array_i
g3101_3200.s3132_find_the_integer_added_to_array_ii
g3101_3200.s3133_minimum_array_end
g3101_3200.s3134_find_the_median_of_the_uniqueness_array
g3101_3200.s3136_valid_word
g3101_3200.s3137_minimum_number_of_operations_to_make_word_k_periodic
g3101_3200.s3138_minimum_length_of_anagram_concatenation
g3101_3200.s3139_minimum_cost_to_equalize_array
g3101_3200.s3142_check_if_grid_satisfies_conditions
g3101_3200.s3143_maximum_points_inside_the_square
g3101_3200.s3144_minimum_substring_partition_of_equal_character_frequency
g3101_3200.s3145_find_products_of_elements_of_big_array
g3101_3200.s3146_permutation_difference_between_two_strings
g3101_3200.s3147_taking_maximum_energy_from_the_mystic_dungeon
g3101_3200.s3148_maximum_difference_score_in_a_grid
g3101_3200.s3149_find_the_minimum_cost_array_permutation
g3101_3200.s3151_special_array_i
g3101_3200.s3152_special_array_ii
g3101_3200.s3153_sum_of_digit_differences_of_all_pairs
g3101_3200.s3154_find_number_of_ways_to_reach_the_k_th_stair
g3101_3200.s3158_find_the_xor_of_numbers_which_appear_twice
g3101_3200.s3159_find_occurrences_of_an_element_in_an_array
g3101_3200.s3160_find_the_number_of_distinct_colors_among_the_balls
g3101_3200.s3161_block_placement_queries
g3101_3200.s3162_find_the_number_of_good_pairs_i
g3101_3200.s3163_string_compression_iii
g3101_3200.s3164_find_the_number_of_good_pairs_ii
g3101_3200.s3165_maximum_sum_of_subsequence_with_non_adjacent_elements
g3101_3200.s3168_minimum_number_of_chairs_in_a_waiting_room
g3101_3200.s3169_count_days_without_meetings
g3101_3200.s3170_lexicographically_minimum_string_after_removing_stars
g3101_3200.s3171_find_subarray_with_bitwise_and_closest_to_k
g3101_3200.s3174_clear_digits
g3101_3200.s3175_find_the_first_player_to_win_k_games_in_a_row
g3101_3200.s3176_find_the_maximum_length_of_a_good_subsequence_i
g3101_3200.s3177_find_the_maximum_length_of_a_good_subsequence_ii
g3101_3200.s3178_find_the_child_who_has_the_ball_after_k_seconds
g3101_3200.s3179_find_the_n_th_value_after_k_seconds
g3101_3200.s3180_maximum_total_reward_using_operations_i
g3101_3200.s3181_maximum_total_reward_using_operations_ii
g3101_3200.s3184_count_pairs_that_form_a_complete_day_i
g3101_3200.s3185_count_pairs_that_form_a_complete_day_ii
g3101_3200.s3186_maximum_total_damage_with_spell_casting
g3101_3200.s3187_peaks_in_array
g3101_3200.s3190_find_minimum_operations_to_make_all_elements_divisible_by_three
g3101_3200.s3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i
g3101_3200.s3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii
g3101_3200.s3193_count_the_number_of_inversions
g3101_3200.s3194_minimum_average_of_smallest_and_largest_elements
g3101_3200.s3195_find_the_minimum_area_to_cover_all_ones_i
g3101_3200.s3196_maximize_total_cost_of_alternating_subarrays
g3101_3200.s3197_find_the_minimum_area_to_cover_all_ones_ii
g3101_3200.s3200_maximum_height_of_a_triangle
g3101_3200.s3200_maximum_height_of_a_triangle.g3101_3200.s3200_maximum_height_of_a_triangle.Solution
g3201_3300.s3201_find_the_maximum_length_of_valid_subsequence_i
g3201_3300.s3202_find_the_maximum_length_of_valid_subsequence_ii
g3201_3300.s3203_find_minimum_diameter_after_merging_two_trees
g3201_3300.s3206_alternating_groups_i
g3201_3300.s3207_maximum_points_after_enemy_battles
g3201_3300.s3208_alternating_groups_ii
g3201_3300.s3209_number_of_subarrays_with_and_value_of_k
g3201_3300.s3210_find_the_encrypted_string
g3201_3300.s3211_generate_binary_strings_without_adjacent_zeros
g3201_3300.s3212_count_submatrices_with_equal_frequency_of_x_and_y
g3201_3300.s3213_construct_string_with_minimum_cost
g3201_3300.s3216_lexicographically_smallest_string_after_a_swap
g3201_3300.s3217_delete_nodes_from_linked_list_present_in_array
g3201_3300.s3218_minimum_cost_for_cutting_cake_i
g3201_3300.s3219_minimum_cost_for_cutting_cake_ii
g3201_3300.s3220_odd_and_even_transactions
g3201_3300.s3222_find_the_winning_player_in_coin_game
g3201_3300.s3223_minimum_length_of_string_after_operations
g3201_3300.s3224_minimum_array_changes_to_make_differences_equal
g3201_3300.s3225_maximum_score_from_grid_operations
g3201_3300.s3226_number_of_bit_changes_to_make_two_integers_equal
g3201_3300.s3227_vowels_game_in_a_string
g3201_3300.s3228_maximum_number_of_operations_to_move_ones_to_the_end
g3201_3300.s3229_minimum_operations_to_make_array_equal_to_target
g3201_3300.s3232_find_if_digit_game_can_be_won
g3201_3300.s3233_find_the_count_of_numbers_which_are_not_special
g3201_3300.s3234_count_the_number_of_substrings_with_dominant_ones
g3201_3300.s3235_check_if_the_rectangle_corner_is_reachable
g3201_3300.s3238_find_the_number_of_winning_players
g3201_3300.s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i
g3201_3300.s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii
g3201_3300.s3241_time_taken_to_mark_all_nodes
g3201_3300.s3241_time_taken_to_mark_all_nodes.g3201_3300.s3241_time_taken_to_mark_all_nodes.Solution
g3201_3300.s3242_design_neighbor_sum_service
g3201_3300.s3243_shortest_distance_after_road_addition_queries_i
g3201_3300.s3244_shortest_distance_after_road_addition_queries_ii
g3201_3300.s3245_alternating_groups_iii
g3201_3300.s3248_snake_in_matrix
g3201_3300.s3249_count_the_number_of_good_nodes
g3201_3300.s3250_find_the_count_of_monotonic_pairs_i
g3201_3300.s3251_find_the_count_of_monotonic_pairs_ii
g3201_3300.s3254_find_the_power_of_k_size_subarrays_i
g3201_3300.s3255_find_the_power_of_k_size_subarrays_ii
g3201_3300.s3256_maximum_value_sum_by_placing_three_rooks_i
g3201_3300.s3257_maximum_value_sum_by_placing_three_rooks_ii
g3201_3300.s3258_count_substrings_that_satisfy_k_constraint_i
g3201_3300.s3259_maximum_energy_boost_from_two_drinks
g3201_3300.s3260_find_the_largest_palindrome_divisible_by_k
g3201_3300.s3261_count_substrings_that_satisfy_k_constraint_ii
g3201_3300.s3264_final_array_state_after_k_multiplication_operations_i
g3201_3300.s3265_count_almost_equal_pairs_i
g3201_3300.s3266_final_array_state_after_k_multiplication_operations_ii
g3201_3300.s3267_count_almost_equal_pairs_ii
g3201_3300.s3270_find_the_key_of_the_numbers
g3201_3300.s3271_hash_divided_string
g3201_3300.s3272_find_the_count_of_good_integers
g3201_3300.s3273_minimum_amount_of_damage_dealt_to_bob
g3201_3300.s3274_check_if_two_chessboard_squares_have_the_same_color
g3201_3300.s3275_k_th_nearest_obstacle_queries
g3201_3300.s3276_select_cells_in_grid_with_maximum_score
g3201_3300.s3277_maximum_xor_score_subarray_queries
g3201_3300.s3280_convert_date_to_binary
g3201_3300.s3281_maximize_score_of_numbers_in_ranges
g3201_3300.s3282_reach_end_of_array_with_max_score
g3201_3300.s3283_maximum_number_of_moves_to_kill_all_pawns
g3201_3300.s3285_find_indices_of_stable_mountains
g3201_3300.s3286_find_a_safe_walk_through_a_grid
g3201_3300.s3287_find_the_maximum_sequence_value_of_array
g3201_3300.s3288_length_of_the_longest_increasing_path
g3201_3300.s3289_the_two_sneaky_numbers_of_digitville
g3201_3300.s3290_maximum_multiplication_score
g3201_3300.s3290_maximum_multiplication_score.g3201_3300.s3290_maximum_multiplication_score.Solution
g3201_3300.s3291_minimum_number_of_valid_strings_to_form_target_i
g3201_3300.s3292_minimum_number_of_valid_strings_to_form_target_ii
g3201_3300.s3295_report_spam_message
g3201_3300.s3296_minimum_number_of_seconds_to_make_mountain_height_zero
g3201_3300.s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i
g3201_3300.s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii
g3201_3300.s3300_minimum_element_after_replacement_with_digit_sum
g3301_3400.s3301_maximize_the_total_height_of_unique_towers
g3301_3400.s3302_find_the_lexicographically_smallest_valid_sequence
g3301_3400.s3303_find_the_occurrence_of_first_almost_equal_substring
g3301_3400.s3304_find_the_k_th_character_in_string_game_i
g3301_3400.s3305_count_of_substrings_containing_every_vowel_and_k_consonants_i
g3301_3400.s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii
g3301_3400.s3307_find_the_k_th_character_in_string_game_ii
g3301_3400.s3309_maximum_possible_number_by_binary_concatenation
g3301_3400.s3310_remove_methods_from_project
g3301_3400.s3311_construct_2d_grid_matching_graph_layout
g3301_3400.s3312_sorted_gcd_pair_queries
g3301_3400.s3314_construct_the_minimum_bitwise_array_i
g3301_3400.s3315_construct_the_minimum_bitwise_array_ii
g3301_3400.s3316_find_maximum_removals_from_source_string
g3301_3400.s3317_find_the_number_of_possible_ways_for_an_event
g3301_3400.s3318_find_x_sum_of_all_k_long_subarrays_i
g3301_3400.s3319_k_th_largest_perfect_subtree_size_in_binary_tree
g3301_3400.s3320_count_the_number_of_winning_sequences
g3301_3400.s3321_find_x_sum_of_all_k_long_subarrays_ii
g3301_3400.s3324_find_the_sequence_of_strings_appeared_on_the_screen
g3301_3400.s3325_count_substrings_with_k_frequency_characters_i
g3301_3400.s3326_minimum_division_operations_to_make_array_non_decreasing
g3301_3400.s3327_check_if_dfs_strings_are_palindromes
g3301_3400.s3330_find_the_original_typed_string_i
g3301_3400.s3331_find_subtree_sizes_after_changes
g3301_3400.s3332_maximum_points_tourist_can_earn
g3301_3400.s3333_find_the_original_typed_string_ii
g3301_3400.s3334_find_the_maximum_factor_score_of_array
g3301_3400.s3335_total_characters_in_string_after_transformations_i
g3301_3400.s3336_find_the_number_of_subsequences_with_equal_gcd
g3301_3400.s3337_total_characters_in_string_after_transformations_ii
g3301_3400.s3340_check_balanced_string
g3301_3400.s3341_find_minimum_time_to_reach_last_room_i
g3301_3400.s3342_find_minimum_time_to_reach_last_room_ii
g3301_3400.s3343_count_number_of_balanced_permutations
g3301_3400.s3345_smallest_divisible_digit_product_i
g3301_3400.s3346_maximum_frequency_of_an_element_after_performing_operations_i
g3301_3400.s3347_maximum_frequency_of_an_element_after_performing_operations_ii
g3301_3400.s3348_smallest_divisible_digit_product_ii
g3301_3400.s3349_adjacent_increasing_subarrays_detection_i
g3301_3400.s3350_adjacent_increasing_subarrays_detection_ii
g3301_3400.s3351_sum_of_good_subsequences
g3301_3400.s3352_count_k_reducible_numbers_less_than_n
g3301_3400.s3354_make_array_elements_equal_to_zero
g3301_3400.s3355_zero_array_transformation_i
g3301_3400.s3356_zero_array_transformation_ii
g3301_3400.s3356_zero_array_transformation_ii.g3301_3400.s3356_zero_array_transformation_ii.Solution
g3301_3400.s3357_minimize_the_maximum_adjacent_element_difference
© 2015 - 2024 Weber Informatics LLC | Privacy Policy