Amarkant814
diff --git a/‎08 August Leetcode Challenge 2021/27_findLUSlength.py
Copy file name to clipboard
+12Lines changed: 12 additions & 0 deletions b/‎08 August Leetcode Challenge 2021/27_findLUSlength.py
Copy file name to clipboard
+12Lines changed: 12 additions & 0 deletions
@@ -0,0 +1,12 @@
+class Solution:
+    def findLUSlength(self, words):
+        def isSubsequence(s, t):
+            t = iter(t)
+            return all(c in t for c in s)
+ 
+        words.sort(key = lambda x:-len(x))
+        for i, word in enumerate(words):
+            if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): 
+                return len(word)
+        
+        return -1