Available question text
Find the maximum length of a contiguous subarray in a binary array that contains an equal number of 0s and 1s. This is solved by using a running sum (treat 0 as -1) and a hash map to record first occurrences of each cumulative sum to find longest zero-sum spans in O(n) time for n up to 1e5.
Related questions
Continue with questions that share topics or the same question type.
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
- Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
- Number of Flowers in Full Bloom
Coding · Array · Binary Search · Hash Table
- Subarray Sum Equals K
Coding · Array · Hash Table · Prefix Sum
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 525. Contiguous Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Cisco
Contiguous Array
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 87.8. This is not an interview probability.
View source