Tower of Hanoi in Java

[IndranjanaChatterjee]

Tower of Hanoi is such a problem that involves moving a stack of disks from one peg to another following certain rules: Rules are as follows: 1.Only one disk can be moved at a time 2.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack. In other words, a disk can only be moved if it is the uppermost disk on a stack. 3.No larger disk may be placed on top of a smaller disk.

[tanay-nagde]

hey @akkupy could you assign me this issue under hacktoberfest2023

[Rasayan]

Hey @akkupy could you assign me this issue for Hacktoberfest2023

[Abhinavagarwa]

hey @akkupy could you please assign me this issue under Hacktober2023

[IndranjanaChatterjee]

@akkupy created a new PR under #270 for the Tower of Hanoi problem in java.