Skip to content

Commit f13c0d8

Browse files
javadevjavadev
committed
Updated tags
1 parent b2d2b41 commit f13c0d8

File tree

9 files changed

+17
-10
lines changed

9 files changed

+17
-10
lines changed

‎src/main/java/g3501_3600/s3585_find_weighted_median_node_in_tree/Solution.java

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

3-
// #Hard #Array #Dynamic_Programming #Tree #Binary_Search #Depth_First_Search
3+
// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Binary_Search
44
// #2025_06_17_Time_66_ms_(94.96%)_Space_142.62_MB_(49.64%)
55

66
import java.util.ArrayList;

‎src/main/java/g3501_3600/s3587_minimum_adjacent_swaps_to_alternate_parity/Solution.java

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

3-
// #Medium #2025_06_22_Time_20_ms_(100.00%)_Space_64.10_MB_(100.00%)
3+
// #Medium #Array #Greedy #2025_06_23_Time_20_ms_(100.00%)_Space_62.71_MB_(100.00%)
44

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

‎src/main/java/g3501_3600/s3588_find_maximum_area_of_a_triangle/Solution.java

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

3-
// #Medium #2025_06_22_Time_431_ms_(100.00%)_Space_166.06_MB_(100.00%)
3+
// #Medium #Array #Hash_Table #Math #Greedy #Enumeration #Geometry
4+
// #2025_06_23_Time_410_ms_(100.00%)_Space_165.98_MB_(100.00%)
45

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

‎src/main/java/g3501_3600/s3589_count_prime_gap_balanced_subarrays/Solution.java

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

3-
// #Medium #2025_06_22_Time_414_ms_(100.00%)_Space_55.97_MB_(100.00%)
3+
// #Medium #Array #Math #Sliding_Window #Queue #Number_Theory #Monotonic_Queue
4+
// #2025_06_23_Time_407_ms_(100.00%)_Space_56.17_MB_(100.00%)
45

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

‎src/main/java/g3501_3600/s3590_kth_smallest_path_xor_sum/Solution.java

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

3-
// #Hard #2025_06_22_Time_342_ms_(100.00%)_Space_89.24_MB_(100.00%)
3+
// #Hard #Array #Depth_First_Search #Tree #Ordered_Set
4+
// #2025_06_23_Time_311_ms_(100.00%)_Space_96.82_MB_(100.00%)
45

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

‎src/main/java/g3501_3600/s3591_check_if_any_element_has_prime_frequency/Solution.java

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

3-
// #Easy #2025_06_22_Time_1_ms_(98.70%)_Space_42.32_MB_(99.67%)
3+
// #Easy #Array #Hash_Table #Math #Counting #Number_Theory
4+
// #2025_06_23_Time_1_ms_(100.00%)_Space_42.24_MB_(_%)
45

56
public class Solution {
67
private boolean isPrime(int n) {

‎src/main/java/g3501_3600/s3592_inverse_coin_change/Solution.java

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
1-
package g3501_3600.s3592_inverse_coin_change;
1+
package g3501_3600.s3591_check_if_any_element_has_prime_frequency;
22

3-
// #Medium #2025_06_22_Time_1_ms_(100.00%)_Space_45.32_MB_(51.67%)
3+
// #Easy #Array #Hash_Table #Math #Counting #Number_Theory
4+
// #2025_06_23_Time_1_ms_(100.00%)_Space_42.91_MB_(_%)
45

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

‎src/main/java/g3501_3600/s3593_minimum_increments_to_equalize_leaf_paths/Solution.java

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

3-
// #Medium #2025_06_22_Time_18_ms_(100.00%)_Space_100.49_MB_(69.07%)
3+
// #Medium #Array #Dynamic_Programming #Depth_First_Search #Tree
4+
// #2025_06_23_Time_18_ms_(100.00%)_Space_83.71_MB_(100.00%)
45

56
import java.util.Arrays;
67

‎src/main/java/g3501_3600/s3594_minimum_time_to_transport_all_individuals/Solution.java

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

3-
// #Hard #2025_06_22_Time_250_ms_(97.41%)_Space_47.70_MB_(88.79%)
3+
// #Hard #Array #Dynamic_Programming #Bit_Manipulation #Heap_Priority_Queue #Graph #Bitmask
4+
// #Shortest_Path #2025_06_23_Time_261_ms_(100.00%)_Space_47.18_MB_(100.00%)
45

56
import java.util.Arrays;
67
import java.util.Comparator;

0 commit comments

Comments
 (0)