Given a string A, find length of the longest repeating sub-sequence such that the two subsequence don’t have same string character at same position,
i.e., any i’th character in the two subsequences shouldn’t have the same index in the original string.
NOTE: Sub-sequence length should be greater than or equal to 2.
1 <= |A| <= 100
The first and the only argument of input contains a string A.
Return an integer, 0 or 1:
=> 0 : False => 1 : True
A = "abab"
A = "abba"
"ab" is repeated.
There is no repeating subsequence.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.