terceiro capítulo

[gxnca]

No description provided.

[diogogmatos]

Nice!

[diogogmatos]

That works! However, we can simplify it a lot by using the power of Sets in JS:

let arrDuplicados = [1, 2, 3, 2, 1, 4, 5];
let set = new Set(arrDuplicados)
console.log("Array sem duplicados:", [...set]);

A Set is a list of unique values, when we initialize a set with an array, it automatically removes the duplicated values to create the Set. After that, we can just turn the Set back into an Array with the help of the spread operator (...).

[gxnca]

Dammn, much easier 🤯

[diogogmatos]

Correct :)

A one line solution using reduce could be:

function contarOcorrencias(arr, num) {
    return arr.reduce((acc, curr) => curr === num ? acc + 1 : acc, 0)
}

[diogogmatos]

Also correct!

We could also use reduce for this one like so:

function somarPares(arr) {
    return arr.reduce((acc, curr) => curr % 2 === 0 ? acc + curr : acc, 0)
}

[diogogmatos]

We can also use the power of JavaScript sets for this one 👀

function contarDiferentes(s) {
    const set = new Set(s.split(""))
    return [...set].length
}