Remove All Adjacent Duplicates In String

Try to solve the Remove All Adjacent Duplicates In String problem.

We'll cover the following

Statement

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.

Constraints:

  • 1≤1 \leq string.length ≤103\leq 10^3
  • string consists of lowercase English alphabets.

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy