diff --git a/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java b/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java index beecfb0c2..016313511 100644 --- a/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java +++ b/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java @@ -1,7 +1,7 @@ package g2001_2100.s2054_two_best_non_overlapping_events; // #Medium #Array #Dynamic_Programming #Sorting #Binary_Search #Heap_Priority_Queue -// #2022_05_24_Time_58_ms(70.59%)_Space_109.2_MB_(88.24%) +// #2022_05_24_Time_58_ms_(70.59%)_Space_109.2_MB_(88.24%) import java.util.Arrays; diff --git a/src/main/java/g3301_3400/s3392_count_subarrays_of_length_three_with_a_condition/Solution.java b/src/main/java/g3301_3400/s3392_count_subarrays_of_length_three_with_a_condition/Solution.java index d3d1c6b6a..58940e32d 100644 --- a/src/main/java/g3301_3400/s3392_count_subarrays_of_length_three_with_a_condition/Solution.java +++ b/src/main/java/g3301_3400/s3392_count_subarrays_of_length_three_with_a_condition/Solution.java @@ -1,6 +1,6 @@ package g3301_3400.s3392_count_subarrays_of_length_three_with_a_condition; -// #Easy #Array #2025_01_06_Time_1_(100.00%)_Space_44.87_(93.12%) +// #Easy #Array #2025_01_06_Time_1_ms_(100.00%)_Space_44.87_MB_(93.12%) public class Solution { public int countSubarrays(int[] nums) { diff --git a/src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value/Solution.java b/src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value/Solution.java index 964dd8ed8..2101348be 100644 --- a/src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value/Solution.java +++ b/src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value/Solution.java @@ -1,7 +1,7 @@ package g3301_3400.s3393_count_paths_with_the_given_xor_value; // #Medium #Array #Dynamic_Programming #Math #Matrix #Bit_Manipulation -// #2025_01_06_Time_76_(62.72%)_Space_56.92_(68.41%) +// #2025_01_06_Time_76_ms_(62.72%)_Space_56.92_MB_(68.41%) import java.util.Arrays; diff --git a/src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.java b/src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.java index b58f8ebf9..203f5428b 100644 --- a/src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.java +++ b/src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.java @@ -1,6 +1,6 @@ package g3301_3400.s3394_check_if_grid_can_be_cut_into_sections; -// #Medium #Geometry #Line_Sweep #2025_01_06_Time_35_(99.66%)_Space_117.96_(80.52%) +// #Medium #Geometry #Line_Sweep #2025_01_06_Time_35_ms_(99.66%)_Space_117.96_MB_(80.52%) import java.util.Arrays; diff --git a/src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java b/src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java index 08a45ff94..22571eb62 100644 --- a/src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java +++ b/src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java @@ -1,6 +1,7 @@ package g3301_3400.s3395_subsequences_with_a_unique_middle_mode_i; -// #Hard #Array #Hash_Table #Math #Combinatorics #2025_01_06_Time_27_(99.29%)_Space_45.15_(97.87%) +// #Hard #Array #Hash_Table #Math #Combinatorics +// #2025_01_06_Time_27_ms_(99.29%)_Space_45.15_MB_(97.87%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g3301_3400/s3396_minimum_number_of_operations_to_make_elements_in_array_distinct/Solution.java b/src/main/java/g3301_3400/s3396_minimum_number_of_operations_to_make_elements_in_array_distinct/Solution.java index 5f141cf77..32c90e61e 100644 --- a/src/main/java/g3301_3400/s3396_minimum_number_of_operations_to_make_elements_in_array_distinct/Solution.java +++ b/src/main/java/g3301_3400/s3396_minimum_number_of_operations_to_make_elements_in_array_distinct/Solution.java @@ -1,6 +1,6 @@ package g3301_3400.s3396_minimum_number_of_operations_to_make_elements_in_array_distinct; -// #Easy #Array #Greedy #Simulation #2025_01_06_Time_3_(60.47%)_Space_44.61_(50.65%) +// #Easy #Array #Greedy #Simulation #2025_01_06_Time_3_ms_(60.47%)_Space_44.61_MB_(50.65%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g3301_3400/s3397_maximum_number_of_distinct_elements_after_operations/Solution.java b/src/main/java/g3301_3400/s3397_maximum_number_of_distinct_elements_after_operations/Solution.java index 36f4308c2..2b1b29d67 100644 --- a/src/main/java/g3301_3400/s3397_maximum_number_of_distinct_elements_after_operations/Solution.java +++ b/src/main/java/g3301_3400/s3397_maximum_number_of_distinct_elements_after_operations/Solution.java @@ -1,6 +1,6 @@ package g3301_3400.s3397_maximum_number_of_distinct_elements_after_operations; -// #Medium #Array #Sorting #Greedy #2025_01_06_Time_19_(84.32%)_Space_57.84_(93.53%) +// #Medium #Array #Sorting #Greedy #2025_01_06_Time_19_ms_(84.32%)_Space_57.84_MB_(93.53%) import java.util.Arrays; diff --git a/src/main/java/g3301_3400/s3398_smallest_substring_with_identical_characters_i/Solution.java b/src/main/java/g3301_3400/s3398_smallest_substring_with_identical_characters_i/Solution.java index 38655adfc..8cca1cd6d 100644 --- a/src/main/java/g3301_3400/s3398_smallest_substring_with_identical_characters_i/Solution.java +++ b/src/main/java/g3301_3400/s3398_smallest_substring_with_identical_characters_i/Solution.java @@ -1,6 +1,6 @@ package g3301_3400.s3398_smallest_substring_with_identical_characters_i; -// #Hard #Array #Binary_Search #Enumeration #2025_01_06_Time_1_(100.00%)_Space_42.72_(39.94%) +// #Hard #Array #Binary_Search #Enumeration #2025_01_06_Time_1_ms_(100.00%)_Space_42.72_MB_(39.94%) public class Solution { public int minLength(String s, int ops) { diff --git a/src/main/java/g3301_3400/s3399_smallest_substring_with_identical_characters_ii/Solution.java b/src/main/java/g3301_3400/s3399_smallest_substring_with_identical_characters_ii/Solution.java index 1142ed9b2..672a67264 100644 --- a/src/main/java/g3301_3400/s3399_smallest_substring_with_identical_characters_ii/Solution.java +++ b/src/main/java/g3301_3400/s3399_smallest_substring_with_identical_characters_ii/Solution.java @@ -1,6 +1,6 @@ package g3301_3400.s3399_smallest_substring_with_identical_characters_ii; -// #Hard #Bit_Manipulation #Sliding_Window #2025_01_06_Time_15_(98.93%)_Space_45.62_(57.38%) +// #Hard #Bit_Manipulation #Sliding_Window #2025_01_06_Time_15_ms_(98.93%)_Space_45.62_MB_(57.38%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g3401_3500/s3402_minimum_operations_to_make_columns_strictly_increasing/Solution.java b/src/main/java/g3401_3500/s3402_minimum_operations_to_make_columns_strictly_increasing/Solution.java index 27c2f6c68..c6a2cb451 100644 --- a/src/main/java/g3401_3500/s3402_minimum_operations_to_make_columns_strictly_increasing/Solution.java +++ b/src/main/java/g3401_3500/s3402_minimum_operations_to_make_columns_strictly_increasing/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3402_minimum_operations_to_make_columns_strictly_increasing; -// #Easy #Matrix #Simulation #2025_01_06_Time_1_(99.95%)_Space_45.24_(62.37%) +// #Easy #Matrix #Simulation #2025_01_06_Time_1_ms_(99.95%)_Space_45.24_MB_(62.37%) public class Solution { public int minimumOperations(int[][] grid) { diff --git a/src/main/java/g3401_3500/s3403_find_the_lexicographically_largest_string_from_the_box_i/Solution.java b/src/main/java/g3401_3500/s3403_find_the_lexicographically_largest_string_from_the_box_i/Solution.java index 6925608bc..1f99b5153 100644 --- a/src/main/java/g3401_3500/s3403_find_the_lexicographically_largest_string_from_the_box_i/Solution.java +++ b/src/main/java/g3401_3500/s3403_find_the_lexicographically_largest_string_from_the_box_i/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3403_find_the_lexicographically_largest_string_from_the_box_i; -// #Medium #String #Two_Pointers #Enumeration #2025_01_06_Time_5_(89.70%)_Space_45.38_(80.39%) +// #Medium #String #Two_Pointers #Enumeration #2025_01_06_Time_5_ms_(89.70%)_Space_45.38_MB_(80.39%) public class Solution { public String answerString(String word, int numFriends) { diff --git a/src/main/java/g3401_3500/s3404_count_special_subsequences/Solution.java b/src/main/java/g3401_3500/s3404_count_special_subsequences/Solution.java index 33977c94b..40033c699 100644 --- a/src/main/java/g3401_3500/s3404_count_special_subsequences/Solution.java +++ b/src/main/java/g3401_3500/s3404_count_special_subsequences/Solution.java @@ -1,6 +1,7 @@ package g3401_3500.s3404_count_special_subsequences; -// #Medium #Array #Hash_Table #Math #Enumeration #2025_01_06_Time_342_(73.58%)_Space_55.00_(79.58%) +// #Medium #Array #Hash_Table #Math #Enumeration +// #2025_01_06_Time_342_ms_(73.58%)_Space_55.00_MB_(79.58%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g3401_3500/s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements/Solution.java b/src/main/java/g3401_3500/s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements/Solution.java index 4533beb5f..a95bd473c 100644 --- a/src/main/java/g3401_3500/s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements/Solution.java +++ b/src/main/java/g3401_3500/s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements; -// #Hard #Math #Combinatorics #2025_01_06_Time_55_(52.53%)_Space_44.95_(37.58%) +// #Hard #Math #Combinatorics #2025_01_06_Time_55_ms_(52.53%)_Space_44.95_MB_(37.58%) public class Solution { private static final int MOD = (int) (1e9 + 7); diff --git a/src/main/java/g3401_3500/s3407_substring_matching_pattern/Solution.java b/src/main/java/g3401_3500/s3407_substring_matching_pattern/Solution.java index acd8024e6..0aad7611d 100644 --- a/src/main/java/g3401_3500/s3407_substring_matching_pattern/Solution.java +++ b/src/main/java/g3401_3500/s3407_substring_matching_pattern/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3407_substring_matching_pattern; -// #Easy #String #String_Matching #2025_01_06_Time_1_(100.00%)_Space_42.63_(100.00%) +// #Easy #String #String_Matching #2025_01_06_Time_1_ms_(100.00%)_Space_42.63_MB_(100.00%) public class Solution { public boolean hasMatch(String s, String p) { diff --git a/src/main/java/g3401_3500/s3408_design_task_manager/TaskManager.java b/src/main/java/g3401_3500/s3408_design_task_manager/TaskManager.java index 491a28657..bfe0c405c 100644 --- a/src/main/java/g3401_3500/s3408_design_task_manager/TaskManager.java +++ b/src/main/java/g3401_3500/s3408_design_task_manager/TaskManager.java @@ -1,7 +1,7 @@ package g3401_3500.s3408_design_task_manager; // #Medium #Hash_Table #Design #Heap_Priority_Queue #Ordered_Set -// #2025_01_06_Time_349_(100.00%)_Space_152.40_(100.00%) +// #2025_01_06_Time_349_ms_(100.00%)_Space_152.40_MB_(100.00%) import java.util.HashMap; import java.util.List; diff --git a/src/main/java/g3401_3500/s3409_longest_subsequence_with_decreasing_adjacent_difference/Solution.java b/src/main/java/g3401_3500/s3409_longest_subsequence_with_decreasing_adjacent_difference/Solution.java index 603b8afdf..d507b9a36 100644 --- a/src/main/java/g3401_3500/s3409_longest_subsequence_with_decreasing_adjacent_difference/Solution.java +++ b/src/main/java/g3401_3500/s3409_longest_subsequence_with_decreasing_adjacent_difference/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3409_longest_subsequence_with_decreasing_adjacent_difference; -// #Medium #Array #Dynamic_Programming #2025_01_07_Time_68_(99.55%)_Space_45.74_(78.73%) +// #Medium #Array #Dynamic_Programming #2025_01_07_Time_68_ms_(99.55%)_Space_45.74_MB_(78.73%) public class Solution { public int longestSubsequence(int[] nums) { diff --git a/src/main/java/g3401_3500/s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element/Solution.java b/src/main/java/g3401_3500/s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element/Solution.java index d16511fba..8a5f82679 100644 --- a/src/main/java/g3401_3500/s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element/Solution.java +++ b/src/main/java/g3401_3500/s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element/Solution.java @@ -1,6 +1,7 @@ package g3401_3500.s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element; -// #Hard #Array #Dynamic_Programming #Segment_Tree #2025_01_07_Time_51_(97.96%)_Space_57.22_(85.71%) +// #Hard #Array #Dynamic_Programming #Segment_Tree +// #2025_01_07_Time_51_ms_(97.96%)_Space_57.22_MB_(85.71%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g3401_3500/s3411_maximum_subarray_with_equal_products/Solution.java b/src/main/java/g3401_3500/s3411_maximum_subarray_with_equal_products/Solution.java index 8a914f48a..5ad1453fb 100644 --- a/src/main/java/g3401_3500/s3411_maximum_subarray_with_equal_products/Solution.java +++ b/src/main/java/g3401_3500/s3411_maximum_subarray_with_equal_products/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3411_maximum_subarray_with_equal_products; // #Easy #Array #Math #Sliding_Window #Enumeration #Number_Theory -// #2025_01_07_Time_3_(91.26%)_Space_42.68_(64.20%) +// #2025_01_07_Time_3_ms_(91.26%)_Space_42.68_MB_(64.20%) public class Solution { private int gcd(int a, int b) { diff --git a/src/main/java/g3401_3500/s3412_find_mirror_score_of_a_string/Solution.java b/src/main/java/g3401_3500/s3412_find_mirror_score_of_a_string/Solution.java index 76dd19307..dbecbde12 100644 --- a/src/main/java/g3401_3500/s3412_find_mirror_score_of_a_string/Solution.java +++ b/src/main/java/g3401_3500/s3412_find_mirror_score_of_a_string/Solution.java @@ -1,6 +1,7 @@ package g3401_3500.s3412_find_mirror_score_of_a_string; -// #Medium #String #Hash_Table #Stack #Simulation #2025_01_07_Time_12_(99.54%)_Space_45.78_(74.26%) +// #Medium #String #Hash_Table #Stack #Simulation +// #2025_01_07_Time_12_ms_(99.54%)_Space_45.78_MB_(74.26%) import java.util.ArrayList; diff --git a/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java b/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java index e66f13151..457b77a3e 100644 --- a/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java +++ b/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3413_maximum_coins_from_k_consecutive_bags; // #Medium #Array #Sorting #Greedy #Binary_Search #Prefix_Sum #Sliding_Window -// #2025_01_07_Time_82_(92.23%)_Space_134.12_(21.36%) +// #2025_01_07_Time_82_ms_(92.23%)_Space_134.12_MB_(21.36%) import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java b/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java index b200aaa89..c1f2367f8 100644 --- a/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java +++ b/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3414_maximum_score_of_non_overlapping_intervals; // #Hard #Array #Dynamic_Programming #Sorting #Binary_Search -// #2025_01_08_Time_64_(95.65%)_Space_74.80_(98.26%) +// #2025_01_08_Time_64_ms_(95.65%)_Space_74.80_MB_(98.26%) import java.util.Arrays; import java.util.List; diff --git a/src/main/java/g3401_3500/s3417_zigzag_grid_traversal_with_skip/Solution.java b/src/main/java/g3401_3500/s3417_zigzag_grid_traversal_with_skip/Solution.java index 7863b5ae1..81d7e1b27 100644 --- a/src/main/java/g3401_3500/s3417_zigzag_grid_traversal_with_skip/Solution.java +++ b/src/main/java/g3401_3500/s3417_zigzag_grid_traversal_with_skip/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3417_zigzag_grid_traversal_with_skip; -// #Easy #Array #Matrix #Simulation #2025_01_15_Time_1_(100.00%)_Space_45.56_(84.25%) +// #Easy #Array #Matrix #Simulation #2025_01_15_Time_1_ms_(100.00%)_Space_45.56_MB_(84.25%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g3401_3500/s3418_maximum_amount_of_money_robot_can_earn/Solution.java b/src/main/java/g3401_3500/s3418_maximum_amount_of_money_robot_can_earn/Solution.java index a91076041..60541fa7f 100644 --- a/src/main/java/g3401_3500/s3418_maximum_amount_of_money_robot_can_earn/Solution.java +++ b/src/main/java/g3401_3500/s3418_maximum_amount_of_money_robot_can_earn/Solution.java @@ -1,6 +1,7 @@ package g3401_3500.s3418_maximum_amount_of_money_robot_can_earn; -// #Medium #Array #Dynamic_Programming #Matrix #2025_01_15_Time_12_(99.86%)_Space_72.43_(98.47%) +// #Medium #Array #Dynamic_Programming #Matrix +// #2025_01_15_Time_12_ms_(99.86%)_Space_72.43_MB_(98.47%) public class Solution { public int maximumAmount(int[][] coins) { diff --git a/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java b/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java index 4fa29dc2f..2e451ac7e 100644 --- a/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java +++ b/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3419_minimize_the_maximum_edge_weight_of_graph; // #Medium #Depth_First_Search #Breadth_First_Search #Binary_Search #Graph #Shortest_Path -// #2025_01_15_Time_64_(99.28%)_Space_110.17_(57.63%) +// #2025_01_15_Time_64_ms_(99.28%)_Space_110.17_MB_(57.63%) import java.util.ArrayList; import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations/Solution.java b/src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations/Solution.java index 28780ea83..d586c0d7f 100644 --- a/src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations/Solution.java +++ b/src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3420_count_non_decreasing_subarrays_after_k_operations; // #Hard #Array #Two_Pointers #Stack #Monotonic_Stack #Queue #Segment_Tree #Monotonic_Queue -// #2025_01_15_Time_29_(83.94%)_Space_62.04_(56.93%) +// #2025_01_15_Time_29_ms_(83.94%)_Space_62.04_MB_(56.93%) import java.util.ArrayDeque; import java.util.Deque; diff --git a/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.java b/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.java index b6b97952a..c232c033b 100644 --- a/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.java +++ b/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3423_maximum_difference_between_adjacent_elements_in_a_circular_array; -// #Easy #Array #2025_01_22_Time_1_(99.86%)_Space_43.72_(36.06%) +// #Easy #Array #2025_01_22_Time_1_ms_(99.86%)_Space_43.72_MB_(36.06%) public class Solution { public int maxAdjacentDistance(int[] nums) { diff --git a/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java b/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java index f60c23735..1693d012e 100644 --- a/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java +++ b/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3424_minimum_cost_to_make_arrays_identical; -// #Medium #Array #Sorting #Greedy #2025_01_23_Time_20_(98.92%)_Space_57.80_(28.30%) +// #Medium #Array #Sorting #Greedy #2025_01_23_Time_20_ms_(98.92%)_Space_57.80_MB_(28.30%) import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3425_longest_special_path/Solution.java b/src/main/java/g3401_3500/s3425_longest_special_path/Solution.java index 1be9ee2aa..2a225b1fd 100644 --- a/src/main/java/g3401_3500/s3425_longest_special_path/Solution.java +++ b/src/main/java/g3401_3500/s3425_longest_special_path/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3425_longest_special_path; // #Hard #Array #Hash_Table #Depth_First_Search #Tree #Sliding_Window -// #2025_01_22_Time_49_(74.66%)_Space_98.04_(44.26%) +// #2025_01_22_Time_49_ms_(74.66%)_Space_98.04_MB_(44.26%) import java.util.ArrayList; import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java b/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java index 7016aa07f..baa6a86d5 100644 --- a/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java +++ b/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3426_manhattan_distances_of_all_arrangements_of_pieces; -// #Hard #Math #Combinatorics #2025_01_22_Time_20_(87.92%)_Space_40.82_(98.07%) +// #Hard #Math #Combinatorics #2025_01_22_Time_20_ms_(87.92%)_Space_40.82_MB_(98.07%) public class Solution { private long comb(long a, long b, long mod) { diff --git a/src/main/java/g3401_3500/s3427_sum_of_variable_length_subarrays/Solution.java b/src/main/java/g3401_3500/s3427_sum_of_variable_length_subarrays/Solution.java index c713e549d..2e8a33410 100644 --- a/src/main/java/g3401_3500/s3427_sum_of_variable_length_subarrays/Solution.java +++ b/src/main/java/g3401_3500/s3427_sum_of_variable_length_subarrays/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3427_sum_of_variable_length_subarrays; -// #Easy #Array #Prefix_Sum #2025_01_22_Time_0_(100.00%)_Space_43.77_(58.41%) +// #Easy #Array #Prefix_Sum #2025_01_22_Time_0_ms_(100.00%)_Space_43.77_MB_(58.41%) public class Solution { public int subarraySum(int[] nums) { diff --git a/src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences/Solution.java b/src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences/Solution.java index 6875b956b..0a888e60c 100644 --- a/src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences/Solution.java +++ b/src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences; // #Medium #Array #Dynamic_Programming #Math #Sorting #Combinatorics -// #2025_01_22_Time_28_(99.74%)_Space_65.01_(35.71%) +// #2025_01_22_Time_28_ms_(99.74%)_Space_65.01_MB_(35.71%) import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3429_paint_house_iv/Solution.java b/src/main/java/g3401_3500/s3429_paint_house_iv/Solution.java index 596ca0701..68fdc7502 100644 --- a/src/main/java/g3401_3500/s3429_paint_house_iv/Solution.java +++ b/src/main/java/g3401_3500/s3429_paint_house_iv/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3429_paint_house_iv; -// #Medium #Array #Dynamic_Programming #2025_01_22_Time_5_(100.00%)_Space_106.29_(78.64%) +// #Medium #Array #Dynamic_Programming #2025_01_22_Time_5_ms_(100.00%)_Space_106.29_MB_(78.64%) public class Solution { public long minCost(int n, int[][] cost) { diff --git a/src/main/java/g3401_3500/s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays/Solution.java b/src/main/java/g3401_3500/s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays/Solution.java index 0b343f7c6..7e12098cc 100644 --- a/src/main/java/g3401_3500/s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays/Solution.java +++ b/src/main/java/g3401_3500/s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays/Solution.java @@ -1,6 +1,7 @@ package g3401_3500.s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays; -// #Hard #Array #Math #Stack #Monotonic_Stack #2025_01_22_Time_27_(99.40%)_Space_56.05_(94.64%) +// #Hard #Array #Math #Stack #Monotonic_Stack +// #2025_01_22_Time_27_ms_(99.40%)_Space_56.05_MB_(94.64%) public class Solution { public long minMaxSubarraySum(int[] nums, int k) { diff --git a/src/main/java/g3401_3500/s3432_count_partitions_with_even_sum_difference/Solution.java b/src/main/java/g3401_3500/s3432_count_partitions_with_even_sum_difference/Solution.java index c0b57c1d4..b1d3d58d0 100644 --- a/src/main/java/g3401_3500/s3432_count_partitions_with_even_sum_difference/Solution.java +++ b/src/main/java/g3401_3500/s3432_count_partitions_with_even_sum_difference/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3432_count_partitions_with_even_sum_difference; -// #Easy #Array #Math #Prefix_Sum #2025_01_27_Time_1_(100.00%)_Space_41.86_(100.00%) +// #Easy #Array #Math #Prefix_Sum #2025_01_27_Time_1_ms_(100.00%)_Space_41.86_MB_(100.00%) public class Solution { public int countPartitions(int[] nums) { diff --git a/src/main/java/g3401_3500/s3433_count_mentions_per_user/Solution.java b/src/main/java/g3401_3500/s3433_count_mentions_per_user/Solution.java index a3009f59f..3e971a0da 100644 --- a/src/main/java/g3401_3500/s3433_count_mentions_per_user/Solution.java +++ b/src/main/java/g3401_3500/s3433_count_mentions_per_user/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3433_count_mentions_per_user; -// #Medium #Array #Math #Sorting #Simulation #2025_01_28_Time_12_(99.94%)_Space_45.54_(94.71%) +// #Medium #Array #Math #Sorting #Simulation #2025_01_28_Time_12_ms_(99.94%)_Space_45.54_MB_(94.71%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g3401_3500/s3434_maximum_frequency_after_subarray_operation/Solution.java b/src/main/java/g3401_3500/s3434_maximum_frequency_after_subarray_operation/Solution.java index 943fa1c34..0862bd8e1 100644 --- a/src/main/java/g3401_3500/s3434_maximum_frequency_after_subarray_operation/Solution.java +++ b/src/main/java/g3401_3500/s3434_maximum_frequency_after_subarray_operation/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3434_maximum_frequency_after_subarray_operation; // #Medium #Array #Hash_Table #Dynamic_Programming #Greedy #Prefix_Sum -// #2025_01_27_Time_47_(100.00%)_Space_56.03_(100.00%) +// #2025_01_27_Time_47_ms_(100.00%)_Space_56.03_MB_(100.00%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g3401_3500/s3435_frequencies_of_shortest_supersequences/Solution.java b/src/main/java/g3401_3500/s3435_frequencies_of_shortest_supersequences/Solution.java index 7970bc499..dbf3de656 100644 --- a/src/main/java/g3401_3500/s3435_frequencies_of_shortest_supersequences/Solution.java +++ b/src/main/java/g3401_3500/s3435_frequencies_of_shortest_supersequences/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3435_frequencies_of_shortest_supersequences; // #Hard #Array #String #Bit_Manipulation #Graph #Enumeration #Topological_Sort -// #2025_01_29_Time_16_(95.35%)_Space_45.52_(93.02%) +// #2025_01_29_Time_16_ms_(95.35%)_Space_45.52_MB_(93.02%) import java.util.ArrayList; import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3436_find_valid_emails/script.sql b/src/main/java/g3401_3500/s3436_find_valid_emails/script.sql index e8d8dc0d2..200e7bd50 100644 --- a/src/main/java/g3401_3500/s3436_find_valid_emails/script.sql +++ b/src/main/java/g3401_3500/s3436_find_valid_emails/script.sql @@ -1,5 +1,5 @@ # Write your MySQL query statement below -# #Easy #2025_02_04_Time_451_(70.84%)_Space_0.0_(100.00%) +# #Easy #2025_02_04_Time_451_ms_(70.84%)_Space_0.0_MB_(100.00%) select user_id, email from users where email regexp '^[A-Za-z0-9_]+@[A-Za-z][A-Za-z0-9_]*\.com$' order by user_id diff --git a/src/main/java/g3401_3500/s3438_find_valid_pair_of_adjacent_digits_in_string/Solution.java b/src/main/java/g3401_3500/s3438_find_valid_pair_of_adjacent_digits_in_string/Solution.java index 5cbeecb96..f384c4233 100644 --- a/src/main/java/g3401_3500/s3438_find_valid_pair_of_adjacent_digits_in_string/Solution.java +++ b/src/main/java/g3401_3500/s3438_find_valid_pair_of_adjacent_digits_in_string/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3438_find_valid_pair_of_adjacent_digits_in_string; -// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_(100.00%)_Space_42.83_(94.06%) +// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_ms_(100.00%)_Space_42.83_MB_(94.06%) import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3439_reschedule_meetings_for_maximum_free_time_i/Solution.java b/src/main/java/g3401_3500/s3439_reschedule_meetings_for_maximum_free_time_i/Solution.java index e03be00e0..0ad9aa217 100644 --- a/src/main/java/g3401_3500/s3439_reschedule_meetings_for_maximum_free_time_i/Solution.java +++ b/src/main/java/g3401_3500/s3439_reschedule_meetings_for_maximum_free_time_i/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3439_reschedule_meetings_for_maximum_free_time_i; -// #Medium #Array #Greedy #Sliding_Window #2025_02_04_Time_2_(83.15%)_Space_63.84_(13.98%) +// #Medium #Array #Greedy #Sliding_Window #2025_02_04_Time_2_ms_(83.15%)_Space_63.84_MB_(13.98%) public class Solution { public int maxFreeTime(int eventTime, int k, int[] startTime, int[] endTime) { diff --git a/src/main/java/g3401_3500/s3440_reschedule_meetings_for_maximum_free_time_ii/Solution.java b/src/main/java/g3401_3500/s3440_reschedule_meetings_for_maximum_free_time_ii/Solution.java index 62d8138d3..173a5f422 100644 --- a/src/main/java/g3401_3500/s3440_reschedule_meetings_for_maximum_free_time_ii/Solution.java +++ b/src/main/java/g3401_3500/s3440_reschedule_meetings_for_maximum_free_time_ii/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3440_reschedule_meetings_for_maximum_free_time_ii; -// #Medium #Array #Greedy #Enumeration #2025_02_04_Time_3_(100.00%)_Space_59.87_(86.57%) +// #Medium #Array #Greedy #Enumeration #2025_02_04_Time_3_ms_(100.00%)_Space_59.87_MB_(86.57%) public class Solution { public int maxFreeTime(int eventTime, int[] startTime, int[] endTime) { diff --git a/src/main/java/g3401_3500/s3441_minimum_cost_good_caption/Solution.java b/src/main/java/g3401_3500/s3441_minimum_cost_good_caption/Solution.java index 9fc8ebd94..c7646e137 100644 --- a/src/main/java/g3401_3500/s3441_minimum_cost_good_caption/Solution.java +++ b/src/main/java/g3401_3500/s3441_minimum_cost_good_caption/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3441_minimum_cost_good_caption; -// #Hard #String #Dynamic_Programming #2025_02_04_Time_48_(96.00%)_Space_56.50_(89.33%) +// #Hard #String #Dynamic_Programming #2025_02_04_Time_48_ms_(96.00%)_Space_56.50_MB_(89.33%) @SuppressWarnings({"java:S107", "java:S6541"}) public class Solution { diff --git a/src/main/java/g3401_3500/s3442_maximum_difference_between_even_and_odd_frequency_i/Solution.java b/src/main/java/g3401_3500/s3442_maximum_difference_between_even_and_odd_frequency_i/Solution.java index a35ce661b..1fdc68010 100644 --- a/src/main/java/g3401_3500/s3442_maximum_difference_between_even_and_odd_frequency_i/Solution.java +++ b/src/main/java/g3401_3500/s3442_maximum_difference_between_even_and_odd_frequency_i/Solution.java @@ -1,6 +1,6 @@ package g3401_3500.s3442_maximum_difference_between_even_and_odd_frequency_i; -// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_(100.00%)_Space_42.34_(92.25%) +// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_ms_(100.00%)_Space_42.34_MB_(92.25%) import java.util.Arrays; diff --git a/src/main/java/g3401_3500/s3443_maximum_manhattan_distance_after_k_changes/Solution.java b/src/main/java/g3401_3500/s3443_maximum_manhattan_distance_after_k_changes/Solution.java index 0fba53ce7..ce341970c 100644 --- a/src/main/java/g3401_3500/s3443_maximum_manhattan_distance_after_k_changes/Solution.java +++ b/src/main/java/g3401_3500/s3443_maximum_manhattan_distance_after_k_changes/Solution.java @@ -1,6 +1,7 @@ package g3401_3500.s3443_maximum_manhattan_distance_after_k_changes; -// #Medium #String #Hash_Table #Math #Counting #2025_02_04_Time_50_(96.94%)_Space_45.89_(54.64%) +// #Medium #String #Hash_Table #Math #Counting +// #2025_02_04_Time_50_ms_(96.94%)_Space_45.89_MB_(54.64%) public class Solution { public int maxDistance(String s, int k) { diff --git a/src/main/java/g3401_3500/s3444_minimum_increments_for_target_multiples_in_an_array/Solution.java b/src/main/java/g3401_3500/s3444_minimum_increments_for_target_multiples_in_an_array/Solution.java index d90f8f061..150d607d6 100644 --- a/src/main/java/g3401_3500/s3444_minimum_increments_for_target_multiples_in_an_array/Solution.java +++ b/src/main/java/g3401_3500/s3444_minimum_increments_for_target_multiples_in_an_array/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3444_minimum_increments_for_target_multiples_in_an_array; // #Hard #Array #Dynamic_Programming #Math #Bit_Manipulation #Bitmask #Number_Theory -// #2025_02_04_Time_47_(95.85%)_Space_47.31_(56.40%) +// #2025_02_04_Time_47_ms_(95.85%)_Space_47.31_MB_(56.40%) public class Solution { public int minimumIncrements(int[] nums, int[] target) { diff --git a/src/main/java/g3401_3500/s3445_maximum_difference_between_even_and_odd_frequency_ii/Solution.java b/src/main/java/g3401_3500/s3445_maximum_difference_between_even_and_odd_frequency_ii/Solution.java index c85ddbedf..8223ab6e9 100644 --- a/src/main/java/g3401_3500/s3445_maximum_difference_between_even_and_odd_frequency_ii/Solution.java +++ b/src/main/java/g3401_3500/s3445_maximum_difference_between_even_and_odd_frequency_ii/Solution.java @@ -1,7 +1,7 @@ package g3401_3500.s3445_maximum_difference_between_even_and_odd_frequency_ii; // #Hard #String #Prefix_Sum #Sliding_Window #Enumeration -// #2025_02_04_Time_94_(85.92%)_Space_53.24_(49.30%) +// #2025_02_04_Time_94_ms_(85.92%)_Space_53.24_MB_(49.30%) import java.util.Arrays;