LeetCode: Remove All Adjacent Duplicates In String Solution

Approach

Push every character to stack

If the upcoming character is equal to the top character of the stack, pop the stack and skip pushing

Implementation

1/**
2 * @param {string} s
3 * @return {string}
4 */
5var removeDuplicates = function (s) {
6  const stack = []
7
8  for (const char of s) {
9    const top = stack.slice(-1)[0]
10    if (top === char) {
11      stack.pop()
12    } else {
13      stack.push(char)
14    }
15  }
16
17  return stack.join("")
18}

Trick used

Get last element of an array

1array.slice(-1)[0]