← Morgan Stanley questions

Pairs with Difference Equal to K

Filed under Morgan Stanley

Given an array of integers and an integer k, find the count of unique pairs of elements (arr[i], arr[j]) such that the absolute difference between them is equal to k.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Morgan Stanley questions

Collected from public candidate posts and coding forums. Updated Nov 2026.