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...
Browse Tag
dynamic programming in data structure
75 Articles
Boolean Parenthesization Problem
Boolean Parenthesization Problem - Dynamic Programming Count the number of ways we can parenthesize the expression so that...
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...
Java Programming – Subset Sum Problem
Java Programming - Subset Sum Problem - Dynamic Programming Given a set of non-negative integers, and a value sum, determine...
Java Programming – Bellman–Ford Algorithm
Java Programming - Bellman–Ford Algorithm - Dynamic Programming Given a graph and a source vertex src in graph, find...
Longest Palindromic Substring
Longest Palindromic Substring - Dynamic Programming -Given a string,find the longest substring which is palindrome. For...
Largest Sum Contiguous Subarray
Python Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write program to find the sum of contiguous...
Java Programming – Largest Sum Contiguous Subarray
Java Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write a program to find the sum of contiguous...
C++ Programming – Ugly Numbers
C++ Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every...
Python Programming – Ugly Numbers
Python Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.
