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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Recursion
  4. Recursive Digit Sum
  5. Discussions

Recursive Digit Sum

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • sei40kr
    5 years ago+ 0 comments

    Go solution

    func SuperDigit(digits string, times int) string {
        if len(digits) <= 1 {
            return digits
        }
        return SuperDigit(digitSum(digits, times), 1)
    }
    
    func digitSum(digits string, times int) string {
        sum := 0
        for _, digit := range digits {
            sum += int(digit - '0')
        }
        return strconv.Itoa(sum * times)
    }
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature