We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Recursive Digit Sum
  2. Discussions

Recursive Digit Sum

  • anw_g01
     + 0 comments

    Python solution:

    def superDigit(n: str, k: int) -> int:
    # sum digits of 'n' first and then multiply by k, 
    # instead of summing up digits of int(string * k):
    p = sum(list(map(int, list(n)))) * k
    while p > 10:     # same as len(str(p)) != 1
        p = sum(list(map(int, list(str(p)))))
        # can also use sum(int(digit) for digit in str(p))
    return p