Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3316_find_maximum_removals_from_source_string/Solution.java

@@ -11,7 +11,10 @@ public int maxRemovals(String source, String pattern, int[] targetIndices) {
         int pn = pattern.length();
         int tn = targetIndices.length;
         int[] maxPat = new int[tn + 1];
-        for (int i = 0, di = 0, nextTI = targetIndices[0]; i < sn; i++) {
+        int i = 0;
+        int di = 0;
+        int nextTI = targetIndices[0];
+        while (i < sn) {
             char c = sChars[i];
             if (i == nextTI) {
                 int p = maxPat[di + 1] = maxPat[di];
@@ -32,6 +35,7 @@ public int maxRemovals(String source, String pattern, int[] targetIndices) {
                     }
                 }
             }
+            i++;
         }
         while (maxPat[tn] < pn) {
             tn--;

src/main/java/g3301_3400/s3317_find_the_number_of_possible_ways_for_an_event/Solution.java

@@ -4,7 +4,7 @@
 // #2024_10_15_Time_20_ms_(97.08%)_Space_41.6_MB_(97.66%)
 
 public class Solution {
-    static final int MOD = 1_000_000_007;
+    private static final int MOD = 1_000_000_007;
 
     public int numberOfWays(int n, int x, int y) {
         long[] fact = new long[x + 1];
@@ -13,7 +13,7 @@ public int numberOfWays(int n, int x, int y) {
             fact[i] = fact[i - 1] * i % MOD;
         }
         long[] invFact = new long[x + 1];
-        invFact[x] = powMod(fact[x], MOD - 2);
+        invFact[x] = powMod(fact[x], MOD - 2L);
         for (int i = x - 1; i >= 0; i--) {
             invFact[i] = invFact[i + 1] * (i + 1) % MOD;
         }

src/main/java/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/Solution.java

@@ -7,6 +7,7 @@
 import java.util.Map;
 import java.util.TreeSet;
 
+@SuppressWarnings("java:S1210")
 public class Solution {
     private static class RC implements Comparable<RC> {
         int val;