FastPrepFastPrep
Problem Brief

Find Minimum Trips 🍌

NEW GRADOA
See Amazon online assessment and hiring insights

There were a large number of orders placed on Amazon Prime Day. The orders are packed and are at the warehouse ready to be delivered. The delivery agent needs to deliver them in as few trips as possible.

In a single trip, the delivery agent can choose packages following either of two rules:

  • Choose two packages with the same weight
  • Choose three packages with the same weight

    • Determine the minimum number of trips required to deliver the packages. If it is not possible to deliver all of them, return -1.

    Function Description

    Complete the function findMinTrips in the editor.

    findMinTrips has the following parameter:

    • int packageweight[n]: the weights of each package

    Returns

    int: the minimum number of trips required or -1 if it is not possible to deliver them all

    𓆝 π“†Ÿ π“†ž 🐰 Credit to Jane 🐰 𓆝 𓆝 π“†Ÿ

    1Example 1

    Input
    packageweight = [1, 8, 5, 8, 5, 1, 1]
    Output
    3
    Explanation
    Example 1 illustration
    It takes 3 trips to deliver all the packages.

    2Example 2

    Input
    packageweight = [3, 4, 4, 3, 1]
    Output
    -1
    Explanation
    Packages with weights 3 and 4 can be removed in groups of two. The package of weight 1 cannot be delivered as it cannot be chosen according to the rules. Since it is not possible to deliver all packages, the answer is -1.

    3Example 3

    Input
    packageweight = [2, 4, 6, 6, 4, 2, 4]
    Output
    3
    Explanation
    Example 3 illustration
    The agent needs a min of 3 trips as shown above. Return 3 as the answer :)

    Constraints

    Limits and guarantees your solution can rely on.

  • 1 ≀ n ≀ 1055
  • 1 ≀ packageweight[i] ≀ 109
    • public int findMinTrips(int[] packageweight) {
  // write your code here
}
    Input

    packageweight

    [1, 8, 5, 8, 5, 1, 1]

    Output

    3

    Sign in to submit your solution.