Skip to content

Commit fe4cd71

Browse files
javadevjavadev
committed
Improved tasks 3392-3405
1 parent d215170 commit fe4cd71

File tree

12 files changed

+23
-12
lines changed
  • src/main/java
    • g3301_3400
      • s3392_count_subarrays_of_length_three_with_a_condition
      • s3393_count_paths_with_the_given_xor_value
      • s3394_check_if_grid_can_be_cut_into_sections
      • s3395_subsequences_with_a_unique_middle_mode_i
      • s3396_minimum_number_of_operations_to_make_elements_in_array_distinct
      • s3397_maximum_number_of_distinct_elements_after_operations
      • s3398_smallest_substring_with_identical_characters_i
      • s3399_smallest_substring_with_identical_characters_ii
    • g3401_3500
      • s3402_minimum_operations_to_make_columns_strictly_increasing
      • s3403_find_the_lexicographically_largest_string_from_the_box_i
      • s3404_count_special_subsequences
      • s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements

12 files changed

+23
-12
lines changed

‎src/main/java/g3301_3400/s3392_count_subarrays_of_length_three_with_a_condition/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3301_3400.s3392_count_subarrays_of_length_three_with_a_condition;
22

3-
// #Easy #2024_12_22_Time_1_ms_(100.00%)_Space_45.5_MB_(100.00%)
3+
// #Easy #Array #Sliding_Window #2024_12_22_Time_1_ms_(100.00%)_Space_45.5_MB_(100.00%)
44

55
public class Solution {
66
public int countSubarrays(int[] nums) {

‎src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3393_count_paths_with_the_given_xor_value;
22

3-
// #Medium #2024_12_22_Time_83_ms_(100.00%)_Space_57_MB_(100.00%)
3+
// #Medium #Dynamic_Programming #Math #Bit_Manipulation
4+
// #2024_12_22_Time_83_ms_(100.00%)_Space_57_MB_(100.00%)
45

56
import java.util.Arrays;
67

‎src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3394_check_if_grid_can_be_cut_into_sections;
22

3-
// #Medium #2024_12_22_Time_136_ms_(100.00%)_Space_128.7_MB_(100.00%)
3+
// #Medium #Sorting #Greedy #Simulation #Geometry #Line_Sweep #Grid
4+
// #2024_12_22_Time_136_ms_(100.00%)_Space_128.7_MB_(100.00%)
45

56
import java.util.Arrays;
67

‎src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3395_subsequences_with_a_unique_middle_mode_i;
22

3-
// #Hard #2024_12_22_Time_1115_ms_(100.00%)_Space_45.2_MB_(100.00%)
3+
// #Hard #Dynamic_Programming #Sliding_Window #Combinatorics #Subsequence
4+
// #2024_12_22_Time_1115_ms_(100.00%)_Space_45.2_MB_(100.00%)
45

56
import java.util.ArrayList;
67
import java.util.HashMap;

‎src/main/java/g3301_3400/s3396_minimum_number_of_operations_to_make_elements_in_array_distinct/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3396_minimum_number_of_operations_to_make_elements_in_array_distinct;
22

3-
// #Easy #2024_12_22_Time_4_ms_(100.00%)_Space_45_MB_(100.00%)
3+
// #Easy #Array #Greedy #Simulation #Distinct #Elements #Operations
4+
// #2024_12_22_Time_4_ms_(100.00%)_Space_45_MB_(100.00%)
45

56
import java.util.HashMap;
67
import java.util.Map;

‎src/main/java/g3301_3400/s3397_maximum_number_of_distinct_elements_after_operations/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3397_maximum_number_of_distinct_elements_after_operations;
22

3-
// #Medium #2024_12_22_Time_19_ms_(100.00%)_Space_57.8_MB_(100.00%)
3+
// #Medium #Array #Greedy #Distinct #Elements #Mathematics #Operations #Optimization
4+
// #2024_12_22_Time_19_ms_(100.00%)_Space_57.8_MB_(100.00%)
45

56
import java.util.Arrays;
67

‎src/main/java/g3301_3400/s3398_smallest_substring_with_identical_characters_i/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3398_smallest_substring_with_identical_characters_i;
22

3-
// #Hard #2024_12_24_Time_1_ms_(100.00%)_Space_42.9_MB_(39.83%)
3+
// #Hard #String #Greedy #Bit_Manipulation #Sliding_Window #Optimization
4+
// #2024_12_24_Time_1_ms_(100.00%)_Space_42.9_MB_(39.83%)
45

56
public class Solution {
67
public int minLength(String s, int ops) {

‎src/main/java/g3301_3400/s3399_smallest_substring_with_identical_characters_ii/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3301_3400.s3399_smallest_substring_with_identical_characters_ii;
22

3-
// #Hard #2024_12_24_Time_15_ms_(99.39%)_Space_45.9_MB_(43.03%)
3+
// #Hard #String #Greedy #Bit_Manipulation #Sliding_Window #Optimization
4+
// #2024_12_24_Time_15_ms_(99.39%)_Space_45.9_MB_(43.03%)
45

56
import java.util.ArrayList;
67
import java.util.List;

‎src/main/java/g3401_3500/s3402_minimum_operations_to_make_columns_strictly_increasing/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3402_minimum_operations_to_make_columns_strictly_increasing;
22

3-
// #Easy #2024_12_29_Time_1_(100.00%)_Space_44.99_(100.00%)
3+
// #Easy #Array #Dynamic_Programming #Greedy #Matrix #Simulation
4+
// #2024_12_29_Time_1_(100.00%)_Space_44.99_(100.00%)
45

56
public class Solution {
67
public int minimumOperations(int[][] grid) {

‎src/main/java/g3401_3500/s3403_find_the_lexicographically_largest_string_from_the_box_i/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3403_find_the_lexicographically_largest_string_from_the_box_i;
22

3-
// #Medium #2024_12_29_Time_5_(100.00%)_Space_45.20_(100.00%)
3+
// #Medium #String #Sorting #Greedy #Backtracking #Combinatorics
4+
// #2024_12_29_Time_5_(100.00%)_Space_45.20_(100.00%)
45

56
public class Solution {
67
public String answerString(String word, int numFriends) {

0 commit comments

Comments
 (0)