You are given a number N which you have to reduce to 1 in minimum number of moves possible. In one move you can either divide the number by 10 or multiply it by 5. code example
Example: minimum-number-of-steps-to-reduce-number-to-1
#minimum-number-of-steps-to-reduce-number-to-1
def stepCount(n):
count = 0
while n > 1:
if n % 2 == 0: # bitmask: *0
n = n // 2
elif n == 3 or n % 4 == 1: # bitmask: 01
n = n - 1
else: # bitmask: 11
n = n + 1
count += 1
return count