Solution for "Divisible Sum Pairs" in Hackerrank

Divisible Sum Pairs | Solution | JavaScript.js

const ar = [1, 3, 2, 6, 1, 2];
const n = 6;
const k = 3;
function divisibleSumPairs(n, k, ar) {
    let count=0;
    for(let i= 0;i<n;i++){
       for(let j=i+1;j<n;j++){
           let sum =ar[i]+ar[j];
           if(sum%k===0){
               count++
           }
       }

    }
return count
}
console.log(divisibleSumPairs(n, k, ar))