Just completed my meta technical screen yesterday. Was given two 2 medium LC problems

• https://leetcode.com/problems/nested-list-weight-sum/description/
• https://leetcode.com/problems/basic-calculator-ii/description/ -

Nested list weight sum - I came up with the recursive solution and coded it in time. Interviewer asked follow up about coming up with better space complexity. For the recursive solution, the call stack would have a memory complexity of O(d) where d is max depth of the list. I mentioned that another solution I could think of is by solving it iteratively and using bfs approach with queue but that wouldn't improve the memory complexity still. He then asked whether the the input could be represented as a different data structure to improve memory complexity to which I replied mentioning a tree like structure with elements in different levels of an n-ary tree but kind messed up explaining it since I was just thinking out load. Not sure if his response was positive or negative but we moved on to the next question at the 20 minute mark

Basic Calculator II - This was an easier variant that involved only * and + . Explained my approach of keeping track of cur, prev and curOP and reversing the previous + operation if we encounter * operation. This was the best solution since it was constant space complexity (better than the stack solution). Did a try run of my test cases and code seemed okay. After the interview I realized that I made some indexing issue with the iteration but hopefully interviewer overlooked it.

My interview prep was pretty brief - top 20 questions in the last 30 days meta tagged and both questions were from the list. Should've coded better since I had solved both pretty recently but I guess the interview nerves came in the way. Hoping to hear positive result soon