중복 인수

// Time complexity - O(n)
// Space complexity - O(n)
function CheckArgsDuplicates(...args) {
    const argumentz = [...args];
    const argsLength = argumentz.length;

    let argCounter = {};
    for (let i=0; i<argsLength; i++) {
        if (argCounter[argumentz[i]]) return true;
        argCounter[argumentz[i]] = 1;
    }

    return false;
}

// one-liner solution which should only be used as naive solution
function CheckArgsDuplicates(...args) {
    return Array.from(new Set(args)).length !== args.length;
}