How should I practice Longest Binary Subarray With at Most K Ones?

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

Is Longest Binary Subarray With at Most K Ones associated with LinkedIn?

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

Longest Binary Subarray With at Most K Ones

LinkedIn● MediumFULLTIMEONSITE INTERVIEW

Problem statement

Given a binary array nums and an integer k, return the maximum length of a contiguous subarray containing at most k ones.

Function

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

Examples

Example 1

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

Either length-five window contains exactly two ones.

Example 2

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

No non-empty subarray is allowed because every element is one.

Constraints

1 <= nums.length <= 200000
nums[i] is 0 or 1.
0 <= k <= nums.length