Jun 6

Author: siddydutta

2024-06-June-LeetCoding-Challenge/Hand of Straights.py

@@ -0,0 +1,38 @@
+from collections import Counter
+from heapq import heapify, heappop
+from typing import List
+
+
+class Solution:
+    def isNStraightHand(self, hand: List[int], groupSize: int) -> bool:
+        if len(hand) % groupSize != 0:
+            return False
+
+        freq = Counter(hand)
+        heapify(hand)
+        while hand:
+            start = heappop(hand)
+            if freq[start] == 0:
+                # already used
+                continue
+            freq[start] -= 1
+            # check k consecutive
+            for i in range(1, groupSize):
+                if freq[start+i] == 0:
+                    return False
+                freq[start+i] -= 1
+        return True
+
+
+def main():
+    hand = [1, 2, 3, 6, 2, 3, 4, 7, 8]
+    groupSize = 3
+    assert Solution().isNStraightHand(hand, groupSize) is True
+
+    hand = [1, 2, 3, 4, 5]
+    groupSize = 4
+    assert Solution().isNStraightHand(hand, groupSize) is False
+
+
+if __name__ == '__main__':
+    main()

2024-06-June-LeetCoding-Challenge/README.md

@@ -8,7 +8,7 @@
 | June 3 | [2486. Append Characters to String to Make Subsequence](https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/) | Medium | Solved |
 | June 4 | [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | Easy | Solved |
 | June 5 | [1002. Find Common Characters](https://leetcode.com/problems/find-common-characters/) | Easy | Solved |
-| June 6 | []() |  |  |
+| June 6 | [846. Hand of Straights](https://leetcode.com/problems/hand-of-straights/) | Medium | Solved |
 | June 7 | []() |  |  |
 | June 8 | []() |  |  |
 | June 9 | []() |  |  |
@@ -39,5 +39,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 1 | 1 | 0 |
+| Medium | 2 | 2 | 0 |
 | Hard   | 0 | 0 | 0 |