How should I practice Minimal Cost to Increase Package Size?

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

Is Minimal Cost to Increase Package Size associated with Amazon?

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

FastPrep

Problem · Greedy

Minimal Cost to Increase Package Size

● MediumAmazonOA

See Amazon hiring insights

One of the products listed on Amazon Ecommerce is available in n sizes as indicated in the array size. The category manager recognizes that some of the sizes are repetitive and do not provide a good user experience. To make the best use of inventory, the product should be available in distinct sizes. The size of the i-th product, size[i], can be increased by one unit for an amount in the cost array, cost[i].

Given the arrays size and cost for the product, find the minimal total cost in order to make all the sizes distinct.

Function Description

Complete the function minimalCostToIncreasePackageSize in the editor.

minimalCostToIncreasePackageSize has the following parameters:

1. int size[n]: an array of integers representing the sizes
2. int cost[n]: an array of integers representing the cost to increase each size

Returns

int: the minimal total cost to make all the sizes distinct

Examples

01 · Example 1

size = [2, 3, 2, 2]
cost = [2, 4, 5, 1]
return = 7

It costs 7 units to make the prices distinct. We can also adjust size[1] to 5, which costs cost[1] * (5 - size[1]) = 8, and size[3] to 4, which costs cost[3] * (4 - size[3]) = 2. Therefore, the total cost is 8 + 2 = 10. However, 7 is the minimum cost required to make all sizes distinct.

Constraints

🐹