← Questions
Contiguous array with equal 0s and 1s
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a binary array, return the length of the longest contiguous subarray with as many 0s as 1s. Treat 0 as -1 and look for two equal prefix sums as far apart as possible.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding