## some important dynamic programming problems to practice

Dynamic programming is method of solving complex problem by breaking into subproblems. subproblems are solved and each solution is stored. List of some important dynamic programming problems to practice....

## maximum submatrix sum problem

Given a 2D matrix find the maximum submatrix sum in it. The matrix is containing positive and negative integers. For example The maximum submatrix sum is 15 in the...

## traveling salesman problem dynamic programming

Traveling salesman problem dynamic programming. The tsp problem is considered to be difficult problem in computer science. Let us understand the classical traveling salesman problem with the help of...

## traveling salesman problem Brute force and dynamic programming

Traveling salesman problem Brute force and dynamic programming: Given a set of cities and the distances between them, find the shortest path visiting each of a given set of...

## All pair shortest path floyd warshall algorithm

All pair shortest path floyd warshall algorithm. All pair shortest path is problem of finding shortest distance between every pair of vertices/nodes in a given directed weighted graph. floyd...

## longest palindromic substring

## longest common substring problem

## longest increasing subsequence

Longest increasing subsequence problem: Dynamic programing Given a set of integers in unsorted manner find the length of longest increasing subsequence. for example 10 23 3 45 56 24...

## Subset Sum Problem Dynamic Programming

Let us learn Subset Sum Problem Dynamic Programming.The Subset Sum problem takes as input a set X = {x1, x2 ,…, xn} of n integers and another integer K....