Fixed sonar

Author: javadev

src/main/kotlin/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring/Solution.kt

@@ -15,10 +15,10 @@ class Solution {
             f2[ch.code - 'a'.code]++
         }
         while (right < n) {
-            val ch = s.get(right)
+            val ch = s[right]
             f1[ch.code - 'a'.code]++
             if (right - left + 1 == pattern.length + 1) {
-                f1[s.get(left).code - 'a'.code]--
+                f1[s[left].code - 'a'.code]--
                 left += 1
             }
             if (right - left + 1 == pattern.length && check(f1, f2, left, s, pattern)) {

src/main/kotlin/g3301_3400/s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/Solution.kt

@@ -27,11 +27,11 @@ class Solution {
         val map: MutableMap<Char?, Int?> = HashMap<Char?, Int?>()
         var res: Long = 0
         while (end < word.length) {
-            val ch = word.get(end)
+            val ch = word[end]
             // adding vowel or consonants;
             if (vowels.contains(ch)) {
                 if (map.containsKey(ch)) {
-                    map.put(ch, map.get(ch)!! + 1)
+                    map.put(ch, map[ch]!! + 1)
                 } else {
                     map.put(ch, 1)
                 }
@@ -41,9 +41,9 @@ class Solution {
             // checking any valid string ispresent or not
             while (map.size == 5 && consonants >= k) {
                 res += (word.length - end).toLong()
-                val ch1 = word.get(start)
+                val ch1 = word[start]
                 if (vowels.contains(ch1)) {
-                    val temp = map.get(ch1)!! - 1
+                    val temp = map[ch1]!! - 1
                     if (temp == 0) {
                         map.remove(ch1)
                     } else {