Jellybean Color Match Probability

This jellybean probability puzzle is a classic combinatorics and counting question built around sampling without replacement. It tests whether you can translate a verbal description about colors and positions into a precise event in a random sequence. For quant prep, it's a gentle but representative introduction to the kind of discrete probability reasoning that shows up in quant interviews and online assessments.

It trains your ability to formalize constraints, recognize hidden symmetries, and break a probability event into structured combinatorial cases. You must identify which outcomes qualify, separate them into disjoint scenarios, count them correctly, and relate them to the full sample space while keeping track of dependence between draws.

This matters in quant interviews because similar logic appears in path-dependent payoffs, credit events, and sequential trading outcomes. Quant interviews use such questions to see if candidates can reason cleanly about dependent events and structured randomness.

What it tests

When sampling without replacement from distinct groups, the core structure is to partition the event space into mutually exclusive cases based on the constraints, then count the number of favorable arrangements for each case. The probability is the ratio of favorable to total arrangements, where order may or may not matter depending on the question. The key is to recognize that the constraints often create symmetry or repetition, so enumeration by cases (such as 'all same', 'two of each', etc.) is both necessary and sufficient. This approach holds because the lack of replacement means each draw changes the composition, so sequential counting (multiplying choices at each step) captures the dependencies. The pattern is to translate verbal constraints into combinatorial cases, then sum their probabilities.