Write a function to find the maximum sum of a contiguous subarray (Kadane's Algorithm).
HardProblem Statement
Write a function to find the maximum sum of a contiguous subarray (Kadane's Algorithm).
Sample Input
A hardcoded array, e.g., [-2, 1, -3, 4, -1, 2, 1, -5, 4].
Sample Output
Maximum sum of contiguous subarray: 6
Limits
Time: 2s · Memory: 256 MB
Code Editor
00:00
fun maxSubArray(nums: Array<Int>): Int {
// Add your code here to find the maximum subarray sum
}
fun main() {
val nums = arrayOf(-2, 1, -3, 4, -1, 2, 1, -5, 4)
println("Maximum sum of contiguous subarray: ${maxSubArray(nums)}")
}
Input
A hardcoded array, e.g., [-2, 1, -3, 4, -1, 2, 1, -5, 4].
Expected Output
Maximum sum of contiguous subarray: 6