Swap the first and last character of a string in Java

Given string str, the task is to write a Java program to swap the first and the last character of the given string and print the modified string.

Examples:

Input: str = "GeeksForGeeks"
Output: seeksForGeekG
Explanation: The first character of the given string is 'G' and the last character of the given string is 's'. We swap the character 'G and 's' and print the modified string.

Input: str = "Java"
Output: aavJ
Explanation: The first character of the given string is 'J' and the last character of the given string is 'a'. We swap the character 'J and 'a' and print the modified string.

Method 1 - using String.toCharArray() method

1. Get the string to swap first and last character.
2. Check if the string has only one character then return the string.
3. Convert the given string into a character array.
4. Swap first and the last character of the string using a temp variable.
5. Now, print the modified string.

Below is the implementation of the above approach:

seeksForGeekG

Time Complexity: O(N)
Auxiliary Space: O(N)

Method 2 - using StringBuilder.setCharAt() method:

1. Get the string to swap first and the last character.
2. Check if the string has only one character then return the string.
3. Create a StringBuilder object with the given string passed as a parameter.
4. Set the last character of a string at index zero.
5. Set the first character of a string at the last index.
6. Now, print the modified string.

Below is the implementation of the above approach:

seeksForGeekG

Time Complexity: O(N)
Auxiliary Space: O(N) it is using extra space for StringBuilder sb

Method 3 - using String.substring() method

1. Get the string to swap first and the last character.
2. Check if the string has only one character then return the string.
3. Extract the last character of the string.
4. Extract the first character of the string.
5. Concatenate the last character and first character between the middle characters.
6. Now, print the modified string.

Below is the implementation of the above approach:

seeksForGeekG

Time Complexity: O(N)
Auxiliary Space: O(1)