Recursive Digit Sum

  • + 0 comments
    def superDigit(n, k):
        # Write your code here
        digit = sum(int(i) for i in n)
        total = digit*k
        return helper(total)
        
    def helper(num):
        if num<10:
            return num
        s = sum(int(i) for i in str(num))
        return helper(s)