min = x
==

#5 Build an algorithm that returns a uniform random permutation of numbers 1 to n.
# Given a stream of integers build an algorithm that returns a uniform random sample of size k using O(k) memory.
# (Coupon collector’s problem) Suppose a kid wants to collect all the cartoon characters in a kinder surprise series. Given that there are n different characters in total and they are distributed uniformly random