Easiest Way to Reverse a String
Last Updated :
05 Feb, 2024
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 changes the order of a given string so that the last character of the string becomes the first character , second last becomes second character of the string and so on.
Examples:
Input: "ABC"
Output: "CBA"
Input: "geeksforgeeks"
Output: "skeegrofskeeg"
The easiest way to reverse a string:
The easiest way to reverse a string is to use the inbuilt function of respective languages. There is a direct function in the “algorithm” header file for doing reverse that saves our time when programming.
// Reverses elements in [begin, end]
void reverse (BidirectionalIterator begin, BidirectionalIterator end);
What is reverse() function in C++:
reverse() is a predefined function in the header file algorithm. It is defined as a template in the above-mentioned header file. It reverses the order of the elements in the range [first, last) of any container. The time complexity is O(n).
Note: The range used is [first, last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.
Syntax:
void reverse(BidirectionalIterator first, BidirectionalIterator last)
Explanation:
BidirectionalIterator is an iterator that can be used to access any
elements of a container in both forward and backward direction.
Built in reverse() method of the StringBuilder class in Java:
- String class does not have reverse() method, we need to convert the input string to StringBuilder, which is achieved by using the append method of StringBuilder. After that, print out the characters of the reversed string by scanning from the first till the last index.
Below is the Implementation of the above approach:
C++
// C++ program to illustrate the
// reversing of a string using
// reverse() function
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str = "geeksforgeeks";
// Reverse str[begin..end]
reverse(str.begin(), str.end());
cout << str;
return 0;
}
Java
// Java program to ReverseString using StringBuilder
import java.io.*;
import java.lang.*;
import java.util.*;
// Class of ReverseString
class ReverseString {
public static void main(String[] args)
{
String input = "geeksforgeeks";
StringBuilder input1 = new StringBuilder();
// append a string into StringBuilder input1
input1.append(input);
// reverse StringBuilder input1
input1.reverse();
// print reversed String
System.out.println(input1);
}
}
Python3
# Python program to reverse a string
def reverse_string(string):
return string[::-1]
str = "geeksforgeeks"
reversed_str = reverse_string(str)
print(reversed_str)
# This code is contributed by Sakshi
C#
using System;
using System.Text;
class ReverseString
{
public static void Main(string[] args)
{
string input = "geeksforgeeks";
StringBuilder input1 = new StringBuilder();
// append a string into StringBuilder input1
input1.Append(input);
// reverse StringBuilder input1
input1 = ReverseStringBuilder(input1);
// print reversed String
Console.WriteLine(input1);
}
// Method to reverse a StringBuilder
public static StringBuilder ReverseStringBuilder(StringBuilder sb)
{
char[] arr = sb.ToString().ToCharArray();
Array.Reverse(arr);
return new StringBuilder(new string(arr));
}
}
JavaScript
// JavaScript program to reverse a string using StringBuilder
// Function to reverse a string
function reverseString(str) {
// Create a StringBuilder equivalent in JavaScript
let input1 = new StringBuilder();
// Append the input string to the StringBuilder
input1.append(str);
// Reverse the StringBuilder
input1.reverse();
// Return the reversed string
return input1.toString();
}
// Class equivalent to StringBuilder in JavaScript
class StringBuilder {
constructor() {
this.strings = [];
}
// Append a string to the StringBuilder
append(str) {
this.strings.push(str);
}
// Reverse the StringBuilder
reverse() {
this.strings = this.strings.join('').split('').reverse();
}
// Convert the StringBuilder to a string
toString() {
return this.strings.join('');
}
}
// Main function
function main() {
// Input string
let input = "geeksforgeeks";
// Call the reverseString function
let reversedString = reverseString(input);
// Print the reversed string
console.log(reversedString);
}
// Call the main function
main();
Complexity Analysis:
Time Complexity: O(N), N is the size of the string.
Auxiliary Space: O(1)
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read