Add Longest Common Subsquence #Issue 259

[lobachaos]

Issue Id you have worked upon -

Issue id : 259

259

Briefly explain your program logic -

To find all possibilities we need to establish a matrix 2x2 from the theory of permutation and combination and compare both strings in the parameter

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 -

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

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

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

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] 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.
  

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

[lobachaos]

I'm just commit the changes , it's all right?