[Programmers] (2017 팁스타운) Lv 2. 짝지어 제거하기

https://school.programmers.co.kr/learn/courses/30/lessons/12973?language=javascript 

프로그래머스

 

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

    for(let i = 0 ; i < s.length ; i++ )
        (!stack.length || stack[stack.length - 1] !== s[i]) ? stack.push(s[i]) : stack.pop();
    
    return stack.length ? 0 : 1;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/12973.%E2%80%85%EC%A7%9D%EC%A7%80%EC%96%B4%E2%80%85%EC%A0%9C%EA%B1%B0%ED%95%98%EA%B8%B0

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드