Longest Uncommon Subsequence II LeetCode solution in Python

1
class Solution:
2
    def findLUSlength(self, strs: List[str]) -> int:
3
        def isSubseq(a, b):
4
            j = 0
5
            for i in range(len(b)):
6
                if a[j] == b[i]:
7
                    j += 1
8
                    if j == len(a):
9
                        return True
10
            return False
11

12
        c = Counter(strs)
13
        s = sorted(c.keys(), key=len, reverse=True)
14
        for i in range(len(s)):
15
            if c[s[i]] > 1:
16
                continue
17
            if i == 0 or not any(isSubseq(s[i], s[j]) for j in range(i)):
18
                return len(s[i])
19
        return -1