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.
possible_comb = list()
for comb in itertools.combinations(ar, 2):
if (comb[0] + comb[1]) % k == 0:
possible_comb.append(comb)
return len(possible_comb)
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):