Hi I wanted to share with you my experience I had in the phone interview at fb london.

The interview was about 50 mins. I had 2 questions where I had to solve each one in 20 mins, so be careful while studying to time yourself to only 20 mins this will help you a lot during the interview as this was the main reason I wasn't able to solve.

However the interview itself was very basic, you just need to practice a lot and be able to write code quickly.

First question, design a function that works like cdir in linux, so the input for you will be a certain path and based on that it should generate the path it would navigate to. I can't remember the exact example I was given but it's basically conditions and strings manipulation.

Second question, Search for a node that is nearest to a given node in a BST. At first I suggested using Breadth First Search it was okay but the interviewer wanted more efficient which is supposed to be a normal binary search tree traversing so we can achieve O(log(n)).

The question is also very simple if you solved a lot of examples here.

Finally make sure at the day of the interview you are sleeping well, and before the interview you should warm up very well so your mind is sharp when you start the interview.

Good Luck!