Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value/Solution.java

@@ -5,7 +5,7 @@
 import java.util.Arrays;
 
 public class Solution {
-    private final int mod = (int) (1e9 + 7);
+    private static final int MOD = (int) (1e9 + 7);
     private int m = -1;
     private int n = -1;
     private int[][][] dp;
@@ -35,7 +35,7 @@ private int dfs(int[][] grid, int xorVal, int k, int i, int j) {
         }
         int down = dfs(grid, xorVal, k, i + 1, j);
         int right = dfs(grid, xorVal, k, i, j + 1);
-        dp[i][j][xorVal] = (down + right) % mod;
+        dp[i][j][xorVal] = (down + right) % MOD;
         return dp[i][j][xorVal];
     }
 }

src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.java

@@ -4,6 +4,7 @@
 
 import java.util.Arrays;
 
+@SuppressWarnings("unused")
 public class Solution {
     public boolean checkValidCuts(int n, int[][] rectangles) {
         int m = rectangles.length;

src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java

@@ -61,7 +61,9 @@ public int subsequencesWithMiddleMode(int[] a) {
                 if (!midEntry.getKey().equals(tmpEntry.getKey())) {
                     List<Integer> c = tmpEntry.getValue();
                     int size = c.size();
-                    for (int k = 0, j = 0; k < m; k++) {
+                    int k = 0;
+                    int j = 0;
+                    while (k < m) {
                         int i = b.get(k);
                         int r = m - 1 - k;
                         int u = i - k;
@@ -114,6 +116,7 @@ public int subsequencesWithMiddleMode(int[] a) {
                         dif =
                                 (dif + convert(r, 1) * convert(x, 2) % MOD * convert(y, 1) % MOD)
                                         % MOD;
+                        k++;
                     }
                 }
             }