# Tag - dynamic programming set 1

## C Programming – Maximum sum rectangle in a 2D matrix

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

## 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

## 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

## Java Programming – Largest Sum Contiguous Subarray

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

## C++ Programming – Ugly Numbers

C++ Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every step we choose the smallest one

## Java Programming – Ugly Numbers

Java Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Here we use similar merge

## Python Programming – Ugly Numbers

Python Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.

## Minimum number of jumps to reach end

Minimum number of jumps to reach end - Dynamic Programming An array of integers where elements represents the max number of steps that can be made forward

## Java Programming – Program for Fibonacci numbers

Java Programming - Program for Fibonacci numbers - Dynamic Programming The Fibonacci numbers are the numbers in the following integer sequence.