Problem · Array
Secure Maximum Deliveries
Problem statement
You are given an integer array deliveryLogs of size n, where each value represents the number of deliveries in one log, and an even integer k representing the number of warehouses.
Store deliveries according to these rules:
The problem statement continues
ProExamples
Example 1
deliveryLogs = [3, 5, 9, 6]k = 4return = 9FastPrep 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
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week