Home Blog Past IEEEXtreme Challenges Posts on IEEEXtreme 14.0
Dynamic Programming · Tabulation · Fibonacci
5 min read
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.
Photo by Paul Milasan on Unsplash