Hi,

I recently gave a facebook phone screen interview for a new grad role. Honestly both were Leetcode Easy problems and inspite of solving them perfectly on time with god code quality and dry runs they rejected me for some strange reason.

Problem 1 : Give a sorted array find the list of closest elements at a distance of k from a given element.
Solution : Use binary search and store each such element in a new arraylist and return it.

Problem 2 : Given a binary tree print the right view of the tree.
Solution : Either iterative or recursion is fine.

My opinion : FAANGs rejected me inspite of performing well and solving all of the problems because I lacked FAANG level speed,skill accuracy, precision, confidence and communication. I had some nervousness in all the interviews because of the hype they have. Once you get past this nervousness and ignore the overhyped interviews I think anybody with good LC coding experience can crack these interviews.