Meta Phone Screen | E4 | London | Passed

Questions:

1. https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/description/
2. Variant of https://leetcode.com/problems/binary-tree-right-side-view/description/

On first question I have missed the edge cases for empty list and list with one element. Stupid mistake. Luckily, after I've finished verification, the interviewer gave me the cases and asked me if it will pass. I said no, then he gave me a minute to quickly fix the code.

Second one was a variant of the binary tree right side view problem, where you need to give back both left side and right side view in a single list. Left side in leaf to root order, right side in root to leaf order. This I solved without any issues.

I got response in 2 days that I have moved on to onsite stage.

For anyone wondering, you don't have to do onsite all in one day, you can email the scheduling coordinator on the arrangement you want. For example I've wanted to do the 2 coding on one day, and the design and behavioural a week later.