Longest Commom subsequence

[PrakharRathore123]

Issue Id you have worked upon -

305

Briefly explain your program logic -

1)Function to calculate the LIS 2)If length of s1 or s2 is zero then return zero 3)If value is already calculated then return that 4)If last element is equal then add 1 in diagonal element 5)Else Calculate max from (i-1,y) and (i,y-1) of 2d array

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.

[PrakharRathore123]

@SarthakKeshari Kindly acknowledge that.