# Tag - types of dynamic programming

## Cpp Programming – Count of n digit numbers whose sum of digits equals to given sum

C++ Programming - Count of n digit numbers whose sum of digits equals to given sum - Dynamic Programming Given two integers ‘n’ and ‘sum’, find count of all

Mobile Numeric Keypad Problem - Dynamic Programming Given the mobile numeric keypad. You can only press buttons that are up, left, right or down

## C Programming – Count ways to reach the n’th stair

C Programming - Count ways to reach the n’th stair - Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.

## Java Programming – Count number of binary strings without consecutive 1’s

Java Programming - Count number of binary strings without consecutive 1’s - Dynamic Programming Positive integer, count all possible distinct binary string

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

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

## 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 – Largest Sum Contiguous Subarray

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