Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Tower of Hanoi: The Moves

Tower of Hanoi: The Moves

Difficulty: 1300 2000 ms 128 MB

implementation

Print the optimal move sequence for an N-disc Tower of Hanoi from peg 1 to peg 3 (peg 2 is spare). Each line: from to.

Input: one integer N.

Output: 2N−1 lines of moves.

Constraints:

  • 1 ≤ N ≤ 15

Sample Tests

Input 1
2
Output 1
1 2
1 3
2 3
Input 2
1
Output 2
1 3

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen