← Questions
Longest non-decreasing subarray after changing one element
0
I was asked this
No reports yet. Sign in to say where you were asked it.
- Warm-up: return the length of the longest run of consecutive elements that is strictly increasing.
- Given an integer array, return the longest contiguous non-decreasing subarray you can get after changing at most one element to any integer you like (or changing none).
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding
