Applied online.

Received a phone interview request one month later. The phone interview happened one week after the request.

One week after the phone interview, I was requested to fly in for an on-site interview.

Three weeks later, I flew up and had two 45-minute interviews.

The interviews focused on managing memory complexity over time complexity, which is not stated before you try to solve a problem.

Questions focused more heavily on data structures over the algorithms that operate on them (most of the algorithms were trivial for the best case).

Interviewers heavily focused on amortized time analysis of algorithms and hand-waved away the memory complexity of stacks, queues, linked lists, etc.

Remove duplicate numbers in an array in O(n) time, in place.

Remove vowels (function blackboxed to check whether a letter is a vowel) from a string in O(n) time, in place.

Check whether a singly linked list of letters is a palindrome in O(n) time, in place.

Reconstruct a binary tree of unique digits from any combination of prefix, infix, or postfix lists of the digits.