We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Algorithms
- Search
- Gena Playing Hanoi
- Discussions
Gena Playing Hanoi
Gena Playing Hanoi
+ 0 comments Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Gena Playing Hanoi Problem Solution
+ 0 comments Here is the solution of Gena Playing Hanoi Click Here
+ 3 comments 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?
+ 0 comments 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
+ 1 comment How to restore the tower to its original state by making valid moves. how to break a couple up without them knowing
Load more conversations
Sort 33 Discussions, By:
Please Login in order to post a comment