Available question text
Compute the digital root of a nonnegative integer by repeatedly summing its digits until one digit remains; this reduces to a mod-9 property (with a special-case for 0), enabling an O(1) solution without loops or recursion.
Related questions
Continue with questions that share topics or the same question type.
- Form Largest Integer With Digits That Add up to Target
Coding
- Add Binary
Coding · Bit Manipulation · Math · Simulation
- Add Bold Tag in String
Coding
- Add Consecutive-Value Bonuses to Grid Paths
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 258. Add Digits
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source