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.
  1. Recursive Digit Sum
  2. Discussions

Recursive Digit Sum

  • jwinkens120
     + 0 comments

    Java 8 solution. Passed all cases. Make sure you are storing the sum of the digits as a Long.

        public static int superDigit(String n, int k) {
    // Write your code here

        if (n.length() == 1){
            return Integer.parseInt(n);
            
        }
        
        else{
            long sum = 0;
            for (int i = 0; i < n.length(); i++){
                sum += n.charAt(i) - '0';
            }
            sum = sum * k;
            return superDigit(Long.toString(sum), 1);
        }
        
    }