fun maxLengthSubarrayEqualsToK(arr: IntArray, K: Int): Int {
val map = mutableMapOf<Int, Int>() // To store cumulative sum and its index
var maxLength = 0
var cumulativeSum = 0
for (i in arr.indices) {
cumulativeSum += arr[i]
// If the cumulative sum equals K, update maxLength
if (cumulativeSum == K) {
maxLength = i + 1
}
// If (cumulativeSum - K) exists in the map, update maxLength
if (map.containsKey(cumulativeSum - K)) {
val prevIndex = map[cumulativeSum - K]!!
maxLength = maxOf(maxLength, i - prevIndex)
}
// Store the cumulative sum in the map if not already present
if (!map.containsKey(cumulativeSum)) {
map[cumulativeSum] = i
}
}
return maxLength
}
fun main() {
val arr = intArrayOf(1, -1, 5, -2, -3, 2, 3, 3)
val K = 3
// 1, -1, 5, -2 = 3 (length 4)
// 5, -2 = 3 (length 2)
// -2, -3, 2, 3, 3 = 3 (length 5)
println(maxLengthSubarrayEqualsToK(arr, K))
}
/*
run:
5
*/
