Added Longest Common Subsequence solution in Python

[jaimin45-art]

Description

This PR adds a Python implementation of the Longest Common Subsequence problem using Dynamic Programming.

Folder

strings/

Language

Python

Type

✅ Hacktoberfest Contribution
✅ New Feature / Algorithm

[algorithms-keeper]

Closing this pull request as invalid

@jaimin45-art, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

• Read a point one at a time and think if it is relevant to the pull request or not.
• If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.