Available question text
Determine whether an integer array can be made non-decreasing by modifying at most one element. The core challenge is a greedy single-pass: detect inversions (nums[i] > nums[i+1]) and ensure there is at most one and that the offending pair can be fixed by changing either element without causing another violation.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 665. Non-decreasing Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source