Fixed sonar

Author: javadev

src/main/kotlin/g3201_3300/s3286_find_a_safe_walk_through_a_grid/Solution.kt

@@ -16,7 +16,7 @@ class Solution {
         val bfs: Queue<IntArray?> = LinkedList<IntArray>()
         bfs.add(intArrayOf(0, 0, health - grid[0][0]))
         visited[0]!![0][health - grid[0][0]] = true
-        while (!bfs.isEmpty()) {
+        while (bfs.isNotEmpty()) {
             var size = bfs.size
             while (size-- > 0) {
                 val currNode = bfs.poll()

src/main/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.kt

@@ -38,7 +38,7 @@ class Solution {
         return longestIncreasingLength(upper) + longestIncreasingLength(lower) + 1
     }
 
-    private fun longestIncreasingLength(array: MutableList<IntArray>): Int {
+    private fun longestIncreasingLength(array: List<IntArray>): Int {
         val list: MutableList<Int?> = ArrayList<Int?>()
         for (pair in array) {
             val m = list.size
@@ -52,7 +52,7 @@ class Solution {
         return list.size
     }
 
-    private fun binarySearch(list: MutableList<Int?>, target: Int): Int {
+    private fun binarySearch(list: List<Int?>, target: Int): Int {
         val n = list.size
         var left = 0
         var right = n - 1