Recursive Digit Sum

  • + 0 comments

    Here's the C++ Code, All test cases passing

    int num1(long long int z)
    {
        if(z<=9)
        {
            return z;
        }
        long long int sum=0;
        long long int m=0;
    
        while(z!=0)
        {
            
            m=z%10;
            sum=sum+m;
            z=z/10;
    
    
        }
        return num1(sum);
    
    
    }
    
    // Complete the superDigit function below.
    int superDigit(string n, int k) {
    long long int sum=0;
    long long int m;
       for(int i=0; i<n.size(); i++){
            sum += n[i] - '0';
        }
    
        return num1(sum*k);
    
    }