Can anybody help to solve this problem ? https://edabit.com/challenge/RG5NJWDa7pZGFkhTA Here is my

Question

Can anybody help to solve this problem ? https://edabit.com/challenge/RG5NJWDa7pZGFkhTA Here is my

solution
const XO = ([...str]) => {
str = str.map(x => x.toLowerCase());
let counter = [0,0];
if(str.length === 1) return false;
if(!str.includes('0') && !str.includes('x')) return true;
str.forEach( x => x === 'o' ? counter[0]++ : x === 'x' ? counter[1]++ : 0)
return counter[0] === counter[1];
}

0

18.06.2019

3 ответов

10 просмотров

Artem Starikov

why not this? const XO = (str) => { const count = [...str.toLowerCase()] // .filter(l => l == "o" || l == "x") .reduce((obj, l) => { obj[l]++; return obj; }, { x: 0, o: 0 }); return count.x == count.o; }

0

18.06.2019

Pavle

0

18.06.2019

Wojciech Pawlik · Accepted Answer

Wojciech Pawlik

Your first 2 conditions are completely unnecessary

0

18.06.2019

Похожие чаты

Can anybody help to solve this problem ? https://edabit.com/challenge/RG5NJWDa7pZGFkhTA Here is my

3 ответов

Похожие вопросы