Counting Matching Numbers in Arrays | Dataford Interview Questions

Can you write a function to count matching numbers within an array?

Implement count_matching_numbers(nums) to return the number of non-overlapping pairs of equal integers. Each array element may belong to at most one pair; return 0 when no pair exists.

Examples: [1, 2, 1, 2] returns 2; [1, 1, 1] returns 1. Constraints: 0 <= len(nums) <= 1000, and each value is an integer.

Constraints

0 <= len(nums) <= 1000
Each element of nums is an integer
Each element may be used in at most one pair

Function Signature

def count_matching_numbers(nums):

Your question is Counting Matching Numbers in Arrays. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem