Sum of Digits of String After Convert
You are given a string s consisting of lowercase English letters, and an integer k.
You are given a string s consisting of lowercase English letters, and an integer k. Your task is to convert the string into an integer by a special process, and then transform it by summing its digits repeatedly k times. More specifically, perform the following steps:
For example, if s = "zbax" and k = 2, then the resulting integer would be 8 by the following operations:
Return the resulting integer after performing the operations described above.
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
Constraints
- 1 <= s.length <= 100
- 1 <= k <= 10
- s consists of lowercase English letters.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.