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

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

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...