One-hour phone screen followed by a one-hour technical interview.

Both interviews followed the same format, with the exception that video was turned on for the second interview.

Candidates were required to SSH into the company's servers and solve LeetCode-esque problems.

Phone Screen 1:

Q1: Some questions about BSTs. The BST had a parent pointer, which kind of threw me off, since I didn't realize it did until about 20 minutes into the question. I think one of the questions was printing the BST in order (aka do an inorder traversal).

Q2: Finding Islands on Leetcode.

Final Rd Interview:

Q1: Finding the missing element in a sorted, consecutive list of numbers, aka [11, 12, 13, 15]. This is very easy to do with binary search.

Q2: Given a linked list, modify it in place to contain only the Fibonacci-indexed nodes. For example, it should only contain the 0th, 1st, 2nd, 3rd, 5th, 8th, etc. nodes. This was pretty tricky, but I somehow did it without the interviewer's help.

No behavioral questions at all, which I appreciated.