feat: add Palindrome Partitioning algorithm #971
Merged
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.
Description
Adds a dynamic programming solution for finding the minimum cuts needed for palindrome partitioning of a string.
Algorithm
Given a string
s, partitionssuch that every substring of the partition is a palindrome. This function finds the minimum number of cuts needed for such a partitioning.Time Complexity: O(n²)
Space Complexity: O(n²)
Example
Implementation Details
Vec<char>Testing
Reference
Based on: https://www.youtube.com/watch?v=_H8V5hJUGd0
Checklist