Count Fair Pairs | Dataford Interview Questions

Ivanti Neurons can compare numeric attributes from endpoint records when evaluating device groups. Given an array of integers nums, count the number of index pairs (i, j) that satisfy all of the following conditions:

0 <= i < j < len(nums)
lower <= nums[i] + nums[j] <= upper

Return the total number of fair pairs. Each pair is identified by its indices, so duplicate values at different indices must be counted separately.

Formal Specification

Implement count_fair_pairs(nums, lower, upper), where nums is a list of integers and lower and upper are integer bounds. Return an integer containing the number of valid pairs. The input array may be reordered.

Constraints

1 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= lower <= upper <= 10^9
The result fits in a signed 64-bit integer.

Function Signature

def count_fair_pairs(nums, lower, upper):

Your question is Count Fair Pairs. 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

0 <= i < j < len(nums)
lower <= nums[i] + nums[j] <= upper