This content originally appeared on DEV Community and was authored by Abhishek Chaudhary
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.
Constraints:
-
1 <= n <= 100 -
2 <= k <= 10
SOLUTION:
class Solution:
def sumBase(self, n: int, k: int) -> int:
total = 0
while n > 0:
total += n % k
n = n // k
return total
This content originally appeared on DEV Community and was authored by Abhishek Chaudhary
Abhishek Chaudhary | Sciencx (2022-06-16T14:00:45+00:00) Sum of Digits in Base K. Retrieved from https://www.scien.cx/2022/06/16/sum-of-digits-in-base-k/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.