Added tasks 3360-3373

Author: javadev

README.md

@@ -71,7 +71,7 @@ import java.util.List;
 public class Solution {
     public List<String> addOperators(String num, int target) {
         List<String> res = new ArrayList<>();
-        if (num.length() == 0 || Long.valueOf(num) > Integer.MAX_VALUE) {
+        if (num.length() == 0 || Long.parseLong(num) > Integer.MAX_VALUE) {
             return res;
         }
         char[] list = num.toCharArray();

src/main/java/g0201_0300/s0282_expression_add_operators/readme.md

@@ -39,7 +39,7 @@ public class Solution {
         long count = 9;
         int start = 1;
         while (n > len * count) {
-            n -= len * count;
+            n -= (int) (len * count);
             len += 1;
             count *= 10;
             start *= 10;

src/main/java/g0301_0400/s0400_nth_digit/readme.md

@@ -46,7 +46,7 @@ public class Solution {
         for (int i = 0; i < m; i++) {
             for (int j = 0; j < n; j++) {
                 if (board[i][j] != '.'
-                        && (j <= 0 || board[i][j - 1] != 'X')
+                        && (j == 0 || board[i][j - 1] != 'X')
                         && (i <= 0 || board[i - 1][j] != 'X')) {
                     count++;
                 }

src/main/java/g0401_0500/s0419_battleships_in_a_board/readme.md

@@ -61,7 +61,7 @@ public class Solution {
         }
         for (int i = s.length() - 1; i >= 0; i--) {
             char c = s.charAt(i);
-            k %= length;
+            k %= (int) length;
             if (c >= 48 && c <= 57) {
                 length /= c - '0';
             } else if (k == 0) {

src/main/java/g0801_0900/s0880_decoded_string_at_index/readme.md

@@ -61,7 +61,7 @@ public class Solution {
         int exp = list.size() - 1;
         for (int i = list.size() - 1; i >= 0; i--) {
             if (list.get(i) == 0) {
-                result += Math.pow(2, exp);
+                result += (int) Math.pow(2, exp);
             }
             exp--;
         }

src/main/java/g1001_1100/s1009_complement_of_base_10_integer/readme.md

@@ -53,60 +53,74 @@ Implement the `FizzBuzz` class:
 ## Solution
 
 ```java
-import java.util.concurrent.atomic.AtomicInteger;
 import java.util.function.IntConsumer;
 
 @SuppressWarnings("java:S1130")
 public class FizzBuzz {
-    private final AtomicInteger count = new AtomicInteger(1);
-
     private final int n;
+    private int current;
 
     public FizzBuzz(int n) {
         this.n = n;
+        this.current = 1;
     }
 
     // printFizz.run() outputs "fizz".
     public void fizz(Runnable printFizz) throws InterruptedException {
-        int i;
-        while ((i = count.get()) <= n) {
-            if (i % 3 == 0 && i % 5 != 0) {
-                printFizz.run();
-                count.compareAndSet(i, i + 1);
+        synchronized (this) {
+            while (current <= n) {
+                if (current % 3 == 0 && current % 5 != 0) {
+                    printFizz.run();
+                    current += 1;
+                    notifyAll();
+                } else {
+                    wait();
+                }
             }
         }
     }
 
     // printBuzz.run() outputs "buzz".
     public void buzz(Runnable printBuzz) throws InterruptedException {
-        int i;
-        while ((i = count.get()) <= n) {
-            count.get();
-            if (i % 5 == 0 && i % 3 != 0) {
-                printBuzz.run();
-                count.compareAndSet(i, i + 1);
+        synchronized (this) {
+            while (current <= n) {
+                if (current % 3 != 0 && current % 5 == 0) {
+                    printBuzz.run();
+                    current += 1;
+                    notifyAll();
+                } else {
+                    wait();
+                }
             }
         }
     }
 
     // printFizzBuzz.run() outputs "fizzbuzz".
     public void fizzbuzz(Runnable printFizzBuzz) throws InterruptedException {
-        int i;
-        while ((i = count.get()) <= n) {
-            if (i % 15 == 0) {
-                printFizzBuzz.run();
-                count.compareAndSet(i, i + 1);
+        synchronized (this) {
+            while (current <= n) {
+                if (current % 15 == 0) {
+                    printFizzBuzz.run();
+                    current += 1;
+                    notifyAll();
+                } else {
+                    wait();
+                }
             }
         }
     }
 
     // printNumber.accept(x) outputs "x", where x is an integer.
     public void number(IntConsumer printNumber) throws InterruptedException {
-        int i;
-        while ((i = count.get()) <= n) {
-            if (i % 5 != 0 && i % 3 != 0) {
-                printNumber.accept(i);
-                count.compareAndSet(i, i + 1);
+        synchronized (this) {
+            while (current <= n) {
+                if (current % 3 != 0 && current % 5 != 0) {
+                    printNumber.accept(current);
+                    current += 1;
+                    notifyAll();
+                } else {
+                    wait();
+                }
             }
         }
     }

src/main/java/g1101_1200/s1195_fizz_buzz_multithreaded/readme.md

@@ -36,13 +36,12 @@ public class CombinationIterator {
     private List<String> list;
     private int index;
     private int combinationLength;
-    private boolean[] visited;
 
     public CombinationIterator(String characters, int combinationLength) {
         this.index = 0;
         this.list = new ArrayList<>();
         this.combinationLength = combinationLength;
-        this.visited = new boolean[characters.length()];
+        boolean[] visited = new boolean[characters.length()];
         buildAllCombinations(characters, 0, new StringBuilder(), visited);
     }
 

src/main/java/g1201_1300/s1286_iterator_for_combination/readme.md

@@ -71,7 +71,7 @@ public class Solution {
                 || target[maxIndex] % remainingSum == 0) {
             return false;
         }
-        target[maxIndex] %= remainingSum;
+        target[maxIndex] %= (int) remainingSum;
         return isPossible(target);
     }
 }

src/main/java/g1301_1400/s1354_construct_target_array_with_multiple_sums/readme.md

@@ -67,7 +67,7 @@ import java.util.ArrayList;
 public class Solution {
     public int[] countSubTrees(int n, int[][] edges, String labelsString) {
         int[] labelsCount = new int[n];
-        if (n <= 0 || edges == null || labelsString == null) {
+        if (n == 0 || edges == null || labelsString == null) {
             return labelsCount;
         }
 

src/main/java/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/readme.md

@@ -55,7 +55,7 @@ public class Solution {
                 long diff = i == 0 ? inventory[i] : inventory[i] - inventory[i - 1];
                 if (count * diff < orders) {
                     totalValue += (2L * inventory[i] - diff + 1) * diff * count / 2 % mod;
-                    orders -= count * diff;
+                    orders -= (int) (count * diff);
                 } else {
                     diff = orders / count;
                     long remainder = orders % count;

src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls/readme.md

@@ -43,7 +43,7 @@ public class Solution {
         Arrays.fill(res, 'a');
         k -= n;
         while (k > 0) {
-            res[--n] += Math.min(25, k);
+            res[--n] += (char) Math.min(25, k);
             k -= Math.min(25, k);
         }
         return String.valueOf(res);

src/main/java/g1601_1700/s1663_smallest_string_with_a_given_numeric_value/readme.md

@@ -71,7 +71,7 @@ public class Solution {
         int mid = l + (h - l) / 2;
         int k = h - l + 1;
         int radius = mid - l;
-        long res = sum[h + 1] - sum[mid + 1] - (sum[mid] - sum[l]) - (1 + radius) * radius;
+        long res = sum[h + 1] - sum[mid + 1] - (sum[mid] - sum[l]) - (long) (1 + radius) * radius;
         if (k % 2 == 0) {
             res = res - arr[mid] - (radius + 1);
         }

src/main/java/g1701_1800/s1703_minimum_adjacent_swaps_for_k_consecutive_ones/readme.md

@@ -49,7 +49,7 @@ public class Solution {
             int start = range[0];
             int end = range[ranges[0].length - 1];
             temp[start] += 1;
-            temp[end + 1] += -1;
+            temp[end + 1] -= 1;
         }
         for (int i = 1; i < temp.length; i++) {
             temp[i] += temp[i - 1];

src/main/java/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered/readme.md

@@ -97,7 +97,7 @@ public class Solution {
         long com = 1;
         for (long[] p : list) {
             long choose = c(cnt, (int) (p[0]));
-            cnt -= p[0];
+            cnt -= (int) p[0];
             com = com * choose;
             com %= MOD;
             com = com * p[1];

src/main/java/g1901_2000/s1916_count_ways_to_build_rooms_in_an_ant_colony/readme.md

@@ -80,7 +80,7 @@ public class Solution {
             return res;
         }
         long sum = 0;
-        long range = 2 * k + 1L;
+        long range = 2L * k + 1L;
         // take sum of all elements from 0 to k*2 index
         for (int i = 0; i <= 2 * k; ++i) {
             sum += nums[i];

src/main/java/g2001_2100/s2090_k_radius_subarray_averages/readme.md

@@ -88,7 +88,7 @@ public class Solution {
                 int cur = q.removeLast();
                 int left = q.peekLast();
                 int right = i;
-                sum += 1L * (cur - left) * (right - cur) * nums[cur];
+                sum += (long) (cur - left) * (right - cur) * nums[cur];
             }
             q.add(i);
         }
@@ -100,7 +100,7 @@ public class Solution {
                 int cur = q.removeLast();
                 int left = q.peekLast();
                 int right = i;
-                sum -= 1L * (cur - left) * (right - cur) * nums[cur];
+                sum -= (long) (cur - left) * (right - cur) * nums[cur];
             }
             q.add(i);
         }

src/main/java/g2101_2200/s2104_sum_of_subarray_ranges/readme.md

@@ -72,7 +72,7 @@ public class Solution {
             str[i] = temp;
             str[swapIndex] = tempStr;
         }
-        return Integer.valueOf(new String(str));
+        return Integer.parseInt(new String(str));
     }
 }
 ```

src/main/java/g2201_2300/s2231_largest_number_after_digit_swaps_by_parity/readme.md

@@ -90,7 +90,7 @@ public class ATM {
             return new int[] {-1};
         }
         for (int i = 0; i < 5; i++) {
-            counts[i] += -delivery[i];
+            counts[i] -= delivery[i];
         }
         return delivery;
     }

src/main/java/g2201_2300/s2241_design_an_atm_machine/readme.md

@@ -69,7 +69,7 @@ public class Solution {
         long res = 0;
         for (int i = 0; i < len; i++) {
             int idx = s.charAt(i) - 'a';
-            res += (i - lastPos[idx]) * (len - i);
+            res += (long) (i - lastPos[idx]) * (len - i);
             lastPos[idx] = i;
         }
         return res;

src/main/java/g2201_2300/s2262_total_appeal_of_a_string/readme.md

@@ -77,7 +77,7 @@ public class Solution {
                     return s;
                 }
                 price *= 10;
-                price += (s.charAt(i) - '0') * (100 - discount);
+                price += (long) (s.charAt(i) - '0') * (100 - discount);
             }
             String stringPrice = String.valueOf(price);
             if (price < 10) {

src/main/java/g2201_2300/s2288_apply_discount_to_prices/readme.md

@@ -81,8 +81,8 @@ public class Solution {
                 // if current group has more differences than the totalK, we can only move k of them
                 // to the lower level.
                 if (diffs[i] >= kSum) {
-                    diffs[i] -= kSum;
-                    diffs[i - 1] += kSum;
+                    diffs[i] -= (int) kSum;
+                    diffs[i - 1] += (int) kSum;
                     kSum = 0;
                 } else {
                     // else, we can make this whole group one level lower.

src/main/java/g2301_2400/s2333_minimum_sum_of_squared_difference/readme.md

@@ -49,7 +49,7 @@ public class Solution {
         for (int num : nums) {
             int s = 0;
             for (char digit : String.valueOf(num).toCharArray()) {
-                s += Integer.valueOf(digit - '0');
+                s += digit - '0';
             }
             if (!map.containsKey(s)) {
                 map.put(s, num);

src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits/readme.md

@@ -54,14 +54,14 @@ public class Solution {
         Integer endMonth = Integer.valueOf(ends[0]);
         int res = 0;
         if (startMonth.equals(endMonth)) {
-            res += (Integer.valueOf(ends[1]) - Integer.valueOf(starts[1]) + 1);
+            res += (Integer.parseInt(ends[1]) - Integer.parseInt(starts[1]) + 1);
             return res;
         }
         for (int i = startMonth; i <= endMonth; i++) {
             if (i == endMonth) {
-                res += Integer.valueOf(ends[1]);
+                res += Integer.parseInt(ends[1]);
             } else if (i == startMonth) {
-                res += dates[i] - Integer.valueOf(starts[1]) + 1;
+                res += dates[i] - Integer.parseInt(starts[1]) + 1;
             } else {
                 res += dates[i];
             }

src/main/java/g2401_2500/s2409_count_days_spent_together/readme.md

@@ -80,7 +80,7 @@ public class Solution {
             if (req > k) {
                 return false;
             }
-            k -= req;
+            k -= (int) req;
             extraPower[i] += (req);
             if (i + 2 * r + 1 < n) {
                 extraPower[i + 2 * r + 1] -= (req);

src/main/java/g2501_2600/s2528_maximize_the_minimum_powered_city/readme.md

@@ -60,7 +60,7 @@ public class Solution {
     public int stringCount(int n) {
         long mod = (int) 1e9 + 7L;
         return (int)
-                (((+pow(26, n, mod)
+                (((pow(26, n, mod)
                                                 - (n + 75) * pow(25, n - 1L, mod)
                                                 + (2 * n + 72) * pow(24, n - 1L, mod)
                                                 - (n + 23) * pow(23, n - 1L, mod))

src/main/java/g2901_3000/s2930_number_of_strings_which_can_be_rearranged_to_contain_substring/readme.md

@@ -65,7 +65,7 @@ public class Solution {
         dp[1] = counts[1];
         dp[2] = Math.max(counts[2] * 2L, dp[1]);
         for (int i = 3; i <= maxPower; i++) {
-            dp[i] = Math.max(counts[i] * i + dp[i - 3], Math.max(dp[i - 1], dp[i - 2]));
+            dp[i] = Math.max((long) counts[i] * i + dp[i - 3], Math.max(dp[i - 1], dp[i - 2]));
         }
         return dp[maxPower];
     }