2026-02-26 20:44:53 +0300 MSK

Number of Steps to Reduce a Number in Binary Representation to One
Tags:

Code

class Solution:
    def numSteps(self, s: str) -> int:
        N = len(s)

        operations = 0
        carry = 0
        for i in range(N - 1, 0, -1):
            digit = int(s[i]) + carry
            if digit % 2 == 1:
                operations += 2
                carry = 1
            else:
                operations += 1

        return operations + carry