Updated tags

javadev · javadev · commit efe2320a1aa4 · 2025-01-22T02:05:26.000+02:00
diff --git a/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.java b/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3423_maximum_difference_between_adjacent_elements_in_a_circular_array;
 
-// #Easy #2025_01_19_Time_1_(100.00%)_Space_43.31_(100.00%)
+// #Easy #Array #2025_01_22_Time_1_(99.86%)_Space_43.72_(36.06%)
 
 public class Solution {
     public int maxAdjacentDistance(int[] nums) {
diff --git a/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java b/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3424_minimum_cost_to_make_arrays_identical;
 
-// #Medium #2025_01_19_Time_62_(_%)_Space_57.38_(_%)
+// #Medium #Array #Sorting #Greedy #2025_01_22_Time_60_(98.08%)_Space_57.68_(39.04%)
 
 import java.util.Arrays;
 
diff --git a/src/main/java/g3401_3500/s3425_longest_special_path/Solution.java b/src/main/java/g3401_3500/s3425_longest_special_path/Solution.java
@@ -1,6 +1,7 @@
 package g3401_3500.s3425_longest_special_path;
 
-// #Hard #2025_01_19_Time_57_(100.00%)_Space_94.11_(100.00%)
+// #Hard #Array #Hash_Table #Depth_First_Search #Tree #Sliding_Window
+// #2025_01_22_Time_49_(74.66%)_Space_98.04_(44.26%)
 
 import java.util.ArrayList;
 import java.util.Arrays;
diff --git a/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java b/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3426_manhattan_distances_of_all_arrangements_of_pieces;
 
-// #Hard #2025_01_19_Time_20_(100.00%)_Space_41.18_(100.00%)
+// #Hard #Math #Combinatorics #2025_01_22_Time_20_(87.92%)_Space_40.82_(98.07%)
 
 public class Solution {
     private long comb(long a, long b, long mod) {
