Very bad solution for anyone in search of performance but here is my take at the challenge using a terminal recursion and TypeScript.
"use strict"; /** * Deduplicate an array * * @example * deduplicate([1, 2, 2, 3, 3, 3]); // [1, 2, 3] * deduplicate(["boom", "boom", "satellite"]); // ["boom", "satellite"] */ function deduplicate<T>([item, ...items]: T[], deduplicated: T[] = []): T[] { if (item === undefined) { return deduplicated; } if (deduplicated.includes(item)) { return deduplicate(items, deduplicated); } return deduplicate(items, [...deduplicated, item]); }
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Very bad solution for anyone in search of performance but here is my take at the challenge using a terminal recursion and TypeScript.