Meta E3 Virtual Full Loop

Meta E3 Virtual Full Loop

Round 1:

• Buildings With an Ocean View
• LRU Cache

Round 2:

• Minimum Remove to Make Valid Parentheses with in-place replacement (O(1) space)
• Basic Calculator II without using a stack (O(1) space)

I answered all questions with optimal solutions except for Basic Calculator II. I initially provided a stack-based solution, and the interviewer asked me to optimize it to avoid O(n) space. I attempted to optimize it and arrived at a solution with the interviewer's help, but I did not have time to thoroughly test it. I am hopeful for an offer.

UPDATE: Currently in the team matching process.