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. Prepare
  2. Algorithms
  3. Recursion
  4. Recursive Digit Sum
  5. Discussions

Recursive Digit Sum

  • saurabh_srivast2
     + 0 comments
    def superDigit(N, K):
    # Write your code here
    return int(N) if K== 1 and len(N) == 1 else superDigit(str(K * sum([int(n) for n in N])), 1)

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in