# Category - Dynamic Programming

## Maximum sum rectangle in a 2D matrix

Java Programming - Maximum sum rectangle in a 2D matrix - Dynamic Programming - Given a 2D array, find the maximum sum subarray in it. For example

## C Programming – Subset Sum Problem

C Programming - Subset Sum Problem - Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset

## Java Programming – Subset Sum Problem

Java Programming - Subset Sum Problem - Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset

## Largest Independent Set Problem

Largest Independent Set Problem - Dynamic Programming subset of all tree nodes is an independent set if there is no edge between any two nodes of the subset

## Optimal Binary Search Tree

Optimal Binary Search Tree - Dynamic Programming Given a sorted array keys[0.. n-1] of search keys and an array freq[0.. n-1] of frequency counts,

## Cpp Programming – Bellman–Ford Algorithm

C++ Programming - Bellman Ford Algorithm - Dynamic Programming Given a graph and a source vertex src in graph, find shortest paths from src to all vertices

## Java Programming – Bellman–Ford Algorithm

Java Programming - Bellman–Ford Algorithm - Dynamic Programming Given a graph and a source vertex src in graph, find shortest paths from src to all vertices

## Python Programming – Bellman–Ford Algorithm

Python Programming - Bellman Ford Algorithm - Dynamic Programming Given a graph and source vertex src in graph, find shortest paths from src to all vertices.

## Longest Palindromic Substring

Longest Palindromic Substring - Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is

## Largest Sum Contiguous Subarray

Python Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write program to find the sum of contiguous subarray within one-dimensional array

X