Given an array of integers nums, return the total count of good pairs.

A pair (i, j) is considered good if nums[i] == nums[j] and i $<$ j.

Constraints:

• $1 \leq$ nums.length $\leq 10^2$

• $1 \leq$ nums[i] $\leq 10^2$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.