- Home
- Assessment

10 / 13

We have two integer sequences `A`

and `B`

of the same non-zero length.

We are allowed to swap elements `A[i]`

and `B[i]`

. Note that both elements are in the same index position in their respective sequences.

At the end of some number of swaps, `A`

and `B`

are both strictly increasing. (`A`

sequence is strictly increasing if and only if `A[0] < A[1] < A[2] < ... < A[A.length - 1]`

.)

Given `A`

and `B`

, return the minimum number of swaps to make both sequences strictly increasing. It is guaranteed that the given input always makes it possible.

Example:

```
Input: A=[5, 2, 14], B=[1, 6, 12])
Output: 1
Explanation: Swap A[0] and B[0]. Then the sequences are:
A = [1, 2, 14] and B = [5, 6, 12]
which are both strictly increasing.
```

Constraints:

`A`

,`B`

are arrays with the same length, and that length will be in the range`[1, 1000]`

.`A[i]`

,`B[i]`

are integer values in the range`[0, 2000].`

- Write your code inside a function named
`minimum_swaps`

- Your function must
**return**the output, it should**not print**the output. - To execute a block on the right-side coding panel, please press 'shift'+ 'enter' inside the block.
- Your code should work for all permitted possible values(check Constraints) of
`A`

and`B`

Complete the below code in the right side coding panel

```
def minimum_swaps(A: list, B: list) -> int:
# your code goes here
```

XP

Taking you to the next exercise in seconds...

Want to create exercises like this yourself? Click here.

Checking Please wait.

Success

Error

No hints are availble for this assesment

Fetching answer, please wait...

Error

**Note - **Having trouble with the assessment engine? Follow the steps listed
here

## Loading comments...