Meta Phone Screen | E4 | London | Passed

Meta Phone Screen | E4 | Passed

Questions:

1. Insert into a Sorted Circular Linked List
2. Variant of Binary Tree Right Side View

On the first question, I missed the edge cases for an empty list and a list with one element. Luckily, after I finished the initial solution, the interviewer provided these cases and asked if my code would pass. I correctly identified the failure and, given a minute, was able to fix the code.

The second question was a variation of the Binary Tree Right Side View problem, requiring both the left and right side views in a single list. The left side was to be presented in leaf-to-root order, and the right side in root-to-leaf order. I solved this without any issues.

I received notification later that I had advanced to the onsite stage.

For scheduling, the onsite interviews do not need to be completed all in one day. The scheduling coordinator can be contacted to arrange a schedule that suits your needs. For example, I scheduled my two coding interviews on one day and the design and behavioral interviews later.