Add Missing Dynamic Programming Algorithms

[ganeshvenkatasai]

What would you like to share?

I found that some dynamic programming algorithms are currently missing. These algorithms are widely used in competitive programming, interview preparation, and realworld applications.

Extra issue details

Below is a list of the missing DP algorithms I propose to add:

Partition Problem: Dividing an array into two subsets with equal sum.
Maximum Subarray Sum (Kadane's Algorithm): Finding the contiguous subarray with the maximum sum.
Longest Palindromic Substring: Find the longest substring in a string that is a palindrome.
Word Break Problem: Determining if a string can be segmented into dictionary words.
Egg Dropping Problem: Find the minimum number of attempts needed to find the critical floor.
Tiling Problems: Count the ways to tile a 2xN board using 2x1 tiles.
Dice Throw Problem: Count the number of ways to achieve a target sum using a given number of dice.
Burst Balloons: Find the maximum coins you can collect by bursting balloons wisely.
Wildcard Matching: Matching a string with a pattern containing wildcards like ? and *.
Interleaving Strings: Determine if a string is an interleaving of two other strings.
Optimal Binary Search Tree: Construct a BST with minimum cost for given search probabilities.
Longest Arithmetic Subsequence: Find the longest subsequence with the same difference between consecutive elements.

Additional information

No response