Skip to content

LCS implementation #30

Description

@SamareshMaiti16

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.

Activity

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

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions