Longest Palindromic Sub-sequence #235
Open
Conversation
This file contains 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
prateekiiest
requested changes
Dec 24, 2017
|
|
||
| ### Filling of the matrix | ||
| Every single charecter contributes to a palindromic string of length 1 starting and ending at itself, therefore we fill the diagonal of the | ||
| matrix with 1 for every [i][i] entry. <br/><br/> |
| For every other entry:<br/> | ||
| If last and first characters of str are same, then mat[i][j] = mat[i+1][j-1] + 2, as it considers [2(for the first and the last chaar)] + | ||
| [longest palindromic subsequence between these 2 chars].<br/> | ||
| Else mat[i][j] = max(mat[i][j-1], mat[i+1][j]). |
There was a problem hiding this comment.
similarly add ` before and after
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
ISSUE NUMBER
117
SHORT DESCRIPTION
Added the code for longest palindromic subsequence along with a readme.md for it.