Optimizing a Performance Bottleneck | Dataford Interview Questions

How would you optimize a function that is currently a performance bottleneck?

For this task, the bottleneck counts every pair of equal values in an integer array. Implement an optimized replacement that returns the number of index pairs (i, j) where i < j and values[i] == values[j].

Input/output contract: values is a list of integers; return an integer count. The result must be correct for duplicate values, negative values, and an empty list.

Constraints

0 <= len(values) <= 1000
-10^9 <= values[i] <= 10^9
Return the number of index pairs with equal values

Function Signature

def count_duplicate_pairs(values):

Your question is Optimizing a Performance Bottleneck. 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

How would you optimize a function that is currently a performance bottleneck?

Input/output contract: values is a list of integers; return an integer count. The result must be correct for duplicate values, negative values, and an empty list.

Constraints

0 <= len(values) <= 1000
-10^9 <= values[i] <= 10^9
Return the number of index pairs with equal values

Function Signature

def count_duplicate_pairs(values):

Your question is Optimizing a Performance Bottleneck. 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.