Tower of Hanoi Using Recursion The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod. You are given the number of discs N. Initially, these discs are in the rod 1. You need to print all the steps of discs movement so that all the discs reach the 3rd rod. Also, you need to find the total moves. Note: The discs are arranged such that the top disc is numbered 1 and the bottom-most disc is numbered N. Also, all the discs have different sizes and a bigger disc cannot be put on the top of a smaller disc. Refer the provided link to get a better clarity about the puzzle.
Palindrome of String Using Recursion Company tags: Amazon, Cisco, D-E_Shaw, Facebook.. etc.
In this post we will be seeing What is Recursion in Java. Recursion is a part of algorithms in which function calling itself until some base condition is not occur.