Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2064. Minimized Maximum of Products Distributed to Any Store
Given m product types and n stores where each store can hold at most one type (but any amount), minimize the maximum number of items any store receives; this reduces to finding the smallest x such that sum ceil(quantities[i]/x) ≤ n, typically solved by binary-search on x with a greedy feasibility check.
Asked at:
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early January, 2020
Microsoft
Mid-level
Minimize the Maximum Products Distributed to Any Store
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.