e.g.
100011111001
should return 3
.
Leading and training 0
s should be ignored, as they are not surrounded both sides.
Calculate all the possible permutations of a string, both itertively and recursively
lorem Remove a convoluted code full of if statements by using Chain of Responsibility