Leetcode 258. Add Digits

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 258. Add Digits

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact