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.
defdivisibleSumPairs(n,k,ar):# Write your code herepairs=0foriinrange(len(ar)):forjinrange(i+1,len(ar)):if(i<jand(ar[i]+ar[j])%k==0):pairs+=1returnpairs
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 →
pythob