Dsa
Strings
Hard
Cyclic String Transformation
You are given a string containing lowercase English letters. Transform the string by transforming every character at an odd index into the next character in the alphabet (wrapping from 'z' to 'a') and leaving characters at even indices unchanged. Output the transformed string.
Input Format:
- A single line containing the string `s` (1 ≤ |s| ≤ 1000).
Output Format:
- A single line containing the transformed string.
Example Input:
abcde
Example Output:
adcfe
Key concepts
stringsmanipulationindexing
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now