Given an array of 1's and 0's , return the index to maximize the number of zeros on the left and number of ones on the right.
eg: 10010 => 3 because 100, 10
101010 => 4 or 2.
111111 => 0
000000 => 6 (the last index).
I could not solve it and obviously did not get through to the next round.