Leetcode 1945. Sum of Digits of String After Convert

Convert the string by replacing each letter with its alphabet index concatenated into a decimal number, then repeatedly replace the number with the sum of its digits k times and return the result. This is essentially a string-to-number conversion followed by repeated digit-sum (digital-root) operations; s.length ≤ 100 and k ≤ 10.

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 1945. Sum of Digits of String After Convert

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact