Max Non Negative SubArray

Problem Statement

Max Non Negative SubArray Problem Description Given an array of integers, A of length N, find out the maximum sum sub-array of non negative numbers from A. The sub-array should be contiguous i.e., a sub-array created by choosing the second and fourth element and skipping the third element is invalid. Maximum sub-array is defined in terms of the sum of the elements in the sub-array. Find and return the required sub-array. Note If there is a tie, then compare with segment's length and return segment which has maximum length. If there is still a tie, then return the segment with minimum starting index. Input Format The first and the only argument of input contains an integer array A, of length N. Output Format Return an array of integers, that is a subarray of A that satisfies the given conditions. Constraints 1 <= N <= 1e5 -INT_MAX < A[i] <= INT_MAX Examples Input 1: A = [1, 2, 5, -7, 2, 3] Output 1: [1, 2, 5] Explanation 1: The two sub-arrays are [1, 2, 5] and [2, 3] . The a