Updated tags

Author: javadev

src/main/java/g3401_3500/s3477_fruits_into_baskets_ii/Solution.java

@@ -1,6 +1,7 @@
 package g3401_3500.s3477_fruits_into_baskets_ii;
 
-// #Easy #2025_03_09_Time_2_ms_(100.00%)_Space_45.04_MB_(100.00%)
+// #Easy #Array #Binary_Search #Simulation #Segment_Tree
+// #2025_03_10_Time_2_ms_(100.00%)_Space_43.96_MB_(100.00%)
 
 public class Solution {
     public int numOfUnplacedFruits(int[] fruits, int[] baskets) {

src/main/java/g3401_3500/s3478_choose_k_elements_with_maximum_sum/Solution.java

@@ -1,6 +1,7 @@
 package g3401_3500.s3478_choose_k_elements_with_maximum_sum;
 
-// #Medium #2025_03_09_Time_156_ms_(100.00%)_Space_63.92_MB_(100.00%)
+// #Medium #Array #Sorting #Heap_(Priority_Queue)
+// #2025_03_10_Time_157_ms_(100.00%)_Space_62.83_MB_(50.00%)
 
 import java.util.Arrays;
 import java.util.PriorityQueue;

src/main/java/g3401_3500/s3479_fruits_into_baskets_iii/Solution.java

@@ -1,6 +1,7 @@
 package g3401_3500.s3479_fruits_into_baskets_iii;
 
-// #Medium #2025_03_09_Time_629_ms_(100.00%)_Space_67.19_MB_(100.00%)
+// #Medium #Array #Binary_Search #Ordered_Set #Segment_Tree
+// #2025_03_10_Time_655_ms_(100.00%)_Space_65.58_MB_(50.00%)
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.java

@@ -1,6 +1,7 @@
 package g3401_3500.s3480_maximize_subarrays_after_removing_one_conflicting_pair;
 
-// #Hard #2025_03_09_Time_581_ms_(_%)_Space_163.11_MB_(_%)
+// #Hard #Array #Prefix_Sum #Enumeration #Segment_Tree
+// #2025_03_10_Time_567_ms_(100.00%)_Space_159.65_MB_(50.00%)
 
 import java.util.ArrayList;
 import java.util.Arrays;