Optimize Package Order by Sorting One Window
Amazon● MediumFULLTIMEOAProblem statement
Given an integer array of package priorities and a window size k, choose exactly one contiguous window of length k and sort only that window in ascending order.
The problem statement continues
ProExamples
Example 1
packages = [3,2,1,4]k = 3return = [1,2,3,4]Sorting the first three values produces the smallest possible first element.
FastPrep 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