divisible sum pairs - HackerRank challenge solution

divisible-sum-pairs.js

// addapted from https://www.hackerrank.com/challenges/divisible-sum-pairs/problem?isFullScreen=true
function divisibleSumPairs(n, k, ar) {
    let counter = 0;
    for(let i = 0; i< n; i++){
        for(let j = 0; j< n; j++){
            if(i < j && (ar[i] + ar[j]) % k === 0){
                counter +=1;
            }
        }
    }
    return counter;
}