There is great pay. There are great colleagues if you find the right team.
Too much pressure to perform. Everything revolves around the performance cycle, and people who game the system get promoted rather than talented folks.
4 Rounds Round 1: Talking with recruiter to see if your interests align with Facebook. Round 2: Phone Screen (45 Minutes) - Algorithm and Data Structure. Round 3: Phone Screen (45 Minutes) - Algorithm and Data Structure. Round 4: Onsite for entir
It was an on-campus interview. Before this, I submitted my resume at a career fair. The interview consisted of: * Questions about my resume * Two medium-level coding questions The interviewer was nice. Coding was done on a whiteboard. The intervie
1. Calculate the square root of a double. 2. Given n intervals [si, fi], find the maximum number of overlapping intervals. 3. Print all the paths from the root to every leaf in a binary tree. 4. Print the sum of all numbers at every vertical level
4 Rounds Round 1: Talking with recruiter to see if your interests align with Facebook. Round 2: Phone Screen (45 Minutes) - Algorithm and Data Structure. Round 3: Phone Screen (45 Minutes) - Algorithm and Data Structure. Round 4: Onsite for entir
It was an on-campus interview. Before this, I submitted my resume at a career fair. The interview consisted of: * Questions about my resume * Two medium-level coding questions The interviewer was nice. Coding was done on a whiteboard. The intervie
1. Calculate the square root of a double. 2. Given n intervals [si, fi], find the maximum number of overlapping intervals. 3. Print all the paths from the root to every leaf in a binary tree. 4. Print the sum of all numbers at every vertical level