day 27

Author: sachuverma

Leetcode Daily Challenge/August-2021/27. Longest Uncommon Subsequence II.cpp

@@ -0,0 +1,60 @@
+/*
+Longest Uncommon Subsequence II
+===============================
+
+Given an array of strings strs, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return -1.
+
+An uncommon subsequence between an array of strings is a string that is a subsequence of one string but not the others.
+
+A subsequence of a string s is a string that can be obtained after deleting any number of characters from s.
+
+For example, "abc" is a subsequence of "aebdc" because you can delete the underlined characters in "aebdc" to get "abc". Other subsequences of "aebdc" include "aebdc", "aeb", and "" (empty string).
+
+Example 1:
+Input: strs = ["aba","cdc","eae"]
+Output: 3
+
+Example 2:
+Input: strs = ["aaa","aaa","aa"]
+Output: -1
+
+Constraints:
+1 <= strs.length <= 50
+1 <= strs[i].length <= 10
+strs[i] consists of lowercase English letters.
+*/
+
+class Solution {
+public:
+    bool isSubseq(string& a, string& b) {
+        int ia = 0, ib = 0;
+        while(ia < a.size() && ib < b.size()) {
+            if(a[ia] == b[ib]) {
+                ia++;
+                ib++;
+            }
+            else ib++;
+        }
+        
+        return ia == a.size();
+    }
+    
+    int findLUSlength(vector<string>& strs) {
+        int ans = -1;
+        
+        for(int i = 0; i < strs.size(); ++i) {
+            int flag = 0;
+            for(int j = 0; j < strs.size(); ++j) {
+                if(i != j && isSubseq(strs[i], strs[j])) {
+                    flag = 1;
+                    break;
+                }
+            }
+            
+            if(!flag) ans = max(ans, (int)strs[i].size());
+        }
+        
+        return ans;
+    }
+};
+

Leetcode Daily Challenge/August-2021/README.md

@@ -28,5 +28,5 @@
 | 24. | [Complex Number Multiplication](https://leetcode.com/explore/featured/card/august-leetcoding-challenge-2021/616/week-4-august-22nd-august-28th/3917/)                            |                  [cpp](./24.%20Complex%20Number%20Multiplication.cpp)                   |
 | 25. | [Sum of Square Numbers](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge-2021/616/week-4-august-22nd-august-28th/3918/)                            |                  [cpp](./25.%20Sum%20of%20Square%20Numbers.cpp)                   |
 | 26. | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge-2021/616/week-4-august-22nd-august-28th/3920/) | [cpp](./26.%20Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree.cpp) |
-| 27. | []() | [cpp](./27.%20.cpp) |
+| 27. | [Longest Uncommon Subsequence II](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge-2021/616/week-4-august-22nd-august-28th/3921/) | [cpp](./27.%20Longest%20Uncommon%20Subsequence%20II.cpp) |
 | 28. | []() | [cpp](./28.%20.cpp) |