How should I practice Max Consecutive Ones III?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Microsoft onsite interview problems in FastPrep.

Is Max Consecutive Ones III associated with Microsoft?

FastPrep tags this as a Microsoft onsite interview coding practice problem when the problem catalog has that company and stage context.

Max Consecutive Ones III

Microsoft● MediumFULLTIMEONSITE INTERVIEW

Learn

Problem statement

Given a binary array nums and an integer k, you may change at most k zeroes into ones.

Return the maximum length of a contiguous subarray containing only ones after the changes.

Function

longestOnes(nums: int[], k: int) → int

Examples

Example 1

nums = [1,1,1,0,0,0,1,1,1,1,0]k = 2return = 6

Changing two zeroes gives a run of six ones.

Example 2

nums = [0,0,1,1,0,0,0,0]k = 0return = 2

Without changes, the longest existing run has length two.

Constraints

1 <= nums.length <= 100000.
Each value is 0 or 1.
0 <= k <= nums.length.

Source note: Author-written prompt excerpt retained for source fidelity.