Sum Of Digits In Base K - Leetcode Solution

The problem statement of Sum Of Digits In Base K problem on LeetCode is as follows:

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.

To solve this problem, we can use the basic algorithm of converting a number from base 10 to base k. In this algorithm, we repeatedly divide the number by k and store the remainder. The remainder is the next digit in the base k representation of the number. We continue this process until the number becomes 0.

After the number is converted to base k, the sum of its digits is the sum of all the remainders that we stored during the conversion process.

Here is an algorithm to solve this problem:

1. Initialize sum to 0.
2. While n is greater than 0, do the following: a. Calculate the remainder of n divided by k and store it in a variable called digit. b. Add digit to sum. c. Divide n by k and store the quotient in n.
3. Return sum.

Let's implement this algorithm in Python:

def sumBase(n: int, k: int) -> int:
    sum = 0
    while n > 0:
        digit = n % k
        sum += digit
        n //= k
    return sum

In this code, we define a function called sumBase that takes two integer arguments, n and k, and returns an integer.

We initialize sum to 0 and use a while loop to repeatedly divide n by k and add the remainder to sum. We use the floor division (//) operator to get the integer quotient of the division.

Finally, we return the sum of the digits in base k representation of n.

Let's test this function with the given example:

assert sumBase(34, 6) == 7

This assertion should pass, as the sum of the digits in base 6 representation of 34 is 7 (34 = 1 * 6^2 + 3 * 6^1 + 2 * 6^0).

Therefore, the solution to the Sum Of Digits In Base K problem on LeetCode is to implement the above algorithm in the programming language of your choice.

1