Maximize Shipment Order by Sorting One Window
Amazon● HardFULLTIMENEW GRADOAProblem statement
shipmentOrder is a permutation of 1..n. Choose exactly one contiguous window of length windowSize, sort that window in ascending order, and return the lexicographically largest complete array obtainable.
The problem statement continues
ProExamples
Example 1
shipmentOrder = [5,1,4,3,2]windowSize = 3return = [5,1,3,4,2]Sorting positions 1 through 3 preserves the longest and then largest prefix.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, 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