Posts on Competitive Programming Challenges

IEEEXtreme 14.0 · Markov Chains

Back to Square 1

Solving this problem is very easy and only requires a few lines of code if you know what Markov Chains are. After modeling the problem as a Markov Chain, the solution is just a matter of finding the expected number of steps required to reach the desired state.

IEEEXtreme 14.0 · Dynamic Programming

Fibonacci

Here I will discuss the most efficient way to calculate the nth Fibonacci under modulo. This is a typical Fibonacci problem, but with a twist. The twist comes because of the modulo operation. This causes the fibonacci sequence to repeat itself after a certain point.