All interviews were technical.

I started with an on-campus interview in September. There was a hold on submitting candidates to the final round that was lifted in December.

I then flew out to Seattle for four more interviews, each spaced out with a 15-minute break.

Print all nodes in a binary tree in order without recursion.

Return the longest palindromic substring.

Print nodes in a balanced tree level by level, reversing the print order every other level.

Get the k largest elements in a list. The list is extremely large and does not fit in memory. Write actual test cases.

Determine if a linked list is circular. Give upper and lower bounds on runtime, considering the choices made for an optimal ratio.