Improved tasks 2827, 2835, 2846, 2855

Author: javadev

src/main/kotlin/g2801_2900/s2827_number_of_beautiful_integers_in_the_range/Solution.kt

@@ -4,6 +4,7 @@ package g2801_2900.s2827_number_of_beautiful_integers_in_the_range
 
 import kotlin.math.max
 
+@Suppress("kotlin:S107")
 class Solution {
     private lateinit var dp: Array<Array<Array<Array<IntArray>>>>
     private var maxLength = 0

src/main/kotlin/g2801_2900/s2835_minimum_operations_to_form_subsequence_with_target_sum/Solution.kt

@@ -18,7 +18,7 @@ class Solution {
         if (sum < target) {
             return -1
         }
-        while (!pq.isEmpty()) {
+        while (pq.isNotEmpty()) {
             val `val` = pq.poll()
             sum -= `val`.toLong()
             if (`val` <= target) {

src/main/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/Solution.kt

@@ -6,6 +6,7 @@ package g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree
 import kotlin.math.ln
 import kotlin.math.max
 
+@Suppress("kotlin:S107")
 class Solution {
     private class Node(var v: Int, var w: Int)
 

src/main/kotlin/g2801_2900/s2855_minimum_right_shifts_to_sort_the_array/Solution.kt

@@ -2,6 +2,7 @@ package g2801_2900.s2855_minimum_right_shifts_to_sort_the_array
 
 // #Easy #Array #2023_12_18_Time_169_ms_(75.00%)_Space_36.7_MB_(50.00%)
 
+@Suppress("kotlin:S6510")
 class Solution {
     fun minimumRightShifts(nums: List<Int>): Int {
         var i = 1