Question 1:
The first coding question was about validating a string of parentheses and return whether it has a valid mathematical expression for example str = ‘()’ would be true and str = ‘()(’ would be false (and you build your test cases).
Question 2:
The second question was: given an array that represents a valid binary search tree, construct a function that returns the nodes of the BST. The second question tricked me a little bit since I’m used to solving binary search trees the other way around and not construct them. However, I haven’t heard back from them yet. Will update my post if I pass the interview