Java 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.
dynamic programming problems
78 Articles
78
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 – Subset Sum Problem – Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset
Largest Independent Set Problem – Dynamic Programming subset of all tree nodes is an independent set if there is no edge between any two nodes of the subset
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 – Dynamic Programming Given a graph and source vertex src in graph, find shortest paths from src to all vertices.
Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is
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 – Dynamic Programming Write a program to find the sum of contiguous subarray within one-dimensional array
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