Published November 5, 2026
| Version v1
Lesson
Open
Sum of Digits in Base K (LeetCode 1837): Base Conversion Without Strings
Authors/Creators
Description
Study note on LeetCode 1837: repeated division by k produces the base-k digits, so you can sum them on the fly in O(log n) time without building a string. Includes code and interview talking points. Written by the team behind the Linkjob AI interview assistant (disclosure: I work on Linkjob AI).