Solution 1 - Stack

Push chars; pop when top equals current.

TimeComplexity: O(n)

SpaceComplexity: O(n)

""" 1047.1 - Remove All Adjacent Duplicates In String - Solution 1 - Stack """

class Solution:
    def removeDuplicates(self, s: str) -> str:
        st = []
        for c in s:
            if st and st[-1] == c:
                st.pop()
            else:
                st.append(c)
        return "".join(st)

package main

func removeDuplicates(s string) string {
	st := make([]byte, 0, len(s))
	for i := 0; i < len(s); i++ {
		c := s[i]
		if len(st) > 0 && st[len(st)-1] == c {
			st = st[:len(st)-1]
		} else {
			st = append(st, c)
		}
	}
	return string(st)
}

func main() {}

fn remove_duplicates(s: &str) -> String {
	let mut st: Vec<char> = vec![];
	for c in s.chars() {
		if st.last() == Some(&c) { st.pop(); }
		else { st.push(c); }
	}
	st.into_iter().collect()
}
fn main() {}

1047 - Remove All Adjacent Duplicates In String

Solution 1 - Stack