Skip to content

Commit 8df25e6

Browse files
javadevjavadev
authored
Improved tags
1 parent e4592c3 commit 8df25e6

File tree

46 files changed

+53
-46
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

46 files changed

+53
-46
lines changed

‎src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g2001_2100.s2054_two_best_non_overlapping_events;
22

33
// #Medium #Array #Dynamic_Programming #Sorting #Binary_Search #Heap_Priority_Queue
4-
// #2022_05_24_Time_58_ms(70.59%)_Space_109.2_MB_(88.24%)
4+
// #2022_05_24_Time_58_ms_(70.59%)_Space_109.2_MB_(88.24%)
55

66
import java.util.Arrays;
77

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

+1-1
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 #Array #2025_01_06_Time_1_(100.00%)_Space_44.87_(93.12%)
3+
// #Easy #Array #2025_01_06_Time_1_ms_(100.00%)_Space_44.87_MB_(93.12%)
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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3301_3400.s3393_count_paths_with_the_given_xor_value;
22

33
// #Medium #Array #Dynamic_Programming #Math #Matrix #Bit_Manipulation
4-
// #2025_01_06_Time_76_(62.72%)_Space_56.92_(68.41%)
4+
// #2025_01_06_Time_76_ms_(62.72%)_Space_56.92_MB_(68.41%)
55

66
import java.util.Arrays;
77

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3301_3400.s3394_check_if_grid_can_be_cut_into_sections;
22

3-
// #Medium #Geometry #Line_Sweep #2025_01_06_Time_35_(99.66%)_Space_117.96_(80.52%)
3+
// #Medium #Geometry #Line_Sweep #2025_01_06_Time_35_ms_(99.66%)_Space_117.96_MB_(80.52%)
44

55
import java.util.Arrays;
66

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

+2-1
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 #Array #Hash_Table #Math #Combinatorics #2025_01_06_Time_27_(99.29%)_Space_45.15_(97.87%)
3+
// #Hard #Array #Hash_Table #Math #Combinatorics
4+
// #2025_01_06_Time_27_ms_(99.29%)_Space_45.15_MB_(97.87%)
45

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3301_3400.s3396_minimum_number_of_operations_to_make_elements_in_array_distinct;
22

3-
// #Easy #Array #Greedy #Simulation #2025_01_06_Time_3_(60.47%)_Space_44.61_(50.65%)
3+
// #Easy #Array #Greedy #Simulation #2025_01_06_Time_3_ms_(60.47%)_Space_44.61_MB_(50.65%)
44

55
import java.util.HashMap;
66
import java.util.Map;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3301_3400.s3397_maximum_number_of_distinct_elements_after_operations;
22

3-
// #Medium #Array #Sorting #Greedy #2025_01_06_Time_19_(84.32%)_Space_57.84_(93.53%)
3+
// #Medium #Array #Sorting #Greedy #2025_01_06_Time_19_ms_(84.32%)_Space_57.84_MB_(93.53%)
44

55
import java.util.Arrays;
66

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3301_3400.s3398_smallest_substring_with_identical_characters_i;
22

3-
// #Hard #Array #Binary_Search #Enumeration #2025_01_06_Time_1_(100.00%)_Space_42.72_(39.94%)
3+
// #Hard #Array #Binary_Search #Enumeration #2025_01_06_Time_1_ms_(100.00%)_Space_42.72_MB_(39.94%)
44

55
public class Solution {
66
public int minLength(String s, int ops) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3301_3400.s3399_smallest_substring_with_identical_characters_ii;
22

3-
// #Hard #Bit_Manipulation #Sliding_Window #2025_01_06_Time_15_(98.93%)_Space_45.62_(57.38%)
3+
// #Hard #Bit_Manipulation #Sliding_Window #2025_01_06_Time_15_ms_(98.93%)_Space_45.62_MB_(57.38%)
44

55
import java.util.ArrayList;
66
import java.util.List;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3402_minimum_operations_to_make_columns_strictly_increasing;
22

3-
// #Easy #Matrix #Simulation #2025_01_06_Time_1_(99.95%)_Space_45.24_(62.37%)
3+
// #Easy #Matrix #Simulation #2025_01_06_Time_1_ms_(99.95%)_Space_45.24_MB_(62.37%)
44

55
public class Solution {
66
public int minimumOperations(int[][] grid) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3403_find_the_lexicographically_largest_string_from_the_box_i;
22

3-
// #Medium #String #Two_Pointers #Enumeration #2025_01_06_Time_5_(89.70%)_Space_45.38_(80.39%)
3+
// #Medium #String #Two_Pointers #Enumeration #2025_01_06_Time_5_ms_(89.70%)_Space_45.38_MB_(80.39%)
44

55
public class Solution {
66
public String answerString(String word, int numFriends) {

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3404_count_special_subsequences;
22

3-
// #Medium #Array #Hash_Table #Math #Enumeration #2025_01_06_Time_342_(73.58%)_Space_55.00_(79.58%)
3+
// #Medium #Array #Hash_Table #Math #Enumeration
4+
// #2025_01_06_Time_342_ms_(73.58%)_Space_55.00_MB_(79.58%)
45

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements;
22

3-
// #Hard #Math #Combinatorics #2025_01_06_Time_55_(52.53%)_Space_44.95_(37.58%)
3+
// #Hard #Math #Combinatorics #2025_01_06_Time_55_ms_(52.53%)_Space_44.95_MB_(37.58%)
44

55
public class Solution {
66
private static final int MOD = (int) (1e9 + 7);

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3407_substring_matching_pattern;
22

3-
// #Easy #String #String_Matching #2025_01_06_Time_1_(100.00%)_Space_42.63_(100.00%)
3+
// #Easy #String #String_Matching #2025_01_06_Time_1_ms_(100.00%)_Space_42.63_MB_(100.00%)
44

55
public class Solution {
66
public boolean hasMatch(String s, String p) {

‎src/main/java/g3401_3500/s3408_design_task_manager/TaskManager.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3408_design_task_manager;
22

33
// #Medium #Hash_Table #Design #Heap_Priority_Queue #Ordered_Set
4-
// #2025_01_06_Time_349_(100.00%)_Space_152.40_(100.00%)
4+
// #2025_01_06_Time_349_ms_(100.00%)_Space_152.40_MB_(100.00%)
55

66
import java.util.HashMap;
77
import java.util.List;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3409_longest_subsequence_with_decreasing_adjacent_difference;
22

3-
// #Medium #Array #Dynamic_Programming #2025_01_07_Time_68_(99.55%)_Space_45.74_(78.73%)
3+
// #Medium #Array #Dynamic_Programming #2025_01_07_Time_68_ms_(99.55%)_Space_45.74_MB_(78.73%)
44

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

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element;
22

3-
// #Hard #Array #Dynamic_Programming #Segment_Tree #2025_01_07_Time_51_(97.96%)_Space_57.22_(85.71%)
3+
// #Hard #Array #Dynamic_Programming #Segment_Tree
4+
// #2025_01_07_Time_51_ms_(97.96%)_Space_57.22_MB_(85.71%)
45

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3411_maximum_subarray_with_equal_products;
22

33
// #Easy #Array #Math #Sliding_Window #Enumeration #Number_Theory
4-
// #2025_01_07_Time_3_(91.26%)_Space_42.68_(64.20%)
4+
// #2025_01_07_Time_3_ms_(91.26%)_Space_42.68_MB_(64.20%)
55

66
public class Solution {
77
private int gcd(int a, int b) {

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3412_find_mirror_score_of_a_string;
22

3-
// #Medium #String #Hash_Table #Stack #Simulation #2025_01_07_Time_12_(99.54%)_Space_45.78_(74.26%)
3+
// #Medium #String #Hash_Table #Stack #Simulation
4+
// #2025_01_07_Time_12_ms_(99.54%)_Space_45.78_MB_(74.26%)
45

56
import java.util.ArrayList;
67

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3413_maximum_coins_from_k_consecutive_bags;
22

33
// #Medium #Array #Sorting #Greedy #Binary_Search #Prefix_Sum #Sliding_Window
4-
// #2025_01_07_Time_82_(92.23%)_Space_134.12_(21.36%)
4+
// #2025_01_07_Time_82_ms_(92.23%)_Space_134.12_MB_(21.36%)
55

66
import java.util.Arrays;
77

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3414_maximum_score_of_non_overlapping_intervals;
22

33
// #Hard #Array #Dynamic_Programming #Sorting #Binary_Search
4-
// #2025_01_08_Time_64_(95.65%)_Space_74.80_(98.26%)
4+
// #2025_01_08_Time_64_ms_(95.65%)_Space_74.80_MB_(98.26%)
55

66
import java.util.Arrays;
77
import java.util.List;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3417_zigzag_grid_traversal_with_skip;
22

3-
// #Easy #Array #Matrix #Simulation #2025_01_15_Time_1_(100.00%)_Space_45.56_(84.25%)
3+
// #Easy #Array #Matrix #Simulation #2025_01_15_Time_1_ms_(100.00%)_Space_45.56_MB_(84.25%)
44

55
import java.util.ArrayList;
66
import java.util.List;

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3418_maximum_amount_of_money_robot_can_earn;
22

3-
// #Medium #Array #Dynamic_Programming #Matrix #2025_01_15_Time_12_(99.86%)_Space_72.43_(98.47%)
3+
// #Medium #Array #Dynamic_Programming #Matrix
4+
// #2025_01_15_Time_12_ms_(99.86%)_Space_72.43_MB_(98.47%)
45

56
public class Solution {
67
public int maximumAmount(int[][] coins) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3419_minimize_the_maximum_edge_weight_of_graph;
22

33
// #Medium #Depth_First_Search #Breadth_First_Search #Binary_Search #Graph #Shortest_Path
4-
// #2025_01_15_Time_64_(99.28%)_Space_110.17_(57.63%)
4+
// #2025_01_15_Time_64_ms_(99.28%)_Space_110.17_MB_(57.63%)
55

66
import java.util.ArrayList;
77
import java.util.Arrays;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3420_count_non_decreasing_subarrays_after_k_operations;
22

33
// #Hard #Array #Two_Pointers #Stack #Monotonic_Stack #Queue #Segment_Tree #Monotonic_Queue
4-
// #2025_01_15_Time_29_(83.94%)_Space_62.04_(56.93%)
4+
// #2025_01_15_Time_29_ms_(83.94%)_Space_62.04_MB_(56.93%)
55

66
import java.util.ArrayDeque;
77
import java.util.Deque;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3423_maximum_difference_between_adjacent_elements_in_a_circular_array;
22

3-
// #Easy #Array #2025_01_22_Time_1_(99.86%)_Space_43.72_(36.06%)
3+
// #Easy #Array #2025_01_22_Time_1_ms_(99.86%)_Space_43.72_MB_(36.06%)
44

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3424_minimum_cost_to_make_arrays_identical;
22

3-
// #Medium #Array #Sorting #Greedy #2025_01_23_Time_20_(98.92%)_Space_57.80_(28.30%)
3+
// #Medium #Array #Sorting #Greedy #2025_01_23_Time_20_ms_(98.92%)_Space_57.80_MB_(28.30%)
44

55
import java.util.Arrays;
66

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3425_longest_special_path;
22

33
// #Hard #Array #Hash_Table #Depth_First_Search #Tree #Sliding_Window
4-
// #2025_01_22_Time_49_(74.66%)_Space_98.04_(44.26%)
4+
// #2025_01_22_Time_49_ms_(74.66%)_Space_98.04_MB_(44.26%)
55

66
import java.util.ArrayList;
77
import java.util.Arrays;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3426_manhattan_distances_of_all_arrangements_of_pieces;
22

3-
// #Hard #Math #Combinatorics #2025_01_22_Time_20_(87.92%)_Space_40.82_(98.07%)
3+
// #Hard #Math #Combinatorics #2025_01_22_Time_20_ms_(87.92%)_Space_40.82_MB_(98.07%)
44

55
public class Solution {
66
private long comb(long a, long b, long mod) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3427_sum_of_variable_length_subarrays;
22

3-
// #Easy #Array #Prefix_Sum #2025_01_22_Time_0_(100.00%)_Space_43.77_(58.41%)
3+
// #Easy #Array #Prefix_Sum #2025_01_22_Time_0_ms_(100.00%)_Space_43.77_MB_(58.41%)
44

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences;
22

33
// #Medium #Array #Dynamic_Programming #Math #Sorting #Combinatorics
4-
// #2025_01_22_Time_28_(99.74%)_Space_65.01_(35.71%)
4+
// #2025_01_22_Time_28_ms_(99.74%)_Space_65.01_MB_(35.71%)
55

66
import java.util.Arrays;
77

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3429_paint_house_iv;
22

3-
// #Medium #Array #Dynamic_Programming #2025_01_22_Time_5_(100.00%)_Space_106.29_(78.64%)
3+
// #Medium #Array #Dynamic_Programming #2025_01_22_Time_5_ms_(100.00%)_Space_106.29_MB_(78.64%)
44

55
public class Solution {
66
public long minCost(int n, int[][] cost) {

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays;
22

3-
// #Hard #Array #Math #Stack #Monotonic_Stack #2025_01_22_Time_27_(99.40%)_Space_56.05_(94.64%)
3+
// #Hard #Array #Math #Stack #Monotonic_Stack
4+
// #2025_01_22_Time_27_ms_(99.40%)_Space_56.05_MB_(94.64%)
45

56
public class Solution {
67
public long minMaxSubarraySum(int[] nums, int k) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3432_count_partitions_with_even_sum_difference;
22

3-
// #Easy #Array #Math #Prefix_Sum #2025_01_27_Time_1_(100.00%)_Space_41.86_(100.00%)
3+
// #Easy #Array #Math #Prefix_Sum #2025_01_27_Time_1_ms_(100.00%)_Space_41.86_MB_(100.00%)
44

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3433_count_mentions_per_user;
22

3-
// #Medium #Array #Math #Sorting #Simulation #2025_01_28_Time_12_(99.94%)_Space_45.54_(94.71%)
3+
// #Medium #Array #Math #Sorting #Simulation #2025_01_28_Time_12_ms_(99.94%)_Space_45.54_MB_(94.71%)
44

55
import java.util.ArrayList;
66
import java.util.List;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3434_maximum_frequency_after_subarray_operation;
22

33
// #Medium #Array #Hash_Table #Dynamic_Programming #Greedy #Prefix_Sum
4-
// #2025_01_27_Time_47_(100.00%)_Space_56.03_(100.00%)
4+
// #2025_01_27_Time_47_ms_(100.00%)_Space_56.03_MB_(100.00%)
55

66
import java.util.HashMap;
77
import java.util.Map;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3435_frequencies_of_shortest_supersequences;
22

33
// #Hard #Array #String #Bit_Manipulation #Graph #Enumeration #Topological_Sort
4-
// #2025_01_29_Time_16_(95.35%)_Space_45.52_(93.02%)
4+
// #2025_01_29_Time_16_ms_(95.35%)_Space_45.52_MB_(93.02%)
55

66
import java.util.ArrayList;
77
import java.util.Arrays;

‎src/main/java/g3401_3500/s3436_find_valid_emails/script.sql

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Write your MySQL query statement below
2-
# #Easy #2025_02_04_Time_451_(70.84%)_Space_0.0_(100.00%)
2+
# #Easy #2025_02_04_Time_451_ms_(70.84%)_Space_0.0_MB_(100.00%)
33
select user_id, email from users
44
where email regexp '^[A-Za-z0-9_]+@[A-Za-z][A-Za-z0-9_]*\.com$'
55
order by user_id

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3438_find_valid_pair_of_adjacent_digits_in_string;
22

3-
// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_(100.00%)_Space_42.83_(94.06%)
3+
// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_ms_(100.00%)_Space_42.83_MB_(94.06%)
44

55
import java.util.Arrays;
66

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3439_reschedule_meetings_for_maximum_free_time_i;
22

3-
// #Medium #Array #Greedy #Sliding_Window #2025_02_04_Time_2_(83.15%)_Space_63.84_(13.98%)
3+
// #Medium #Array #Greedy #Sliding_Window #2025_02_04_Time_2_ms_(83.15%)_Space_63.84_MB_(13.98%)
44

55
public class Solution {
66
public int maxFreeTime(int eventTime, int k, int[] startTime, int[] endTime) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3440_reschedule_meetings_for_maximum_free_time_ii;
22

3-
// #Medium #Array #Greedy #Enumeration #2025_02_04_Time_3_(100.00%)_Space_59.87_(86.57%)
3+
// #Medium #Array #Greedy #Enumeration #2025_02_04_Time_3_ms_(100.00%)_Space_59.87_MB_(86.57%)
44

55
public class Solution {
66
public int maxFreeTime(int eventTime, int[] startTime, int[] endTime) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3441_minimum_cost_good_caption;
22

3-
// #Hard #String #Dynamic_Programming #2025_02_04_Time_48_(96.00%)_Space_56.50_(89.33%)
3+
// #Hard #String #Dynamic_Programming #2025_02_04_Time_48_ms_(96.00%)_Space_56.50_MB_(89.33%)
44

55
@SuppressWarnings({"java:S107", "java:S6541"})
66
public class Solution {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3401_3500.s3442_maximum_difference_between_even_and_odd_frequency_i;
22

3-
// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_(100.00%)_Space_42.34_(92.25%)
3+
// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_ms_(100.00%)_Space_42.34_MB_(92.25%)
44

55
import java.util.Arrays;
66

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3401_3500.s3443_maximum_manhattan_distance_after_k_changes;
22

3-
// #Medium #String #Hash_Table #Math #Counting #2025_02_04_Time_50_(96.94%)_Space_45.89_(54.64%)
3+
// #Medium #String #Hash_Table #Math #Counting
4+
// #2025_02_04_Time_50_ms_(96.94%)_Space_45.89_MB_(54.64%)
45

56
public class Solution {
67
public int maxDistance(String s, int k) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3444_minimum_increments_for_target_multiples_in_an_array;
22

33
// #Hard #Array #Dynamic_Programming #Math #Bit_Manipulation #Bitmask #Number_Theory
4-
// #2025_02_04_Time_47_(95.85%)_Space_47.31_(56.40%)
4+
// #2025_02_04_Time_47_ms_(95.85%)_Space_47.31_MB_(56.40%)
55

66
public class Solution {
77
public int minimumIncrements(int[] nums, int[] target) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3401_3500.s3445_maximum_difference_between_even_and_odd_frequency_ii;
22

33
// #Hard #String #Prefix_Sum #Sliding_Window #Enumeration
4-
// #2025_02_04_Time_94_(85.92%)_Space_53.24_(49.30%)
4+
// #2025_02_04_Time_94_ms_(85.92%)_Space_53.24_MB_(49.30%)
55

66
import java.util.Arrays;
77

0 commit comments

Comments
 (0)