You are given a string consisting of lowercase English letters. Repeatedly remove adjacent duplicate letters, one pair at a time. Both members of a pair of adjacent duplicate letters need to be removed.

remove-adjacent-duplicates.js

export function removeDuplicates(string) {
  const stack = [];

  for (const char of string) {
    if (stack[stack.length - 1] === char) {
      stack.pop();
    } else {
      stack.push(char);
    }
  }

  let result = "";
  while (stack.length > 0) {
    result = stack.pop() + result;
  }

  return result;
}

// tc: O(n)
// sc: O(n)