← Goldman Sachs questionsCount pairs with difference divisible by k
Filed under Goldman Sachs
Given an array of integers and a number k, find the number of pairs (i, j) such that i < j and (arr[i] - arr[j]) is divisible by 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 Goldman Sachs questions
Collected from public candidate posts and coding forums. Updated Nov 2026.