The first line of input contains T - number of test cases. It is followed by 2T lines. First line of each test case contains N - size of the array and the second line contains N integers - elements of ...

⊛ The brute force approach is find the all possible subarrays and calculate the sum. (Time complexity: O(N^3) ⊛ We only need to calculate the maximum sum so we can avoid our third loop and when ever ...