An interesting puzzle.

A routine problem from IMO 2024.

This is amongst the simplest problems to say, easiest to approach and yet somehow unsolvable at times.

One of my favourite puzzle. So simple to speak, never lacked avenues of attack, though rested all but one!

In this introductory post we discuss the mathematical model of an MDP and some elementary ways to solve it in both offline and online setting.

Let us say we toss a coin N times. Which occurs more frequently the Tail - Tail (TT) or Head - Tail (HT)? In the sequence TTT, we count 2 TT's.

A kinematic problem that requires one to understand difference between radial and perpendicular velocity, and a bit of differential equations.

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.