Improved tasks 3349-3357

Author: javadev

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

@@ -8,7 +8,7 @@ class Solution {
         if (l < k * 2) {
             return false
         }
-        for (i in 0.rangeUntil(l - 2 * k + 1)) {
+        for (i in 0..<l - 2 * k + 1) {
             if (check(i, k, nums) && check(i + k, k, nums)) {
                 return true
             }
@@ -17,7 +17,7 @@ class Solution {
     }
 
     private fun check(p: Int, k: Int, nums: List<Int>): Boolean {
-        for (i in p.rangeUntil(p + k - 1)) {
+        for (i in p..<p + k - 1) {
             if (nums[i] >= nums[i + 1]) {
                 return false
             }

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

@@ -9,7 +9,7 @@ class Solution {
     fun maxIncreasingSubarrays(nums: List<Int>): Int {
         val n = nums.size
         val a = IntArray(n)
-        for (i in 0.rangeUntil(n)) {
+        for (i in 0..<n) {
             a[i] = nums[i]
         }
         var ans = 1

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

@@ -7,12 +7,12 @@ class Solution {
     fun countKReducibleNumbers(s: String, k: Int): Int {
         val n = s.length
         val reducible = IntArray(n + 1)
-        for (i in 2.rangeUntil(reducible.size)) {
+        for (i in 2..<reducible.size) {
             reducible[i] = 1 + reducible[Integer.bitCount(i)]
         }
         val dp = LongArray(n + 1)
         var curr = 0
-        for (i in 0.rangeUntil(n)) {
+        for (i in 0..<n) {
             for (j in i - 1 downTo 0) {
                 dp[j + 1] += dp[j]
                 dp[j + 1] %= MOD.toLong()

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

@@ -11,7 +11,7 @@ class Solution {
         var result = 0
         leftSum[0] = 0
         rightSum[nums.size - 1] = 0
-        for (i in 1.rangeUntil(nums.size)) {
+        for (i in 1..<nums.size) {
             leftSum[i] = leftSum[i - 1] + nums[i - 1]
         }
         for (j in nums.size - 2 downTo 0) {

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

@@ -21,7 +21,7 @@ class Solution {
                 diff[high + 1] += 1
             }
         }
-        for (i in 0.rangeUntil(n)) {
+        for (i in 0..<n) {
             if (i > 0) {
                 diff[i] += diff[i - 1]
             }

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

@@ -12,7 +12,7 @@ class Solution {
         var maxAdj = 0
         var mina = Int.Companion.MAX_VALUE
         var maxb = Int.Companion.MIN_VALUE
-        for (i in 0.rangeUntil(n - 1)) {
+        for (i in 0..<n - 1) {
             val a = nums[i]
             val b = nums[i + 1]
             if (a > 0 && b > 0) {
@@ -23,7 +23,7 @@ class Solution {
             }
         }
         var res = 0
-        for (i in 0.rangeUntil(n)) {
+        for (i in 0..<n) {
             if ((i > 0 && nums[i - 1] == -1) || nums[i] > 0) {
                 continue
             }