Initial technical screening.

Virtual onsite.

Two rounds of algorithm and design questions.

I was forced to use my non-preferred language of choice to answer the questions, which frankly made the entire process a waste of time. I was not going to be able to quickly and succinctly solve many problems in TypeScript. Having to think about syntax and not having that implicit muscle memory makes it extremely hard.

Asked to determine the text of the most nested parentheses:

A(B(C)) -> C

Find all routes between two given nodes (e.g., A, D): A -> B B -> C B -> D C -> D

Routes: A, B, C, D A, B, D