Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1128. Number of Equivalent Domino Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source