Skip to content

Conversation

@keiravillekode
Copy link
Contributor

No description provided.

Copy link
Contributor

@fapdash fapdash left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Really cool example solution, although my graph theory is not strong enough to fully follow. 😅

Great addition! :)

@keiravillekode keiravillekode merged commit 96b16b4 into exercism:main Oct 21, 2025
2 checks passed
@keiravillekode keiravillekode deleted the dominoes branch October 21, 2025 18:32
@keiravillekode
Copy link
Contributor Author

I added some comments when publishing my community solution.

; For the dominoes to chain, it is necessary and sufficient that
; - each number appears an even number of times
; - each number present is reachable from any other number present

; We use a `tally` vector to record how many times each number appears.

; We use a Disjoint Set `parent` vector to merge sets of reachable numbers.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants