We will see a combinatorial proof of the Chernoff-Hoeffding bound, which says that the sum of independent {0,1}-valued random variables is highly concentrated around the expected value. We will also see proof for the case of [0,1]-valued random variables. This is based upon the work of Russell Impagliazzo, Valentine Kabanets, Wolfgang Mulzer, and Natalia Shenkman.