2 questions-

1. https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ - Solved using deque. This question took little bit extra time.
2. https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/ - Provided stack approach and was asking for without stack. Time was less so he asked me to code stack approach only.

Feedback - Try to write code fast.