LV.2 :: 짝지어 제거하기

https://school.programmers.co.kr/learn/courses/30/lessons/12973

프로그래머스

 

function solution(s) {
    const stack = [];

    for (let letter of s) {
        if (stack.length > 0 && stack[stack.length - 1] === letter) {
            stack.pop();
        } else {
            stack.push(letter);
        }
    }

    return stack.length === 0 ? 1 : 0;
}