Hey y’all, hope studying is going well. Happy to say I have a solution up for Leetcode problem 1047 Remove All Adjacent Duplicates In String as well as the variant Meta commonly asks in their interviews.
This is definitely a top 50 question and TBH I consider it a silent killer since Meta changes the requirements of the OG LC problem quite a bit: what happens if you have to remove all adjacent duplicate letters instead of a single adjacent duplicate? This significantly changes the underlying implementation.
To make matters more confusing, they also ask more variants such as Candy Crush. That, however, will be covered in another video since it’s slightly more similar to LC1209 (but it's arguable).
Okay, one more quick note: a lot of people have been emailing me asking if I'll be able to cover the top 50 questions in the near future. My answer is yes, my plan is to cover Meta’s top 50 frequently asked questions and their variants within the next 2 months or so. In other words, if you want to reschedule your on-site for 1-2 months, then I’ll try to come through. Leetcode is the most important part, yes, but remember there’s also the behavioral and system designs (which I plan on covering in the future).
And for reference, here’s the previous post:
LC 162: Find Peak Element
As a quick note, we’re starting to include the Python code in the repository since people have been requesting it.
Reference to the OG LC problem: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/
Good luck on your phone screens & onsite loops.