Unique characters in each string: Difference between revisions
m
→{{header|JavaScript}}
m (→{{header|JavaScript}}: Tidied) |
|||
Line 460:
wordCount = ws.length;
return
...ws.slice(1).reduceRight(
(a, x) => intersect(x)(
Line 469:
]
.filter(c => wordCount === charFreqs[c])
.join("");
})() : "";
Line 500 ⟶ 502:
// The intersection of two sets.
b => new Set([...a].filter(i => b.has(i)));
▲ );
| |||