Tag - how to solve dynamic programming problems

C++ Programming – Print all increasing sequences of length k from first n natural numbers

Given two positive integers n and k, print all increasing sequences of length k such that the elements in every sequence are from first n natural numbers.

C++ Programming – Longest Monotonically Increasing Subsequence Size

Given an array of random numbers, find longest monotonically increasing subsequence (LIS) in the array.If you want to understand the O(NlogN) approach.

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

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

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.

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