Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1007. Minimum Domino Rotations For Equal Row
Given two equal-length arrays representing the top and bottom numbers of dominoes, find the minimum number of single-domino rotations (swapping top and bottom) needed so that all entries in the top row or all in the bottom row are the same, or return -1 if impossible. The solution hinges on checking candidate target values that must appear on every domino (on at least one side) and counting required swaps.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.