6 kyu
Hanoi Tower Array
102jamad
Description:
Given the number n, return a string which shows the minimum number of moves to complete the tower of Hanoi consisting of n layers. Tower of Hanoi : https://en.wikipedia.org/wiki/Tower_of_Hanoi
Example - 2 layered Tower of Hanoi
Input: n=2
Start [[2, 1], [], []]
Goal [[], [], [2, 1]]
Expected Output : '[[2, 1], [], []]\n[[2], [1], []]\n[[], [1], [2]]\n[[], [], [2, 1]]'
Algorithms
Similar Kata:
Stats:
| Created | Nov 8, 2017 |
| Published | Nov 8, 2017 |
| Warriors Trained | 529 |
| Total Skips | 76 |
| Total Code Submissions | 494 |
| Total Times Completed | 102 |
| Python Completions | 102 |
| Total Stars | 12 |
| % of votes with a positive feedback rating | 85% of 41 |
| Total "Very Satisfied" Votes | 31 |
| Total "Somewhat Satisfied" Votes | 8 |
| Total "Not Satisfied" Votes | 2 |
| Total Rank Assessments | 5 |
| Average Assessed Rank | 5 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 7 kyu |
