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.
C#
var remainderCounts = new int[k];
var count = 0;
foreach (var num in ar)
{
var remainder = num % k;
var complement = (k - remainder) % k;
count += remainderCounts[complement];
remainderCounts[remainder]++;
}
return count;
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 →
C# var remainderCounts = new int[k]; var count = 0;
foreach (var num in ar) { var remainder = num % k; var complement = (k - remainder) % k; count += remainderCounts[complement]; remainderCounts[remainder]++; }
return count;