A Solution to Leetcode 1007. Minimum Domino Rotations For Equal Row

Problem statement In a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the i-th domino. (A domino is a tile with two numbers from 1 to 6 - one on each half of the tile.) We may rotate the i-th domino, so that tops[i] an...