7 days with Dynamic Programming

Become Dynamic Programming Master in 7 days Dynamic Programming is one of the most important algorithmic domains and is equally challenging. With practice and correct way of thinking you can master it easily. If a problem takes O(2^N) time to search a solution among possible solutions Dynamic Programming has the potential to reduce it to O(N) or polynomial time thereby reducing the search space. We will attempt one problem every day in this week and analyze the problem deeply. Our schedule:• Day 1: Introduction + Longest Increasing Subsequence• Day 2: 2D version of Day 1 problems• Day 3: Dynamic Programming on Strings• Day 4: Modified version of Day 3 problems• Day 5: Dynamic Programming for String patterns (Longest Palindromic Substring)• Day 6: Modified version of Day 4 problems• Day 7: 2 conditions on 1 data point On following this routine sincerely you will get a strong hold on Dynamic Programming and will be able to attempt interview and real-life problems easily. #7daysOfAlgo: a 7-day investment to Algorithmic mastery. (C) iq.OPENGENUS.org