Skip to content

Practice Minimum Operations to Make Binary Array Elements Equal to One I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3191
LeetCode Problem

Minimum Operations to Make Binary Array Elements Equal to One I

Problem Statement

Given a binary array nums, one operation flips all bits in any three consecutive positions, turning 0 into 1 and 1 into 0. Return the minimum operations needed to make every bit 1, or -1 if this is impossible.

Source: Minimum Operations to Make Binary Array Elements Equal to One I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [0,1,1,1,0,0]
Output
3

# Example 2

Input
nums = [0,1,1,1]
Output
-1

Constraints

3 <= nums.length <= 10^5
0 <= nums[i] <= 1

Related LeetCode Problems

Practice more problems similar to Minimum Operations to Make Binary Array Elements Equal to One I.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.