Skip to content

Different Methods to Reverse a String in C++

Different Methods to Reverse a String in C++

Last Updated : 23 Apr, 2025

Try it on GfG Practice

Reversing the string means the last character will be the first character, second last character will be second character and so on. In C++, we can reverse a string in various different ways as show below:

Table of Content

Using reverse() Function

C++ STL provides a built-in function reverse(), which can be used to reverse the string efficiently.

Example

C++

#include <bits/stdc++.h> using namespace std;  int main() {     string s = "Hello World";      // Using reverse() function to reverse s     reverse(s.begin(), s.end());      cout << s;     return 0; }

Output

dlroW olleH

Time Complexity: O(n), where n is the length of string.
Auxiliary Space: O(1)

Using Reverse Iterators

In C++, reverse iterators such as string.rbegin() and string.rend() are used to allow the traversal of string in reverse. We can use them to construct temporary reversed version of the string and then assign it to the original string.

Example

C++

#include <bits/stdc++.h> using namespace std;  int main() {     string s = "Hello World";      // Creating a temporary reversed string   	// and assigning it to the s     s = string(s.rbegin(), s.rend());        	cout << s;     return 0; }

Output

dlroW olleH

Time Complexity: O(n), where n is the length of string.
Auxiliary Space: O(n), for temporary reversed string.

Using a Stack

A stack can also be used to reverse a string due to its LIFO (Last In First Out) property. We can push all characters of the string into a stack and clear the current string. Then we pop characters from the stack and append them to the string one by one, resulting in the reversed string.

Example

C++

#include <bits/stdc++.h> using namespace std;  int main() {     string s = "Hello World";     stack<char> st;      // Push each character of string into stack     for (char c : s)         st.push(c);      // Clear the string     s.clear();      // Pop characters from stack and add them to     // reversed string     while (!st.empty()) {         s.push_back(st.top());         st.pop();     }      cout << s;     return 0; }

Output

dlroW olleH

Time Complexity: O(n), where n is the length of string.
Auxiliary Space: O(n), for stack.

Using Two Pointer Technique

In two-pointer technique, we use two pointers: one starting at the beginning (left) and one at the end (right) of the string. We move them towards the centre of the string and keep swapping the characters they point till they meet each other.

Example

C++

#include <bits/stdc++.h> using namespace std;  int main() {     string s = "Hello World";      // Initialize two pointers: left at start     //  and right at the end of the string     int l = 0;     int r = s.length() - 1;      // Loop until the two pointers meet in the middle     while (l < r) {                // Swap characters at position left and right         swap(s[l], s[r]);          // Move the left pointer to right         l++;          // Move the right pointer to left         r--;     }      cout << s;     return 0; }

Output

dlroW olleH

Time Complexity: O(n), where n is the length of string.
Auxiliary Space: O(1)

Note: Two pointer technique is implemented in the std::reverse() function.

Using Recursion

The two-pointer technique can also be implemented using recursion though it can be less space efficient and harder to understand.

Example

C++

#include <bits/stdc++.h> using namespace std;  // Function to reverse the string using recursion void revStr(string &s, int l, int r) {        // Base case: When left and right pointer meet     if (l >= r)         return;      // Swap characters at left and right     swap(s[l], s[r]);      // Recursive call to reverse remaining substring     revStr(s, l + 1, r - 1); }  int main() {     string s = "Hello World";      // Call the recursive function to reverse string     revStr(s, 0, s.length() - 1);      cout << s;     return 0; }

Output

dlroW olleH

Time Complexity: O(n), where n is the length of string.
Auxiliary Space: O(n), for recursive stack.

Different Methods to Reverse a String in C++

P

Priyam kakati, Ranju Kumari, Somesh Awasthi

Improve

Article Tags :

Practice Tags :

Similar Reads

Easiest Way to Reverse a String

Have you wondered which is the easiest way to reverse a string, Imagine you are giving a contest and an algorithm you have made requires reversing a string, you must be aware of the easiest way to reverse a string. What is a reversal of string:Reversing a string is the technique that reverses or cha

How to traverse a STL map in reverse direction?

Map stores the elements in sorted order of keys. Now if we want to traverse it in reverse order we will use reverse_iterator of map. Syntax: map::reverse_iterator iterator_name; Reverse Iterator of map moves in backward direction on increment. So, we will point the reverse_iterator to the last eleme

list reverse function in C++ STL

The list::reverse() is a built-in function in C++ STL which is used to reverse a list container. It reverses the order of elements in the list container. Syntax: list_name.reverse()Parameters: This function does not accept any parameters. Return Value: This function does not return any value. It jus

string::rbegin() and string::rend() in C++

The std::string::rbegin() and std::string::rend() functions in C++ are used to fetch the reverse iterators to the string. They are the member function of std::string and are used when we want to iterate the string in reverse. In this article, we will learn how to use string::rbegin() and string::ren

std::string::back() in C++ with Examples

This function returns a direct reference to the last character of the string. This shall only be used on non-empty strings. This can be used to access the last character of the string as well as to append a character at the end of the string. Length of the string remains unchanged after appending a