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

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static jav...

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 ...