1007. Minimum Domino Rotations For Equal Row

from collections import Counter
class Solution:
    def minDominoRotations(self, A: List[int], B: List[int]) -> int:
        # time O(A+B) space O(1)
        cntA,cntB,same =Counter(A),Counter(B),Counter()
        if len(A) != len(B):
            return -1
        for a,b in zip(A,B):
            if a == b :
                same[a] += 1
                
        for v in range(1,7):
            if cntA[v] + cntB[v] - same[v] == len(A):
                return  min(cntA[v],cntB[v]) - same[v]
        return -1