Get Pairs Count

Problem Overview

• Count pairs of processes whose resource requirements differ by at most k.
• Input: process[n] (1 ≤ n ≤ 2e5, 1 ≤ process[i] ≤ 1e6) and k (0 ≤ k ≤ 1e6); Output: long integer count of such pairs.
• Context: multi-process analysis tool assessing computational intensity.
• This coding interview problem was asked in Amazon interviews and is a common interview question.