I had a question on a phone screen first. I was then asked to participate in a university day interview event, where all candidates were university grads.

I had three back-to-back interviews, one of which was concentrated on my background.

There were a few behavioral questions.

Given two sorted arrays, A and B, where len(A) >= len(B), merge array B into array A in-place.

Note that elements in A starting at index len(A) - len(B) are null.

Given a string like "((A9a)))()()())", remove parentheses such that all parentheses are balanced. By balanced, "((A9a))" and "()()" are balanced, while "((()" or "((ra)))" are not.

Your algorithm should run in O(n) time and O(1) space.

Given a list of strings (e.g., ["serer", "ewewr", "ererr", ...]) and another string regex containing a character '', where '' can match any single character, search the list and return a boolean value indicating whether any string in the list can match the regex.

You can use any data structure to store the list. Describe the time complexity and space complexity of your algorithm.

Describe a time when you were taking responsibility for others.