k2bd
diff --git a/‎src/advent_of_code/y2023/d7.py
Lines changed: 104 additions & 0 deletions b/‎src/advent_of_code/y2023/d7.py
Lines changed: 104 additions & 0 deletions
@@ -0,0 +1,104 @@
+from dataclasses import dataclass
+from functools import cached_property, total_ordering
+
+from advent_of_code.util import format_solution, puzzle_input
+
+HIGH_CARD = 1
+ONE_PAIR = 2
+TWO_PAIR = 3
+THREE_OF_A_KIND = 4
+FULL_HOUSE = 5
+FOUR_OF_A_KIND = 6
+FIVE_OF_A_KIND = 7
+
+
+@total_ordering
+@dataclass(frozen=True)
+class CamelCardsHand:
+    """
+    Represent a hand with a bid in a game of Camel Cards
+    """
+
+    bid: int
+
+    cards: tuple[int, int, int, int, int]
+
+    @cached_property
+    def hand_type_strength(self) -> int:
+        card_value_counts = {
+            v: sum(1 for c in self.cards if c == v) for v in set(self.cards)
+        }
+        card_counts = card_value_counts.values()
+
+        if set(card_counts) == {5}:
+            return FIVE_OF_A_KIND
+        elif set(card_counts) == {4, 1}:
+            return FOUR_OF_A_KIND
+        elif set(card_counts) == {3, 2}:
+            return FULL_HOUSE
+        elif set(card_counts) == {3, 1}:
+            return THREE_OF_A_KIND
+        elif sorted(card_counts) == [1, 2, 2]:
+            return TWO_PAIR
+        elif 2 in card_counts:
+            return ONE_PAIR
+        else:
+            return HIGH_CARD
+
+    def __eq__(self, other: "CamelCardsHand") -> bool:
+        return self.cards == other.cards
+
+    def __lt__(self, other: "CamelCardsHand") -> bool:
+        if self.hand_type_strength < other.hand_type_strength:
+            return True
+        if self.hand_type_strength == other.hand_type_strength:
+            for self_num, other_num in zip(self.cards, other.cards):
+                if self_num < other_num:
+                    return True
+                elif self_num == other_num:
+                    continue
+                else:
+                    return False
+        return False
+
+    @classmethod
+    def from_input(cls, input_line: str) -> "CamelCardsHand":
+        cards_part, bid_part = input_line.split()
+
+        values_map = {
+            "T": 10,
+            "J": 11,
+            "Q": 12,
+            "K": 13,
+            "A": 14,
+        }
+
+        card_values = tuple(
+            values_map[v] if v in values_map else int(v) for v in cards_part
+        )
+
+        return cls(
+            bid=int(bid_part),
+            cards=card_values,
+        )
+
+
+def part_1(cards_input: list[str]) -> int:
+    hands = [CamelCardsHand.from_input(line) for line in cards_input]
+
+    return sum(i * hand.bid for i, hand in enumerate(sorted(hands), start=1))
+
+
+def part_2(cards_input: list[str]) -> int:
+    pass
+
+
+if __name__ == "__main__":
+    puzzle = puzzle_input(2023, 7)
+
+    print(
+        format_solution(
+            solver_p1=lambda: part_1(puzzle),
+            solver_p2=lambda: part_2(puzzle),
+        )
+    )