You are given a string s consisting of lowercase English letters, and an integer k.

First, convert s into an integer by replacing each letter with its position in the alphabet (i.e., replace 'a' with 1, 'b' with 2, ..., 'z' with 26). Then, transform the integer by replacing it with the sum of its digits. Repeat the transform operation k times in total.

For example, if s = "zbax" and k = 2, then the resulting integer would be 8 by the following operations:


	Convert: "zbax" ➝ "(26)(2)(1)(24)" ➝ "262124" ➝ 262124
	Transform #1: 262124 ➝ 2 + 6 + 2 + 1 + 2 + 4&nbsp;➝ 17
	Transform #2: 17 ➝ 1 + 7 ➝ 8


Return the resulting integer after performing the operations described above.

&nbsp;
Example 1:

Input: s = "iiii", k = 1
Output: 36
Explanation: The operations are as follows:
- Convert: "iiii" ➝ "(9)(9)(9)(9)" ➝ "9999" ➝ 9999
- Transform #1: 9999 ➝ 9 + 9 + 9 + 9 ➝ 36
Thus the resulting integer is 36.


Example 2:

Input: s = "leetcode", k = 2
Output: 6
Explanation: The operations are as follows:
- Convert: "leetcode" ➝ "(12)(5)(5)(20)(3)(15)(4)(5)" ➝ "12552031545" ➝ 12552031545
- Transform #1: 12552031545 ➝ 1 + 2 + 5 + 5 + 2 + 0 + 3 + 1 + 5 + 4 + 5 ➝ 33
- Transform #2: 33 ➝ 3 + 3 ➝ 6
Thus the resulting integer is 6.


Example 3:

Input: s = "zbax", k = 2
Output: 8


&nbsp;
Constraints:


	1 &lt;= s.length &lt;= 100
	1 &lt;= k &lt;= 10
	s consists of lowercase English letters.


class Solution:
    def getLucky(self, s: str, k: int) -> int:
        nums = [str(ord(c) - ord('a') + 1) for c in s]
        for _ in range(k):
            nums = str(sum(int(digit) for num in nums for digit in num))
        return nums
class Solution {
    public int getLucky(String s, int k) {
    
        StringBuilder sb=new StringBuilder();

        for(int i=0;i<s.length();i++)
        sb.append((s.charAt(i)-'a')+1);
        String result=sb.toString();
 
        if(result.length()==1)
        return Character.getNumericValue(result.charAt(0));
        
        int sum=0;
        while(k-->0 && result.length()>1)
        {   
            sum=0;
            for(int i=0;i<result.length();i++)
            sum+=Character.getNumericValue(result.charAt(i));
            
            result=String.valueOf(sum);
        }
        
        return sum;   
    }
}
class Solution {
public:
    int getLucky(string s, int k) {
        
        long long sum=0,d;
        string convert;
        
        for(auto& ch: s)
        {
            convert+= to_string((ch-96));
        }

        while(k--)
        {
            sum=0;
            for(auto& ch: convert)
            {
               sum+= (ch-48);
            }
            convert=to_string(sum);
        }
       
        return sum;
    }
};
/**
 * @param {string} s
 * @param {number} k
 * @return {number}
 */
var getLucky = function(s, k) {
    function alphabetPosition(text) {
      var result = [];
      for (var i = 0; i < text.length; i++) {
        var code = text.toUpperCase().charCodeAt(i)
        if (code > 64 && code < 91) result.push(code - 64);
      }
      return result;
    }

    let str = alphabetPosition(s).join("");
    let sum = 0;
    let newArr;

    while(k>0){
        newArr = str.split("");
        sum = newArr.reduce((acc, e) => parseInt(acc)+parseInt(e));
        str = sum.toString();
        k--;
    }
    return sum

};
Sum of Digits of String After Convert