Print Longest Common Subsequence (CPP)

[pranil-19]

(DP Problem Using C++)

Given two strings X and Y of lengths m and n respectively, PRINT LCS of strings X and Y Example 1 Input: X = aggtab, Y = gxtxayb Output: gtab Explanation: Longest Common Subsequence would be gtab which is of length 4

// I wanna contribute this to DP folder , Please assign this to me

[Saloni6111]

Hey, please assign me this issue.

[Sourajyoti1234]

I have solved this dsa question. Please assign me I have solved this problem in Leetcode using CPP