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.
functiondivisibleSumPairs(n,k,ar){// Write your code hereletcont=0;for(leti=0;i<n-1;i++){for(letj=i+1;j<n;j++){if((ar[i]+ar[j])%k==0){console.log("true");cont++;}}}returncont;}
Cookie support is required to access HackerRank
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 →
FOR JAVASCRIPT NODEJS