Leetcode Problem 1512. Number of Good Pairs
Leetcode Solutions
Hash Map Approach for Counting Good Pairs
- Initialize
ansto 0, which will hold the count of good pairs. - Initialize a hash map
countsto keep track of the frequency of each number. - Iterate over each number
numin the input arraynums.- For each
num, incrementansbycounts[num](the number of timesnumhas been seen before). - Increment
counts[num]by 1.
- For each
- After iterating through all numbers, return
ans.
Brute Force Approach for Counting Good Pairs
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...
OR