Number of Good Pairs at Sony
Easy89.8% acceptance
This problem has 62.5% frequency at Sony.
Problem Description
Given an array of integers `nums`, return _the number of**good pairs**_. A pair `(i, j)` is called _good_ if `nums[i] == nums[j]` and `i` < `j`.
Read full problem and hints