Problem Brief

Longest Non Decreasing Subarray Part 2

NEW GRADPHONE SCREEN

See Google online assessment and hiring insights

Note 📝 - This is a follow up question of Find Maximum Length of Non-Decreasing Subarray Part 1 🦭

You can choose any one index and change its value to any number that you like. What will be the longest non decreasing subarray now:

In the same example as before, the answer would now be:

ans = 6, [2 4 6 8 0 9], by changing 0 -> 8 so the subarray becomes non-decreasing.

1Example 1

Input

nums = [2, 4, 6, 8, 0, 9]

Output

Explanation

By changing the value at index 4 from 0 to 8, the array becomes [2, 4, 6, 8, 8, 9], which is non-decreasing. The length of this subarray is 6, which is the longest possible non-decreasing subarray after making one change.

Constraints

Limits and guarantees your solution can rely on.

🍌🍌

Draft autosaves locally

public int longestNonDecreasingSubarray(int[] nums) {
  // write your code here
}

Input

nums

[2, 4, 6, 8, 0, 9]

Output