3.2 KiB
3.2 KiB
Exercise: Match the tarot cards!¶
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
In [2]:
import random
# List of tarot card names (Major Arcana)
tarot_cards = [
"The Fool", "The Magician", "The High Priestess", "The Empress", "The Emperor",
"The Hierophant", "The Lovers", "The Chariot", "Strength", "The Hermit",
"Wheel of Fortune", "Justice", "The Hanged Man", "Death", "Temperance",
"The Devil", "The Tower", "The Star", "The Moon", "The Sun", "Judgement",
"The World"
]
# Copy the list to create two separate decks
deck1 = tarot_cards.copy()
deck2 = tarot_cards.copy()
# Shuffle both decks
random.shuffle(deck1)
random.shuffle(deck2)
# Print the shuffled decks
print("-- Deck 1: --\n", deck1)
print("-- Deck 2: --\n", deck2)
In [ ]:
In [ ]: