You are given two $0$-indexed integer arrays nums1 and nums2, each of length n.

You can create an array nums3 of length n by choosing nums3[i] to be either nums1[i] or nums2[i] for each index i where $0 \leq$ i $< n$.

Return the maximum length of a contiguous non-decreasing subarray in nums3.

Constraints:

• $1 \leq$ nums1.length $= nums2.length` $= n \leq 10^5$

• $1 \leq$ nums1[i], nums2[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.