Problem · Array
Aggressive Cows
● Medium
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Given distinct integer stall positions stalls and an integer cows, place exactly cows cows in different stalls.
The problem statement continues
ProExamples
Example 1
stalls = [1,2,4,8,9]cows = 3return = 3Placing cows at 1, 4, and 8 gives a minimum distance of 3, which cannot be improved.
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
- 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