Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Remove All Adjacent Duplicates In String

Explore how to identify and remove adjacent duplicate characters in strings by applying stack operations. This lesson helps you understand stack usage for solving string manipulation challenges commonly asked in coding interviews.

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

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Remove All Adjacent Duplicates In String

1.

What will be the output after removing all adjacent duplicates from the string given below?

string = “azxxzy”

A.

azzy

B.

axxy

C.

ay

D.

" "

1 / 3

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4

Try it yourself

Implement your solution in the following coding playground:

Java
usercode > Main.java
import java.util.*;

public class Main{

    public static String removeDuplicates(String s) {



        // Replace this placeholder return statement with your code

        return "";

    }

}
Remove All Adjacent Duplicates In String