Tower of Hanoi : A mathematical puzzle [Asked in FAANG Interview]

[ankit-95]

Description

This Problem requires you to move disks from Stand A to Stand C where Stand B is a helper. Stand A contains some disks as which are required to be moved to Destination C.

Additional context

Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

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 i.e. a disk can only be moved if it is the uppermost disk on a stack.
3. No disk may be placed on top of a smaller disk.

Important Checklist

• [x] I have read the contribution guidelines before making this issue.
• [x] I have verified this issue program is not already implemented

Languages and Assignees:

• [x] Python: @aastha01chauhan
• [x] Java: @ankit-95
• [ ] C: @
• [x] C++: @ShreyaDayma-cse

Notes

I have read the CODE_OF_CONDUCT.md and CONTRIBUTING.md. Please assign the issue to me.

[ankit-95]

@kaustubhgupta. Please assign this issue to me.

[hackgone]

can i work on it?

[ShreyaDayma-cse]

I would like to contribute in this

[kaustubhgupta]

@hackgone @ShreyaDayma-cse language?

[hackgone]

Java

[kaustubhgupta]

Java

Choose languages that are not taken by anybody else

[ShreyaDayma-cse]

@hackgone @ShreyaDayma-cse language?

Java

[aastha0326]

please assign this to me in python

[ShreyaDayma-cse]

I will do it in C++

[ankit-95]

@kaustubhgupta : I have created the pull Request #669 which will close this issue for Java.

[kaustubhgupta]

I will do it in C++

done