Number of Good Pairs

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.

LeetCode Problem - 1512: Link | Click Here

class Solution {
    // Method to count the number of identical pairs in an array
    public int numIdenticalPairs(int[] nums) {
        // Variable to store the count of identical pairs
        int count = 0;

        // Nested loop to compare each pair of elements in the array
        for (int i=0; i<nums.length; i++){
            for (int j=i+1; j<nums.length; j++){
                // Check if the elements at positions i and j are identical and i is less than j
                if ((nums[i]==nums[j]) && (i<j)){
                    // Increment the count if a pair is found
                    count++;
                }
            }
        }
        // Return the final count of identical pairs
        return count;
    }
}