Find the longest binary gap in the binary number given.
Rotate a given array to the right.
Find the only unpaired value in the array
Count the minimum number of jumps to get from point X to point Y
Find the longest binary gap in the binary number given.
Rotate a given array to the right.
Find the only unpaired value in the array
Count the minimum number of jumps to get from point X to point Y