Meta Phone Screen
- Result
- Ongoing
- Posted
- 6 Sept 2025
Summary
I successfully passed my phone screen at Meta, solving two LeetCode problems: Minimum Remove to Make Valid Parentheses and Range Sum of BST, even though I had a brief moment of struggle on the second question.
How it went
I recently had my phone screen at Meta and passed last week. I'm really glad to share my experience. My interviewer was incredibly nice and chill, which I believe really helped me out, especially when I fumbled a bit in places I shouldn't have. He didn't ask for many follow-ups or questions during my implementation, besides having me run through another example for each problem. I think I was able to pass mainly because my interviewer was cool and understanding.
Questions asked (2)
- 01
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms · Medium
Open the problemFor the first question, I was given Minimum Remove to Make Valid Parentheses. I finished this one pretty quickly. I discussed using a stack-based approach but then mentioned I could also achieve an O(1) space solution. I was provided example inputs and outputs, and I did dry runs for a couple of them.
- 02
Range Sum of BST
Data Structures & Algorithms · Easy
Open the problemThe second question I faced was Range Sum of BST. I almost blanked on this one but thankfully managed to pull myself together. The code I wrote was a bit clunky, but I checked it later, and it passed on LeetCode. I did a dry run of a provided example, getting a bit mixed up in the middle but quickly getting myself back on track.