Search⌘ K
AI Features

Solution: Add Digits

Solution: Add Digits asks you to repeatedly sum the digits of a nonnegative integer until one digit remains, then return that final value without loops or recursion.

Statement

Given an integer num, repeatedly sum all of its digits until the resulting value is a single digit, then return that value.

Note: Could you solve this without any loop or recursion in O(1)O(1) runtime?

Constraints:

  • 0≤0 \leq num ≤231−1\leq 2^{31} - 1

Solution

The key insight behind this problem lies in a mathematical concept called the digital root. Rather than repeatedly summing digits in a loop, we can leverage the fact that any positive integer’s repeated digit sum is equivalent to 1+(num−1)1 + ...