Count Number of Digits

Naive: Time Complexity: O(log₁₀(n)) Space Complexity: O(1) def countDigits(n:int) -> int: int res = 0 while (x>0): x = x//10 res += 1 return res Recursive Way: Time Complexity: O(log₁₀(n)) Space Complexity: O(log₁₀(n)) de...