This tutorial explains on how memoization is relevant in reducing time complexity. In addition, it focusses on two standard problems in Dynamic Programming, the Longest Increasing Subsequence problem and the Coin Denomination problem.