Reverse Words in a String Python

How To Reverse Words In A String Python?

In Python, a string is created by putting a stream of characters inside single quotes, double quotes, or triple quotes. Reverse words in a string mean that we have to reverse the position of all words in the given string.

Examples

Let us look at some examples :

Method - 1: Reverse The Individual Words And Then Reverse The Whole String

The intuition of this approach is to first reverse every word present in the string individually,

For Example:
I like coding becomes, I ekil gnidoc. Now, we have to reverse the whole string to get the desired result which in the case of this example will be coding like I.

Let us now see the implementation of this approach to reverse words in a string in Python :

Output:

Complexity analysis

Since we are traversing the whole string once to reverse the words in a string, the Time Complexity is $O(n)$, where $n$ is the size of the string.

While an auxiliary space is required to reverse words in a string, the Space Complexity is $O(n)$, where $n$ is the size of the string.

Method - 2: By Splitting The String Using The split() Function In Python

The above-discussed method does not handle the case when the string starts with a space. Therefore, we will discuss an approach using Python's in-built split() function. The algorithm to implement this method is as follows :

1. Define a function that will take a string as input.
2. Split the input string on space using the split() function and store the result as a list.
3. Reverse the created list using the reversed() function and add them to a new string using the join() string function in Python.
4. Return the new string

Let us now see the implementation of this approach to reverse words in a string in Python :

Output :

Method - 3: Without Using Any Extra Space

We will discuss an optimal approach to reverse words in a string Python. The intuition of this approach is to swap the words of the string from the beginning and end, using a two-pointer approach, to reverse the string in constant space.

The algorithm is demonstrated as follows :

1. Convert the string into an array of strings by splitting it on space.
2. Initialize the two pointers left and right to 0 and len(string) – 1, respectively.
3. While the left pointer does not exceed the right pointer, swap the elements at the left and right pointers, and move the left pointer forward and the right pointer backward by 1 step.
4. Finally, return the final reversed string.

Let us now see the implementation of this approach to reverse words in a string in Python :

Output:

Complexity analysis

Since we are traversing the whole string to split it in space, the Time Complexity is $O(n)$, where $n$ is the size of the string.

While an auxiliary space is required to store the string in a reverse manner, the Space Complexity is $O(1)$.