How should I practice Max Consecutive Ones III?

Start by reading the full statement, solve the visible examples, then compare the pattern against related EPAM phone screen problems in FastPrep.

Is Max Consecutive Ones III associated with EPAM?

FastPrep tags this as a EPAM phone screen coding practice problem when the problem catalog has that company and stage context.

EPAM● MediumFULLTIMEPHONE SCREEN

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.

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

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

Changing two zeroes gives a run of six ones.

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

Without changes, the longest existing run has length two.

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