ItIsUday commented 4 years ago

Feature ✅

Description

Given the number of disks and labels for the towers, displays necessary moves required to solve the Tower of Hanoi problem.

Input: 2 A B C

Output: Move Disk 1 from A to B Move Disk 2 from A to C Move Disk 1 from B to C It took 3 moves in total

[x] I have read the project guidelines.
[x] I have checked all the existing projects, before submitting a new project issue.
[x] This issue will be meaningful for the project.
[x] I will contribute more in future

I would like to contribute in Python

ShivamYadav-Coding commented 4 years ago

I would like to contribute in c++

SAKSHI2569 commented 4 years ago

I would like to contribute in c . will you please assign me this issue?

pratik-choudhari commented 4 years ago

@SAKSHI2569 It has already been assigned to shivam.

ilmiye commented 4 years ago

Can you assign this to me in python

sawzedong commented 4 years ago

Hi, could I take this in Java?