Create 2350. Shortest Impossible Sequence of Rolls.py

Author: 724thomas

leetcode3/최원준/2350. Shortest Impossible Sequence of Rolls.py

@@ -0,0 +1,13 @@
+class Solution:
+    def shortestSequence(self, rolls: list[int], k: int) -> int:
+        seen = set()
+        ans = 1
+
+        for num in rolls:
+            seen.add(num)
+
+            if len(seen) == k:
+                ans += 1
+                seen.clear()
+
+        return ans