# Tag - dynamic programming in data structure

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

## Boolean Parenthesization Problem

Boolean Parenthesization Problem - Dynamic Programming Count the number of ways we can parenthesize the expression so that the value of expression

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

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

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

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

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