Spreading an array into a Set and back into an array is the canonical JavaScript dedupe. Set uses the SameValueZero algorithm for membership, so it correctly treats NaN as equal to itself (unlike ===). It also preserves insertion order, which means the first occurrence of each value wins. Time complexity is O(n) average, but only for primitives. The next accordion shows why this breaks for objects.

new Set(arrayOfObjects) deduplicates by reference identity, which means two distinct objects with identical fields stay in the result. The fix is to project each item to a primitive key (an id, a normalised string, a tuple) and dedupe on that. Storing the first item per key in a Map keeps the original object intact for downstream code. Use this whenever your equality is structural rather than identity, for example deduping API rows, normalising form input, or merging events.

When the difference between 'Apple' and 'apple' is just casing, the dedupe key needs to be normalised before comparison. Building a Map from [normalisedKey, originalValue] pairs keeps the last-seen casing, which is usually what users expect after a paste from a CSV. Swap toLowerCase() for normalize('NFD') if you also need to fold accents (see the js-string-strip-accents snippet). The trade-off is one extra pass over the input, still O(n) time.