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.
publicstaticintdivisibleSumPairs(intn,intk,List<Integer>ar){// Write your code hereintcount=0;for(inti=0;i<ar.size();i++){for(intj=i+1;j<ar.size();j++){if((ar.get(i)+ar.get(j))%k==0){count++;}}}returncount;}
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 →
This was my solution using JAVA