Longest Uncommon Subsequence II - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
522. Longest Uncommon Subsequence II
Medium
30 Points
Array
Hash Table
Two Pointers
String
Sorting
Given an array of strings strs, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return -1.
An uncommon subsequence between an array of strings is a string that is a subsequence of one string but not the others.
A subsequence of a string s is a string that can be obtained after deleting any number of characters from s.
Examples
Example 1
Input: strs = ["aba","cdc","eae"]
Output: 3
Example 2
Input: strs = ["aaa","aaa","aa"]
Output: -1
Constraints
2 <= strs.length <= 50
1 <= strs[i].length <= 10
strs[i] consists of lowercase English letters.
522. Longest Uncommon Subsequence II
Medium
30 Points
Array
Hash Table
Two Pointers
String
Sorting
Given an array of strings strs, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return -1.
An uncommon subsequence between an array of strings is a string that is a subsequence of one string but not the others.
A subsequence of a string s is a string that can be obtained after deleting any number of characters from s.