Probability of Drawing Two Kings from a Deck

This is a basic probability question about drawing specific ranks from a standard deck, framed as a very simple two-card hand. The candidate has to interpret a familiar physical setup, translate it into a well-defined probability model, and decide how to handle dependence between successive draws from a finite deck. Because it uses playing cards and a tiny sample size, it often appears in early-round interviews or written screens to check comfort with discrete probability before moving to more abstract setups.

Conceptually, the problem leans on combinatorics and conditional probability. Candidates can either think in terms of ordered draws and conditional probabilities, or in terms of counting favorable and total two-card combinations. Interviewers listen for clarity about sampling without replacement, recognition that the second draw's probability changes after the first, and the ability to express that change cleanly. They also watch whether the candidate chooses a consistent method, avoids double-counting, and can justify why different approaches must give the same numerical result.

What it tests

When sampling without replacement from a finite set, the probabilities of successive events are dependent: the outcome of each draw alters the composition of the remaining set, and thus the probabilities for subsequent draws. This dependence means that the probability of a sequence of outcomes is not simply the product of the marginal probabilities, but rather a product of conditional probabilities that reflect the updated state after each selection. The general structure is that after each draw, both the numerator (number of desired outcomes) and the denominator (total possible outcomes) change. This principle underlies all problems involving sequential draws from a finite population without replacement, whether the objects are cards, balls, or people. The combinatorial approach—counting the number of favorable ways to select the desired combination, divided by the total number of possible selections—naturally encodes this dependency, since it considers the set as a whole rather than as a sequence of steps.