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. Prepare
  2. Algorithms
  3. Recursion
  4. Recursive Digit Sum
  5. Discussions

Recursive Digit Sum

  • stealth_coder
     + 1 comment

    There is no recursion here, checkout my 3 line solution:

    public static int superDigit(String n, int k) {
        BigInteger num=new BigInteger(n);
        int rem=  num.remainder(new BigInteger("9")).multiply(new BigInteger(k+"")).intValue();
   
    return rem%9==0?9: rem%9;
    }