Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added code to find longest common subsequence #389

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

freckles30
Copy link

Issue Id you have worked upon -

Kindly write your answer here

Briefly explain your program logic -

Kindly write your answer here

Screenshots(Attach 2 screenshots of your own input and output) -

Attach here


Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

  • [] I have mentioned the question as comment in my solution file.

  • [] My code follows the guidelines of this project.

  • [] I have performed a self-review of my own code.

  • [] I have commented my code.

  • [] My code gives the correct output.

  • [] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.

  • [] I affirm that I strictly follow contributing guidelines and code of conduct.

@SarthakKeshari
Copy link
Owner

@freckles30,
Kindly create an issue first and then PR. And follow the PR template and contribution guidelines.
I am not closing this PR since this was your first time. You may refer CONTRIBUTING.md(present in the repository) and create an issue(iff program has not been done in repositories probable folders).

If above given lines follow, then kindly create an issue now and claim it. I will assign it to you.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants