# Tag - simple dynamic programming example

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

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

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

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

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

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

X