Glassdoor is your free inside look at Facebook interview questions and advice. All 664 interview reviews are posted anonymously by Facebook employees and interview candidates.
Accepted Offer – Reviewed Mar 13, 2013
Interview Details
Write a program to sum two binary numbers represented as strings.
Input: "110", "01101"
Output: "10011"
Interview Question – 2nd ques- add if the numbers are of any base .. View Answers (2)
No Offer – Interviewed in Jan 2013 – Reviewed Feb 25, 2013
Interview Details
Initial Communication -
Email from recruiter asking to solve a problem on Interviewstreet. Simple enough. Led to phone interview with a Facebook engineer.
Phone interview questions -
Check if given string is a palindrome
Fibonacci series generator
Interview Question – None. View Answer
No Offer – Reviewed Feb 22, 2013
Interview Details Good people. Know their stuff. You need to read the job description really well and be sure that you speak to the requirements because *they* may not ask for them precisely in the interview: none the less are expecting you to cover these. They are perhaps more concerned with standard methods than they initially project. Carefree attitude in some employees in interview process, others are VERY interested to hear about process.
Interview Question – Describe your ideation process... View Answer
No Offer – Interviewed in Hyderābād Sep 2012 – Reviewed Feb 10, 2013
Interview Details I first had a coding contest organized in the school, which was on the interviewstreet platform. After that, I had an on-site interview at Facebook, Hyderabad office. Interviewers were flown from the HQ for the process. There were a total of 1/2/3 interview rounds depending on the performance on previous interviews. I had a very positive experience overall. The recruiter and other staff were very pleasant.
Interview Question –
Questions asked -
1. Longest common substring between two strings A and B.
2. Find the successor/predecessor of a binary search tree.
Answer Question
No Offer – Reviewed Jan 31, 2013
Interview Details
I faced three 1 on 1 interview rounds, each with one coding question.
Round 1: Given an undirected graph and a node, modify the graph into a directed graph such that, any path leads to one particular node.
Round 2: Given a matrix of size mXn, and a list of cells, find the number of paths from the top left cell to the bottom right cell.
Round 3: Solve a linear equation in one variable, where the possible operands are +,- and * along with brackets. For eg. (2x + 5 - (3x-2)=x + 5)
The interviewers themselves were very helpful, prodding me towards the right answer, and it was a good experience overall
Interview Question – The questions weren't tough as such, I fumbled a bit with the code for the matrix question which i guess could have been handled better. Answer Question
Accepted Offer – Interviewed on New Delhi Feb 2011 – Reviewed Dec 23, 2012
Interview Details I was hired through Campus interview at IIT
Interview Question – The most difficult question was programming question where I had to design the best way to search for words starting with a particular word in a dictionary View Answer
Negotiation Details – Well the offer was fixed
Accepted Offer – Interviewed on Surathakal Aug 2011 – Reviewed Dec 13, 2012
Interview Details I had to clear a online coding challenge. After that I had 4 rounds of this interview, one after the another on the same day. Most of the questions were technical in nature focusing on algorithms and problem solving. Other questions were based on my project and internships
Interview Question – Can't point my finger on any one of them. View Answer
Accepted Offer – Interviewed in New Delhi – Reviewed Sep 23, 2012
Interview Details
There are varying number of interviews in different colleges. I personally had to undergo a total of 6 rounds-
a) Written - wherein they tested our command over English. The test though not very difficult, will gauge your grasp over grammar.
b) Group Discussion- a group of 6- 7 candidates are expected to debate on 2- 3 topics. Here I believe the key is to put across one's view without coming across as too dominating. Being balanced and constantly engaged always seems to work.
c) First round (interview) - The first round for me was extremely basic and lots of fun. As I was been interviewed for Online Sales Operations (now Global Marketing Solutions), the interviewer asked me questions pertaining to my favorite ad, my thoughts on online advertising etc. It was a very easy interview and was basically to understand if I was aware of the online platform.
d) Second Round - The second round was largely around scrutinizing my resume and later questions pertaining to my future plans. I was honest about when I wanted to pursue my Masters, later got to know that they were looking forward to such honest answers. (Guess lying about you wanting with the company forever, esp if you're an undergrad, won't work :) )
e) The next two round were via Skype and phone. Both of the interviewers were there to gauge one's analytical skills.
Interview Question – Out of the blue a series of extremely random analytical questions View Answer
Negotiation Details – Since I was a campus recruit, no negotiations :/
No Offer – Interviewed in Bangalore Mar 2011 – Reviewed Sep 22, 2012
Interview Details I applied in 2011 march and got a call from the HR, she discussed my profile and we had a good discussion and she told me she will get back how ever there was no response then I called to followup and finally she told me that the position is on hold
Interview Question – It was mentally rigorous and focussed on my resume View Answer
Accepted Offer – Interviewed on Bangalore Apr 2012 – Reviewed Jul 22, 2012
Interview Details
I was contacted by a recruiting agency for software engineering position at Facebook, and after I told them I was willing to apply, my resume was forwarded to Facebook's recruiter. Next day, I got an email from the FB recruiter with a link to an online coding test on interviewstreet. This test was for one hour duration, designed to test coding skills of the interviewer. It was a string parsing problem and code could be written in any language and we'd just need to submit the output on a given input set. I got an email later from the Facebook people that I passed that test and would need to do a phone interview. My phone interview was scheduled in a week.
An engineer called me up for the phone interview and asked about my work projects. I explained to him briefly and also got to know a little about his work at Facebook. He then followed onto the technical interviewing part and posed a problem for me. We were working on a shared document for this part. This was a problem about the classic binary search tree data structure, like an RB Tree. I coded a simple solution and I was asked to analyse its runtime complexity. I analysed the complexity and was able to put it in Big O notation. He was satisfied with that solution and then moved onto talking about his work, what Facebook is expecting from the candidates and such. The conversation quickly ended after that . A couple weeks later, their recruiter informed me that I passed the phone interview and would be scheduled personal interviews.
About a month after my phone interview, it was the day for the personal interviews and I was flown into their interviewing location. I had two technical interviews that day and another general, informal get-to-know-you-and-your-work type of interview. For technical interviews, code was to be written on a whiteboard. In one of the technical interviews, I was told to come up with an algorithm for a variation of the classic knapsack problem. This could be solved with a dynamic programming and I coded the same on the whiteboard. It's important to explain how the solution was arrived at. After coding it up, I was asked to analyse its complexity. I'd written a recursive solution and I could only write a recurrence relation for the complexity function, not a closed form. I also told him that an interative solution is also possible and wrote it out too. Being an iterative code, with a simple nested loop, it was also easy to analyse its complexity. The interviewer was actually ok with the recurrence relation for the complexity and didn't bug me on an exact form. He seemed satisfied with my solution and then we moved onto general topics. Interview was quickly over after that.
For the second technical interview, I was asked a problem on balanced binary search trees. I'd previously implemented an RB Tree and that experience helped me very much for this interview. Without this experience, I couldn't have solved that problem and would've been rejected. I was asked the classic interview problem on sorted-but-rotated array. I knew the solution for this one and it involved binary search. I wrote the solution for this one and the interview was quickly over after that.
I was told to provide 3 personal references on that day and left for home. About 2 weeks later, I was informed that there would be another technical interview. In this interview, I was asked to implement a simple regex parser. Conceptually, some what simpler than the other interviews, but getting the implementation correct was tricky for this one. I got it right and he was satisfied with the code. I was also then asked about the runtime complexity for the solution. I left the interview confidently.
A week later, I was offered the job. Generally speaking, good programming skills help a lot in getting this job. On top of that, I'd suggest reading the CS algorithms textbook by Cormen. Writing good code, with a clear understanding of its complexity is a must.
Interview Question – About my college education. View Answers (3)
Loading...
We're making the world more open and connected. Want to help? Working at Facebook means doing what you love. We hire trailblazers, hackers and pioneers. We want people who can solve challenging problems… — Full Overview
Provided by employer [?]
This is the employer's chance to tell you why you should work for them. The information provided is from their perspective.
Would you like us to review something? Please describe the problem with this {0} and we will look into it.
Sorry, but your feedback didn't make it to the team. Your input is valuable to us – would you mind trying again?
The difficulty rating is the average interview difficulty rating across all interview candidates.
The interview experience is the percentage of all interview candidates who said that their interview experience was positive, neutral or negative.
Your response will be removed from the review – this cannot be undone.
Copyright © 2008–2013, Glassdoor. All Rights Reserved. Your use of this service is subject to our Terms of Use and Privacy & Cookies Policy. Glassdoor ® is a registered trademark of Glassdoor, Inc.
Simply post an anonymous review for a recent interview experience or current/former employer. Your post is anonymous – and if you're worried someone will be able to identify your review, you can even post without telling us your job title and location. Learn More.
No thanks – I'll just look around