I applied on the Facebook website.

A recruiter contacted me about 3-4 weeks later and scheduled an interview on campus, coming to our university.

That was a technical interview where I had two problems based on Data Structures (Trees mainly) and bits manipulation. I passed the interview and was scheduled for one more online.

I was disappointed about the second interviewer; he didn't seem to be really enjoying interviewing and was also doing something else during my interview for some part (about 10 minutes). He finished the interview quite shortly, and I didn't pass to the next one.

Find the k-th smallest element in a BST.

Having a function that generates only 0 or 1, write a function that uses the above function to generate integers in the range [0, n], with n given. Ensure equal probability for all numbers by calling the provided function only as needed.

Given a sorted circular linked list and a new value to insert, along with a link to one of the nodes, insert the new value while maintaining the sorted order of the linked list.

Given N points in space, find the k-th closest ones to the origin.