javadev · javadev · Sep 26, 2025 · Sep 21, 2025 · Sep 21, 2025 · Sep 26, 2025
diff --git a/src/main/java/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.java b/src/main/java/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3648_minimum_sensors_to_cover_grid;
 
-// #Medium #Biweekly_Contest_163 #2025_08_17_Time_0_ms_(100.00%)_Space_41.03_MB_(100.00%)
+// #Medium #Math #Biweekly_Contest_163 #2025_09_26_Time_0_ms_(100.00%)_Space_41.09_MB_(54.77%)
 
 public class Solution {
     public int minSensors(int n, int m, int k) {

diff --git a/src/main/java/g3601_3700/s3649_number_of_perfect_pairs/Solution.java b/src/main/java/g3601_3700/s3649_number_of_perfect_pairs/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3649_number_of_perfect_pairs;
 
-// #Medium #Biweekly_Contest_163 #2025_08_17_Time_46_ms_(100.00%)_Space_60.00_MB_(100.00%)
+// #Medium #Array #Math #Sorting #Two_Pointers #Biweekly_Contest_163
+// #2025_09_26_Time_44_ms_(71.88%)_Space_59.91_MB_(26.12%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.java b/src/main/java/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3650_minimum_cost_path_with_edge_reversals;
 
-// #Medium #Biweekly_Contest_163 #2025_08_17_Time_51_ms_(99.85%)_Space_110.03_MB_(49.54%)
+// #Medium #Heap_Priority_Queue #Graph #Shortest_Path #Biweekly_Contest_163
+// #2025_09_26_Time_47_ms_(99.80%)_Space_109.50_MB_(56.57%)
 
 import java.util.Arrays;
 import java.util.PriorityQueue;

diff --git a/src/main/java/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.java b/src/main/java/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3651_minimum_cost_path_with_teleportations;
 
-// #Hard #Biweekly_Contest_163 #2025_08_17_Time_78_ms_(100.00%)_Space_45.52_MB_(97.73%)
+// #Hard #Array #Dynamic_Programming #Matrix #Biweekly_Contest_163
+// #2025_09_26_Time_79_ms_(94.66%)_Space_45.38_MB_(97.96%)
 
 import java.util.Arrays;
 
@@ -60,7 +61,6 @@ public int minCost(int[][] grid, int k) {
                     prev[grid[i][j]] = Math.min(prev[grid[i][j]], dp[i][j]);
                 }
             }
-            // int currcost = prev[0];
             for (int i = 1; i <= max; i++) {
                 prev[i] = Math.min(prev[i], prev[i - 1]);
             }

diff --git a/src/main/java/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.java b/src/main/java/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3654_minimum_sum_after_divisible_sum_deletions;
 
-// #Medium #Weekly_Contest_463 #2025_08_17_Time_17_ms_(98.16%)_Space_60.80_MB_(48.62%)
+// #Medium #Array #Hash_Table #Dynamic_Programming #Prefix_Sum #Weekly_Contest_463
+// #2025_09_26_Time_17_ms_(91.65%)_Space_59.64_MB_(68.62%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.java b/src/main/java/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3658_gcd_of_odd_and_even_sums;
 
-// #Easy #Weekly_Contest_464 #2025_08_24_Time_1_ms_(100.00%)_Space_41.16_MB_(100.00%)
+// #Easy #Math #Number_Theory #Weekly_Contest_464
+// #2025_09_26_Time_0_ms_(100.00%)_Space_41.43_MB_(15.15%)
 
 public class Solution {
     public int gcdOfOddEvenSums(int n) {

diff --git a/src/main/java/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.java b/src/main/java/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3659_partition_array_into_k_distinct_groups;
 
-// #Medium #Weekly_Contest_464 #2025_08_29_Time_2_ms_(100.00%)_Space_55.86_MB_(99.96%)
+// #Medium #Array #Hash_Table #Counting #Weekly_Contest_464
+// #2025_09_26_Time_3_ms_(99.86%)_Space_56.50_MB_(99.38%)
 
 public class Solution {
     public boolean partitionArray(int[] nums, int k) {

diff --git a/src/main/java/g3601_3700/s3660_jump_game_ix/Solution.java b/src/main/java/g3601_3700/s3660_jump_game_ix/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3660_jump_game_ix;
 
-// #Medium #Weekly_Contest_464 #2025_08_29_Time_3_ms_(100.00%)_Space_66.47_MB_(70.03%)
+// #Medium #Array #Dynamic_Programming #Weekly_Contest_464
+// #2025_09_26_Time_4_ms_(98.97%)_Space_70.98_MB_(7.99%)
 
 public class Solution {
     public int[] maxValue(int[] nums) {

diff --git a/src/main/java/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.java b/src/main/java/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3661_maximum_walls_destroyed_by_robots;
 
-// #Hard #Weekly_Contest_464 #2025_08_29_Time_88_ms_(99.25%)_Space_68.62_MB_(40.75%)
+// #Hard #Array #Dynamic_Programming #Sorting #Binary_Search #Weekly_Contest_464
+// #2025_09_26_Time_101_ms_(91.89%)_Space_63.31_MB_(79.90%)
 
 import java.util.Arrays;
 import java.util.Comparator;

diff --git a/src/main/java/g3601_3700/s3663_find_the_least_frequent_digit/Solution.java b/src/main/java/g3601_3700/s3663_find_the_least_frequent_digit/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3663_find_the_least_frequent_digit;
 
-// #Easy #Biweekly_Contest_164 #2025_09_06_Time_1_ms_(97.91%)_Space_41.14_MB_(60.27%)
+// #Easy #Array #Hash_Table #Math #Counting #Biweekly_Contest_164
+// #2025_09_26_Time_1_ms_(97.93%)_Space_41.02_MB_(71.15%)
 
 public class Solution {
     public int getLeastFrequentDigit(int n) {

diff --git a/src/main/java/g3601_3700/s3664_two_letter_card_game/Solution.java b/src/main/java/g3601_3700/s3664_two_letter_card_game/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3664_two_letter_card_game;
 
-// #Medium #Biweekly_Contest_164 #2025_09_06_Time_8_ms_(98.82%)_Space_60.21_MB_(45.56%)
+// #Medium #Array #String #Hash_Table #Counting #Enumeration #Biweekly_Contest_164
+// #2025_09_26_Time_8_ms_(99.01%)_Space_60.52_MB_(32.53%)
 
 public class Solution {
     public int score(String[] cards, char x) {

diff --git a/src/main/java/g3601_3700/s3665_twisted_mirror_path_count/Solution.java b/src/main/java/g3601_3700/s3665_twisted_mirror_path_count/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3665_twisted_mirror_path_count;
 
-// #Medium #Biweekly_Contest_164 #2025_09_06_Time_28_ms_(100.00%)_Space_86.70_MB_(69.78%)
+// #Medium #Array #Dynamic_Programming #Matrix #Biweekly_Contest_164
+// #2025_09_26_Time_28_ms_(99.81%)_Space_87.43_MB_(62.40%)
 
 public class Solution {
     public int uniquePaths(int[][] grid) {

diff --git a/src/main/java/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.java b/src/main/java/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3666_minimum_operations_to_equalize_binary_string;
 
-// #Hard #Biweekly_Contest_164 #2025_09_06_Time_6_ms_(83.87%)_Space_45.74_MB_(64.52%)
+// #Hard #String #Hash_Table #Math #Biweekly_Contest_164 #Breadth_First_Search
+// #2025_09_26_Time_6_ms_(85.17%)_Space_45.57_MB_(88.76%)
 
 public class Solution {
     public int minOperations(String s, int k) {

diff --git a/src/main/java/g3601_3700/s3668_restore_finishing_order/Solution.java b/src/main/java/g3601_3700/s3668_restore_finishing_order/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3668_restore_finishing_order;
 
-// #Easy #Weekly_Contest_465 #2025_09_06_Time_1_ms_(100.00%)_Space_45.18_MB_(44.72%)
+// #Easy #Array #Hash_Table #Weekly_Contest_465
+// #2025_09_26_Time_1_ms_(100.00%)_Space_44.90_MB_(92.68%)
 
 public class Solution {
     public int[] recoverOrder(int[] order, int[] friends) {

diff --git a/src/main/java/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.java b/src/main/java/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3669_balanced_k_factor_decomposition;
 
-// #Medium #Weekly_Contest_465 #2025_09_06_Time_13_ms_(78.36%)_Space_45.64_MB_(10.38%)
+// #Medium #Math #Backtracking #Number_Theory #Weekly_Contest_465
+// #2025_09_26_Time_14_ms_(77.10%)_Space_45.18_MB_(43.88%)
 
 import java.util.ArrayList;
 import java.util.Collections;

diff --git a/...n/java/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.java b/...n/java/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3670_maximum_product_of_two_integers_with_no_common_bits;
 
-// #Medium #Weekly_Contest_465 #2025_09_06_Time_151_ms_(99.28%)_Space_64.23_MB_(47.58%)
+// #Medium #Array #Dynamic_Programming #Bit_Manipulation #Weekly_Contest_465
+// #2025_09_26_Time_159_ms_(98.86%)_Space_64.54_MB_(25.90%)
 
 public class Solution {
     public long maxProduct(int[] nums) {

diff --git a/src/main/java/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.java b/src/main/java/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3671_sum_of_beautiful_subsequences;
 
-// #Hard #Weekly_Contest_465 #2025_09_06_Time_233_ms_(96.31%)_Space_62.03_MB_(69.80%)
+// #Hard #Array #Math #Tree #Number_Theory #Weekly_Contest_465
+// #2025_09_26_Time_232_ms_(92.27%)_Space_56.32_MB_(82.85%)
 
 public class Solution {
     private static final int MOD = 1000000007;

diff --git a/src/main/java/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.java b/src/main/java/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3674_minimum_operations_to_equalize_array;
 
-// #Easy #Weekly_Contest_466 #2025_09_07_Time_1_ms_(100.00%)_Space_43.98_MB_(100.00%)
+// #Easy #Array #Bit_Manipulation #Brainteaser #Weekly_Contest_466
+// #2025_09_26_Time_0_ms_(100.00%)_Space_43.29_MB_(90.84%)
 
 public class Solution {
     public int minOperations(int[] nums) {

diff --git a/src/main/java/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.java b/src/main/java/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3675_minimum_operations_to_transform_string;
 
-// #Medium #Weekly_Contest_466 #2025_09_14_Time_5_ms_(100.00%)_Space_47.93_MB_(95.06%)
+// #Medium #String #Greedy #Weekly_Contest_466
+// #2025_09_26_Time_5_ms_(100.00%)_Space_47.76_MB_(98.96%)
 
 public class Solution {
     public int minOperations(String s) {

diff --git a/src/main/java/g3601_3700/s3676_count_bowl_subarrays/Solution.java b/src/main/java/g3601_3700/s3676_count_bowl_subarrays/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3676_count_bowl_subarrays;
 
-// #Medium #Weekly_Contest_466 #2025_09_14_Time_2_ms_(100.00%)_Space_58.91_MB_(69.85%)
+// #Medium #Array #Stack #Monotonic_Stack #Weekly_Contest_466
+// #2025_09_26_Time_2_ms_(100.00%)_Space_58.70_MB_(69.49%)
 
 public class Solution {
     public long bowlSubarrays(int[] nums) {

diff --git a/src/main/java/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.java b/src/main/java/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3677_count_binary_palindromic_numbers;
 
-// #Hard #Weekly_Contest_466 #2025_09_07_Time_1_ms_(100.00%)_Space_40.86_MB_(100.00%)
+// #Hard #Math #Bit_Manipulation #Weekly_Contest_466
+// #2025_09_26_Time_1_ms_(100.00%)_Space_40.82_MB_(77.82%)
 
 public class Solution {
     private long makePalin(long left, boolean odd) {

diff --git a/src/main/java/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.java b/src/main/java/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3678_smallest_absent_positive_greater_than_average;
 
-// #Easy #Biweekly_Contest_165 #2025_09_20_Time_2_ms_(100.00%)_Space_45.28_MB_(53.71%)
+// #Easy #Array #Hash_Table #Biweekly_Contest_165
+// #2025_09_26_Time_2_ms_(100.00%)_Space_45.02_MB_(77.05%)
 
 public class Solution {
     public int smallestAbsent(int[] nums) {

diff --git a/src/main/java/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.java b/src/main/java/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3679_minimum_discards_to_balance_inventory;
 
-// #Medium #Biweekly_Contest_165 #2025_09_20_Time_2_ms_(100.00%)_Space_60.72_MB_(75.43%)
+// #Medium #Array #Hash_Table #Simulation #Counting #Sliding_Window #Biweekly_Contest_165
+// #2025_09_26_Time_2_ms_(100.00%)_Space_61.06_MB_(68.83%)
 
 public class Solution {
     public int minArrivalsToDiscard(int[] arrivals, int w, int m) {

diff --git a/src/main/java/g3601_3700/s3680_generate_schedule/Solution.java b/src/main/java/g3601_3700/s3680_generate_schedule/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3680_generate_schedule;
 
-// #Medium #Biweekly_Contest_165 #2025_09_20_Time_2_ms_(100.00%)_Space_45.33_MB_(59.29%)
+// #Medium #Array #Math #Greedy #Biweekly_Contest_165
+// #2025_09_26_Time_2_ms_(100.00%)_Space_45.58_MB_(29.48%)
 
 public class Solution {
     public int[][] generateSchedule(int n) {

diff --git a/src/main/java/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.java b/src/main/java/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3681_maximum_xor_of_subsequences;
 
-// #Hard #Biweekly_Contest_165 #2025_09_20_Time_27_ms_(99.73%)_Space_58.35_MB_(30.31%)
+// #Hard #Array #Math #Greedy #Bit_Manipulation #Biweekly_Contest_165
+// #2025_09_26_Time_28_ms_(98.28%)_Space_57.46_MB_(98.97%)
 
 public class Solution {
     public int maxXorSubsequences(int[] nums) {

diff --git a/src/main/java/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.java b/src/main/java/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.java
@@ -1,13 +1,13 @@
 package g3601_3700.s3683_earliest_time_to_finish_one_task;
 
-// #Easy #Weekly_Contest_467 #2025_09_20_Time_0_ms_(100.00%)_Space_45.29_MB_(39.62%)
+// #Easy #Array #Weekly_Contest_467 #2025_09_26_Time_1_ms_(77.01%)_Space_45.24_MB_(38.70%)
 
 public class Solution {
     public int earliestTime(int[][] tasks) {
         int ans = 1000;
-        for (int i = 0; i < tasks.length; i++) {
-            int st = tasks[i][0];
-            int tm = tasks[i][1];
+        for (int[] task : tasks) {
+            int st = task[0];
+            int tm = task[1];
             ans = Math.min(ans, st + tm);
         }
         return ans;

diff --git a/src/main/java/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.java b/src/main/java/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3684_maximize_sum_of_at_most_k_distinct_elements;
 
-// #Easy #Weekly_Contest_467 #2025_09_20_Time_2_ms_(100.00%)_Space_45.58_MB_(68.55%)
+// #Easy #Array #Hash_Table #Sorting #Greedy #Weekly_Contest_467
+// #2025_09_26_Time_3_ms_(99.92%)_Space_45.48_MB_(84.34%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.java b/src/main/java/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.java
@@ -1,22 +1,21 @@
 package g3601_3700.s3685_subsequence_sum_after_capping_elements;
 
-// #Medium #Weekly_Contest_467 #2025_09_20_Time_24_ms_(96.07%)_Space_45.39_MB_(97.38%)
+// #Medium #Array #Dynamic_Programming #Sorting #Two_Pointers #Weekly_Contest_467
+// #2025_09_26_Time_24_ms_(96.44%)_Space_45.98_MB_(36.73%)
 
 public class Solution {
     public boolean[] subsequenceSumAfterCapping(int[] nums, int k) {
-        int[] zolvarinte = nums;
-        int n = zolvarinte.length;
+        int n = nums.length;
         boolean[] answer = new boolean[n];
-        int maxV = n;
-        int[] freq = new int[maxV + 2];
-        for (int v : zolvarinte) {
-            if (v <= maxV) {
+        int[] freq = new int[n + 2];
+        for (int v : nums) {
+            if (v <= n) {
                 freq[v]++;
             }
         }
-        int[] cntGe = new int[maxV + 2];
-        cntGe[maxV] = freq[maxV];
-        for (int x = maxV - 1; x >= 1; x--) {
+        int[] cntGe = new int[n + 2];
+        cntGe[n] = freq[n];
+        for (int x = n - 1; x >= 1; x--) {
             cntGe[x] = cntGe[x + 1] + freq[x];
         }
         boolean[] dp = new boolean[k + 1];

diff --git a/src/main/java/g3601_3700/s3686_number_of_stable_subsequences/Solution.java b/src/main/java/g3601_3700/s3686_number_of_stable_subsequences/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3686_number_of_stable_subsequences;
 
-// #Hard #Weekly_Contest_467 #2025_09_20_Time_9_ms_(99.94%)_Space_59.73_MB_(89.70%)
+// #Hard #Array #Dynamic_Programming #Weekly_Contest_467
+// #2025_09_26_Time_9_ms_(99.95%)_Space_60.26_MB_(57.85%)
 
 public class Solution {
     private static final long MOD = 1000000007L;

diff --git a/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array/Solution.java b/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array/Solution.java
@@ -0,0 +1,16 @@
+package g3601_3700.s3688_bitwise_or_of_even_numbers_in_an_array;
+
+// #Easy #Array #Bit_Manipulation #Simulation #Weekly_Contest_468
+// #2025_09_26_Time_0_ms_(100.00%)_Space_42.64_MB_(87.38%)
+
+public class Solution {
+    public int evenNumberBitwiseORs(int[] nums) {
+        int count = 0;
+        for (int num : nums) {
+            if (num % 2 == 0) {
+                count |= num;
+            }
+        }
+        return count;
+    }
+}
diff --git a/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array/readme.md b/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array/readme.md
@@ -0,0 +1,44 @@
+3688\. Bitwise OR of Even Numbers in an Array
+
+Easy
+
+You are given an integer array `nums`.
+
+Return the bitwise **OR** of all **even** numbers in the array.
+
+If there are no even numbers in `nums`, return 0.
+
+**Example 1:**
+
+**Input:** nums = [1,2,3,4,5,6]
+
+**Output:** 6
+
+**Explanation:**
+
+The even numbers are 2, 4, and 6. Their bitwise OR equals 6.
+
+**Example 2:**
+
+**Input:** nums = [7,9,11]
+
+**Output:** 0
+
+**Explanation:**
+
+There are no even numbers, so the result is 0.
+
+**Example 3:**
+
+**Input:** nums = [1,8,16]
+
+**Output:** 24
+
+**Explanation:**
+
+The even numbers are 8 and 16. Their bitwise OR equals 24.
+
+**Constraints:**
+
+*   `1 <= nums.length <= 100`
+*   `1 <= nums[i] <= 100`
diff --git a/src/main/java/g3601_3700/s3689_maximum_total_subarray_value_i/Solution.java b/src/main/java/g3601_3700/s3689_maximum_total_subarray_value_i/Solution.java
@@ -0,0 +1,16 @@
+package g3601_3700.s3689_maximum_total_subarray_value_i;
+
+// #Medium #Array #Greedy #Weekly_Contest_468
+// #2025_09_26_Time_1_ms_(100.00%)_Space_55.58_MB_(71.81%)
+
+public class Solution {
+    public long maxTotalValue(int[] num, int k) {
+        int mxv = Integer.MIN_VALUE;
+        int mnv = Integer.MAX_VALUE;
+        for (int val : num) {
+            mxv = Math.max(mxv, val);
+            mnv = Math.min(mnv, val);
+        }
+        return (long) (mxv - mnv) * k;
+    }
+}