Hey everyone. I got asked these questions yesterday for my Meta interview. Please give it an upvote if you will

• 1249. Minimum Remove to Make Valid Parentheses
        I coded it using a stack solution first. Followup was to code without stack. The interviewer wanted O(1) space complexity which wasn't really possible because of Python but I explained a solution without using stack and they were okay with it.
• 650. Lowest Common Ancestor of a Binary Tree III
       The exact same question but the example used letters instead of numbers. Gave them an optimal solution with O(1) space. Didn't brute force cause time was running out since I had to rewrite code for first one. Interviewer was satisfied.

Overall my code was correct since they are common questions however the interviewer did spot a bug in my first code which I corrected and my explanation wasn't that great for the second question but they said my solution was okay and they understand. Hopefully I get a pass. Best of luck!

Location: Bay Area/Seattle
3YOE
Interviewer reached out randomly. I had applied for roles like 5 months prior but got rejected from all of them at resume screen.