You are viewing a single comment's thread. Return to all comments →
# **JAVA SOLUTION** public static int divisibleSumPairs(int n, int k, List<Integer> ar) { // Write your code here int max=0; int count=0; for(int i=0;i<ar.size();i++) { for(int j=i+1;j<ar.size();j++) { max=ar.get(i)+ar.get(j); if(max%k==0) { count++; } } } return count; } }****
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 →