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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Search
  4. Gena Playing Hanoi
  5. Discussions

Gena Playing Hanoi

Problem
Submissions
Leaderboard
Discussions
Editorial

Sort 33 Discussions, By:

recency

Please Login in order to post a comment

  • yashparihar729
    1 month ago+ 0 comments

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

    0|
    Permalink
  • mineman1012221
    2 months ago+ 0 comments

    Here is the solution of Gena Playing Hanoi Click Here

    0|
    Permalink
  • Carlo_otano
    8 months ago+ 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|
    Permalink
  • danikademers7
    1 year ago+ 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

    -6|
    Permalink
  • wesleyowens
    1 year ago+ 1 comment

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

    -5|
    Permalink
Load more conversations

Need Help?


View editorial
View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy