Added tags

Author: javadev

src/main/java/g3701_3800/s3731_find_missing_elements/Solution.java

@@ -1,21 +1,31 @@
 package g3701_3800.s3731_find_missing_elements;
 
-// #Easy #Weekly_Contest_474 #2025_11_02_Time_6_ms_(100.00%)_Space_47.09_MB_(_%)
+// #Easy #Array #Hash_Table #Sorting #Weekly_Contest_474
+// #2025_11_05_Time_2_ms_(94.89%)_Space_46.54_MB_(95.16%)
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 
 public class Solution {
     public List<Integer> findMissingElements(int[] nums) {
+        int maxi = 0;
+        int mini = 101;
         List<Integer> list = new ArrayList<>();
-        Arrays.sort(nums);
-        for (int i = 0; i < nums.length - 1; i++) {
-            if (nums[i + 1] - nums[i] > 1) {
-                for (int j = nums[i] + 1; j < nums[i + 1]; j++) {
-                    list.add(j);
-                }
+        boolean[] array = new boolean[101];
+        for (int num : nums) {
+            array[num] = true;
+            if (maxi < num) {
+                maxi = num;
             }
+            if (mini > num) {
+                mini = num;
+            }
+        }
+        for (int index = mini + 1; index < maxi; index++) {
+            if (array[index]) {
+                continue;
+            }
+            list.add(index);
         }
         return list;
     }

src/main/java/g3701_3800/s3732_maximum_product_of_three_elements_after_one_replacement/Solution.java

@@ -1,6 +1,7 @@
 package g3701_3800.s3732_maximum_product_of_three_elements_after_one_replacement;
 
-// #Medium #Weekly_Contest_474 #2025_11_02_Time_4_ms_(100.00%)_Space_96.67_MB_(_%)
+// #Medium #Array #Math #Sorting #Greedy #Weekly_Contest_474
+// #2025_11_05_Time_4_ms_(95.32%)_Space_97.32_MB_(28.84%)
 
 public class Solution {
     public long maxProduct(int[] nums) {

src/main/java/g3701_3800/s3733_minimum_time_to_complete_all_deliveries/Solution.java

@@ -1,41 +1,47 @@
 package g3701_3800.s3733_minimum_time_to_complete_all_deliveries;
 
-// #Medium #Weekly_Contest_474 #2025_11_02_Time_2_ms_(100.00%)_Space_44.04_MB_(_%)
+// #Medium #Math #Binary_Search #Weekly_Contest_474
+// #2025_11_05_Time_1_ms_(100.00%)_Space_44.16_MB_(55.61%)
 
 public class Solution {
-    private boolean func(long mid, int[] d, int[] r) {
-        long lcm = (long) r[0] * r[1] / gcd(r[0], r[1]);
-        long a1 = mid / r[0];
-        long a2 = mid / r[1];
-        long a3 = mid / lcm;
-        long b = mid - a1 - a2 + a3;
-        long o1 = a2 - a3;
-        long o2 = a1 - a3;
-        long d0 = Math.max(d[0] - o1, 0);
-        long d1 = Math.max(d[1] - o2, 0);
-        return b >= d0 + d1;
+    private boolean pos(long k, long n1, long n2, int p1, int p2, long lVal) {
+        long kP1 = k / p1;
+        long kP2 = k / p2;
+        long kL = k / lVal;
+        long s1 = kP2 - kL;
+        long s2 = kP1 - kL;
+        long sB = k - kP1 - kP2 + kL;
+        long w1 = Math.max(0L, n1 - s1);
+        long w2 = Math.max(0L, n2 - s2);
+        return (w1 + w2) <= sB;
     }
 
-    private long gcd(long a, long b) {
+    private long findGcd(long a, long b) {
         if (b == 0) {
             return a;
         }
-        return gcd(b, a % b);
+        return findGcd(b, a % b);
     }
 
     public long minimumTime(int[] d, int[] r) {
-        long lo = 0;
-        long hi = (long) 1e12;
-        long ans = Long.MAX_VALUE;
+        long n1 = d[0];
+        long n2 = d[1];
+        int p1 = r[0];
+        int p2 = r[1];
+        long g = findGcd(p1, p2);
+        long l = (long) p1 * p2 / g;
+        long lo = n1 + n2;
+        long hi = (n1 + n2) * Math.max(p1, p2);
+        long res = hi;
         while (lo <= hi) {
-            long mid = (lo + hi) / 2;
-            if (func(mid, d, r)) {
-                ans = mid;
+            long mid = lo + (hi - lo) / 2;
+            if (pos(mid, n1, n2, p1, p2, l)) {
+                res = mid;
                 hi = mid - 1;
             } else {
                 lo = mid + 1;
             }
         }
-        return ans;
+        return res;
     }
 }

src/main/java/g3701_3800/s3734_lexicographically_smallest_palindromic_permutation_greater_than_target/Solution.java

@@ -1,6 +1,7 @@
 package g3701_3800.s3734_lexicographically_smallest_palindromic_permutation_greater_than_target;
 
-// #Hard #Weekly_Contest_474 #2025_11_02_Time_3_ms_(50.00%)_Space_46.55_MB_(_%)
+// #Hard #String #Two_Pointers #Enumeration #Weekly_Contest_474
+// #2025_11_05_Time_2_ms_(100.00%)_Space_46.34_MB_(84.73%)
 
 import java.util.Arrays;