Largest subarray of 0's and 1's
Difficulty: Easy
Acceptance: %
Points: 20.00
Given an array arr of 0s and 1s. Find and return the length of the longest subarray with equal number of 0s and 1s.
Constraints: - 1 <= arr.size() <= 105
- 0 <= arr[i] <= 1
Companies: Amazon Morgan Stanly Paytm
Topics: Data Structures Basics
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.