In this post we derive the famous PCA result and see its applications to MNIST dataset.

Upper Confidence bound algorithm for multi armed bandit problem. We also derive its regret bounds and show that is sublinear and thus better than naive algorithms.

In this post we show the optimality of the worst case time complexity of binary search and see how to adapt binary search to a setting when the elements aren't equally likely present in the array.

We talk about sterling number of first and second kind.

Explanation and Applications of generating functions

We talk about various convergence notions for random variables

A simple way to find size of uniform distribution given its samples.

A simple charming puzzle that shows why rigor is required in mathematics

A practical game theory problem that can help you select (probabilistically) the best candidate when interviewing. Spoiler - The first candidate is always rejected!

A simple logical puzzle from a class of puzzles involving interviewing one (or more) member(s) of truth tellers or liers clan. The identity of clan is not known. The aim is to get hold of an answer to some question.