Fixed sonar

Author: javadev

src/main/java/g3201_3300/s3271_hash_divided_string/Solution.java

@@ -5,12 +5,15 @@
 public class Solution {
     public String stringHash(String s, int k) {
         var result = new StringBuilder();
-        for (int i = 0, sum = 0; i < s.length(); i++) {
+        int i = 0;
+        int sum = 0;
+        while (i < s.length()) {
             sum += s.charAt(i) - 'a';
             if ((i + 1) % k == 0) {
                 result.append((char) ('a' + sum % 26));
                 sum = 0;
             }
+            i++;
         }
         return result.toString();
     }

src/main/java/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/Solution.java

@@ -6,6 +6,7 @@
 import java.util.Collections;
 import java.util.List;
 
+@SuppressWarnings("java:S1210")
 public class Solution {
     int total;
     int power;

src/main/java/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/Solution.java

@@ -44,6 +44,7 @@ private int helper(int n, int mask, List<List<Integer>> list, int[][] dp) {
             take = Math.max(n + helper(n - 1, mask | (1 << row), list, dp), take);
         }
         int notTake = helper(n - 1, mask, list, dp);
-        return dp[n][mask] = Math.max(take, notTake);
+        dp[n][mask] = Math.max(take, notTake);
+        return dp[n][mask];
     }
 }

src/main/java/g3201_3300/s3277_maximum_xor_score_subarray_queries/Solution.java

@@ -2,6 +2,7 @@
 
 // #Hard #2024_09_02_Time_62_ms_(100.00%)_Space_90.5_MB_(100.00%)
 
+@SuppressWarnings("java:S3012")
 public class Solution {
     public int[] maximumSubarrayXor(int[] nums, int[][] queries) {
         int n = nums.length;