Meta | Phone | Minimum Remove Parenthesis Remove and Binary Tree Vertical Order Traversal

Leetcode has been very helpful to me, so I'm writing a review of my technical phone interview if this can help others!

Interview was two questions:
(1) Minimum remove to make valid paranthesis
(2) Binary tree vertical order traversal

This was a very straightforward interview, and to be honest, I was very surprised to get such common questions.

My interview preparation consisted of working through Meta top 75 questions as I saw on Leetcode this is what to expect.

Hope this helps :)!

Update Going to virtual onsites :)

Comments (8)