How should I practice Longest Equal-Zero-One Subarray?

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

Is Longest Equal-Zero-One Subarray associated with Motive?

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

Longest Equal-Zero-One Subarray

Motive● MediumFULLTIMEPHONE SCREENONSITE INTERVIEW

Learn

Problem statement

Given a binary array nums, return the maximum length of a contiguous subarray containing the same number of 0s and 1s.

Function

longestBalancedSubarray(nums: int[]) → int

Examples

Example 1

nums = [0,1]return = 2

The full array contains one zero and one one.

Example 2

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

Either length-two prefix is balanced.

Constraints

0 <= nums.length <= 100000.
Every value is 0 or 1.