Sha256: a939d96831e88b71707ae40430cb4927f63ce1389a67d697bf34c856cb3cff86
Contents?: true
Size: 1006 Bytes
Versions: 106
Compression:
Stored size: 1006 Bytes
Contents
# Dominoes Make a chain of dominoes. 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 neighbouring half of an adjacent stone) and that dots on the halfs of the stones which don't have a neighbour (the first and last stone) match each other. For example given the stones `21`, `23` and `13` you should compute something like `12 23 31` or `32 21 13` or `13 32 21` etc, where the first and last numbers are the same. For stones 12, 41 and 23 the resulting chain is not valid: 41 12 23's first and last numbers are not the same. 4 != 3 Some test cases may use duplicate stones in a chain solution, assume that multiple Domino sets are being used. ## Setup Go through the project setup instructions for Xcode using Swift: http://exercism.io/languages/swift ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
106 entries across 106 versions & 1 rubygems