From fe4cd71dadde1446b4d0bb2613099e51e91e419a Mon Sep 17 00:00:00 2001 From: Valentyn Kolesnikov Date: Sun, 5 Jan 2025 22:48:25 +0200 Subject: [PATCH] Improved tasks 3392-3405 --- .../Solution.java | 2 +- .../s3393_count_paths_with_the_given_xor_value/Solution.java | 3 ++- .../s3394_check_if_grid_can_be_cut_into_sections/Solution.java | 3 ++- .../Solution.java | 3 ++- .../Solution.java | 3 ++- .../Solution.java | 3 ++- .../Solution.java | 3 ++- .../Solution.java | 3 ++- .../Solution.java | 3 ++- .../Solution.java | 3 ++- .../g3401_3500/s3404_count_special_subsequences/Solution.java | 3 ++- .../Solution.java | 3 ++- 12 files changed, 23 insertions(+), 12 deletions(-) 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 2d52fc44e..3cb5c61d2 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 #2024_12_22_Time_1_ms_(100.00%)_Space_45.5_MB_(100.00%) +// #Easy #Array #Sliding_Window #2024_12_22_Time_1_ms_(100.00%)_Space_45.5_MB_(100.00%) 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 c6082f7a8..c8f9d9976 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,6 +1,7 @@ package g3301_3400.s3393_count_paths_with_the_given_xor_value; -// #Medium #2024_12_22_Time_83_ms_(100.00%)_Space_57_MB_(100.00%) +// #Medium #Dynamic_Programming #Math #Bit_Manipulation +// #2024_12_22_Time_83_ms_(100.00%)_Space_57_MB_(100.00%) 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 00af92a54..8c7d3927c 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,7 @@ package g3301_3400.s3394_check_if_grid_can_be_cut_into_sections; -// #Medium #2024_12_22_Time_136_ms_(100.00%)_Space_128.7_MB_(100.00%) +// #Medium #Sorting #Greedy #Simulation #Geometry #Line_Sweep #Grid +// #2024_12_22_Time_136_ms_(100.00%)_Space_128.7_MB_(100.00%) 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 921dc0436..3e95ac895 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 #2024_12_22_Time_1115_ms_(100.00%)_Space_45.2_MB_(100.00%) +// #Hard #Dynamic_Programming #Sliding_Window #Combinatorics #Subsequence +// #2024_12_22_Time_1115_ms_(100.00%)_Space_45.2_MB_(100.00%) import java.util.ArrayList; import java.util.HashMap; 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 d6ae812ea..b5fc3d38a 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,7 @@ package g3301_3400.s3396_minimum_number_of_operations_to_make_elements_in_array_distinct; -// #Easy #2024_12_22_Time_4_ms_(100.00%)_Space_45_MB_(100.00%) +// #Easy #Array #Greedy #Simulation #Distinct #Elements #Operations +// #2024_12_22_Time_4_ms_(100.00%)_Space_45_MB_(100.00%) 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 8a5dbd801..ccb81aa82 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,7 @@ package g3301_3400.s3397_maximum_number_of_distinct_elements_after_operations; -// #Medium #2024_12_22_Time_19_ms_(100.00%)_Space_57.8_MB_(100.00%) +// #Medium #Array #Greedy #Distinct #Elements #Mathematics #Operations #Optimization +// #2024_12_22_Time_19_ms_(100.00%)_Space_57.8_MB_(100.00%) 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 bc2ed7b73..f1d63dd62 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,7 @@ package g3301_3400.s3398_smallest_substring_with_identical_characters_i; -// #Hard #2024_12_24_Time_1_ms_(100.00%)_Space_42.9_MB_(39.83%) +// #Hard #String #Greedy #Bit_Manipulation #Sliding_Window #Optimization +// #2024_12_24_Time_1_ms_(100.00%)_Space_42.9_MB_(39.83%) 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 4ca5c483a..b1163a0f0 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,7 @@ package g3301_3400.s3399_smallest_substring_with_identical_characters_ii; -// #Hard #2024_12_24_Time_15_ms_(99.39%)_Space_45.9_MB_(43.03%) +// #Hard #String #Greedy #Bit_Manipulation #Sliding_Window #Optimization +// #2024_12_24_Time_15_ms_(99.39%)_Space_45.9_MB_(43.03%) 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 52ecf87a8..1de629e63 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,7 @@ package g3401_3500.s3402_minimum_operations_to_make_columns_strictly_increasing; -// #Easy #2024_12_29_Time_1_(100.00%)_Space_44.99_(100.00%) +// #Easy #Array #Dynamic_Programming #Greedy #Matrix #Simulation +// #2024_12_29_Time_1_(100.00%)_Space_44.99_(100.00%) 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 39f7d7e32..6e9f6ca9a 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,7 @@ package g3401_3500.s3403_find_the_lexicographically_largest_string_from_the_box_i; -// #Medium #2024_12_29_Time_5_(100.00%)_Space_45.20_(100.00%) +// #Medium #String #Sorting #Greedy #Backtracking #Combinatorics +// #2024_12_29_Time_5_(100.00%)_Space_45.20_(100.00%) 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 02d3621f0..682a3342e 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 #2024_12_29_Time_331_(100.00%)_Space_55.49_(100.00%) +// #Medium #Array #Combinatorics #Dynamic #Mathematics #Programming +// #2024_12_29_Time_331_(100.00%)_Space_55.49_(100.00%) 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 b7796cda8..895018ceb 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,7 @@ package g3401_3500.s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements; -// #Hard #2024_12_29_Time_57_(100.00%)_Space_44.55_(100.00%) +// #Hard #Dynamic_Programming #Combinatorics #Arrays #Mathematics +// #2024_12_29_Time_57_(100.00%)_Space_44.55_(100.00%) public class Solution { private static final int MOD = (int) (1e9 + 7);