DSA Level 2 Data Structures Hashmap and Heaps Longest Subarray With Equal Number Of 0s 1s And 2s

Longest Subarray With Equal Number Of 0s 1s And 2s

easy

Hashmap and Heaps

Question Solve Solutions

1. You are given an array that contains only 0s, 1s, and 2s.
2. You have to find length of the longest subarray with equal number of 0s, 1s, and 2s.

Input Format

A number N arr1 arr2.. N numbers

Output Format

A number representing length of the longest subarray with equal number of 0s, 1s, and 2s.

Constraints

1 <= N <= 10^5
0 <= arr[i] <= 2

Example

Input

7
0 1 0 2 0 1 0

Output

Count Of Subarrays With Equal Number Of Zeroes And Ones

Count Of Subarrays With Equal Number Of 0s 1s And 2s

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String