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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Divisible Sum Pairs
  5. Discussions

Divisible Sum Pairs

  • leandro_gessner
     + 0 comments

    Python - one line answer

    from itertools import combinations
...
def divisibleSumPairs(n, k, ar):
    return len([pair for pair in combinations(ar, 2) if (pair[0] + pair[1]) % k == 0])

    Assuming that question statement is wrong because the question is considering i >= j

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in