How should I practice Max Consecutive Ones III?

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

Is Max Consecutive Ones III associated with Nykaa?

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

Nykaa● MediumFULLTIMEPHONE SCREEN

Given a binary array nums and an integer k, return the maximum number of consecutive ones obtainable by flipping at most k zeros to ones.

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

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

Flipping two zeros creates a six-element run.

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

Without flips, the central run has length three.

nums = [0,0,0]k = 3return = 3

All three zeros can be flipped.

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