Leetcode Problem 1512. Number of Good Pairs

1512. Number of Good Pairs

Leetcode Solutions

Hash Map Approach for Counting Good Pairs

  1. Initialize ans to 0, which will hold the count of good pairs.
  2. Initialize a hash map counts to keep track of the frequency of each number.
  3. Iterate over each number num in the input array nums.
    • For each num, increment ans by counts[num] (the number of times num has been seen before).
    • Increment counts[num] by 1.
  4. After iterating through all numbers, return ans.
UML Thumbnail

Brute Force Approach for Counting Good Pairs

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...