File tree
1,919 files changed
+1279
-1263
lines changed- src/main/java
- g0001_0100
- s0002_add_two_numbers
- s0011_container_with_most_water
- s0017_letter_combinations_of_a_phone_number
- s0019_remove_nth_node_from_end_of_list
- s0021_merge_two_sorted_lists
- s0024_swap_nodes_in_pairs
- s0025_reverse_nodes_in_k_group
- s0036_valid_sudoku
- s0037_sudoku_solver
- s0038_count_and_say
- s0042_trapping_rain_water
- s0048_rotate_image
- s0051_n_queens
- s0052_n_queens_ii
- s0054_spiral_matrix
- s0059_spiral_matrix_ii
- s0061_rotate_list
- s0062_unique_paths
- s0063_unique_paths_ii
- s0064_minimum_path_sum
- s0073_set_matrix_zeroes
- s0074_search_a_2d_matrix
- s0079_word_search
- s0082_remove_duplicates_from_sorted_list_ii
- s0083_remove_duplicates_from_sorted_list
- s0084_largest_rectangle_in_histogram
- s0085_maximal_rectangle
- s0086_partition_list
- s0092_reverse_linked_list_ii
- s0094_binary_tree_inorder_traversal
- s0095_unique_binary_search_trees_ii
- s0096_unique_binary_search_trees
- s0097_interleaving_string
- s0098_validate_binary_search_tree
- s0099_recover_binary_search_tree
- s0100_same_tree
- g0101_0200
- s0101_symmetric_tree
- s0102_binary_tree_level_order_traversal
- s0103_binary_tree_zigzag_level_order_traversal
- s0104_maximum_depth_of_binary_tree
- s0105_construct_binary_tree_from_preorder_and_inorder_traversal
- s0106_construct_binary_tree_from_inorder_and_postorder_traversal
- s0107_binary_tree_level_order_traversal_ii
- s0108_convert_sorted_array_to_binary_search_tree
- s0109_convert_sorted_list_to_binary_search_tree
- s0110_balanced_binary_tree
- s0111_minimum_depth_of_binary_tree
- s0112_path_sum
- s0113_path_sum_ii
- s0114_flatten_binary_tree_to_linked_list
- s0116_populating_next_right_pointers_in_each_node
- s0117_populating_next_right_pointers_in_each_node_ii
- s0118_pascals_triangle
- s0119_pascals_triangle_ii
- s0124_binary_tree_maximum_path_sum
- s0129_sum_root_to_leaf_numbers
- s0130_surrounded_regions
- s0133_clone_graph
- s0138_copy_list_with_random_pointer
- s0141_linked_list_cycle
- s0142_linked_list_cycle_ii
- s0143_reorder_list
- s0144_binary_tree_preorder_traversal
- s0145_binary_tree_postorder_traversal
- s0147_insertion_sort_list
- s0148_sort_list
- s0149_max_points_on_a_line
- s0160_intersection_of_two_linked_lists
- s0173_binary_search_tree_iterator
- s0174_dungeon_game
- s0199_binary_tree_right_side_view
- g0201_0300
- s0203_remove_linked_list_elements
- s0206_reverse_linked_list
- s0212_word_search_ii
- s0218_the_skyline_problem
- s0221_maximal_square
- s0222_count_complete_tree_nodes
- s0223_rectangle_area
- s0226_invert_binary_tree
- s0230_kth_smallest_element_in_a_bst
- s0234_palindrome_linked_list
- s0235_lowest_common_ancestor_of_a_binary_search_tree
- s0236_lowest_common_ancestor_of_a_binary_tree
- s0237_delete_node_in_a_linked_list
- s0240_search_a_2d_matrix_ii
- s0257_binary_tree_paths
- s0289_game_of_life
- s0297_serialize_and_deserialize_binary_tree
- g0301_0400
- s0304_range_sum_query_2d_immutable
- s0310_minimum_height_trees
- s0319_bulb_switcher
- s0328_odd_even_linked_list
- s0329_longest_increasing_path_in_a_matrix
- s0331_verify_preorder_serialization_of_a_binary_tree
- s0332_reconstruct_itinerary
- s0335_self_crossing
- s0337_house_robber_iii
- s0363_max_sum_of_rectangle_no_larger_than_k
- s0375_guess_number_higher_or_lower_ii
- s0382_linked_list_random_node
- s0388_longest_absolute_file_path
- s0391_perfect_rectangle
- g0401_0500
- s0401_binary_watch
- s0404_sum_of_left_leaves
- s0407_trapping_rain_water_ii
- s0417_pacific_atlantic_water_flow
- s0419_battleships_in_a_board
- s0427_construct_quad_tree
- s0429_n_ary_tree_level_order_traversal
- s0430_flatten_a_multilevel_doubly_linked_list
- s0437_path_sum_iii
- s0441_arranging_coins
- s0445_add_two_numbers_ii
- s0450_delete_node_in_a_bst
- s0463_island_perimeter
- s0473_matchsticks_to_square
- s0497_random_point_in_non_overlapping_rectangles
- s0498_diagonal_traverse
- s0500_keyboard_row
- g0501_0600
- s0501_find_mode_in_binary_search_tree
- s0508_most_frequent_subtree_sum
- s0513_find_bottom_left_tree_value
- s0514_freedom_trail
- s0515_find_largest_value_in_each_tree_row
- s0529_minesweeper
- s0530_minimum_absolute_difference_in_bst
- s0538_convert_bst_to_greater_tree
- s0542_01_matrix
- s0543_diameter_of_binary_tree
- s0547_number_of_provinces
- s0554_brick_wall
- s0558_logical_or_of_two_binary_grids_represented_as_quad_trees
- s0559_maximum_depth_of_n_ary_tree
- s0563_binary_tree_tilt
- s0566_reshape_the_matrix
- s0572_subtree_of_another_tree
- s0576_out_of_boundary_paths
- s0587_erect_the_fence
- s0589_n_ary_tree_preorder_traversal
- s0590_n_ary_tree_postorder_traversal
- s0598_range_addition_ii
- g0601_0700
- s0606_construct_string_from_binary_tree
- s0608_tree_node
- s0617_merge_two_binary_trees
- s0623_add_one_row_to_tree
- s0636_exclusive_time_of_functions
- s0637_average_of_levels_in_binary_tree
- s0652_find_duplicate_subtrees
- s0653_two_sum_iv_input_is_a_bst
- s0654_maximum_binary_tree
- s0655_print_binary_tree
- s0661_image_smoother
- s0662_maximum_width_of_binary_tree
- s0668_kth_smallest_number_in_multiplication_table
- s0669_trim_a_binary_search_tree
- s0671_second_minimum_node_in_a_binary_tree
- s0675_cut_off_trees_for_golf_event
- s0684_redundant_connection
- s0685_redundant_connection_ii
- s0687_longest_univalue_path
- s0688_knight_probability_in_chessboard
- s0690_employee_importance
- s0695_max_area_of_island
- s0699_falling_squares
- s0700_search_in_a_binary_search_tree
- g0701_0800
- s0701_insert_into_a_binary_search_tree
- s0725_split_linked_list_in_parts
- s0733_flood_fill
- s0741_cherry_pickup
- s0743_network_delay_time
- s0749_contain_virus
- s0756_pyramid_transition_matrix
- s0764_largest_plus_sign
- s0766_toeplitz_matrix
- s0773_sliding_puzzle
- s0778_swim_in_rising_water
- s0782_transform_to_chessboard
- s0783_minimum_distance_between_bst_nodes
- s0785_is_graph_bipartite
- s0787_cheapest_flights_within_k_stops
- s0790_domino_and_tromino_tiling
- s0794_valid_tic_tac_toe_state
- s0797_all_paths_from_source_to_target
- s0799_champagne_tower
- g0801_0900
- s0802_find_eventual_safe_states
- s0807_max_increase_to_keep_city_skyline
- s0812_largest_triangle_area
- s0814_binary_tree_pruning
- s0817_linked_list_components
- s0833_find_and_replace_in_string
- s0834_sum_of_distances_in_tree
- s0835_image_overlap
- s0838_push_dominoes
- s0840_magic_squares_in_grid
- s0847_shortest_path_visiting_all_nodes
- s0849_maximize_distance_to_closest_person
- s0850_rectangle_area_ii
- s0858_mirror_reflection
- s0861_score_after_flipping_matrix
- s0863_all_nodes_distance_k_in_binary_tree
- s0864_shortest_path_to_get_all_keys
- s0865_smallest_subtree_with_all_the_deepest_nodes
- s0867_transpose_matrix
- s0872_leaf_similar_trees
- s0876_middle_of_the_linked_list
- s0882_reachable_nodes_in_subdivided_graph
- s0883_projection_area_of_3d_shapes
- s0885_spiral_matrix_iii
- s0889_construct_binary_tree_from_preorder_and_postorder_traversal
- s0892_surface_area_of_3d_shapes
- s0894_all_possible_full_binary_trees
- s0897_increasing_order_search_tree
- g0901_1000
- s0909_snakes_and_ladders
- s0913_cat_and_mouse
- s0919_complete_binary_tree_inserter
- s0931_minimum_falling_path_sum
- s0935_knight_dialer
- s0938_range_sum_of_bst
- s0939_minimum_area_rectangle
- s0941_valid_mountain_array
- s0951_flip_equivalent_binary_trees
- s0952_largest_component_size_by_common_factor
- s0958_check_completeness_of_a_binary_tree
- s0959_regions_cut_by_slashes
- s0963_minimum_area_rectangle_ii
- s0965_univalued_binary_tree
- s0968_binary_tree_cameras
- s0971_flip_binary_tree_to_match_preorder_traversal
- s0973_k_closest_points_to_origin
- s0979_distribute_coins_in_binary_tree
- s0980_unique_paths_iii
- s0986_interval_list_intersections
- s0987_vertical_order_traversal_of_a_binary_tree
- s0988_smallest_string_starting_from_leaf
- s0993_cousins_in_binary_tree
- s0994_rotting_oranges
- s0998_maximum_binary_tree_ii
- s0999_available_captures_for_rook
- g1001_1100
- s1001_grid_illumination
- s1007_minimum_domino_rotations_for_equal_row
- s1008_construct_binary_search_tree_from_preorder_traversal
- s1019_next_greater_node_in_linked_list
- s1020_number_of_enclaves
- s1022_sum_of_root_to_leaf_binary_numbers
- s1026_maximum_difference_between_node_and_ancestor
- s1028_recover_a_tree_from_preorder_traversal
- s1035_uncrossed_lines
- s1038_binary_search_tree_to_greater_sum_tree
- s1039_minimum_score_triangulation_of_polygon
- s1074_number_of_submatrices_that_sum_to_target
- s1080_insufficient_nodes_in_root_to_leaf_paths
- s1091_shortest_path_in_binary_matrix
- g1101_1200
- s1104_path_in_zigzag_labelled_binary_tree
- s1105_filling_bookcase_shelves
- s1110_delete_nodes_and_return_forest
- s1123_lowest_common_ancestor_of_deepest_leaves
- s1130_minimum_cost_tree_from_leaf_values
- s1138_alphabet_board_path
- s1145_binary_tree_coloring_game
- s1161_maximum_level_sum_of_a_binary_tree
- s1162_as_far_from_land_as_possible
- s1184_distance_between_bus_stops
- s1189_maximum_number_of_balloons
- s1192_critical_connections_in_a_network
- g1201_1300
- s1203_sort_items_by_groups_respecting_dependencies
- s1206_design_skiplist
- s1210_minimum_moves_to_reach_target_with_rotations
- s1217_minimum_cost_to_move_chips_to_the_same_position
- s1222_queens_that_can_attack_the_king
- s1226_the_dining_philosophers
- s1232_check_if_it_is_a_straight_line
- s1235_maximum_profit_in_job_scheduling
- s1240_tiling_a_rectangle_with_the_fewest_squares
- s1252_cells_with_odd_values_in_a_matrix
- s1254_number_of_closed_islands
- s1260_shift_2d_grid
- s1261_find_elements_in_a_contaminated_binary_tree
- s1263_minimum_moves_to_move_a_box_to_their_target_location
- s1266_minimum_time_visiting_all_points
- s1267_count_servers_that_communicate
- s1275_find_winner_on_a_tic_tac_toe_game
- s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix
- s1289_minimum_falling_path_sum_ii
- s1290_convert_binary_number_in_a_linked_list_to_integer
- s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold
- s1293_shortest_path_in_a_grid_with_obstacles_elimination
- g1301_1400
- s1302_deepest_leaves_sum
- s1305_all_elements_in_two_binary_search_trees
- s1311_get_watched_videos_by_your_friends
- s1315_sum_of_nodes_with_even_valued_grandparent
- s1318_minimum_flips_to_make_a_or_b_equal_to_c
- s1319_number_of_operations_to_make_network_connected
- s1320_minimum_distance_to_type_a_word_using_two_fingers
- s1325_delete_leaves_with_a_given_value
- s1326_minimum_number_of_taps_to_open_to_water_a_garden
- s1329_sort_the_matrix_diagonally
- s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance
- s1335_minimum_difficulty_of_a_job_schedule
- s1339_maximum_product_of_splitted_binary_tree
- s1340_jump_game_v
- s1344_angle_between_hands_of_a_clock
- s1349_maximum_students_taking_exam
- s1353_maximum_number_of_events_that_can_be_attended
- s1361_validate_binary_tree_nodes
- s1367_linked_list_in_binary_tree
- s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid
- s1372_longest_zigzag_path_in_a_binary_tree
- s1373_maximum_sum_bst_in_binary_tree
- s1376_time_needed_to_inform_all_employees
- s1377_frog_position_after_t_seconds
- s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree
- s1382_balance_a_binary_search_tree
- s1386_cinema_seat_allocation
- s1388_pizza_with_3n_slices
- s1391_check_if_there_is_a_valid_path_in_a_grid
- g1401_1500
- s1401_circle_and_rectangle_overlapping
- s1411_number_of_ways_to_paint_n_3_grid
- s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons
- s1424_diagonal_traverse_ii
- s1437_check_if_all_1s_are_at_least_length_k_places_away
- s1443_minimum_time_to_collect_all_apples_in_a_tree
- s1444_number_of_ways_of_cutting_a_pizza
- s1448_count_good_nodes_in_binary_tree
- s1453_maximum_number_of_darts_inside_of_a_circular_dartboard
- s1457_pseudo_palindromic_paths_in_a_binary_tree
- s1462_course_schedule_iv
- s1463_cherry_pickup_ii
- s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts
- s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero
- s1478_allocate_mailboxes
- s1483_kth_ancestor_of_a_tree_node
- s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree
- s1494_parallel_courses_ii
- s1496_path_crossing
- g1501_1600
- s1503_last_moment_before_all_ants_fall_out_of_a_plank
- s1504_count_submatrices_with_all_ones
- s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits
- s1514_path_with_maximum_probability
- s1515_best_position_for_a_service_centre
- s1518_water_bottles
- s1519_number_of_nodes_in_the_sub_tree_with_the_same_label
- s1521_find_a_value_of_a_mysterious_function_closest_to_target
- s1528_shuffle_string
- s1530_number_of_good_leaf_nodes_pairs
- s1536_minimum_swaps_to_arrange_a_binary_grid
- s1537_get_the_maximum_score
- s1547_minimum_cost_to_cut_a_stick
- s1552_magnetic_force_between_two_balls
- s1557_minimum_number_of_vertices_to_reach_all_nodes
- s1558_minimum_numbers_of_function_calls_to_make_target_array
- s1559_detect_cycles_in_2d_grid
- s1560_most_visited_sector_in_a_circular_track
- s1568_minimum_number_of_days_to_disconnect_island
- s1569_number_of_ways_to_reorder_array_to_get_same_bst
- s1572_matrix_diagonal_sum
- s1578_minimum_time_to_make_rope_colorful
- s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable
- s1582_special_positions_in_a_binary_matrix
- s1584_min_cost_to_connect_all_points
- s1591_strange_printer_ii
- s1594_maximum_non_negative_product_in_a_matrix
- s1595_minimum_cost_to_connect_two_groups_of_points
- s1598_crawler_log_folder
- s1599_maximum_profit_of_operating_a_centennial_wheel
- g1601_1700
- s1601_maximum_number_of_achievable_transfer_requests
- s1606_find_servers_that_handled_most_number_of_requests
- s1609_even_odd_tree
- s1610_maximum_number_of_visible_points
- s1615_maximal_network_rank
- s1617_count_subtrees_with_max_distance_between_cities
- s1620_coordinate_with_maximum_network_quality
- s1621_number_of_sets_of_k_non_overlapping_line_segments
- s1627_graph_connectivity_with_threshold
- s1631_path_with_minimum_effort
- s1632_rank_transform_of_a_matrix
- s1637_widest_vertical_area_between_two_points_containing_no_points
- s1642_furthest_building_you_can_reach
- s1643_kth_smallest_instructions
- s1648_sell_diminishing_valued_colored_balls
- s1656_design_an_ordered_stream
- s1659_maximize_grid_happiness
- s1669_merge_in_between_linked_lists
- s1691_maximum_height_by_stacking_cuboids
- s1697_checking_existence_of_edge_length_limited_paths
- g1701_1800
- s1706_where_will_the_ball_fall
- s1719_number_of_ways_to_reconstruct_a_tree
- s1721_swapping_nodes_in_a_linked_list
- s1727_largest_submatrix_with_rearrangements
- s1728_cat_and_mouse_ii
- s1739_building_boxes
- s1751_maximum_number_of_events_that_can_be_attended_ii
- s1761_minimum_degree_of_a_connected_trio_in_a_graph
- s1765_map_of_highest_peak
- s1766_tree_of_coprimes
- s1782_count_pairs_of_nodes
- s1786_number_of_restricted_paths_from_first_to_last_node
- s1791_find_center_of_star_graph
- s1797_design_authentication_manager
- g1801_1900
- s1801_number_of_orders_in_the_backlog
- s1812_determine_color_of_a_chessboard_square
- s1819_number_of_different_subsequences_gcds
- s1823_find_the_winner_of_the_circular_game
- s1824_minimum_sideway_jumps
- s1828_queries_on_number_of_points_inside_a_circle
- s1840_maximum_building_height
- s1857_largest_color_value_in_a_directed_graph
- s1861_rotating_the_box
- s1878_get_biggest_three_rhombus_sums_in_a_grid
- s1886_determine_whether_matrix_can_be_obtained_by_rotation
- s1895_largest_magic_square
- g1901_2000
- s1901_find_a_peak_element_ii
- s1905_count_sub_islands
- s1914_cyclically_rotating_a_grid
- s1916_count_ways_to_build_rooms_in_an_ant_colony
- s1926_nearest_exit_from_entrance_in_maze
- s1928_minimum_cost_to_reach_destination_in_time
- s1931_painting_a_grid_with_three_different_colors
- s1932_merge_bsts_to_create_single_bst
- s1937_maximum_number_of_points_with_cost
- s1938_maximum_genetic_difference_query
- s1943_describe_the_painting
- s1944_number_of_visible_people_in_a_queue
- s1948_delete_duplicate_folders_in_system
- s1954_minimum_garden_perimeter_to_collect_enough_apples
- s1958_check_if_move_is_legal
- s1970_last_day_where_you_can_still_cross
- s1971_find_if_path_exists_in_graph
- s1974_minimum_time_to_type_word_using_special_typewriter
- s1975_maximum_matrix_sum
- s1976_number_of_ways_to_arrive_at_destination
- s1981_minimize_the_difference_between_target_and_chosen_elements
- s1992_find_all_groups_of_farmland
- s1993_operations_on_tree
- g2001_2100
- s2002_maximum_product_of_the_length_of_two_palindromic_subsequences
- s2003_smallest_missing_genetic_value_in_each_subtree
- s2013_detect_squares
- s2014_longest_subsequence_repeated_k_times
- s2017_grid_game
- s2018_check_if_word_can_be_placed_in_crossword
- s2019_the_score_of_students_solving_math_expression
- s2022_convert_1d_array_into_2d_array
- s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter
- s2033_minimum_operations_to_make_a_uni_value_grid
- s2035_partition_array_into_two_arrays_to_minimize_sum_difference
- s2039_the_time_when_the_network_becomes_idle
- s2042_check_if_numbers_are_ascending_in_a_sentence
- s2045_second_minimum_time_to_reach_destination
- s2049_count_nodes_with_the_highest_score
- s2050_parallel_courses_iii
- s2054_two_best_non_overlapping_events
- s2055_plates_between_candles
- s2056_number_of_valid_move_combinations_on_chessboard
- s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points
- s2065_maximum_path_quality_of_a_graph
- s2069_walking_robot_simulation_ii
- s2074_reverse_nodes_in_even_length_groups
- s2075_decode_the_slanted_ciphertext
- s2078_two_furthest_houses_with_different_colors
- s2087_minimum_cost_homecoming_of_a_robot_in_a_grid
- s2088_count_fertile_pyramids_in_a_land
- s2090_k_radius_subarray_averages
- s2095_delete_the_middle_node_of_a_linked_list
- s2096_step_by_step_directions_from_a_binary_tree_node_to_another
- g2101_2200
- s2101_detonate_the_maximum_bombs
- s2103_rings_and_rods
- s2106_maximum_fruits_harvested_after_at_most_k_steps
- s2116_check_if_a_parentheses_string_can_be_valid
- s2120_execution_of_all_suffix_instructions_staying_in_a_grid
- s2125_number_of_laser_beams_in_a_bank
- s2127_maximum_employees_to_be_invited_to_a_meeting
- s2130_maximum_twin_sum_of_a_linked_list
- s2132_stamping_the_grid
- s2133_check_if_every_row_and_column_contains_all_numbers
- s2136_earliest_possible_day_of_full_bloom
- s2141_maximum_running_time_of_n_computers
- s2146_k_highest_ranked_items_within_a_price_range
- s2147_number_of_ways_to_divide_a_long_corridor
- s2151_maximum_good_people_based_on_statements
- s2162_minimum_cost_to_set_cooking_time
- s2181_merge_nodes_in_between_zeros
- s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph
- s2194_cells_in_a_range_on_an_excel_sheet
- s2196_create_binary_tree_from_descriptions
- g2201_2300
- s2201_count_artifacts_that_can_be_extracted
- s2203_minimum_weighted_subgraph_with_the_required_paths
- s2209_minimum_white_tiles_after_covering_with_carpets
- s2212_maximum_points_in_an_archery_competition
- s2218_maximum_value_of_k_coins_from_piles
- s2221_find_triangular_sum_of_an_array
- s2236_root_equals_sum_of_children
- s2242_maximum_score_of_a_node_sequence
- s2245_maximum_trailing_zeros_in_a_cornered_path
- s2246_longest_path_with_different_adjacent_characters
- s2249_count_lattice_points_inside_a_circle
- s2250_count_number_of_rectangles_containing_each_point
- s2251_number_of_flowers_in_full_bloom
- s2257_count_unguarded_cells_in_the_grid
- s2258_escape_the_spreading_fire
- s2265_count_nodes_equal_to_average_of_subtree
- s2266_count_number_of_texts
- s2267_check_if_there_is_a_valid_parentheses_string_path
- s2271_maximum_white_tiles_covered_by_a_carpet
- s2280_minimum_lines_to_represent_a_line_chart
- s2285_maximum_total_importance_of_roads
- s2290_minimum_obstacle_removal_to_reach_corner
- s2293_min_max_game
- g2301_2400
- s2304_minimum_path_cost_in_a_grid
- s2312_selling_pieces_of_wood
- s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph
- s2319_check_if_matrix_is_x_matrix
- s2320_count_number_of_ways_to_place_houses
- s2322_minimum_score_after_removals_on_a_tree
- s2325_decode_the_message
- s2326_spiral_matrix_iv
- s2328_number_of_increasing_paths_in_a_grid
- s2331_evaluate_boolean_binary_tree
- s2352_equal_row_and_column_pairs
- s2359_find_closest_node_to_given_two_nodes
- s2360_longest_cycle_in_a_graph
- s2368_reachable_nodes_with_restrictions
- s2373_largest_local_values_in_a_matrix
- s2374_node_with_highest_edge_score
- s2385_amount_of_time_for_binary_tree_to_be_infected
- s2392_build_a_matrix_with_conditions
- s2397_maximum_rows_covered_by_columns
- g2401_2500
- s2415_reverse_odd_levels_of_binary_tree
- s2421_number_of_good_paths
- s2428_maximum_sum_of_an_hourglass
- s2435_paths_in_matrix_whose_sum_is_divisible_by_k
- s2440_create_components_with_same_value
- s2458_height_of_binary_tree_after_subtree_removal_queries
- s2463_minimum_total_distance_traveled
- s2467_most_profitable_path_in_a_tree
- s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level
- s2476_closest_nodes_queries_in_a_binary_search_tree
- s2477_minimum_fuel_cost_to_report_to_the_capital
- s2481_minimum_cuts_to_divide_a_circle
- s2482_difference_between_ones_and_zeros_in_row_and_column
- s2487_remove_nodes_from_linked_list
- s2492_minimum_score_of_a_path_between_two_cities
- s2493_divide_nodes_into_the_maximum_number_of_groups
- s2497_maximum_star_sum_of_a_graph
- s2498_frog_jump_ii
- s2500_delete_greatest_value_in_each_row
- g2501_2600
- s2503_maximum_number_of_points_from_grid_queries
- s2508_add_edges_to_make_degrees_of_all_nodes_even
- s2509_cycle_length_queries_in_a_tree
- s2536_increment_submatrices_by_one
- s2538_difference_between_maximum_and_minimum_price_sum
- s2545_sort_the_students_by_their_kth_score
- s2550_count_collisions_of_monkeys_on_a_polygon
- s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip
- s2577_minimum_time_to_visit_a_cell_in_a_grid
- s2579_count_total_number_of_colored_cells
- s2581_count_number_of_possible_root_nodes
- s2583_kth_largest_sum_in_a_binary_tree
- s2584_split_the_array_to_make_coprime_products
- s2596_check_knight_tour_configuration
- g2601_2700
- s2603_collect_coins_in_a_tree
- s2608_shortest_cycle_in_a_graph
- s2614_prime_in_diagonal
- s2617_minimum_number_of_visited_cells_in_a_grid
- s2624_snail_traversal
- s2627_debounce
- s2641_cousins_in_binary_tree_ii
- s2642_design_graph_with_shortest_path_calculator
- s2646_minimize_the_total_price_of_the_trips
- s2658_maximum_number_of_fish_in_a_grid
- s2661_first_completely_painted_row_or_column
- s2673_make_costs_of_paths_equal_in_a_binary_tree
- s2684_maximum_number_of_moves_in_a_grid
- s2685_count_the_number_of_complete_components
- s2699_modify_graph_edge_weights
- g2701_2800
- s2711_difference_of_number_of_distinct_values_on_diagonals
- s2713_maximum_strictly_increasing_cells_in_a_matrix
- s2718_sum_of_matrix_after_queries
- s2751_robot_collisions
- s2768_number_of_black_blocks
- s2791_count_paths_that_can_form_a_palindrome_in_a_tree
- g2801_2900
- s2807_insert_greatest_common_divisors_in_linked_list
- s2812_find_the_safest_path_in_a_grid
- s2816_double_a_number_represented_as_a_linked_list
- s2846_minimum_edge_weight_equilibrium_queries_in_a_tree
- s2849_determine_if_a_cell_is_reachable_at_a_given_time
- s2850_minimum_moves_to_spread_stones_over_grid
- s2858_minimum_edge_reversals_so_every_node_is_reachable
- s2867_count_valid_paths_in_a_tree
- s2872_maximum_number_of_k_divisible_components
- s2876_count_visited_nodes_in_a_directed_graph
- g2901_3000
- s2920_maximum_points_after_collecting_coins_from_all_nodes
- s2924_find_champion_ii
- s2925_maximum_score_after_applying_operations_on_a_tree
- s2943_maximize_area_of_square_hole_in_grid
- s2946_matrix_similarity_after_cyclic_shifts
- s2959_number_of_possible_sets_of_closing_branches
- s2973_find_number_of_coins_to_place_in_tree_nodes
- s2975_maximum_square_area_by_removing_fences_from_a_field
- g3001_3100
- s3001_minimum_moves_to_capture_the_queen
- s3014_minimum_number_of_pushes_to_type_word_i
- s3015_count_the_number_of_houses_at_a_certain_distance_i
- s3016_minimum_number_of_pushes_to_type_word_ii
- s3017_count_the_number_of_houses_at_a_certain_distance_ii
- s3025_find_the_number_of_ways_to_place_people_i
- s3027_find_the_number_of_ways_to_place_people_ii
- s3030_find_the_grid_of_region_average
- s3033_modify_the_matrix
- s3044_most_frequent_prime
- s3047_find_the_largest_area_of_square_inside_two_rectangles
- s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network
- s3068_find_the_maximum_sum_of_node_values
- s3070_count_submatrices_with_top_left_element_and_sum_less_than_k
- s3071_minimum_operations_to_write_the_letter_y_on_a_grid
- s3100_water_bottles_ii
- g3101_3200
- s3108_minimum_cost_walk_in_weighted_graph
- s3111_minimum_rectangles_to_cover_points
- s3112_minimum_time_to_visit_disappearing_nodes
- s3122_minimum_number_of_operations_to_satisfy_conditions
- s3123_find_edges_in_shortest_paths
- s3142_check_if_grid_satisfies_conditions
- s3143_maximum_points_inside_the_square
- s3148_maximum_difference_score_in_a_grid
- s3149_find_the_minimum_cost_array_permutation
- s3160_find_the_number_of_distinct_colors_among_the_balls
- s3161_block_placement_queries
- s3195_find_the_minimum_area_to_cover_all_ones_i
- s3197_find_the_minimum_area_to_cover_all_ones_ii
- s3200_maximum_height_of_a_triangle
- g3201_3300
- s3203_find_minimum_diameter_after_merging_two_trees
- s3206_alternating_groups_i
- s3208_alternating_groups_ii
- s3212_count_submatrices_with_equal_frequency_of_x_and_y
- s3217_delete_nodes_from_linked_list_present_in_array
- s3218_minimum_cost_for_cutting_cake_i
- s3219_minimum_cost_for_cutting_cake_ii
- s3225_maximum_score_from_grid_operations
- s3235_check_if_the_rectangle_corner_is_reachable
- s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i
- s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii
- s3241_time_taken_to_mark_all_nodes
- s3242_design_neighbor_sum_service
- s3243_shortest_distance_after_road_addition_queries_i
- s3244_shortest_distance_after_road_addition_queries_ii
- s3245_alternating_groups_iii
- s3249_count_the_number_of_good_nodes
- s3256_maximum_value_sum_by_placing_three_rooks_i
- s3257_maximum_value_sum_by_placing_three_rooks_ii
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
1,919 files changed
+1279
-1263
lines changedLines changed: 1 addition & 1 deletion
Lines changed: 1 addition & 1 deletion
Lines changed: 1 addition & 1 deletion
Lines changed: 1 addition & 1 deletion
Lines changed: 1 addition & 1 deletion
0 commit comments