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.