Dynamic programming

Introduction
Introduction to Dynamic programming
Common characterstics in dynamic programming
Overlapping subproblems in Dynamic programming
Optimal Substructure

Some applications
Fibonacci Sequence Dynamic Programming
Dynamic-Programming Solution to the 0-1 Knapsack Problem
Longest common subsequence : Dynamic programming Longest common substring problem
Longest common substring revisited Reducing the space for LCS lengths 
Find longest palindrome in a string.
To find the longest substring with unique characters in a given string
Dynamic-Programming Algorithm for the Activity-Selection Problem  Get maximum sum from coins in a line Minimum number of coins to get particular amount, given multiple denomination 
Find the maximum subarray of an integer array
Bellman ford algorithm - One source shortest path
Matrix chain multiplication Max possible sum of non-consecutive elements Find optimal number of jumps to reach last element
Hirschberg's algorithm
Hirschberg’s linear space algorithm in C++
Dynamic Programming Algorithm (DPA) for Edit-Distance

Maximum size square sub-matrix with all 1s  

Problem sets
Dynamic Programming Practise Problem 1 
Dynamic Programming Practise Problem 2 
Dynamic Programming Practise Problem 3