Create 2900. Longest Unequal Adjacent Groups Subsequence I (#794)

Author: Chayandas07

2900. Longest Unequal Adjacent Groups Subsequence I

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    static vector<string> getLongestSubsequence(vector<string>& words, vector<int>& groups) {
+        const int n=groups.size();
+        int prev=groups[0];
+        int len=1;
+        for(int i=1, j=1; i<n; i++){
+            while(i<n && prev==groups[i])
+                i++;
+            if (i<n) {
+                words[j++]=words[i];
+                len++;
+                prev=groups[i];
+            }
+        }
+        words.resize(len);
+        return words;
+    }
+};