You are given an array ' containing 0s and 1s. Find the maximum sub sequence which has equal number of 1s and 0s.
The solution is straight forward (using a long so testing would be easy).
- We determine the maximum possible length and use this to shorten the loops.
The test was done by just walking values and spot checking.
The example for 17, yielding just 2 appears to confirm correctness.