Compute P(third Ace | Ace in first two)
CitadelData Scientist · Technical Screen
Last updated
This question evaluates understanding of conditional probability, dependence versus independence, symmetry arguments, and combinatorial reasoning in sampling without replacement.
You draw three cards without replacement from a standard 52-card deck. Given that among the first two cards there is at least one Ace, what is the probability that the third card is an Ace? State and justify any independence or symmetry arguments you use. Then generalize: for a deck of N cards with A Aces, given that the first m cards (m ≥ 2) contain at least one Ace, what is P(card m+1 is an Ace)?
Solution walkthrough is for members
Get the full walkthrough with reference code and complexity analysis, plus Kitty Coach at 300 messages a day. Hints, the code runner and community answers stay free.