30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 1047. Remove All Adjacent Duplicates In String

Given a lowercase string, repeatedly remove any two equal adjacent characters until no more removals are possible and return the resulting (unique) string. Solve in linear time using a stack or in-place two-pointer simulation to handle lengths up to 1e5.

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid March, 2025

Meta

Mid-level

Late January, 2025

Meta

Mid-level

Mid September, 2024

Meta

Senior

Remove all adjacent duplicates in a string (Variation of LeetCode 1047)

Get Premium to View All 5 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1047. Remove All Adjacent Duplicates In String

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact