Dynamic Programming Prof. Muhammad Saeed. Dynamic programming like the divide and conquer method, solves problem by combining the solutions of sub problems.
