Example 2:

Input: num = 8
Output: 4
Explanation: 
Step 1) 8 is even; divide by 2 and obtain 4. 
Step 2) 4 is even; divide by 2 and obtain 2. 
Step 3) 2 is even; divide by 2 and obtain 1. 
Step 4) 1 is odd; subtract 1 and obtain 0.

Example 3:

Input: num = 123
Output: 12

Constraints:

0 <= num <= 10⁶

23:T445,# Intuition\n\nIf converted to binary, every "1" will have to be removed as an odd number and every position (except the last) will need to be shifted right as an even number. Given this, we could just convert to binary, count the number of "1"\'s, add the total length and subtract 1.\n# Approach\n\nconvert the number to a binary string\ncount the number of "1"\'s\nreturn the sum of the number of "1"\' and the length - 1\n# Complexity\n- Time complexity:\n- O(n)\n\n\n- Space complexity:\n\nO(n)\n\n# Code\n```\nclass Solution {\n public int numberOfSteps(int n){\n int count = 0;\n String string = Integer.toBinaryString(n);\n for(int i = 0; i < string.length(); i++){\n count = (string.charAt(i) == \'1\') ? count + 1: count;\n }\n \n \n return count + string.length() - 1;\n }\n \n}\n```24:T264f,

Number of Steps to Reduce a Number to Zero

Problem Description

Problem Description

Answer Panel