How should I practice Minimum Swaps?

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

Is Minimum Swaps associated with JP Morgan Chase?

FastPrep tags this as a JP Morgan Chase online assessment coding practice problem when the problem catalog has that company and stage context.

Minimum Swaps

JP Morgan Chase● MediumINTERNOA

Learn

Problem statement

A shopkeeper in Koxland always each item in a shop a unique popularity rating. To order the items in decreasing popularity from left to right, the shopkeeper can swap any 2 items in one operation. Determine the minimum number of operations needed to reorder the items correctly.

Function

minimumSwaps(popularity: int[]) → int

Complete the function minimumSwaps in the editor.

minimumSwaps has the following parameters:

int popularity[n]: an array of integers that represents the popularity of each item

Returns int: the minimum number of swaps to order the items properly

Examples

Example 1

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

First switch 3 and 4 to get popularity [4, 3, 1, 2] :) Then switch 1 and 2 to get [4, 3, 2, 1] :3 The array now is reorderd in 2 operations :>

Constraints

1 <= n <= 2 * 105
1 <= popularity[i] <= n