Repeated Subsequence
Lesson 14 of 15 in Coddy's Recursion Challenges - Master The Recursive Thinking course.
Challenge
HardWrite a function named repeatedSubseq that gets a string s and returns a repeated subsequence s if it exists, otherwise an empty string.
A repeated subsequence must have 2 or more characters.
For example,
repeatedSubseq("XYBAXB")->"XB"(XBXB)repeatedSubseq("BANAN")->"AN"(ANAN)repeatedSubseq("XYZX")->""(None)repeatedSubseq("XYXYX")->"XYX"
Make sure to return the longest repeated subsequence!
Try it yourself
#include <string.h>
char* repeatedSubseq(char* s) {
// Write code here
}