Leetcode Problem 1007. Minimum Domino Rotations For Equal Row

1007. Minimum Domino Rotations For Equal Row

Leetcode Solutions

Define a helper function that counts the minimum rotations needed to make all values in tops equal to a target value, considering the corresponding values in bottoms.
Call the helper function twice: once with tops[0] as the target value and once with bottoms[0] as the target value.
If either call returns a non-negative result, return the minimum of the two results.
If both calls return -1, return -1 to indicate that it's not possible to make all values equal.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen