Answer
A Set only stores unique values — adding a duplicate is a no-op — and lookups with .has() are much faster (O(1) on average) than an array's .includes() (O(n)).
const set = new Set([1, 2, 2, 3]);
console.log(set.size); // 3
console.log(set.has(2)); // trueReal-world example Tracking which user IDs have already been processed to avoid duplicate work.