I did my meta phone screen today and got these 2 questions:\n\n\n* https://leetcode.com/problems/minimum-add-to-make-parentheses-valid\n* https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/\n\nI did the first question perfectly and dry run it on test cases\nFor the second one, I implemented the Node class and added the parent pointer, I explained the approach and the interviewer agreed, but told me to not use it. I took some time to come with a DFS approach without parent pointer, the interviewer also agreed, I started implementing it, but time was up halfway so I didn\'t fully implement it.\n\nWhat do you think ? I heard that we should have 2 working solutions to pass \n\nEdit: invited to onsite :)

I did my meta phone screen today and got these 2 questions:\n\n\n https://leetcode.com/problems/minimum-add-to-make-parentheses-valid\n https://leetcode.com/pro