Answer: TURVO Hiring Challenge | Online Assessment Question | On-Campus (2021)
Answer · Posted Jun 2026
Approach Simulate the process: If number is even → divide by 2. If number is odd → subtract 1. Count each operation until number becomes 0. Java Code class Solution { public int numberOfSteps(int num) { int steps = 0; while (num > 0) { if (num % 2 == 0) { num /= 2; } else { num -= 1; } steps++; } return steps; } } Time Complexity O(log n) Space Complexity O(1)
The full answer & interview discussion are available to premium members.
Log in Create a free account