Given an integer, store its binary representation bin as a string or an array with digits indexed from 0 to
length(bin) - 1. Reduce its binary representation to
zero by using the following operations:
1. Change the ith binary digit only if (i+1)th binary
digit is 1 and all other binary digits from (i+2) to
the end are zeros.
2. Change the rightmost digit without restriction.
What is the minimum number of operations
required to complete this task?
Example
n = 4
The binary representation of 4 is 100 so for the
example, bin = [1, 0, 0].
100 101 111 110 → 010 011 001
-> 000