How should I practice Repeated Adjacent Pair Deletion?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Repeated Adjacent Pair Deletion associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Repeated Adjacent Pair Deletion

Google● EasyNEW GRADONSITE INTERVIEW

Learn

Problem statement

Given a string s, repeatedly remove adjacent pairs of equal characters. After a removal, newly adjacent equal characters must also be removed.

Return the unique stable string that remains. The process is equivalent to applying removals from left to right with a stack.

Function

removeAdjacentPairs(s: String) → String

Examples

Example 1

s = "ACCAB"return = "B"

Remove CC to get AAB, then remove AA to get B.

Example 2

s = "abbaca"return = "ca"

Removing bb creates aa, whose removal leaves ca.

Example 3

s = "abc"return = "abc"

No adjacent pair is equal.

Constraints

0 <= s.length <= 200000.
s contains ASCII letters.