Deck of Cards Shuffling - Coding Interview

Question

## Problem

Implement a `Deck` class representing a standard 52-card deck. Cards are represented as strings like `"AH"` (Ace of Hearts), `"10S"` (10 of Spades).

```python
class Deck:
    def __init__(self): ...             # initialize in sorted order (suits: C,D,H,S; ranks: A,2..10,J,Q,K)
    def shuffle(self) -> None: ...      # Fisher-Yates in-place shuffle
    def deal(self, n: int) -> list[str]: ...   # remove and return top n cards
    def remaining(self) -> int: ...     # count of cards left
    def reset(self) -> None: ...        # restore to original sorted order
```

**Example:**
```
d = Deck()
d.shuffle()
hand = d.deal(5)   # e.g. ["7H", "KD", "2C", "AS", "10H"]
d.remaining()      # 47
d.reset()
d.remaining()      # 52
```

## Follow-ups
- How would you verify your `shuffle()` is statistically uniform? Describe a chi-squared test approach.
- Extend `deal()` to support dealing to multiple players simultaneously, cycling cards round-robin.
- How would you implement a deterministic shuffle given a seed, and why is this useful in testing?

Deck of Cards Shuffling - Coding Interview

Question Details

Full Details

Topics

More from Bloomberg