Cancel out the doubled keystrokes
A faulty keyboard doubles a letter now and then. The cleaner removes any two identical letters sitting next to each other, and keeps going while that leaves a new pair behind.
- Two identical characters next to each other both disappear.
- Removing a pair can bring two more together, and those go too.
- Keep going until no adjacent pair is left.
- Text with nothing to remove comes back unchanged.
collapseDoubles(typed: string) → string
Go needs a compiler and Drill does not host one yet, so this page is the reference rather than an exercise: the problem, worked examples, and the solution in full. To type it out, the same problem runs in Python.
Where you start
func collapseDoubles(typed string) string {
}Worked examples
| Call | Result |
|---|---|
collapseDoubles("abbaca") | "ca" |
collapseDoubles("azxxzy") | "ay" |
collapseDoubles("abc") | "abc" |
collapseDoubles("aa") | "" |
Hint
Build the result on a stack. For each character, either it cancels the one on top or it goes on top — no rescanning needed.
Reference solution in Go
func collapseDoubles(typed string) string {
kept := []rune{}
for _, ch := range typed {
if len(kept) > 0 && kept[len(kept)-1] == ch {
kept = kept[:len(kept)-1]
} else {
kept = append(kept, ch)
}
}
return string(kept)
}