Fixed sonar

Author: javadev

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

@@ -34,7 +34,7 @@ class Solution {
         while (nums[j] <= nums[i]) {
             j--
         }
-        nums[i] = nums.set(j, nums[i])
+        nums[j] = nums[i]
         nums.subList(i + 1, nums.size).reverse()
         return true
     }

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

@@ -29,7 +29,7 @@ class Solution {
         val pq = PriorityQueue<IntArray>(Comparator { a: IntArray, b: IntArray -> a[0] - b[0] })
         visited[n] = true
         pq.add(intArrayOf(n, n))
-        while (!pq.isEmpty()) {
+        while (pq.isNotEmpty()) {
             val current = pq.poll()
             val cost = current[0]
             val num = current[1]