HackerRank C++ Solution – Recursive Digit Sum
I JustWriteTheCode of the solution to the " Recursive Digit Sum " problem present on HackerRank (1 Week Preparation Kit - Day 4).
Programming Language: C++.
Problem:
Given an integer, we need to find the super digit of the integer.
We define super digit of an integer x using the following rules:
If x has only 1 digit, then its super digit is x.
Otherwise, the super digit of x is equal to the super digit of the sum of the digits of x.
For example, the super digit of 9875 will be calculated as:
9 + 8 + 7 + 5 = 29
2 + 9 = 11
1 + 1 = 2