DynamicProgramming

Two of the most important steps in any dynamic programming problem are:
Identifying the recurrent relation.
Figuring out what to memoize.

Dynamic programming is to remembering sub problem answers to save time later



1. Longest Palindromic Subsequence






reference:
https://www.codechef.com/wiki/tutorial-dynamic-programming
https://blog.usejournal.com/top-50-dynamic-programming-practice-problems-4208fed71aa3