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.
Same idea, but using the Stream's count() method which I believe is more idiomatic:
// Complete the divisibleSumPairs function below.staticintdivisibleSumPairs(intn,intk,finalint[]ar){return(int)IntStream.range(0,ar.length).mapToLong(baseIndex->Arrays.stream(ar,baseIndex+1,ar.length).filter(value->(ar[baseIndex]+value)%k==0).count()).sum();}
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 →
Same idea, but using the Stream's
count()
method which I believe is more idiomatic: