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 Fibonacchi-indexed nodes. For example, it should only contain the 0th, 1st, 2nd, 3rd, 5th, 8th, etc. nodes. This was pretty tricky but somehow I did it without the interviewers help. No behavioral questions at all, which I appreciated.