Dp Learnings Series' Articles

Back to Prashant Mishra's Series
House Robber leetcode problem

House Robber leetcode problem

Jump game leetcode problem

Jump game leetcode problem

Jump game II leetcode problem

Jump game II leetcode problem

Cherry Pickup II Leetcode Problem

Cherry Pickup II Leetcode Problem

Partition Equals Subset Sum Leetcode problem or Subset sum equals to target

Partition Equals Subset Sum Leetcode problem or Subset sum equals to target

Maximum Sum Problem GeeksForGeeks

Maximum Sum Problem GeeksForGeeks

Count Palindrome Sub-Strings of a String GeeksForGeeks

Count Palindrome Sub-Strings of a String GeeksForGeeks

Length of Longest Common Subsequence (LCS) and Longest common subsequence string leetcode

Length of Longest Common Subsequence (LCS) and Longest common subsequence string leetcode

0/1 Knapsack Problem GeeksForGeeks both bounded and Unbounded

0/1 Knapsack Problem GeeksForGeeks both bounded and Unbounded

Shortest distance from source to all other nodes in a Directed Acyclic Graph

Shortest distance from source to all other nodes in a Directed Acyclic Graph

Coin change Leetcode

Coin change Leetcode

Coin Change 2 Leetcode

Coin Change 2 Leetcode

Target Sum or Partition with given difference Leetcode

Target Sum or Partition with given difference Leetcode

Rod cutting Problem (similar to unbounded knapsack)

Rod cutting Problem (similar to unbounded knapsack)

Length of longest common substring

Length of longest common substring

Longest Palindromic subsequence (Same as Lcs)

Longest Palindromic subsequence (Same as Lcs)

Minimum Insertion steps needed to make a string palindrome (Same as LCS)

Minimum Insertion steps needed to make a string palindrome (Same as LCS)

Minimum number of Insertion and deletion needed to convert String A to String B or make both the strings equal (same as lcs)