In a number, add digits until it becomes a single digit

Write a program to add the digits of the given number until the number becomes a single digit number.

Example:

Input: 256, Output: 4
256 -> 13 -> 4

Input: 15, Output: 6
15 -> 6

Input: 82, Output: 1
82 -> 10 -> 1

Input: 242239, Output: 4
242239 -> 22 -> 4

Approach:

In this article we are using recursion which can be easily modified to an iterative solution. I start with the given input number and find the sum of all its digits and make a recursive call with the input equal to the sum. Base cases are:

• When the input number is less than 10 then return the number.

Run This Code

Complete Code:

Output:

Input: 256, Output: 4
Input: 15, Output: 6
Input: 82, Output: 1
Input: 242239, Output: 4

Also Read:

- Towers Of Hanoi Beginner
- Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard
- Convert Prefix to Postfix Expression Medium
- Check if Number is divisible by its digits Beginner
- Dynamic Programming - Stairs Climbing Puzzle Beginner
- Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard
- Print All Possible Subsets with Sum equal to a given Number Hard
- Check if array is sorted using recursion Beginner