Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1128. Number of Equivalent Domino Pairs
Count how many index pairs (i < j) of dominoes are equivalent up to rotation (i.e., [a,b] equals [c,d] if {a,b} = {c,d}). Normalize each domino to an order-insensitive form (e.g., (min,max)) and total the combinations from duplicate normalized forms; n ≤ 4×10^4 and values are 1..9.
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.