Search
⌘K

Leetcode 1230. Toss Strange Coins

Given n biased coins with specified probabilities of landing heads, compute the probability of getting exactly a target number of heads. This requires combining independent Bernoulli outcomes efficiently (e.g., dynamic programming / convolution of distributions) rather than enumerating all subsets.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.