1512. Number of Good Pairs.txt

class Solution {
public:
    int numIdenticalPairs(vector<int>& nums) {
        int n=nums.size();
        int counter=0;
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                if(nums[i]==nums[j]){
                    counter++;
                }
            }
        }
        return counter;
    }
};