Leetcode 522. Longest Uncommon Subsequence II
Find the length of the longest string in the array that is a subsequence of itself but not a subsequence of any other string in the array (return -1 if none exists). Note that identical duplicates cannot count as an uncommon subsequence.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.