Mobile Numeric Keypad Problem
Mobile Numeric Keypad Problem – Dynamic Programming Given the mobile numeric keypad. You can only press buttons that are up, left, right or down
Tag: concept of dynamic programming
C Programming – Count ways to reach the n’th stair
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.
Java Programming – Count ways to reach the n’th stair
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.
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
Largest Independent Set Problem
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
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
Python Programming – 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
Python Programming – Ugly Numbers
Python Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.