LeetCode — Number of Equivalent Domino Pairs

Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a==c and b==d), or (a==d and b==c) - that is, one domino can be rotated to be equal to another domino.

Return the number of pairs (i, j) for which 0 <= i < j < dominoes.length, and dominoes[i] is equivalent to dominoes[j].

Example 1:

Input: dominoes = [[1,2],[2,1],[3,4],[5,6]]
Output: 1

Constraints:

  • 1 <= dominoes.length <= 40000
  • 1 <= dominoes[i][j] <= 9

Solution:

Equivalent Domino Paris solution — Array

--

--

--

Dell Technologies — VxRail Software Engineer 👨‍💻

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

New Language, New Routes, New Paths, & New Apps

MCL v2 Sneak Peek #9

Easy Hack 2 Apk Free Download

ANTLR in VSCode without import error

My journey through Sheppie

How to Create a Reusable Web Scraper

Cherry Pick Multiple Commits

Flame 1.0 is here!

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Steven Lu

Steven Lu

Dell Technologies — VxRail Software Engineer 👨‍💻

More from Medium

Leetcode Q347. Top K Frequent Elements (Q291)

LeetCode — First Bad Version

Leetcode — Stone Game

12. Integer to Roman | LeetCode | Medium | Java