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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Divisible Sum Pairs
  5. Discussions

Divisible Sum Pairs

  • wmgarciaporcel
     + 0 comments

    This is my solution, with JavaScript:

    function divisibleSumPairs(n, k, ar) {
    // Write your code here
    let count = 0;
    while(ar.length>1){
        let i = ar.shift();
        for(let j=0; j<ar.length;j++){    
        let sum = i + ar[j];
        if(sum%k===0) count++;
        }
    }
    return count;
}