Longest Ones After One Flip

Medium

ArraysSliding WindowTwo Pointers

Problem

Given a binary array nums, return the length of the longest contiguous subarray containing only 1s if you may flip at most one 0 to 1. The input is a list of integers containing only 0 and 1, and the output is a single integer.

Constraints

1 <= len(nums) <= 10^5
nums[i] is either 0 or 1
You may flip at most one 0
An O(n) solution is expected

Problem

Constraints

1 <= len(nums) <= 10^5
nums[i] is either 0 or 1
You may flip at most one 0
An O(n) solution is expected

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Minimum Jumps to Reach EndMedium

Maximum Subarray SumMedium

Find Duplicate in Sorted ArrayEasy

Next question

All questions/Coding

Longest Ones After One Flip

Medium

ArraysSliding WindowTwo Pointers

Problem

Constraints

1 <= len(nums) <= 10^5
nums[i] is either 0 or 1
You may flip at most one 0
An O(n) solution is expected

Problem

Constraints

1 <= len(nums) <= 10^5
nums[i] is either 0 or 1
You may flip at most one 0
An O(n) solution is expected

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Minimum Jumps to Reach EndMedium

Maximum Subarray SumMedium

Find Duplicate in Sorted ArrayEasy

Next question