Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings.
A subsequence is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements. Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.
The input will be two strings, and the output needs to be the length of the longest uncommon subsequence. If the longest uncommon subsequence doesn't exist, return -1.
Input: "aba", "cdc" Output: 3 Explanation: The longest uncommon subsequence is "aba" (or "cdc"),
because "aba" is a subsequence of "aba",
but not a subsequence of any other strings in the group of two strings.
In the brute force approach we will generate all the possible subsequences of both the strings and store their number of occurences in a hashmap.\nLongest subsequence whose frequency is equal to will be the required subsequence.\nAnd, if it is not found we will return .\n\n
Simple analysis of this problem can lead to an easy solution.\n
These three cases are possible with string and :-\n
\n. If both the strings are identical, it is obvious that no subsequence will be uncommon. Hence, return -1.\n
\n and . Example: and . In this case we can consider any string i.e. or as a required subsequence, as out of these two strings one string will never be a subsequence of other string. Hence, return or .\n
\n. Example and . In this case we can consider bigger string as a required subsequence because bigger string can\'t be a subsequence of smaller string. Hence, return .\n
Time complexity : . where and are the lengths of strings and respectively. Here equals method will take time .\n
Space complexity : . No extra space required.\n
Analysis written by: @vinod23\n