Went through a technical phone screen with behavioral questions and an easy LeetCode question.

Proceeded to onsite in Seattle; everyone was really nice. Toured the building, ate lunch, and had a Q&A session. Then had 3 rounds of technical interviews, each with 10 minutes of behavioral questions and the rest of the time spent on a LeetCode medium question.

Given a string of parentheses with a mismatched parenthesis, return all solutions of valid parentheses.

Given a log file with function calls and times, find the total runtimes of each function call, given only one function can run at a time and a function can call another function.

N-sum problem.