FastPrepPackage Delivery System
Problems/Package Delivery System

Package Delivery System

Amazon logoAmazon● MediumINTERNOA
QuestionFunctionExamplesConstraints

Problem statement

Source note: Update (2026-07-21): Reports of Amazon 2027 Intern questions started appearing today. I have not confirmed whether they are real yet, so I am sharing this question for review until I know more.

Each shipment scenario has a list of truck capacities and a list of package weights.

A truck may deliver any package whose weight does not exceed its current capacity. After a successful delivery, that truck's capacity becomes floor(capacity / 2). Determine whether every package in each scenario can be delivered using the available trucks.

Return an int[] where each entry is 1 if the corresponding scenario is feasible and 0 otherwise.

Function

canDeliverAllPackages(truckCapacities: int[][], packageWeights: int[][]) → int[]

Examples

Example 1

truckCapacities = [[7]]packageWeights = [[4, 3]]return = [1]

The single truck delivers package 4, its capacity drops to 3, and it can still deliver package 3. The scenario is feasible.

Constraints

  • The number of scenarios and the lengths of the nested arrays can be large, so the solution should avoid brute-force backtracking over all assignments.

More Amazon problems

  • Count Adjacent Symbol Pairs for BPEONSITE INTERVIEW · Seen Nov 2026
  • First Non-Repeating CharacterOA · ONSITE INTERVIEW · Seen Nov 2026
  • Lowest Common Ancestor in an N-ary TreePHONE SCREEN · ONSITE INTERVIEW · Seen Nov 2026
See Amazon hiring insights
Saved
class Solution {
    public int[] canDeliverAllPackages(int[][] truckCapacities, int[][] packageWeights) {
      // write your code here
    }

}
Checking account…