HackerRank: Sock Merchant (Easy)
Link to code challenge
function sockMerchant(n, ar) {
let pairs = 0;
let sum = 1;
let arr = ar.sort();
for (let i = 1; i <= ar.length; i++) {
if (arr[i] === arr[i - 1]) sum++;
else {
if (sum > 1) pairs += Math.floor(sum / 2);
sum = 1;
}
}
return pairs;
}
Comments
Post a Comment