Recursive Digit Sum

  • + 0 comments

    Python

    def superDigit(n, k):
        # Write your code here
        num = str(sum([int(i) for i in str(n)])) * k
        
        def rec(num):
            if len(str(num)) == 1:
                return num
            
            return rec(str(sum([int(i) for i in num])))
            
        return rec(num)