Updated tags

Author: javadev

src/main/java/g3701_3800/s3722_lexicographically_smallest_string_after_reverse/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3722_lexicographically_smallest_string_after_reverse;
 
-// #Medium #Biweekly_Contest_168 #2025_10_26_Time_8_ms_(100.00%)_Space_44.98_MB_(100.00%)
+// #Medium #Biweekly_Contest_168 #2025_10_28_Time_8_ms_(100.00%)_Space_44.85_MB_(99.91%)
 
 public class Solution {
     public String lexSmallest(String s) {

src/main/java/g3701_3800/s3723_maximize_sum_of_squares_of_digits/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3723_maximize_sum_of_squares_of_digits;
 
-// #Medium #Biweekly_Contest_168 #2025_10_26_Time_8_ms_(99.81%)_Space_45.78_MB_(_%)
+// #Medium #Biweekly_Contest_168 #2025_10_28_Time_14_ms_(99.30%)_Space_46.14_MB_(70.05%)
 
 public class Solution {
     public String maxSumOfSquares(int places, int sum) {

src/main/java/g3701_3800/s3724_minimum_operations_to_transform_array/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3724_minimum_operations_to_transform_array;
 
-// #Medium #Biweekly_Contest_168 #2025_10_26_Time_2_ms_(100.00%)_Space_61.61_MB_(100.00%)
+// #Medium #Biweekly_Contest_168 #2025_10_28_Time_2_ms_(100.00%)_Space_62.61_MB_(5.39%)
 
 public class Solution {
     public long minOperations(int[] nums1, int[] nums2) {

src/main/java/g3701_3800/s3725_count_ways_to_choose_coprime_integers_from_rows/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3725_count_ways_to_choose_coprime_integers_from_rows;
 
-// #Hard #Biweekly_Contest_168 #2025_10_26_Time_31_ms_(92.56%)_Space_49.21_MB_(_%)
+// #Hard #Biweekly_Contest_168 #2025_10_28_Time_30_ms_(93.77%)_Space_47.15_MB_(68.37%)
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/g3701_3800/s3726_remove_zeros_in_decimal_representation/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3726_remove_zeros_in_decimal_representation;
 
-// #Easy #Weekly_Contest_473 #2025_10_26_Time_9_ms_(_%)_Space_41.93_MB_(_%)
+// #Easy #Weekly_Contest_473 #2025_10_28_Time_1_ms_(98.76%)_Space_40.81_MB_(93.77%)
 
 public class Solution {
     public long removeZeros(long n) {

src/main/java/g3701_3800/s3727_maximum_alternating_sum_of_squares/Solution.java

@@ -1,34 +1,27 @@
 package g3701_3800.s3727_maximum_alternating_sum_of_squares;
 
-// #Medium #Weekly_Contest_473 #2025_10_26_Time_46_ms_(100.00%)_Space_62.34_MB_(_%)
+// #Medium #Weekly_Contest_473 #2025_10_28_Time_10_ms_(99.97%)_Space_63.08_MB_(17.57%)
 
 public class Solution {
     public long maxAlternatingSum(int[] nums) {
         int n = nums.length;
-        long sum = 0;
-        int i = 0;
-        int j = n - 1;
-        for (int k = 0; k < n; k++) {
-            nums[k] = nums[k] * nums[k];
+        int need = n / 2;
+        int maxa = 40000;
+        int[] freq = new int[maxa + 1];
+        long total = 0;
+        for (int x : nums) {
+            int a = Math.abs(x);
+            freq[a]++;
+            total += 1L * a * a;
         }
-        java.util.Arrays.sort(nums);
-        java.util.List<Long> ans = new java.util.ArrayList<>();
-        while (i < j) {
-            ans.add((long) nums[j]);
-            ans.add((long) nums[i]);
-            j--;
-            i++;
-        }
-        if ((n & 1) == 1) {
-            ans.add((long) nums[n / 2]);
-        }
-        for (int k = 0; k < n; k++) {
-            if (k % 2 == 0) {
-                sum += ans.get(k);
-            } else {
-                sum -= ans.get(k);
+        long small = 0;
+        for (int a = 0; a <= maxa && need > 0; a++) {
+            int take = Math.min(freq[a], need);
+            if (take > 0) {
+                small += 1L * a * a * take;
+                need -= take;
             }
         }
-        return sum;
+        return total - 2 * small;
     }
 }

src/main/java/g3701_3800/s3728_stable_subarrays_with_equal_boundary_and_interior_sum/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3728_stable_subarrays_with_equal_boundary_and_interior_sum;
 
-// #Medium #Weekly_Contest_473 #2025_10_26_Time_124_ms_(100.00%)_Space_62.66_MB_(100.00%)
+// #Medium #Weekly_Contest_473 #2025_10_28_Time_96_ms_(68.14%)_Space_62.66_MB_(83.54%)
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/g3701_3800/s3729_count_distinct_subarrays_divisible_by_k_in_sorted_array/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3729_count_distinct_subarrays_divisible_by_k_in_sorted_array;
 
-// #Hard #Weekly_Contest_473 #2025_10_26_Time_67_ms_(50.00%)_Space_61.73_MB_(50.00%)
+// #Hard #Weekly_Contest_473 #2025_10_28_Time_61_ms_(88.70%)_Space_60.47_MB_(80.43%)
 
 import java.util.HashMap;
 import java.util.Map;