Minimum Reverse Operations - Video Solutions

HardArrayBreadth-First SearchOrdered Set

Minimum Number of Operations to Make Array Continuous - Leetcode 2009 - Python

18:3118,440 views

10 video solutions available

Minimum Reverse Operations - Video Solution

Watch 10 video solutions for Minimum Reverse Operations, a hard level problem involving Array, Breadth-First Search, Ordered Set. This walkthrough by NeetCodeIO has 18,440 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.

Problem Statement

You are given an integer n and an integer p representing an array arr of length n where all elements are set to 0's, except position p which is set to 1. You are also given an integer array banned containing restricted positions. Perform the following operation on arr:

Reverse a subarray with size k if the single 1 is not set to a position in banned.

Return an integer array answer with n results where the i^th result is the minimum number of operations needed to bring the single 1 to position i in arr, or -1 if it is impossible.

Example 1:

Input: n = 4, p = 0, banned = [1,2], k = 4

Output: [0,-1,-1,1]

Explanation:

Initially 1 is placed at position 0 so the number of operations we need for position 0 is 0.
We can never place 1 on the banned positions, so the answer for positions 1 and 2 is -1.
Perform the operation of size 4 to reverse the whole array.
After a single operation 1 is at position 3 so the answer for position 3 is 1.

Example 2:

Input: n = 5, p = 0, banned = [2,4], k = 3

Output: [0,-1,-1,-1,-1]

Explanation:

Initially 1 is placed at position 0 so the number of operations we need for position 0 is 0.
We cannot perform the operation on the subarray positions [0, 2] because position 2 is in banned.
Because 1 cannot be set at position 2, it is impossible to set 1 at other positions in more operations.

Example 3:

Input: n = 4, p = 2, banned = [0,1,3], k = 1

Output: [-1,-1,0,-1]

Explanation:

Perform operations of size 1 and 1 never changes its position.

Constraints:

1 <= n <= 10⁵
0 <= p <= n - 1
0 <= banned.length <= n - 1
0 <= banned[i] <= n - 1
1 <= k <= n
banned[i] != p
all values in banned are unique

Read full problem with examples

Continue Learning

Practice this problem

Solve it on FleetCode

Read Solution & Explanation

Detailed text walkthrough

Minimum Reverse Operations - Video Solutions

Minimum Number of Operations to Make Array Continuous - Leetcode 2009 - Python

Minimum Operations to Reduce X to Zero - Leetcode 1658 - Python

Minimum Number of Operations to Move All Balls to Each Box - Leetcode 1769 - Python

Minimum Operations to Make Binary Array Elements Equal to One I - Leetcode 3191 - Python

Minimum Operations to Make Binary Array Elements Equal to One I | Leetcode 3191

2612. Minimum Reverse Operations | Weekly Contest 339 | LeetCode 2612

Minimum Reverse Operations | Weekly Contest 339

2612. Minimum Reverse Operations (Leetcode Hard)

Minimum Operations to Reduce an Integer to 0 | Leetcode 2571 | Weekly Contest 333

Leetcode 2541: Minimum Operations to Make Array Equal II (Biweekly Contest 96)

Minimum Reverse Operations - Video Solution

Problem Statement

Continue Learning

Minimum Reverse Operations - Video Solutions

Minimum Number of Operations to Make Array Continuous - Leetcode 2009 - Python

Minimum Operations to Reduce X to Zero - Leetcode 1658 - Python

Minimum Number of Operations to Move All Balls to Each Box - Leetcode 1769 - Python

Minimum Operations to Make Binary Array Elements Equal to One I - Leetcode 3191 - Python

Minimum Operations to Make Binary Array Elements Equal to One I | Leetcode 3191

2612. Minimum Reverse Operations | Weekly Contest 339 | LeetCode 2612

Minimum Reverse Operations | Weekly Contest 339

2612. Minimum Reverse Operations (Leetcode Hard)

Minimum Operations to Reduce an Integer to 0 | Leetcode 2571 | Weekly Contest 333

Leetcode 2541: Minimum Operations to Make Array Equal II (Biweekly Contest 96)

Minimum Reverse Operations - Video Solution

Problem Statement

Continue Learning