i was trying to solve this problemhttps://www.geeksforgeeks.org/printing-longest-common-subsequence/
but through a different process than what is explained here.
can anyone please tell me whether it is the correct solution for this problem?
this code is giving correct output for test cases which I have thought till now, but I wonder if it will be correct for all sorts of input
here is the code