Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Netflix
Leetcode 522. Longest Uncommon Subsequence II
Reported Mar 20, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source