Longest Subsequence

CodeChefOpen on judge ↗

Given an array, find and return the length of longest subarray containing equal number of 0s and 1s. ### Input Format - Line 1 : Integer N, size of array - Line 2 : Array elements (separated by space) ###Output Format Length of longest subarray ###Constraints 1<= N <=10^6 ###Sample Input 1 6 1 0 0 1 1 1 ###Sample Output 1 4 ###Sample Input 2 10 1 1 1 0 0 0 1 1 0 0 ###Sample Outp

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI