Skip to content

Latest commit

 

History

History
9 lines (5 loc) · 1.46 KB

File metadata and controls

9 lines (5 loc) · 1.46 KB

Tower of hanoi medium #array

by null @aswinsvijay

Take the Challenge

Simulate the solution for the Tower of Hanoi puzzle. Your type should take the number of rings as input an return an array of steps to move the rings from tower A to tower B using tower C as additional. Each entry in the array should be a pair of strings [From, To] which denotes ring being moved From -> To.

Wikipedia GeeksForGeeks


Back Share your Solutions Check out Solutions