Given an array of random numbers, find longest monotonically increasing subsequence (LIS) in the array.If you want to understand the O(NlogN) approach.
Tag - dynamic programming code generation algorithm
Mobile Numeric Keypad Problem - Dynamic Programming Given the mobile numeric keypad. You can only press buttons that are up, left, right or down
Minimum Cost Polygon Triangulation - Dynamic Programming A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices
C 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.
Boolean Parenthesization Problem - Dynamic Programming Count the number of ways we can parenthesize the expression so that the value of expression
Java Programming - Count number of binary strings without consecutive 1’s - Dynamic Programming Positive integer, count all possible distinct binary string
C++ Programming - Bellman Ford Algorithm - Dynamic Programming Given a graph and a source vertex src in graph, find shortest paths from src to all vertices
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 - 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