Monte Carlo code to aid with solution of the October 4, 2019 fivethirtyeight.com Riddler Classic problem

bday.py

import random, collections

def bdaySample(size):
   sample = collections.Counter()
   for i in range(size):
      sample[random.randrange(365)] += 1
   return max(sample.values())

def probAtLeast(n, size, nSamples):
   atLeastN = sum(1 for c in (
       bdaySample(size) for i in range(nSamples)) if c >= n)
   return atLeastN / nSamples