801. Minimum Swaps To Make Sequences Increasing
Hard
2.5K
134

You are given two integer arrays of the same length `nums1` and `nums2`. In one operation, you are allowed to swap `nums1[i]` with `nums2[i]`.

• For example, if `nums1 = [1,2,3,8]`, and `nums2 = [5,6,7,4]`, you can swap the element at `i = 3` to obtain `nums1 = [1,2,3,4]` and `nums2 = [5,6,7,8]`.

Return the minimum number of needed operations to make `nums1` and `nums2` strictly increasing. The test cases are generated so that the given input always makes it possible.

An array `arr` is strictly increasing if and only if `arr < arr < arr < ... < arr[arr.length - 1]`.

Example 1:

```Input: nums1 = [1,3,5,4], nums2 = [1,2,3,7]
Output: 1
Explanation:
Swap nums1 and nums2. Then the sequences are:
nums1 = [1, 3, 5, 7] and nums2 = [1, 2, 3, 4]
which are both strictly increasing.
```

Example 2:

```Input: nums1 = [0,3,5,8,9], nums2 = [2,1,4,6,9]
Output: 1
```

Constraints:

• `2 <= nums1.length <= 105`
• `nums2.length == nums1.length`
• `0 <= nums1[i], nums2[i] <= 2 * 105`
Accepted
64.1K
Submissions
163K
Acceptance Rate
39.3%

Seen this question in a real interview before?
1/4
Yes
No

Discussion (0)

Related Topics