Leetcode 2563. Count the Number of Fair Pairs

Count the number of index pairs (i<j) in nums whose sum lies in [lower, upper]. With n up to 1e5, the challenge is to do better than O(n^2)—typically by sorting and using two-pointers or binary search to count valid complements efficiently.