Edge cases to count number of zeros.

[paurush11]

if the given array is -- [0,o,1,I,2,3] (o,I for visible change)
the diff = 1
result =
1 - {0,1,2}, {o,I,3}
2 - {o,1,2}, {0,I,3}
3 - {0,o,1,2}, {I,3}
4 - {1,2} {0,o,I,3}
5- {0,I,2}, {o,1,3}
6- {o,I,2}, {0,1,3}
7 -{o,I,2}, {0,1,3}
8 -{0,o,I,2}, {1,3}
9 -{ I,2} , { 0,o,1,3}
10 -{1,I,2} ,{3,0,o}
11 -{1,I,2,o} ,{3,0}
12 - {1,I,2,0} ,{3,o}
13 - {1,I,2,0,o} ,{3}