GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Longest Palindromic Sub-sequence by mitali004 · Pull Request #235 · codeIIEST/Algorithms

Conversation

@mitali004

@mitali004 mitali004 commented Dec 16, 2017

Copy link
Copy Markdown
Contributor

ISSUE NUMBER

117

SHORT DESCRIPTION

Added the code for longest palindromic subsequence along with a readme.md for it.

Sorry, something went wrong.

Uh oh!

There was an error while loading. Please reload this page.

All reactions
mitali004 added 5 commits December 16, 2017 10:24
@mitali004
Create lps.c
edd2193
@mitali004
Create readme_lps.md
8f2e51a
@mitali004
Update lps.c
1642c77
@mitali004
Update lps.c
0b52d94
@mitali004
Update lps.c
4608934
prateekiiest
prateekiiest requested changes Dec 24, 2017
View reviewed changes
Comment thread Competitive Coding/Dynamic Programming/Longest Palindromic Sub-sequence/readme_lps.md

### 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/>

@prateekiiest prateekiiest Dec 24, 2017

Copy link
Copy Markdown
Member

There was a problem hiding this comment.

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

make like this [i][i]

Sorry, something went wrong.

Uh oh!

There was an error while loading. Please reload this page.

All reactions
Comment thread Competitive Coding/Dynamic Programming/Longest Palindromic Sub-sequence/readme_lps.md
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]).

@prateekiiest prateekiiest Dec 24, 2017

Copy link
Copy Markdown
Member

There was a problem hiding this comment.

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

similarly add ` before and after

Sorry, something went wrong.

Uh oh!

There was an error while loading. Please reload this page.

All reactions

This branch has not been deployed

No deployments
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@prateekiiest prateekiiest prateekiiest requested changes

Uh oh!

There was an error while loading. Please reload this page.

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

Uh oh!

There was an error while loading. Please reload this page.

2 participants

@mitali004 @prateekiiest
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.
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.