Jellybean Jar II

What this probability-counting interview question tests

This is an easy probability question that combines sampling without replacement with careful case analysis. It rewards methodical enumeration and the ability to translate a constraint—matching colors at symmetric positions—into countable outcomes.

The problem asks you to find the probability of a specific event when drawing a small sample from a finite population. Success depends on identifying all valid color patterns, counting them correctly, and then dividing by the total number of possible draws. This is a common setup in probability interviews: it avoids heavy computation but requires clear thinking about which outcomes satisfy the stated condition.

• Sampling without replacement and hypergeometric reasoning
• Enumeration and case work
• Symmetry and pattern matching in outcomes