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

  • nishant_sukrutha
     + 0 comments

    Here is my solution to this problem in Java

    public static int superDigit(String n, int k) {
        if(n.length() == 1){
            return Integer.parseInt(n);
        }
        
        long sum = n.chars().mapToLong(x -> Integer.parseInt(Character.toString(x))).sum() * k;
        
        return superDigit(Long.toString(sum), 1);
    }