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.
python solution:
def superDigit(n, k):
# Write your code here
if len(n)<2:
return n
else:
Sum=ksum([int(char) for char in n])
return superDigit(str(Sum), 1)*
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Recursive Digit Sum
You are viewing a single comment's thread. Return to all comments →
python solution: def superDigit(n, k): # Write your code here if len(n)<2: return n else: Sum=ksum([int(char) for char in n]) return superDigit(str(Sum), 1)*