Problem
Submissions

Problem: Number of Steps to Reduce a Binary Number to One

Statement

You are given a string, str, as a binary representation of an integer. Your task is to return the number of steps needed to reduce it to 11 by following these rules:

  • If the number is even, divide it by 22.

  • If the number is odd, add 11 to it.

You can always reach 1 for all provided test cases.

Constraints:

  • 1<=1 <= str.length <=500<= 500

  • str consists of characters ′0′'0' or ′1′'1'.

  • str[0]==str[0] == ′1′'1'

Problem
Submissions

Problem: Number of Steps to Reduce a Binary Number to One

Statement

You are given a string, str, as a binary representation of an integer. Your task is to return the number of steps needed to reduce it to 11 by following these rules:

  • If the number is even, divide it by 22.

  • If the number is odd, add 11 to it.

You can always reach 1 for all provided test cases.

Constraints:

  • 1<=1 <= str.length <=500<= 500

  • str consists of characters ′0′'0' or ′1′'1'.

  • str[0]==str[0] == ′1′'1'