add 2653

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -4,7 +4,7 @@ package com.github.contest
 import com.github.contest.math.numberOfPowerfulInt
 import com.github.contest.slidingWindow.customStructure.rabinKarpMultiPattern
 import com.github.contest.slidingWindow.customStructure.slidingWindowClassic
-import com.github.contest.strings.camelMatch
+import com.github.contest.slidingWindow.getSubArrayBeautyAlternativeSolution
 import com.github.contest.strings.fullJustify
 import com.github.contest.strings.subStrHash
 import java.util.TreeMap
@@ -16,7 +16,11 @@ import java.util.TreeMap
 
 fun main() {
 
-    launchPerformance()
+    getSubArrayBeautyAlternativeSolution(
+        intArrayOf(1, -1, -3, -2, 3),
+        3,
+        2
+    ).also { it.printArray() }
 }
 
 

contest/src/main/java/com/github/contest/slidingWindow/SlidingWindowAlternativeSolution.kt

@@ -77,4 +77,36 @@ fun longestAlternatingSubArrayAlternativeSolution(nums: IntArray, threshold: Int
 private fun isEven(number: Int) = when {
     number % 2 == 0 -> true
     else -> false
-}
+}
+
+/**
+ * 2653. Sliding Subarray Beauty
+ * Alternative Solution (TLE) must be classic sliding window
+ */
+
+fun getSubArrayBeautyAlternativeSolution(nums: IntArray, k: Int, x: Int): IntArray {
+    var numbers = IntArray(101)
+    val res = mutableListOf<Int>()
+
+    nums.toList().windowed(k) {
+        it.forEach { elem ->
+            val value = elem + 50
+            numbers[value]++
+        }
+        var cnt = 0
+
+        for (i in numbers.indices) {
+            if (numbers[i] > 0) cnt += numbers[i]
+            if (cnt >= x) {
+                if (i >= 50) res.add(0) else res.add(-(50 - i))
+                break
+            }
+        }
+
+        numbers = IntArray(101)
+    }
+
+    return res.toIntArray()
+}
+
+

contest/src/main/java/com/github/contest/slidingWindow/SlidingWindowLeetcode.kt

@@ -444,7 +444,7 @@ fun getSubArrayBeauty(nums: IntArray, k: Int, x: Int): IntArray {
     val map = mutableMapOf<Int, Int>()
     val res = IntArray(nums.size - k + 1)
     var left = 0
-    var window = TreeSet<Int>()
+    val window = TreeSet<Int>()
 
     for (right in nums.indices) {
         map[nums[right]] = map.getOrDefault(nums[right], 0) + 1