feat(hanoi): create exercise #448
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
nikitarevenco
changed the title
3 tasks
|
Ready for review! |
MaoShizhong
requested changes
Jul 3, 2024
Co-authored-by: MaoShizhong <[email protected]>
Co-authored-by: MaoShizhong <[email protected]>
Co-authored-by: MaoShizhong <[email protected]>
Co-authored-by: MaoShizhong <[email protected]>
nikitarevenco
changed the title
MaoShizhong
requested changes
Aug 18, 2024
Co-authored-by: MaoShizhong <[email protected]>
Co-authored-by: MaoShizhong <[email protected]>
Co-authored-by: MaoShizhong <[email protected]>
Co-authored-by: MaoShizhong <[email protected]>
MaoShizhong
added
the
Status: Do Not Merge
MaoShizhong
requested changes
Aug 25, 2024
20_hanoi/README.md
Outdated
Comment on lines
21
to
38
| Your task is to create a function, `hanoi(n)`, that when given the number of disks in the starting tower (`n`), will return an array. The first element of this array will be the towers' initial state. The last element will be the towers' final state. Every intermediary element will represent a step to get from the initial position to the final position. | ||
|
|
||
| The function **must** return a solution in the minimum number of moves. i.e. there will be no duplicates in the array returned. | ||
|
|
||
| For example, `hanoi(3)` will output the Tower of Hanoi solution as a series of steps: | ||
|
|
||
| ``` | ||
| [ | ||
| [[3, 2, 1], [], []], | ||
| [[3, 2], [], [1]], | ||
| [[3], [2], [1]], | ||
| [[3], [2, 1], []], | ||
| [[], [2, 1], [3]], | ||
| [[1], [2], [3]], | ||
| [[1], [], [3, 2]], | ||
| [[], [], [3, 2, 1]], | ||
| ] | ||
| ``` |
There was a problem hiding this comment.
The instructions need to be amended to reflect the new requirements of returning an array of strings with the moves - the required string template must be provided as well.
Co-authored-by: MaoShizhong <[email protected]>
MaoShizhong
reviewed
Aug 25, 2024
…be in Co-authored-by: MaoShizhong <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Because
I think this exercise should be the last one because in my mind it's the most difficult one.
This PR
Issue
Related to #27265
Additional Information
Pull Request Requirements
location of change: brief description of changeformat, e.g.01_helloWorld: Update test casesBecausesection summarizes the reason for this PRThis PRsection has a bullet point list describing the changes in this PRIssuesection/solutionsfolder