I had an initial phone interview with the recruiter, followed by two technical phone interviews.

The first technical interview went really well; the interviewer was professional.

The second interviewer had an accent that was difficult to understand, but other than that, it was a good interview.

I feel Facebook's interview process is weird; in spite of doing well, you may still get rejected.

Some questions on graph theory were asked, and then I was asked to write a function to check if a graph was bipartite.

Given two binary trees, return true if they have the same elements (irrespective of tree structure).

Given a string, remove all characters from the string that are present in another string, referred to as a filter.