FastPrep
Problem · Array

Minimum Days to Deliver Parcels

Learn this problem
● EasyAmazon logoAmazonFULLTIMEOA
See Amazon hiring insights

Problem statement

Amazon Delivery Centers dispatch parcels every day. There are n delivery centers, each having parcels[i] parcels to be delivered. On each day, an equal number of parcels are to be dispatched from each delivery center that has at least one parcel remaining. Find the minimum number of days needed to deliver all the parcels.

Function

minDaysToDeliverParcels(parcels: int[]) → int

Complete the function minDaysToDeliverParcels in the editor below.

minDaysToDeliverParcels has the following parameters: int parcels[n]: the number of parcels at each center

Returns

int: the minimum number of days needed to deliver all the parcels

Constraints

  • 1 ≤ n ≤ 10^6
  • 0 ≤ parcels[i] ≤ 10^9

Examples

Example 1

parcels = [2, 3, 4, 3, 3]return = 3
All parcels can be delivered in a minimum of 3 days.

Example 2

parcels = [3, 3, 3, 3, 3, 3]return = 1
Each delivery center can dispatch its 3 parcels on the first day.

Constraints

  • 1 ≤ n ≤ 10^6
  • 0 ≤ parcels[i] ≤ 10^9

    • More Amazon problems

    drafts saved locally
    public int minDaysToDeliverParcels(int[] parcels) {
  // write your code here
}
    parcels[2, 3, 4, 3, 3]
    expected3
    checking account