Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring/Solution.java

@@ -19,17 +19,15 @@ public int minStartingIndex(String s, String pattern) {
                 f1[s.charAt(left) - 'a']--;
                 left += 1;
             }
-            if (right - left + 1 == pattern.length()) {
-                if (check(f1, f2, left, right, s, pattern) == true) {
-                    return left;
-                }
+            if (right - left + 1 == pattern.length() && check(f1, f2, left, s, pattern)) {
+                return left;
             }
             right += 1;
         }
         return -1;
     }
 
-    private boolean check(int[] f1, int[] f2, int left, int right, String s, String pattern) {
+    private boolean check(int[] f1, int[] f2, int left, String s, String pattern) {
         int cnt = 0;
         for (int i = 0; i < 26; i++) {
             if (f1[i] != f2[i]) {

src/main/java/g3301_3400/s3305_count_of_substrings_containing_every_vowel_and_k_consonants_i/Solution.java

@@ -52,9 +52,6 @@ public int countOfSubstrings(String word, int k) {
     }
 
     private boolean isVowel(char ch) {
-        if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
-            return true;
-        }
-        return false;
+        return ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u';
     }
 }