Search
⌘K

Leetcode 3271. Hash Divided String

Partition the string s into n/k blocks of length k and for each block compute the sum of character indices (a→0..z→25), take that sum mod 26, map it back to a lowercase letter, and append to the result. s contains only lowercase letters and its length is divisible by k.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.