Practice Real Company Assessment Patterns • Latest 2025–2026 Mock Tests

Programming Exercises

Implement a function to calculate the maximum sum of a contiguous subarray (Kadane's Algorithm)

Hard

Problem Statement

Implement a function to calculate the maximum sum of a contiguous subarray (Kadane's Algorithm)

Sample Input

[-2,1,-3,4,-1,2,1,-5,4]

Sample Output

6

Limits

Time: 2s · Memory: 256 MB

Code Editor
00:00
import java.util.*; public class Main { public static int maxSubArray() { int[] nums = {-2,1,-3,4,-1,2,1,-5,4}; // Your code here return 0; } }
Log in or sign up to run or submit your code.Log inSign up
Input
[-2,1,-3,4,-1,2,1,-5,4]
Expected Output
6