Python Solution using dict: def divisibleSumPairs(n, k, ar): # Write your code here remainder_count = {} valid_pairs = 0

for num in ar:
    remainder = num % k
    complement = (k - remainder) % k
    if complement in remainder_count:
        valid_pairs += remainder_count[complement]
    if remainder in remainder_count:
        remainder_count[remainder] += 1
    else:
        remainder_count[remainder] = 1
return valid_pairs