Loading
Loading
A text buffer collapses any two adjacent identical characters, repeatedly, until no such pair remains. Removing a pair can bring two new neighbours together, which may then collapse as well.
Return the fully collapsed string.
text = "abbaca""abbaca"bb collapses"aaca"the new aa collapses"ca"nothing adjacent matches"ca"Sign in to keep a note here. It is free, and nobody else can see it.
Sign inExample 1
Sign in to open hints.
Struggling is where the learning happens. Open this once you have genuinely tried, or once the hints have run out.
O(n) time · O(n) space
Input. Run your code to watch it work on this input, one line at a time.
Running code is turned off on this deployment. You can still read the problem, write code, use hints and the visualizer.
Tab moves focus out of the editor. Press Ctrl+M to let Tab indent instead.
No results yet
Run your code against the sample tests, or submit to run the full suite.
Example 2
xx collapses, then the new zz collapses.
Example 3