> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/strings-arrays-and-2-pointers/max-non-negative-subarray.md).

# Max Non Negative SubArray

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 subarray.

**NOTE:**

1. If there is a tie, then compare with segment's length and return segment which has maximum length.
2. If there is still a tie, then return the segment with minimum starting index.

\
\
**Problem Constraints**

1 <= N <= 105\
-109 <= A\[i] <= 109

\
**Input Format**

he first and the only argument of input contains an integer array A, of length N.

**Output Format**<br>

Return an array of integers, that is a subarray of A that satisfies the given conditions.\
\
**Example Input**

Input 1:

```
 A = [1, 2, 5, -7, 2, 3]
```

Input 2:

```
 A = [10, -1, 2, 3, -4, 100]
```

\
**Example Output**<br>

Output 1:

```
 [1, 2, 5]
```

Output 2:

```
 [100]
```

\
**Example Explanation**<br>

Explanation 1:

```
 The two sub-arrays are [1, 2, 5] [2, 3].
 The answer is [1, 2, 5] as its sum is larger than [2, 3].
```

Explanation 2:

```
 The three sub-arrays are [10], [2, 3], [100].
 The answer is [100] as its sum is larger than the other two.
```

```java
public class Solution {
    public int[] maxset(int[] A) {
        int maxLen = 0;
        long maxSum = 0;
        int maxStart = 0;
        int start = 0;
        long currentSum = 0;
        int currentlen = 0;
        for (int i = 0; i < A.length; i++) {
            if (A[i] < 0) {
                if (currentSum > maxSum) {
                    maxSum = currentSum;
                    maxLen = currentlen;
                    maxStart = start;
                } else if (currentSum == maxSum) {
                    if (currentlen > maxLen) {
                        maxLen = currentlen;
                        maxStart = start;
                    }
                }
                start = i + 1;
                currentlen = 0;
                currentSum = 0;
            } else {
                currentSum += (long) A[i];
                currentlen++;
            }
        }
        if (currentSum > maxSum) {
            maxSum = currentSum;
            maxLen = currentlen;
            maxStart = start;
        } else if (currentSum == maxSum) {
            if (currentlen > maxLen) {
                maxLen = currentlen;
                maxStart = start;
            }
        }
        int[] ans = new int[maxLen];
        for (int i = maxStart; i < (maxStart + maxLen); i++) 
            ans[i - maxStart] = A[i];
        return ans;
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://mayanktyagi3111.gitbook.io/interview-prep/strings-arrays-and-2-pointers/max-non-negative-subarray.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.