File tree 8 files changed +12
-8
lines changed
s3483_unique_3_digit_even_numbers
s3485_longest_common_prefix_of_k_strings_after_removal
s3486_longest_special_path_ii
s3487_maximum_unique_subarray_sum_after_deletion
s3488_closest_equal_element_queries
s3489_zero_array_transformation_iv
s3490_count_beautiful_numbers
8 files changed +12
-8
lines changed Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3483_unique_3_digit_even_numbers ;
2
2
3
- // #Easy #2025_03_16_Time_5_ms_(100.00%)_Space_44.79_MB_(100.00%)
3
+ // #Easy #Array #Hash_Table #Recursion #Enumeration
4
+ // #2025_03_17_Time_5_ms_(100.00%)_Space_44.59_MB_(100.00%)
4
5
5
6
import java .util .HashSet ;
6
7
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3484_design_spreadsheet ;
2
2
3
- // #Medium #2025_03_16_Time_109_ms_(100.00%)_Space_56.41_MB_(100.00%)
3
+ // #Medium #Array #String #Hash_Table #Matrix #Design
4
+ // #2025_03_17_Time_117_ms_(100.00%)_Space_56.71_MB_(100.00%)
4
5
5
6
import java .util .HashMap ;
6
7
import java .util .Map ;
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3485_longest_common_prefix_of_k_strings_after_removal ;
2
2
3
- // #Hard #2025_03_16_Time_390_ms_ (100.00%)_Space_75.60_MB_ (100.00%)
3
+ // #Hard #Array #String #Trie #2025_03_17_Time_333_ms_ (100.00%)_Space_64.12_MB_ (100.00%)
4
4
5
5
public class Solution {
6
6
private static class TrieNode {
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3486_longest_special_path_ii ;
2
2
3
- // #Hard #2025_03_16_Time_178_ms_(_%)_Space_102.66_MB_(_%)
3
+ // #Hard #Array #Hash_Table #Tree #Prefix_Sum #Depth_First_Search
4
+ // #2025_03_17_Time_166_ms_(_%)_Space_105.50_MB_(_%)
4
5
5
6
import java .util .ArrayList ;
6
7
import java .util .Arrays ;
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3487_maximum_unique_subarray_sum_after_deletion ;
2
2
3
- // #Easy #2025_03_16_Time_2_ms_ (100.00%)_Space_42.42_MB_ (100.00%)
3
+ // #Easy #Array #Hash_Table #Greedy #2025_03_17_Time_2_ms_ (100.00%)_Space_42.64_MB_ (100.00%)
4
4
5
5
import java .util .HashSet ;
6
6
import java .util .Set ;
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3488_closest_equal_element_queries ;
2
2
3
- // #Medium #2025_03_16_Time_50_ms_(100.00%)_Space_78.29_MB_(100.00%)
3
+ // #Medium #Array #Hash_Table #Binary_Search
4
+ // #2025_03_17_Time_50_ms_(100.00%)_Space_74.96_MB_(100.00%)
4
5
5
6
import java .util .ArrayList ;
6
7
import java .util .HashMap ;
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3489_zero_array_transformation_iv ;
2
2
3
- // #Medium #2025_03_16_Time_136_ms_ (100.00%)_Space_55.84_MB_ (100.00%)
3
+ // #Medium #Array #Dynamic_Programming #2025_03_17_Time_142_ms_ (100.00%)_Space_56.22_MB_ (100.00%)
4
4
5
5
import java .util .Arrays ;
6
6
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3490_count_beautiful_numbers ;
2
2
3
- // #Hard #2025_03_16_Time_512_ms_ (100.00%)_Space_55.59_MB_ (100.00%)
3
+ // #Hard #Dynamic_Programming #2025_03_17_Time_523_ms_ (100.00%)_Space_55.41_MB_ (100.00%)
4
4
5
5
import java .util .HashMap ;
6
6
You can’t perform that action at this time.
0 commit comments