Can you share your thoughts on the following question:
Given a string, we have to find the longest non-overlapping repeating subsequence. For example, If we have a string like "abdead", then here the answer is "ad" because longest repeating subsequence is "ad" which is non-overlapping.
My initial thought on this question is that we can use the concept of longest common subsequence but we need to manage the non-overlapping part.
Thanks in advance!