How should I practice Make an Array Non-Decreasing With One Modification?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Make an Array Non-Decreasing With One Modification associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Make an Array Non-Decreasing With One Modification

Google● MediumINTERNONSITE INTERVIEW

Problem statement

You are given an integer array nums. You may replace at most one element with any signed 32-bit integer.

The problem statement continues

Pro

Examples

Example 1

nums = [4,2,3]return = true

Replace 4 with 2 to obtain [2,2,3].

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights