How should I practice Maximum Consecutive Ones in a Circular Array?

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

Is Maximum Consecutive Ones in a Circular Array associated with LinkedIn?

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

Maximum Consecutive Ones in a Circular Array

LinkedIn● MediumFULLTIMEONSITE INTERVIEW

Learn

Problem statement

Given a circular binary array nums, you may change at most k zeros to ones. Return the maximum number of consecutive ones on the circle after those changes.

A circular segment may wrap from the end to the beginning, but it may contain each array position at most once, so its length never exceeds nums.length.

Function

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

Examples

Example 1

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

Flipping the final zero joins the suffix and prefix for four consecutive ones.

Example 2

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

One zero can be flipped, producing a circular run of two but not three.

Constraints

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