Question Details
Problem Remove adjacent duplicate characters from a string repeatedly until no adjacent duplicates remain, using a stack. Likely LeetCode equivalent LC 1047 - Remove All Adjacent Duplicates In String (>80% confident) Tags stack, strings
Full Details
🔒
Unlock all Grammarly questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a reported interview question from a grammarly interview during the phone round.
It covers the following topics: Strings, Phone, Coding, Onsite, Stack .
More Grammarly Interview Questions
1p3a
grammarly software engineer onsite interview experience
InterviewDB
All K Substrings - Generate All Substrings of Exactly Length K
InterviewDB
Grammarly SWE Phone - Duplicate and Missing Numbers
InterviewDB
Grammarly SWE Phone - Fibonacci Number
InterviewDB
Grammarly SWE Onsite - Merge Correction