Create 1312-Minimum-Insertion-Steps-to-Make-a-String-Palindrome.py#4342
Open
Yatin-aggarwal wants to merge 1 commit intoneetcode-gh:mainfrom
Open
Create 1312-Minimum-Insertion-Steps-to-Make-a-String-Palindrome.py#4342Yatin-aggarwal wants to merge 1 commit intoneetcode-gh:mainfrom
Yatin-aggarwal wants to merge 1 commit intoneetcode-gh:mainfrom
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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:
This PR adds a solution to LeetCode Problem 1312 using a top-down dynamic programming approach with memoization.The goal is to return the minimum number of insertions required to make the input string a palindrome.
Approach:
We use recursion with memoization (top-down DP) to avoid redundant computations.
The key idea:
If characters at both ends match, move inward.
Else, insert one character and recursively solve for both possible substrings (excluding one character from either end), and take the minimum.