Card Flipping Game Python Solution with Tests

lcpy gen -n 822   # by problem number
lcpy gen -s card_flipping_game   # by problem name

Input: fronts = [1,2,4,4,7], backs = [1,3,4,1,3]
Output: 2
Explanation:
If we flip the second card, the face up numbers are [1,3,4,4,7] and the face down are [1,2,4,1,3].
2 is the minimum good integer as it appears facing down but not facing up.
It can be shown that 2 is the minimum possible good integer obtainable after flipping some cards.

Input: fronts = [1], backs = [1]
Output: 0
Explanation:
There are no good integers no matter how we flip the cards, so we return 0.

class Solution:
    # Time: O(n)
    # Space: O(n)
    def flipgame(self, fronts: list[int], backs: list[int]) -> int:
        stuck = {f for f, b in zip(fronts, backs, strict=True) if f == b}
        candidates = [x for x in fronts + backs if x not in stuck]
        return min(candidates, default=0)