#K47217. String Transformation: Next Alphabet Character
String Transformation: Next Alphabet Character
String Transformation: Next Alphabet Character
In this problem, you are given a string consisting of lowercase English letters. Your task is to transform the string by replacing each character with its successor in the English alphabet. Note that the letter (z) wraps around to become (a). For example, the string "abc" is transformed into "bcd" and "xyz" into "yza". You need to process multiple test cases, each provided as a separate input string. The input and output are handled via standard input and standard output.
inputFormat
The input begins with an integer (T) representing the number of test cases. Each of the following (T) lines contains a single string consisting of lowercase English letters.
outputFormat
For each test case, output the transformed string on a new line. Each character of the string should be replaced by the next character in the alphabet (with (z) wrapping around to (a)).## sample
2
abc
xyz
bcd
yza
</p>