You are viewing a single comment's thread. Return to all comments →
function divisibleSumPairs(n, k, ar) { let count = 0; for(let i=0; i< n-1 ; i++) { for(let j=i+1 ; j< n ; j++){ if((((ar[i]+ar[j]) % k) === 0)) { count++; } } } return count; }
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 →
function divisibleSumPairs(n, k, ar) { let count = 0; for(let i=0; i< n-1 ; i++) { for(let j=i+1 ; j< n ; j++){ if((((ar[i]+ar[j]) % k) === 0)) { count++; } } } return count; }