You are viewing a single comment's thread. Return to all comments →
Easy JavaScript Solution
let counter = 0 for(var i=0;i<n-1;i++) { for(var j=i+1;j<n;j++) { if((ar[i]+ar[j])%k==0) { counter++ } } } return counter
Please upvote if you like the solution
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 →
Easy JavaScript Solution
Please upvote if you like the solution