Solution: Python
1 2 3 4 5 6 7 8 9 10 11 | def sockMerchant(n, ar): d = dict() for a in ar: if a in d.keys(): d[a] += 1 else: d[a] = 1 re = 0 for k in d.keys(): re += (d[k] // 2) return re |