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

  • bagassatria
     + 0 comments

    Javascript Solution Easy Approach: Sum the individual N first then mult by K, instead of concate the N for K times.

    function superDigit(n, k) {
    if(n.toString().length == 1) return n;
    let p = n.toString().split("").reduce((a, b) => parseInt(a) + parseInt(b)) * k;
    return superDigit(p, 1);
}