Showing:
Handle Score
@Ibrahim Nash 6420
@mb1973 5704
@Quandray 5245
@akhayrutdinov 5111
@saiujwal13083 5046
@sanjay05 3762
@kirtidee18 3673
@mantu_singh 3530
@marius_valentin_dragoi 3523
@sushant_a 3459
Maximum sum of subarray less than or equal to x
Easy Accuracy: 31.3% Submissions: 965 Points: 2

Given an array arr[] of integers of size N and a number X, the task is to find the sum of subarray having maximum sum less than or equal to the given value of X.

Example 1:

Input: N = 5, X = 11
arr[] = {1, 2, 3, 4, 5}
Output:  10
Explanation: Subarray having maximum
sum is {1, 2, 3, 4}.

Example 2:

Input: N = 5, X = 7
arr[] = {2, 4, 6, 8, 10}
Output:  6
Explanation: Subarray having maximum
sum is {2, 4} or {6}.

This is a function problem. You don't need to take any input, as it is already accomplished by the driver code. You just need to complete the function calculateMaxSumLength() that takes array arr, integer N, and integeras parameters and returns maximum sum of any subarray that is less than or equal to x.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).

Constraints:
1 ≤ N ≤ 106