Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Gena Playing Hanoi Problem Solution

Here is the solution of Gena Playing Hanoi Click Here

Is it me or is the second example wrong?

post = [4,2,2,1]

Moves:

1- Disk 2 to rod 3 [4,3,2,1]

2- Disk 3 to rod 1 [4,3,1,1]

3- Disk 2 to rod 1 [4,1,1,1]

4- Disk 1 to rod 1 [1,1,1,1]

That’s 4 moves to reset the game, not three as indicated in the example. Where am I wrong?

The practice of this question is a deep search, unexpectedly , took a little bit more time but in the end got the solution , thanks... Vasiyam Specialist in Kerala

How to restore the tower to its original state by making valid moves. how to break a couple up without them knowing