How should I practice Longest Balanced Binary Subarray?

Start by reading the full statement, solve the visible examples, then compare the pattern against related IBM online assessment problems in FastPrep.

Is Longest Balanced Binary Subarray associated with IBM?

FastPrep tags this as a IBM coding interview or online assessment practice problem when the problem catalog has that company context.

Problem

IBMINTERNFULLTIMEOA

You are given an integer array arr containing only 0s and 1s.

Return the length of the longest contiguous subarray that satisfies both conditions:

The subarray contains the same number of 0s and 1s.
For every prefix of the subarray, the number of 1s is greater than or equal to the number of 0s.

Examples

01 · Example 1

arr = [1, 0, 1, 1, 0, 0, 1]
return = 6

The subarray [1,0,1,1,0,0] is balanced and every prefix has at least as many 1s as 0s.

02 · Example 2

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

The longest valid subarray is [1,0]. The full array is balanced, but its first prefix starts with more 0s than 1s.

03 · Example 3

arr = [1,0,1,1,0,0,1]
return = 6

The subarray [1,0,1,1,0,0] is balanced, and every prefix has at least as many 1s as 0s.

04 · Example 4

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

The full array is balanced, but its first prefix has more 0s than 1s. The longest valid subarray is [1,0].

Constraints