Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds dynamic programming algorithms essential for competitive programming, interview preparation, and real world applications.
The following algorithms have been added:
Partition Problem
Maximum Subarray Sum (Kadane's Algorithm)
Longest Palindromic Substring
Word Break Problem
Egg Dropping Problem
Tiling Problems
Dice Throw Problem
Burst Balloons
Wildcard Matching
Interleaving Strings
Optimal Binary Search Tree
Longest Arithmetic Subsequence
Changes:
Added implementations for each of the above algorithms using dynamic programming.
Developed corresponding test cases to validate the functionality of the algorithms.
This PR fixes #775