LCS implementation #30

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.

Sign up for GitHub

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

Jump to bottom

Open

SamareshMaiti16 opened this issue Oct 26, 2022 · 0 comments

Labels

dynamic programming hacktober-fest hacktoberfest-accepted

Owner

SamareshMaiti16 commented Oct 26, 2022 •

edited

Loading

Write a python code to find the LCS (Longest Common subsequence) of two input strings using dynamic programming approach.
Guidelines:

Write the codes in python only.
Refrain from any unfair means or plagiarism.
The code should display authenticity.
Use proper formatting and comments.
Please include the driver code for your code.

Click here: https://en.wikipedia.org/wiki/Subsequence to read about subsequence.

SamareshMaiti16 added hacktober-fest hacktoberfest-accepted dynamic programming labels

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