Memory Match

1. Card Shuffling — Fisher-Yates Algorithm

Cards are randomized using the Fisher-Yates shuffle, ensuring a perfectly uniform distribution.

function shuffle<T>(array: T[]): T[] {
  const arr = [...array];
  for (let i = arr.length - 1; i > 0; i--) {
    const j = Math.floor(Math.random() * (i + 1));
    [arr[i], arr[j]] = [arr[j], arr[i]];
  }
  return arr;
}

2. Match Detection — HashMap O(1) lookup

When you flip a card, we store it in a Map keyed by its emoji value. Checking for a match is O(1) time complexity.

const cardMap = new Map<string, CardType>();

function checkMatch(card: CardType): boolean {
  if (cardMap.has(card.emoji)) {
    return cardMap.get(card.emoji)?.id !== card.id;
  }
  cardMap.set(card.emoji, card);
  return false;
}

3. Game State — React useState

All game state is managed with React hooks, making the logic predictable and easy to follow.