Exercise: match the tarot cards! #2
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Notebook: exercises/match_tarots/match_tarots.ipynb
Given 2 decks of tarot cards, deck1 and deck2, find all the matching pairs. The output should be a set of tuples (idx1, idx2) for every matching pair in deck1, deck2.
For example:
deck1 = ['C', 'B', 'A']
deck2 = ['A', 'C', 'B']
should return (in no particular order):
{(0, 1), (1, 2), (2, 0)}
Write an algorithm to match the tarot cards
Compute the Big-O complexity of your algorithm
Exercise: Match the tarot cards!to Exercise: match the tarot cards!