How should I practice Minimized Total Idle Time?

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

Is Minimized Total Idle Time associated with Flipkart?

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

FastPrep

Problem

Minimized Total Idle Time

FULLTIMEOA

You are given an array processingTimes, where each element is the processing time of one task.

You may process the tasks in any order. After each processed task, define the current idle time as:

maximum processing time seen so far - minimum processing time seen so far

The total idle time is the sum of the current idle time after every task is processed.

Return the minimum possible total idle time over all processing orders.

Examples

01 · Example 1

processingTimes = [1,2,2,2,3,3]
return = 4

One optimal order is [2,2,2,3,3,1]. The idle times after each task are 0,0,0,1,1,2, whose sum is 4.

02 · Example 2

processingTimes = [4,1,7]
return = 9

Any optimal order has range contributions 3 and 6 after the first task, for total 9.

Constraints

processingTimes.length >= 1

drafts saved locally

public long minimizedTotalIdleTime(int[] processingTimes) {
  // write your code here
}

processingTimes[1,2,2,2,3,3]

expected4