How should I practice Get Minimum Time?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Publicis Sapient online assessment problems in FastPrep.

Is Get Minimum Time associated with Publicis Sapient?

FastPrep tags this as a Publicis Sapient coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Array

Get Minimum Time

● MediumPublicis SapientOA

The other question in this batch is LC 53. Maximum Subarray :)

Your office is relocating to the top floor of a building with n+1 floors, indexed from 0 to n. Currently, boxes of equipment and supplies are scattered across the lower floors (0 to n-1), and you need to transport all of them to the top floor (n).

Rules:

You start at the top floor (n).

You can take the elevator down to any floor i and then return to the top (n).

It takes (n - i) minutes to travel down to floor i and the same time to return.

At each stop, you can load a maximum of one box from that floor into the elevator.

Loading and unloading a box together take 1 minute.

Input:

An integer n (1 ≤ n ≤ 10^5) — the top floor index.

An array of n integers, where boxes[i] (0 ≤ boxes[i] ≤ 10^9) represents the number of boxes on floor i.

Output:

A single long integer — the minimum time required to move all boxes to the top floor.

Examples

01 · Example 1

n = 3
boxes = [1, 2, 3]
return = 12

Start at floor 3.

Go to floor 2 (1 minute), pick up a box, return to floor 3 (1 minute) → 2 minutes.
Go to floor 1 (2 minutes), pick up a box from 2 and 1, return (2 minutes) → 4 minutes.
Go to floor 0 (3 minutes), pick up all remaining boxes, return (3 minutes) → 6 minutes.
Total time: 2 + 4 + 6 = 12 minutes.

drafts saved locally

public long getMinimumTime(int n, int[] boxes) {
  // write your code here
}

boxes[1, 2, 3]

expected12