Leetcode 1085. Sum of Digits in the Minimum Number

Given an array of integers, find the minimum element and return the sum of its decimal digits. This requires scanning to get the minimum (O(n)) and computing its digit sum (O(log value)).

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 1085. Sum of Digits in the Minimum Number

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact