Question

Amar's team is assigned a project that deals with chocolates. He is aware that the chocolates will be represented as arrays. He wants to test his team with respect to their strength in arrays. As part of the skill-testing, the task is as follows. You are given an array of integers of size N. Consider all its contiguous subarrays of length k and find the maximum sum. Do this for all k from 1 to the length of the input array. Write a program to evaluate the task done by the kids. Example Input 5 -1213-2 Output 34653 Explanation For inputArray = [-1, 2, 1, 3, -2], the output should be [3, 2, 1, 0, 0]. The contiguous subarray of K = 1, each subarray will have 1 element. The sub-array with maximum​

Answer 1

Answer:

this question is difficult meri smj me maa aaya