Improved tasks 3701-3704, 3710, 3715

Author: javadev

src/main/java/g3701_3800/s3701_compute_alternating_sum/Solution.java

@@ -1,6 +1,7 @@
 package g3701_3800.s3701_compute_alternating_sum;
 
-// #Easy #Weekly_Contest_470 #2025_10_05_Time_1_ms_(100.00%)_Space_44.28_MB_(66.67%)
+// #Easy #Array #Simulation #Weekly_Contest_470
+// #2025_10_05_Time_1_ms_(100.00%)_Space_44.28_MB_(66.67%)
 
 public class Solution {
     public int alternatingSum(int[] nums) {

src/main/java/g3701_3800/s3702_longest_subsequence_with_non_zero_bitwise_xor/Solution.java

@@ -1,6 +1,7 @@
 package g3701_3800.s3702_longest_subsequence_with_non_zero_bitwise_xor;
 
-// #Medium #Weekly_Contest_470 #2025_10_05_Time_2_ms_(100.00%)_Space_64.20_MB_(100.00%)
+// #Medium #Array #Bit_Manipulation #Weekly_Contest_470
+// #2025_10_05_Time_2_ms_(100.00%)_Space_64.20_MB_(100.00%)
 
 public class Solution {
     public int longestSubsequence(int[] nums) {

src/main/java/g3701_3800/s3703_remove_k_balanced_substrings/Solution.java

@@ -1,6 +1,7 @@
 package g3701_3800.s3703_remove_k_balanced_substrings;
 
-// #Medium #Weekly_Contest_470 #2025_10_05_Time_191_ms_(100.00%)_Space_45.86_MB_(100.00%)
+// #Medium #String #Stack #Simulation #Weekly_Contest_470
+// #2025_10_05_Time_191_ms_(100.00%)_Space_45.86_MB_(100.00%)
 
 public class Solution {
     public String removeSubstring(String s, int k) {

src/main/java/g3701_3800/s3704_count_no_zero_pairs_that_sum_to_n/Solution.java

@@ -1,6 +1,7 @@
 package g3701_3800.s3704_count_no_zero_pairs_that_sum_to_n;
 
-// #Hard #Weekly_Contest_470 #2025_10_05_Time_4_ms_(97.37%)_Space_41.07_MB_(100.00%)
+// #Hard #Dynamic_Programming #Math #Weekly_Contest_470
+// #2025_10_05_Time_4_ms_(97.37%)_Space_41.07_MB_(100.00%)
 
 public class Solution {
     public long countNoZeroPairs(long n) {

src/main/java/g3701_3800/s3710_maximum_partition_factor/Solution.java

@@ -1,7 +1,7 @@
 package g3701_3800.s3710_maximum_partition_factor;
 
-// #Hard #Array #Binary_Search #Graph #Union_Find #Biweekly_Contest_167 #Depth_First_Search
-// #Breadth_First_Search #2025_10_14_Time_46_ms_(99.31%)_Space_45.31_MB_(84.72%)
+// #Hard #Array #Depth_First_Search #Breadth_First_Search #Binary_Search #Graph #Union_Find
+// #Biweekly_Contest_167 #2025_10_14_Time_46_ms_(99.31%)_Space_45.31_MB_(84.72%)
 
 import java.util.Arrays;
 

src/main/java/g3701_3800/s3715_sum_of_perfect_square_ancestors/Solution.java

@@ -1,6 +1,6 @@
 package g3701_3800.s3715_sum_of_perfect_square_ancestors;
 
-// #Hard #Array #Hash_Table #Math #Tree #Counting #Number_Theory #Depth_First_Search
+// #Hard #Array #Hash_Table #Math #Depth_First_Search #Tree #Counting #Number_Theory
 // #Weekly_Contest_471 #2025_10_14_Time_122_ms_(98.09%)_Space_123.31_MB_(49.05%)
 
 import java.util.ArrayList;