LeetCode Question

#3738 Longest Non-Decreasing Subarray After Replacing at Most One Element

SWE coding Medium
Sign in to bookmark Original →

Question Details

LeetCode #3738: Longest Non-Decreasing Subarray After Replacing at Most One Element. Difficulty: Medium. Topics: Array, Dynamic Programming. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Arrays Dynamic Programming

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview
← All Google questions Google Software Engineer Questions → All Arrays,Dynamic Programming Questions →