521. Longest Uncommon Subsequence I LeetCode Solution
In this guide, you will get 521. Longest Uncommon Subsequence I LeetCode Solution with the best time and space complexity. The solution to Longest Uncommon Subsequence I problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Longest Uncommon Subsequence I
Given two strings a and b, return the length of the longest uncommon subsequence between a and b. If no such uncommon subsequence exists, return -1.
An uncommon subsequence between two strings is a string that is a subsequence of exactly one of them.
Example 1:
Input: a = “aba”, b = “cdc”
Output: 3
Explanation: One longest uncommon subsequence is “aba” because “aba” is a subsequence of “aba” but not “cdc”.
Note that “cdc” is also a longest uncommon subsequence.
Example 2:
Input: a = “aaa”, b = “bbb”
Output: 3
Explanation: The longest uncommon subsequences are “aaa” and “bbb”.
Example 3:
Input: a = “aaa”, b = “aaa”
Output: -1
Explanation: Every subsequence of string a is also a subsequence of string b. Similarly, every subsequence of string b is also a subsequence of string a. So the answer would be -1.
Constraints:
1 <= a.length, b.length <= 100
a and b consist of lower-case English letters.
Complexity Analysis
Time Complexity: O(\max(|\texttt{a}|, |\texttt{b}|))
Space Complexity: O(1)
521. Longest Uncommon Subsequence I LeetCode Solution in C++
class Solution {
public:
int findLUSlength(string a, string b) {
return a == b ? -1 : max(a.length(), b.length());
}
}; /* code provided by PROGIEZ */
521. Longest Uncommon Subsequence I LeetCode Solution in Java
class Solution {
public int findLUSlength(String a, String b) {
return a.equals(b) ? -1 : Math.max(a.length(), b.length());
}
} // code provided by PROGIEZ
521. Longest Uncommon Subsequence I LeetCode Solution in Python
class Solution:
def findLUSlength(self, a: str, b: str) -> int:
return -1 if a == b else max(len(a), len(b)) # code by PROGIEZ
