Reverse Only Letters Problem Statement

You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

Example:

Input:

S = "a-bcd"

Output:

"d-cba"

Explanation:

In the string, only the letters 'a', 'b', 'c', and 'd' are reversed, while the '-' character remains in place.

Constraints:

1 ≤ T ≤ 10

0 ≤ |S| ≤ 5000

Time Limit: 1 Sec

Input:

The first line of the input contains ‘T’ denoting the number of test cases.
The first line of each test case contains a string ‘S’.

Output:

For every test case, print the reversed string on a new line.

Note:

You do not need to print anything; it has already been taken care of. Just implement the given function.

Question

You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

S = "a-bcd"

"d-cba"

In the string, only the letters 'a', 'b', 'c', and 'd' are reversed, while the '-' character remains in place.

The first line of the input contains ‘T’ denoting the number of test cases.
The first line of each test case contains a string ‘S’.

For every test case, print the reversed string on a new line.

You do not need to print anything; it has already been taken care of. Just implement the given function.

Accepted Answer

Reverse the letters of a string while keeping non-alphabet characters in their original position.

Iterate through the string and maintain two pointers, one at the start and one at the end, to reverse only the letters
Use isalpha() function to check if a character is an alphabet or not
Swap the letters at the two pointers until they meet in the middle
Keep non-alphabet characters in their original position while reversing the letters

Wipro Software Developer interview questions & answers