Google logoGoogle
Coding·45 minMembers

Longest Non-Decreasing Subarray with One Replacement

Members only

Find the maximum length of a contiguous non-decreasing subarray if at most one element may be changed to any value. Some rounds start from the plain longest-increasing-subarray question and add the on...

SWE
array
dp
two-pointer
medium
Frequency
Low
Last asked
2026-10-04
Stage
phone-screen · onsite-coding

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...