top of page
  • Writer's pictureAlex Martinez

DataWeave programming challenge #4: Solve the Tower of Hanoi mathematical puzzle | ProstDev

Move the disks, one disk at a time, from tower A to tower C following the Tower of Hanoi puzzle rules.

Check out the complete challenge with detailed explanations 👇

You can also see the live-coding solution with some lo-fi music! 👇

3 views0 comments
bottom of page