From 78c3727dc4ce562ba1068170338816b1b5b70e76 Mon Sep 17 00:00:00 2001
From: bumpsoo <bumpsoo063@protonmail.ch>
Date: Thu, 15 May 2025 12:13:03 +0000
Subject: [PATCH] 
 https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i

---
 ...gest_unequal_adjacent_groups_subsequence_i.py | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 easy/longest_unequal_adjacent_groups_subsequence_i.py

diff --git a/easy/longest_unequal_adjacent_groups_subsequence_i.py b/easy/longest_unequal_adjacent_groups_subsequence_i.py
new file mode 100644
index 0000000..dab0466
--- /dev/null
+++ b/easy/longest_unequal_adjacent_groups_subsequence_i.py
@@ -0,0 +1,16 @@
+# https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i
+
+from typing import List
+
+class Solution:
+    def getLongestSubsequence(self, words: List[str], groups: List[int]) -> List[str]:
+        result = []
+        last = -1
+        for i in range(len(words)):
+            if last == groups[i]:
+                continue
+            else:
+                result.append(words[i])
+                last = groups[i]
+        return result
+