Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 43

Max Consecutive Ones III

MediumSliding Window

nums is a binary array. You may flip at most k zeros to ones. Return the longest streak of ones you can make.

Examples

Example 1

Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2

Output: 6

Constraints

1 ≤ nums.length ≤ 10⁵nums[i] is 0 or 1

Target ComplexityNot required

O(n) Time · O(1) Space

Companies (3)

GoogleAmazonFacebook

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputnums = [1,1,1,0,0,0,1,1,1,1,0], k = 2

Expected6

Output—