Fixed sonar

Author: javadev

src/main/kotlin/g3601_3700/s3663_find_the_least_frequent_digit/Solution.kt

@@ -10,7 +10,7 @@ class Solution {
         val k = s.length
         val freq: MutableMap<Int, Int> = HashMap<Int, Int>()
         for (i in 0..<k) {
-            val digit = s.get(i).code - '0'.code
+            val digit = s[i].code - '0'.code
             freq.put(digit, freq.getOrDefault(digit, 0) + 1)
         }
         var minfreq = Int.Companion.MAX_VALUE

src/main/kotlin/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.kt

@@ -23,7 +23,7 @@ class Solution {
         bounds[zeros and 1][0] = bounds[zeros and 1][1]
         bounds[1 - (zeros and 1)][0] = Int.Companion.MAX_VALUE
         bounds[1 - (zeros and 1)][1] = Int.Companion.MIN_VALUE
-        while (!q.isEmpty()) {
+        while (q.isNotEmpty()) {
             // find min number of zeros and max number of zeros in this round
             var minv = Int.Companion.MAX_VALUE
             var maxv = Int.Companion.MIN_VALUE