[Leet Code] Number of Good Pairs

Leetcode: https://leetcode.com/problems/number-of-good-pairs/

Problem:

Given an array of integers nums.A pair (i,j) is called good if nums[i] == nums[j] and i < j.Return the number of good pairs.

Example:

Input: nums = [1,2,3,1,1,3]
Output: 4
Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.

Solution:

class Solution(object):
def numIdenticalPairs(self, nums)…