1965. Sum of Digits in Base K
My accepted Python solution to LeetCode problem 1965, Sum of Digits in Base K, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.6MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.6MB, accepted 2025-12-31.
class Solution:
def sumBase(self, n: int, k: int) -> int:
total = 0
while n > 0:
total += n % k
n //= k
return total