Find n-th Fibonacci number using Dynamic Programming

A Fibonacci series is one in which every number is the sum of previous 2 numbers appearing in the series. The series goes something like: 0 1 1 2 3 5 8 13 21...


This is a companion discussion topic for the original entry at http://iq.opengenus.org/n-th-fibonacci-number-using-dynamic-programming/