We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def divisibleSumPairs(n, k, ar):
combinations = 0
for i in range(n):
for j in range(i + 1, n):
if (ar[i] + ar[j]) % k == 0:
combinations += 1
return combinations
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Divisible Sum Pairs
You are viewing a single comment's thread. Return to all comments →
def divisibleSumPairs(n, k, ar): combinations = 0 for i in range(n): for j in range(i + 1, n): if (ar[i] + ar[j]) % k == 0: combinations += 1 return combinations