sum-of-digits-in-base-k_1837.py

# Given an integer n (in base 10) and a base k, return the sum of the digits of n after converting n from base 10 to base k.

# After converting, each digit should be interpreted as a base 10 number, and the sum should be returned in base 10.


# Example 1:

# Input: n = 34, k = 6
# Output: 9
# Explanation: 34 (base 10) expressed in base 6 is 54. 5 + 4 = 9.
# Example 2:

# Input: n = 10, k = 10
# # Output: 1
# Explanation: n is already in base 10. 1 + 0 = 1.
# ---------------------------------------Runtime 43 ms Beats 68.83% Memory 16.3 MB Beats 57.11%---------------------------------------

# My solution
# Time complexity O(log n)


class Solution:
    def sumBase(self, n: int, k: int) -> int:
        ans: int = 0
        while n > 0:
            l, r = divmod(n, k)
            ans += r
            n = l
        return ans