Q: 02 of 15Consider the array [-2, 1, -3, 4, -1, 2, 1, -5, 4]. Using the Divide and Conquer approach, which of the following subarray generates the maximum subarray sum?Options :LSSCSSRSSNone of these

Given an integer array arr, write a program to find the subarray which has the largest sum and return its sum.Sample Input:9-2 -1 -3 4 -1 2 1 -5 4Sample Output:6Explanation:The subarray is [4, -1, 2, 1] and the sum is 6

Write an efficient C program to find the sum of contiguous subarray within a one-dimensionalarray of integer which returns the largest sum.Explanation:Lets take the example of array {5,-3, 4}Possible contiguous subarray combinations are{5}, {-3}, {4}, {5,-3}, {-3,4}, {5,-3,4}The contiguous subarray {5,-3,4} has got the largest sum 6

Given an integer array nums, find the subarray with the largest sum, and return its sum.

Given an array 𝐴A of size 𝑁N, find the size of the largest subarray of 𝐴A which has an even sum.For example, for the array [2,1,2][2,1,2] the answer is just 11 as the largest subarray with an even sum is [2][2].Note that a subarray is a contiguous part of an array. For the array [1,3,2][1,3,2], some possible subarrays are [1],[2],[1,3],[1,3,2][1],[2],[1,3],[1,3,2]. However, [1,2][1,2] is not a subarray for this array.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of multiple lines of input.The first line of each test case contains a single integer 𝑁N — the size of the array.The next line contains 𝑁N space-separated integer - 𝐴1,𝐴2,…,𝐴𝑁A 1​ ,A 2​ ,…,A N​ .Output FormatFor each test case, output on a new line, the size of the largest subarray with even sum.Constraints1≤𝑇≤501≤T≤501≤𝑁≤501≤N≤501≤𝐴𝑖≤1041≤A i​ ≤10 4 Sample 1:InputOutput432 1 231 3 262 2 1 1 1 2111340Explanation:Test case 11: The largest subarray with even sum is the subarray [2][2] having size 11.Test case 22: The largest subarray with even sum is the subarray [1,3,2][1,3,2] having size 33.Test case 33: The largest subarray with even sum is the subarray [2,2,1,1][2,2,1,1] having size 44.Test case 44: No subarray has even sum.

Given an array Arr of size N containing positive integers. Find the maximum sum of a any possible subsequence such that no two numbers in the subsequence should be adjacent in Arr.