How should I practice Max Consecutive Ones III?

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

Is Max Consecutive Ones III associated with InMobi?

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

Problem · Array

● Medium

InMobiFULLTIMEPHONE SCREEN

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

Return the maximum number of consecutive ones obtainable after those changes.

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

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

Changing the two zeroes between the first and last groups gives a longest run of six ones.

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

No changes are allowed, so the existing run of three ones is optimal.