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

  • arvindwaiker
     + 1 comment
    No recursion java solution.

int sum = 0;
    for(int i = 0; i < n.length(); i++ ) {
        sum += (n.charAt(i) - '0');
        if(sum > 9) {
            sum -= 9;
        }
    }
    sum = sum * k;
    sum = sum % 9;
    if(sum == 0) {
        return 9;
    }
    return sum;