Skip to main content

How to Reverse a String Recursively in Java? | Explained with Stack Trace

Reverse a String Recursively in Java

Reverse a String Recursively in Java

In this article, we will learn how to reverse string using recursive approach with stack trace.

As we all know, Recursion is concept where method is calling itself until base case does not satisfy.

Example 1 : Reverse string recursively with return

import java.util.Scanner;

public class ReverseString {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter String for Reverse :");
        String str = sc.nextLine();
        String reverseStr =    reverseStringByRecursive(str);
        System.out.println("Reversed String : \n"+reverseStr);
    }
    
    private static String reverseStringByRecursive(String str) {
        if ( str.equals("")) {
            return "";
        }
        
        return reverseStringByRecursive( str.substring(1)) + str.charAt(0);
    }

}

Output :

Enter String for Reverse :
java
Reversed String :
avaj

Stack trace for reverse string recursively in java

As we can see, when we call reverseStringByRecursive() method with "java" string it stores all characters one by one until it return empty string (""). At last it returns reverse string as we can seen in above pic.

We can also reverse string without return. lets see code of that

Example 2 : Reverse string recursively without return

public class ReverseString {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter String for Reverse :");
        String str = sc.nextLine();
        System.out.println("Reversed String :");
        reverseStringByRecursive(str);
    }
    
    private static void reverseStringByRecursive(String str) {
        if (str.equals("")) {
            System.out.print(str);
        } else {
            System.out.print(str.charAt(str.length()-1));
            reverseStringByRecursive(str.substring(0,str.length()-1));
        }
    }
}

Output :

Enter String for Reverse :
hello
Reversed String :
olleh

 

Happy learning. Happy coding.

Other articles you may like :

Reverse Linked List (LL) using Iterative (While loop) and Recursive approach in Java 

Most asked interview questions and answers for Java developers on Core Java


   

Comments

Popular posts from this blog

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...