Problem Brief

Minimum Preparation Time for Two Handlers

FULLTIMEOA

See Amazon online assessment and hiring insights

A work queue workList must be processed in order by two handlers. Each value in workList is a work type from 1 through m.

For work type t, the first time a handler processes that type, or whenever the handler's previous job was a different type, that handler pays longPrepTime[t]. If the handler's previous job was the same type, that handler pays shortPrepTime[t] instead.

Each job must be assigned to exactly one of the two handlers, and jobs must be processed in the order they appear. Return the minimum total preparation time.

Function Description

Complete the function minPreparationTime in the editor below.

minPreparationTime has the following parameters:

int[] workList: the ordered work types
int[] longPrepTime: long preparation time for each work type
int[] shortPrepTime: short preparation time for each work type

Returns

int: the minimum total preparation time.

1Example 1

Input

workList = [1, 2, 2], longPrepTime = [4, 5], shortPrepTime = [2, 3]

Output

Explanation

Assign work type 1 to the first handler, then assign both type-2 jobs to the second handler. The total cost is 4 + 5 + 3 = 12.

2Example 2

Input

workList = [1, 1, 1], longPrepTime = [4], shortPrepTime = [2]

Output

Explanation

Use the same handler for all three jobs to pay one long preparation and two short preparations.

Constraints

Limits and guarantees your solution can rely on.

workList[i] identifies a work type between 1 and m
longPrepTime and shortPrepTime contain one entry per work type.
Jobs must be processed in order.