Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3325_count_substrings_with_k_frequency_characters_i/Solution.java

@@ -3,6 +3,7 @@
 // #Medium #2024_10_21_Time_2009_ms_(100.00%)_Space_45.2_MB_(100.00%)
 
 import java.util.HashMap;
+import java.util.Map;
 import java.util.PriorityQueue;
 
 public class Solution {
@@ -13,8 +14,8 @@ public int numberOfSubstrings(String s, int k) {
             char curr = s.charAt(right);
             map.put(curr, map.getOrDefault(curr, 0) + 1);
             PriorityQueue<Integer> queue = new PriorityQueue<>((a, b) -> b - a);
-            for (char ele : map.keySet()) {
-                queue.offer(map.get(ele));
+            for (Map.Entry<Character, Integer> ele : map.entrySet()) {
+                queue.offer(ele.getValue());
             }
             HashMap<Character, Integer> currMap = new HashMap<>(map);
             for (int left = 0; left <= right; left++) {

src/main/java/g3301_3400/s3326_minimum_division_operations_to_make_array_non_decreasing/Solution.java

@@ -7,7 +7,7 @@ public class Solution {
     private static final int[] SIEVE = new int[MAXI];
     private static boolean precompute = false;
 
-    private void compute() {
+    private static void compute() {
         if (precompute) {
             return;
         }