FastPrep
Problem · Array

Get Minimum Boxes

● MediumAmazonNEW GRADOA
See Amazon hiring insights

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. The remaining boxes must satisfy the condition max(boxes) ≤ capacity * min(boxes).

Given the array, boxes, and capacity, find the minimum number of boxes that need to be unloaded.

Function Description

Complete the function getMinimumBoxes in the editor.

getMinimumBoxes has the following parameters:

  1. 1. int[] boxes: an array of integers representing the sizes of the boxes
  2. 2. int capacity: the capacity of the truck

Returns

int: the minimum number of boxes that need to be unloaded

Examples
01 · Example 1
boxes = [1, 4, 3, 2]
capacity = 2
return = 1
Example 1 illustration
This satisfies the required condition. Hence the answer is 1.
Constraints
  • 1 <= n <= 10^5
  • 1 <= boxes[i] <= 5 * 10^5
  • above are just partial constraints. I will add more once find reliable sources
    • More Amazon problems
    drafts saved locally
    public int getMinimumBoxes(int[] boxes, int capacity) {
  // write your code here
}
    boxes[1, 4, 3, 2]
    capacity2
    expected1
    sign in to submit