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
+