This is a solution for the 'Divisible sum pairs' by hackerrank

Divisible Sum Pairs by Hackerrank

function divisibleSumPairs(n, k, ar) {
    let sum = 0;
    let pairs = 0;
    //two loops
    for(let i = 0; i<ar.length; i++){
        //second loop
        for(let j = i+1; j<ar.length; j++){
            if((ar[i]+ar[j])%k==0){
                pairs++;
            }
        }
    }
    return pairs;
}