New update is available. Click here to update. Dynamic Programming Notes
Maximum sum of two non-overlapping subarrays of a given size
Minimum steps to reach target by a Knight
Minimum cost of reducing Array by merging any adjacent elements repetitively
Wildcard Pattern Matching
Best Time To Buy and Sell Stock
Matrix Chain Multiplication
Number of balanced binary trees
Partition to K equal sum subsets
Partition Equal Subset Sum
Palindrome Partitioning ll
Count number of ways to cover a distance
Count ways to reach the nth stairs
Count Palindromic Subsequences
Longest Palindromic Substring
Longest Increasing Subsequence
Optimal Strategy for a Game
Common Digit Longest Subsequence
Maze with N doors and 1 Key