Runtime: 1 ms, Number of Good Pairs

**class Solution {
public int numIdenticalPairs(int[] nums) {

    int count=0;
    for(int i =0 ;i<nums.length;i++) { 
        for(int j=0;j<nums.length;j++){
         if(nums[i]==nums[j] && i<j)
             count++;
         }
    }
    
    return count;
}

}**

Comments (0)