Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Reverse words in a given string | Set 2

  • Difficulty Level : Medium
  • Last Updated : 26 Sep, 2021

Given string str, the task is to reverse the string by considering each word of the string, str as a single unit.

Examples:

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.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input: str = “geeks quiz practice code”
Output: code practice quiz geeks 
Explanation: 
The words in the given string are [“geeks”, “quiz”, “practice”,  “code”]. 
Therefore, after reversing the order of the words, the required output is“code practice quiz geeks”.

Input: str = “getting good at coding needs a lot of practice”
Output: practice of lot a needs coding at good getting

In-place Reversal Approach: Refer to the article Reverse words in a given string for the in-place reversal of words followed by a reversal of the entire string. 



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

Stack-based Approach: In this article, the approach to solving the problem using Stack is going to be discussed. The idea here is to push all the words of str into the Stack and then print all the elements of the Stack. Follow the steps below to solve the problem:

  1. Create a Stack to store each word of the string str.
  2. Iterate over string str, and separate each word of str by a space delimiter.
  3. Push all the words of str into the stack.
  4. Print all the elements of the stack one by one.

Below is the implementation of the above approach:

C++




// C++ Program to implement
// the above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to reverse the words
// of a given string
void printRev(string str)
{
    // Stack to store each
    // word of the string
    stack<string> st;
 
    // Store the whole string
    // in string stream
    stringstream ss(str);
 
    string temp;
    while (getline(ss, temp, ' ')) {
 
        // Push each word of the
        // string into the stack
        st.push(temp);
    }
 
    // Print the string in reverse
    // order of the words
    while (!st.empty()) {
        cout << st.top() << " ";
        st.pop();
    }
}
 
// Driver Code
int main()
{
    string str;
    str = "geeks quiz practice code";
 
    printRev(str);
    return 0;
}
Java



// Java Program to implement
// the above approach
import java.util.*;
class GFG{
 
    // Function to reverse the words
    // of a given String
    static void printRev(String str)
    {
        // Stack to store each
        // word of the String
        Stack<String> st = new Stack<String>();
 
        // Store the whole String
        // in String stream
        String[] ss = str.split(" ");
 
        for (String temp : ss)
        {
 
            // Push each word of the
            // String into the stack
            st.add(temp);
        }
 
        // Print the String in reverse
        // order of the words
        while (!st.isEmpty())
        {
            System.out.print(st.peek() + " ");
            st.pop();
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        String str;
        str = "geeks quiz practice code";
        printRev(str);
    }
}
 
// This code is contributed by Rajput-Ji
Python3



# Python3 program to implement
# the above approach
 
# Function to reverse the words
# of a given string
def printRev(strr):
     
    # Stack to store each
    # word of the string
    strr = strr.split(" ")
    st = []
 
    # Store the whole string
    # in stream
    for i in strr:
 
        # Push each word of the
        # into the stack
        st.append(i)
 
    # Print the in reverse
    # order of the words
    while len(st) > 0:
        print(st[-1], end = " ")
        del st[-1]
 
# Driver Code
if __name__ == '__main__':
     
    strr = "geeks quiz practice code"
     
    printRev(strr)
 
# This code is contributed by mohit kumar 29
C#



// C# program to implement
// the above approach
using System;
using System.Collections;
 
class GFG{
 
// Function to reverse the words
// of a given String
static void printRev(string str)
{
     
    // Stack to store each
    // word of the String
    Stack st = new Stack();
 
    String[] separator = {" "};
     
    // Store the whole String
    // in String stream
    string[] ss = str.Split(separator,
                            int.MaxValue,
             StringSplitOptions.RemoveEmptyEntries);
 
    foreach(string temp in ss)
    {
 
        // Push each word of the
        // String into the stack
        st.Push(temp);
    }
 
    // Print the String in reverse
    // order of the words
    while (st.Count > 0)
    {
        Console.Write(st.Peek() + " ");
        st.Pop();
    }
}
 
// Driver Code
public static void Main(string[] args)
{
    string str;
    str = "geeks quiz practice code";
     
    printRev(str);
}
}
 
// This code is contributed by rutvik_56
Javascript



<script>
// Javascript Program to implement
// the above approach
 
// Function to reverse the words
// of a given String
function printRev(str)
{
        // Stack to store each
        // word of the String
        let st = [];
  
        // Store the whole String
        // in String stream
        let ss = str.split(" ");
  
        for (let temp=0;temp< ss.length;temp++)
        {
  
            // Push each word of the
            // String into the stack
            st.push(ss[temp]);
        }
  
        // Print the String in reverse
        // order of the words
        while (st.length!=0)
        {
            document.write(st.pop() + " ");
             
        }
}
 
// Driver Code
let str;
str = "geeks quiz practice code";
printRev(str);
 
 
// This code is contributed by unknown2108
</script>
Output
code practice quiz geeks 
Time Complexity: O(N), where N denotes the length of the string.
Auxiliary Space: O(N)
Method #2: Using built-in python functions
  • As all the words in a sentence are separated by spaces.
  • We have to split the sentence by spaces using split().
  • We split all the words by spaces and store them in a list.
  • Reverse this list and print it.
C++



// C++ program to implement
// the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to reverse the words
// of a given string
void printRev(string lis[])
{
   
    // reverse the list
    reverse(lis, lis + 4);
      
    for(int i = 0; i < 4; i++)
    {
        cout << lis[i] << " ";
    }
}
     
int main()
{
    string strr[] = {"geeks", "quiz", "practice", "code"};
   
    printRev(strr);
 
    return 0;
}
 
// This code is contributed by divyeshrabadiya07.
Java



// Java program to implement
// the above approach
import java.util.*;
 
class GFG{
     
// Function to reverse the words
// of a given string
static void printRev(String string)
{
     
    // Split by space and converting
    // string to list
    String[] lis = string.split(" ", 0);
      
    // Reverse the list
    Collections.reverse(Arrays.asList(lis));
      
    // Printing the list
    for(String li : lis)
    {
        System.out.print(li + " ");
    }
}
 
// Driver code
public static void main(String[] args)
{
    String strr = "geeks quiz practice code";
 
    printRev(strr);
}
}
 
// This code is contributed by decode2207
Python3



# Python3 program to implement
# the above approach
 
# Function to reverse the words
# of a given string
 
 
def printRev(string):
    # split by space and converting
    # string to list
    lis = list(string.split())
    # reverse the list
    lis.reverse()
    # printing the list
    print(*lis)
 
 
# Driver Code
if __name__ == '__main__':
 
    strr = "geeks quiz practice code"
 
    printRev(strr)
 
# This code is contributed by vikkycirus
C#



// C# program to implement
// the above approach
using System;
class GFG {
     
    // Function to reverse the words
    // of a given string
    static void printRev(string String)
    {
        // split by space and converting
        // string to list
        string[] lis = String.Split(' ');
         
        // reverse the list
        Array.Reverse(lis);
         
        // printing the list
        foreach(string li in lis)
        {
            Console.Write(li + " ");
        }
    }
 
  static void Main() {
    string strr = "geeks quiz practice code";
  
    printRev(strr);
  }
}
 
// This code is contributed by rameshtravel07.
Javascript



<script>
 
// javascript program to implement
// the above approach
 
// Function to reverse the words
// of a given string
 
 
function printRev(string){
    // split by space and converting
    // string to list
    var lis = string.split(' ');
    console.log(lis);
    // reverse the list
    lis.reverse();
    console.log(lis);   
    // printing the list
    document.write(lis.join(' '));
}   
 
 
// Driver Code
 
    var strr = "geeks quiz practice code"
 
    printRev(strr)
 
</script>
Output
code practice quiz geeks



My Personal Notes
arrow_drop_up
Previous
Check if a string can be converted to another by swapping of adjacent characters of given type
Next

Second() and Time() Function in MS Access
Recommended Articles
Page :
Check if the given string of words can be formed from words present in the dictionary
04, Jul 18
Reverse words in a given String in Java
07, Aug 17
Reverse words in a given String in Python
06, Nov 17
Program to reverse words in a given string in C++
30, Apr 20
Reverse words in a given string
03, May 10
Reverse String according to the number of words
01, Jun 18
Reverse middle words of a string
09, Dec 18
Print words of a string in reverse order
04, Nov 17
Reverse the Words of a String using Stack
18, Jun 19
Count words that appear exactly two times in an array of words
13, Jul 17
Reverse individual words
02, Jan 18
Reverse individual words with O(1) extra space
24, Jun 19
Count of unique pairs (i, j) in an array such that sum of A[i] and reverse of A[j] is equal to sum of reverse of A[i] and A[j]
12, Feb 21
Find least start index of a substring from given String that contains all the given words in a contiguous manner
03, Sep 21
Maximize cost of forming a set of words using given set of characters
26, Apr 21
Check if a given string is a Reverse Bitonic String or not
08, Jul 20
Count words in a given string
13, Feb 13
Program to extract words from a given String
15, Jun 17
Check if a two character string can be made using given words
10, Oct 17
Extract and print words separately from a given Camel Case string
26, Jun 20
Check if given words are present in a string
28, Apr 20
Shortest substring of a string containing all given words
11, Oct 17
Reverse the substrings of the given String according to the given Array of indices
26, Feb 20
Reverse an array in groups of given size | Set 2 (Variations of Set 1 )
23, Aug 16
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
anantrungta1999
@anantrungta1999
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!