The supply chain manager at one of Amazon's warehouses is shipping the last container of the day. All n boxes have been loaded into the truck with their sizes represented in the array boxes. The truck may not have enough capacity to store all the boxes though, so some of the boxes may have to be unloaded. Any boxes may be unloaded, and the order of the boxes does not matter; only the sizes of the remaining boxes are considered. The remaining boxes must satisfy the condition max(boxes) ≤ capacity * min(boxes).
Given the array boxes and the value capacity, find the minimum number of boxes that need to be unloaded so that the remaining boxes satisfy the condition.
Complete the function getMinimumBoxes in the editor.
getMinimumBoxes has the following parameters:
int[] boxes: an array of integers representing the sizes of the boxesint capacity: the capacity multiplier of the truck
Returns
int: the minimum number of boxes that need to be unloaded
boxes = [1, 4, 3, 2] capacity = 2 return = 1
Here boxes = [1, 4, 3, 2] and capacity = 2.
With all boxes loaded, max = 4 and min = 1, so max ≤ capacity * min becomes 4 ≤ 2 * 1 = 2, which is false.
Unload the box of size 1. The remaining boxes are [4, 3, 2] with max = 4 and min = 2, so 4 ≤ 2 * 2 = 4, which is true.
Only one box must be unloaded, so the answer is 1.
1 ≤ n ≤ 10^51 ≤ boxes[i] ≤ 5 * 10^51 ≤ capacity
- Currency Conversion RatePHONE SCREEN · Seen Jul 2026
- Minimum Operations to Make the Integer ZeroSeen Jul 2026
- Create Array Generator ServiceSeen Jul 2026
- Drone Delivery RouteOA · Seen Jul 2026
- Find Maximum Total Amount (SDE I, Fungible :)Seen Jul 2026
- Minimum Grid InconvenienceOA · Seen Jul 2026
- Closest Version DateONSITE INTERVIEW · Seen Jul 2026
- Maximum Concurrent Processes (Bar Raiser Round)ONSITE INTERVIEW · Seen Jul 2026
public int getMinimumBoxes(int[] boxes, int capacity) {
// write your code here
}