Added tasks 3643-3646

Author: javadev

src/main/java/g3601_3700/s3627_maximum_median_sum_of_subsequences_of_size_3/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3627_maximum_median_sum_of_subsequences_of_size_3;
 
-// #Medium #Weekly_Contest_460 #2025_07_27_Time_22_ms_(100.00%)_Space_129.50_MB_(86.95%)
+// #Medium #Array #Math #Sorting #Greedy #Game_Theory #Weekly_Contest_460
+// #2025_08_14_Time_23_ms_(98.36%)_Space_129.60_MB_(75.26%)
 
 import java.util.Arrays;
 

src/main/java/g3601_3700/s3628_maximum_number_of_subsequences_after_one_inserting/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3628_maximum_number_of_subsequences_after_one_inserting;
 
-// #Medium #Weekly_Contest_460 #2025_07_27_Time_12_ms_(100.00%)_Space_45.76_MB_(72.28%)
+// #Medium #String #Dynamic_Programming #Greedy #Prefix_Sum #Weekly_Contest_460
+// #2025_08_14_Time_12_ms_(100.00%)_Space_45.79_MB_(76.82%)
 
 public class Solution {
  public long numOfSubsequences(String s) {

src/main/java/g3601_3700/s3629_minimum_jumps_to_reach_end_via_prime_teleportation/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3629_minimum_jumps_to_reach_end_via_prime_teleportation;
 
-// #Medium #Weekly_Contest_460 #2025_07_27_Time_116_ms_(99.81%)_Space_76.00_MB_(67.96%)
+// #Medium #Array #Hash_Table #Math #Breadth_First_Search #Number_Theory #Weekly_Contest_460
+// #2025_08_14_Time_112_ms_(99.76%)_Space_76.04_MB_(74.71%)
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/g3601_3700/s3633_earliest_finish_time_for_land_and_water_rides_i/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3633_earliest_finish_time_for_land_and_water_rides_i;
 
-// #Easy #Biweekly_Contest_162 #2025_08_03_Time_3_ms_(100.00%)_Space_45.04_MB_(33.33%)
+// #Easy #Array #Sorting #Greedy #Binary_Search #Two_Pointers #Biweekly_Contest_162
+// #2025_08_14_Time_3_ms_(93.86%)_Space_45.39_MB_(29.02%)
 
 public class Solution {
  public int earliestFinishTime(

src/main/java/g3601_3700/s3634_minimum_removals_to_balance_array/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3634_minimum_removals_to_balance_array;
 
-// #Medium #Biweekly_Contest_162 #2025_08_03_Time_21_ms_(100.00%)_Space_60.28_MB_(100.00%)
+// #Medium #Array #Sorting #Sliding_Window #Biweekly_Contest_162
+// #2025_08_14_Time_20_ms_(99.40%)_Space_60.70_MB_(34.02%)
 
 import java.util.Arrays;
 

src/main/java/g3601_3700/s3635_earliest_finish_time_for_land_and_water_rides_ii/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3635_earliest_finish_time_for_land_and_water_rides_ii;
 
-// #Medium #Biweekly_Contest_162 #2025_08_03_Time_2_ms_(100.00%)_Space_55.88_MB_(50.00%)
+// #Medium #Array #Sorting #Greedy #Binary_Search #Two_Pointers #Biweekly_Contest_162
+// #2025_08_14_Time_2_ms_(100.00%)_Space_55.78_MB_(68.53%)
 
 public class Solution {
  public int earliestFinishTime(

src/main/java/g3601_3700/s3636_threshold_majority_queries/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3636_threshold_majority_queries;
 
-// #Hard #Biweekly_Contest_162 #2025_08_06_Time_82_ms_(98.38%)_Space_71.28_MB_(74.76%)
+// #Hard #Array #Hash_Table #Binary_Search #Prefix_Sum #Counting #Divide_and_Conquer
+// #Biweekly_Contest_162 #2025_08_14_Time_83_ms_(96.87%)_Space_71.30_MB_(75.24%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/g3601_3700/s3637_trionic_array_i/Solution.java

@@ -1,29 +1,26 @@
 package g3601_3700.s3637_trionic_array_i;
 
-// #Easy #Weekly_Contest_461 #2025_08_03_Time_1_ms_(100.00%)_Space_42.62_MB_(100.00%)
+// #Easy #Array #Weekly_Contest_461 #2025_08_14_Time_0_ms_(100.00%)_Space_43.15_MB_(44.56%)
 
 public class Solution {
  public boolean isTrionic(int[] nums) {
- int p = 0;
- int q = 0;
+ int i = 1;
  int n = nums.length;
- for (int i = 1; i < n - 1; ++i) {
- if (nums[i - 1] == nums[i]) {
- return false;
- }
- if (nums[i - 1] < nums[i] && nums[i] > nums[i + 1]) {
- if (p != 0) {
- return false;
- }
- p = i;
- }
- if (nums[i - 1] > nums[i] && nums[i] < nums[i + 1]) {
- if (p == 0 || q != 0) {
- return false;
- }
- q = i;
- }
+ while (i < n && nums[i] > nums[i - 1]) {
+ i++;
  }
- return q > 0;
+ if (i == n || i == 1) {
+ return false;
+ }
+ while (i < n && nums[i] < nums[i - 1]) {
+ i++;
+ }
+ if (i == n) {
+ return false;
+ }
+ while (i < n && nums[i] > nums[i - 1]) {
+ i++;
+ }
+ return i == n;
  }
 }

src/main/java/g3601_3700/s3638_maximum_balanced_shipments/Solution.java

@@ -1,6 +1,7 @@
 package g3601_3700.s3638_maximum_balanced_shipments;
 
-// #Medium #Weekly_Contest_461 #2025_08_03_Time_3_ms_(100.00%)_Space_62.17_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #Greedy #Stack #Monotonic_Stack #Weekly_Contest_461
+// #2025_08_14_Time_2_ms_(100.00%)_Space_62.34_MB_(68.23%)
 
 public class Solution {
  public int maxBalancedShipments(int[] weight) {

src/main/java/g3601_3700/s3639_minimum_time_to_activate_string/Solution.java

@@ -1,34 +1,34 @@
 package g3601_3700.s3639_minimum_time_to_activate_string;
 
-// #Medium #Weekly_Contest_461 #2025_08_03_Time_122_ms_(100.00%)_Space_58.43_MB_(100.00%)
-
-import java.util.TreeSet;
+// #Medium #Array #Binary_Search #Weekly_Contest_461
+// #2025_08_14_Time_6_ms_(99.91%)_Space_57.07_MB_(91.05%)
 
 public class Solution {
  public int minTime(String s, int[] order, int k) {
  int n = s.length();
- // Use a TreeSet to maintain a sorted list of indices
- TreeSet<Integer> pos = new TreeSet<>();
- pos.add(-1);
- pos.add(n);
- // Iterate through the order of removal
- int localK = k;
- for (int t = 0; t < order.length; ++t) {
+ long total = n * (n + 1L) / 2;
+ if (total < k) {
+ return -1;
+ }
+ int[] prev = new int[n + 1];
+ int[] next = new int[n + 1];
+ for (int i = 0; i < n; ++i) {
+ prev[i] = i - 1;
+ next[i] = i + 1;
+ }
+ for (int t = n - 1; t >= 0; t--) {
  int i = order[t];
- // Find the elements in the sorted set that bracket the current index 'i'
- // 'r' is the smallest element >= i
- Integer r = pos.ceiling(i);
- // 'l' is the largest element <= i
- Integer l = pos.floor(i);
- // The 'cost' to remove an item is the product of the distances to its neighbors
- localK -= (int) ((long) (i - l) * (r - i));
- pos.add(i);
- // If the total cost is exhausted, return the current time 't'
- if (localK <= 0) {
+ int left = prev[i];
+ int right = next[i];
+ total -= (long) (i - left) * (right - i);
+ if (total < k) {
  return t;
  }
+ if (left >= 0) {
+ next[left] = right;
+ }
+ prev[right] = left;
  }
- // If all items are removed and k is not exhausted, return -1
- return -1;
+ return 0;
  }
 }