1st call:\nhttps://leetcode.com/problems/buildings-with-an-ocean-view/description/\nhttps://leetcode.com/problems/lru-cache/description/\n\n2nd call:\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/ with in place replacement aka O(1) space\nhttps://leetcode.com/problems/basic-calculator-ii/description/ with no stack aka O(2) space\n\ngot everything with optimal solution except basic calculator where i gave stack implementation and he asked me to optimize such that it doesnt use O(n) space so I tried and ended up getting somewhat of a final solution with help of interviewer but didnt have time to test. Hopefully I get an offer\n\nUPDATE: Currently in team matching process

1st call:\nhttps://leetcode.com/problems/buildings-with-an-ocean-view/description/\nhttps://leetcode.com/problems/lru-cache/description/\n\n2nd call:\nhttps://l