Available question text
Find the longest non-decreasing contiguous sequence with one substitution. Given an array (e.g. {1, 7, 7, 2, 3, 7, 6, -20}), find the longest non-decreasing contiguous sequence allowing one substitution where all occurrences of a number can be replaced with any integer.
Related questions
Continue with questions that share topics or the same question type.
- Find Maximum Non-decreasing Array Length
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Longest Non-decreasing Subarray From Two Arrays
Coding
- Binary Tree Longest Consecutive Sequence
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Find Longest Non-Decreasing Contiguous Sequence with One Substitution
Reported Aug 22, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source