Given a string str consisting of a sentence, the task is to reverse every word of the sentence except the first and last character of the words.
Examples:
Input: str = “geeks for geeks”
Output: gkees for gkeesInput: str = “this is a string”
Output: tihs is a snirtg
Approach: Break the string into words using strtok(), now for every word take two pointers i and j pointing to the second and the second last character of the string respectively. Swap these characters then increment i and decrement j. Repeat these steps while i < j.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to reverse the given word except // the first and the last character string reverseWord(string str) { int len = str.length(); // Pointer to the second character // of the string int i = 1; // Pointer to the second last // character of the string int j = str.length() - 2; while (i < j) { // Swap str[i] and str[j] char temp = str[i]; str[i] = str[j]; str[j] = temp; i++; j--; } return str; } // Function to reverse every word of the // sentence except the first and the // last character of the words void reverseWords(char str[]) { char* tok = strtok(str, " "); // While there are words left while (tok != NULL) { // Print the reversed word cout << reverseWord(tok) << " "; // Get the next word tok = strtok(NULL, " "); } } // Driver code int main() { char str[] = "geeks for geeks"; reverseWords(str); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the above approach class GFG { // Function to reverse the given word except // the first and the last character static String reverseWord(String str) { int len = str.length(); // Pointer to the second character // of the string int i = 1; // Pointer to the second last // character of the string int j = str.length() - 2; char[] strchar = str.toCharArray(); while (i < j) { // Swap str[i] and str[j] char temp = strchar[i]; strchar[i] = strchar[j]; strchar[j] = temp; i++; j--; } str = new String(strchar); return str; } // Function to reverse every word of the // sentence except the first and the // last character of the words static void reverseWords(String str) { String[] tok = str.split("\\s"); // While there are words left for(String w:tok) { // Print the reversed word System.out.print(reverseWord(w) + " "); } } // Driver code public static void main (String[] args) { String str = "geeks for geeks"; reverseWords(str); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Python3
# Python3 implementation of the approach # Function to reverse the given word except # the first and the last character def reverseWord(Str): # len = len(Str) # Pointer to the second character # of the String i = 1 # Pointer to the second last # character of the String j = len(Str) - 2 while (i < j): # Swap Str[i] and Str[j] temp = Str[i] Str[i] = Str[j] Str[j] = temp i += 1 j -= 1 return "".join(Str) # Function to reverse every word of the # sentence except the first and the # last character of the words def reverseWords(Str): Str = Str.split() # While there are words left for i in Str: # Print the reversed word j = [h for h in i] print(reverseWord(j), end = " ") # Driver code Str= "geeks for geeks"reverseWords(Str) # This code is contributed by Mohit Kumar |
chevron_right
filter_none
C#
// C# implementation of the above approach using System; class GFG { // Function to reverse the given word except // the first and the last character static String reverseWord(String str) { int len = str.Length; // Pointer to the second character // of the string int i = 1; // Pointer to the second last // character of the string int j = str.Length - 2; char[] strchar = str.ToCharArray(); while (i < j) { // Swap str[i] and str[j] char temp = strchar[i]; strchar[i] = strchar[j]; strchar[j] = temp; i++; j--; } str = new String(strchar); return str; } // Function to reverse every word of the // sentence except the first and the // last character of the words static void reverseWords(String str) { String[] tok = str.Split(' '); // While there are words left foreach(String w in tok) { // Print the reversed word Console.Write(reverseWord(w) + " "); } } // Driver code public static void Main (String[] args) { String str = "geeks for geeks"; reverseWords(str); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
Output:
gkees for gkees
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- First substring whose reverse is a word in the string
- Print the first and last character of each word in a String
- Remove the first and last character of each word in a string
- Capitalize the first and last character of each word in a string
- Print last character of each word in a string
- Reverse all the word in a String represented as a Linked List
- Reverse each word in a linked list node
- Replace every character of string by character whose ASCII value is K times more than it
- Modify the string such that every character gets replaced with the next character in the keyboard
- Find a string such that every character is lexicographically greater than its immediate next character
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Map every character of one string to another such that all occurrences are mapped to the same character
- Replace all occurrences of character X with character Y in given string
- Most frequent word in first String which is not present in second String
- String containing first letter of every word in a given string with spaces
- Replace every character of a string by a different character
- Create a new string by alternately combining the characters of two halves of the string in reverse
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Length Of Last Word in a String
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
