Facebook onsite

facebook logo
facebook
No Offer
January 26, 20221 reads

Summary

I'm sharing my onsite interview experience at Facebook, outlining the specific LeetCode problems I encountered. Additionally, I've provided a comparison of interview difficulties across various tech giants, and I'm happy to report that I ultimately received an offer from Google.

Full Experience

I recently navigated the onsite interview process at Facebook, and I've detailed the specific LeetCode problems I encountered during my rounds below. Having also interviewed with Google, Amazon, and Apple, I've developed a perspective on the relative difficulty of securing a position at each. In my experience, Facebook felt somewhat more accessible than Google, particularly if one has thoroughly prepared using the Facebook-tagged questions on LeetCode; I personally didn't encounter any questions that weren't already on LeetCode. On a difficulty scale, I'd rate Google around a 9, Facebook a 7 (or even a 5 if you've mastered their tagged questions), Apple a 5, and Amazon a 2 or 3, as it primarily focused on fundamental concepts. Although this post recounts my Facebook experience, I ultimately accepted an offer from Google, and things have been going great there. To anyone currently interviewing, keep up the excellent work – you'll achieve your goals!

Interview Questions (4)

Q1
Copy List with Random Pointer
Data Structures & AlgorithmsMedium

A linked list is given such that each node contains an additional random pointer, which could point to any node in the list or null. Construct a deep copy of the list.

Q2
Minimum Remove to Make Valid Parentheses
Data Structures & AlgorithmsMedium

Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.

Q3
Custom Sort String
Data Structures & AlgorithmsMedium

You are given two strings, order and s. All the characters of order are unique and were sorted in some custom order previously. Permute the characters of s so that they match the order that order was sorted. More specifically, if a character x occurs before a character y in order, then x should occur before y in the permuted string. Return any such string.

Q4
Word Search
Data Structures & AlgorithmsMedium

Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where 'adjacent' cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.

Preparation Tips

My primary preparation strategy for Facebook was to thoroughly review and practice all the Facebook-tagged questions available on LeetCode. I found this approach highly effective, as I encountered no non-LeetCode questions during my entire interview process.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!