You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Compute a way to order a given set of dominoes in such a way that they form a correct domino chain (the dots on one half of a stone match the dots on the neighboring half of an adjacent stone) and that dots on the halves of the stones which don't have a neighbor (the first and last stone) match each other.
It is said that I need to compute the correct domino chain, but in fact the exercise only requires to make a method that return a bool value - that is, if it's possible to create such a domino chain.
So either the instruction needs to be updated, or the whole exercise needs to be updated to meet the instructions.
The text was updated successfully, but these errors were encountered:
At Exercism we use our Community Forum, not GitHub issues, as the primary place for discussion. That allows maintainers and contributors from across Exercism's ecosystem to discuss your problems/ideas/suggestions without them having to subscribe to hundreds of repositories.
This issue will be automatically closed. Please use this link to copy your GitHub Issue into a new topic on the forum, where we look forward to chatting with you!
If you're interested in learning more about this auto-responder, please read this blog post.
It is said that I need to compute the correct domino chain, but in fact the exercise only requires to make a method that return a bool value - that is, if it's possible to create such a domino chain.
So either the instruction needs to be updated, or the whole exercise needs to be updated to meet the instructions.
The text was updated successfully, but these errors were encountered: