Solving Number of Equivalent Domino Pairs in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

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

Constraints:

  • 1 <= dominoes.length <= 40000

  • 1 <= dominoes[i][j] <= 9

  • 1 <= dominoes.length <= 40000

  • 1 <= dominoes[i][j] <= 9

See the full details of the problem Number of Equivalent Domino Pairs at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go