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.
defsuperDigit(n,k):# Write your code herenum=str(sum([int(i)foriinstr(n)]))*kdefrec(num):iflen(str(num))==1:returnnumreturnrec(str(sum([int(i)foriinnum])))returnrec(num)
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