Minimized Maximum of Products Distributed to Any Store
You are given an integer n indicating there are n specialty retail stores. There are m product types of varying amounts, given as a 0-indexed integer array quantities, where quantities[i] represents the number of products of the i^th product type.
You need to distribute all products to the retail stores following these rules:
- A store can only be given at most one product type but can be given any amount of it.
- After distribution, each store will have been given some number of products, possibly
0.
Let x represent the maximum number of products given to any store. You want x to be as small as possible, i.e. you want to minimize the maximum number of products that are given to any store.
Return the minimum possible x.
Example 1
Input
n = 6, quantities = [11,6]Output
3Distributing type 0 as 2, 3, 3, 3 and type 1 as 3, 3 makes the maximum products in any store equal to 3.
Example 2
Input
n = 7, quantities = [15,10,10]Output
5Distributing the three product types across stores in groups of 5 makes the maximum products in any store equal to 5.
Constraints
- m == quantities.length
- 1 <= m <= n <= 10^5
- 1 <= quantities[i] <= 10^5
Asked at 5 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.