Hi,
I have a quick question. I see that all these problems return the length of the longest subsequence/substring. Is there a way we could print/return the subsequence/substring too by using backtracking or other approaches using the same LPS function defined in this course or do we need to define a separate method to retrieve the sequence. Please let me know.