Fixed sonar

Author: javadev

src/main/kotlin/g3401_3500/s3498_reverse_degree_of_a_string/Solution.kt

@@ -6,7 +6,7 @@ class Solution {
     fun reverseDegree(s: String): Int {
         var ans = 0
         for (i in 0..<s.length) {
-            ans += (26 - (s.get(i).code - 'a'.code)) * (i + 1)
+            ans += (26 - (s[i].code - 'a'.code)) * (i + 1)
         }
         return ans
     }

src/main/kotlin/g3401_3500/s3499_maximize_active_section_with_trade_i/Solution.kt

@@ -11,7 +11,7 @@ class Solution {
         var curZeroCount = 0
         var lastZeroCount = 0
         for (i in 0..<s.length) {
-            if (s.get(i) == '0') {
+            if (s[i] == '0') {
                 curZeroCount++
             } else {
                 if (curZeroCount != 0) {

src/main/kotlin/g3501_3600/s3505_minimum_operations_to_make_elements_within_k_subarrays_equal/Solution.kt

@@ -44,7 +44,7 @@ class Solution {
 
         fun remove(num: Int) {
             delayedRemovals.put(num, delayedRemovals.getOrDefault(num, 0) + 1)
-            if (!leftHeap.isEmpty() && num <= leftHeap.peek()!!) {
+            if (leftHeap.isNotEmpty() && num <= leftHeap.peek()!!) {
                 sumLeft -= num
                 sizeLeft--
             } else {
@@ -75,7 +75,7 @@ class Solution {
         }
 
         fun pruneHeap(heap: PriorityQueue<Int>) {
-            while (!heap.isEmpty() && delayedRemovals.containsKey(heap.peek())) {
+            while (heap.isNotEmpty() && delayedRemovals.containsKey(heap.peek())) {
                 val num: Int = heap.peek()!!
                 if (delayedRemovals[num]!! > 0) {
                     heap.poll()