Leetcode Problem 522. Longest Uncommon Subsequence II
Leetcode Solutions
Approach # Checking Subsequence
- Iterate over each string in the array.
- For each string, check if it is a subsequence of any other string in the array.
- If the string is not a subsequence of any other string, it is a candidate for the longest uncommon subsequence.
- Keep track of the length of the longest candidate.
- After checking all strings, return the length of the longest candidate or -1 if no candidate is found.
Approach # Brute Force
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...