Facebook onsite
- Result
- No Offer
- Posted
- 26 Jan 2022
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.
How it went
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!
Questions asked (4)
- 01
Copy List with Random Pointer
Data Structures & Algorithms · Medium
Open the problemA 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.
- 02
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms · Medium
Open the problemGiven 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.
- 03
Custom Sort String
Data Structures & Algorithms · Medium
Open the problemYou are given two strings,
orderands. All the characters oforderare unique and were sorted in some custom order previously. Permute the characters ofsso that they match the order thatorderwas sorted. More specifically, if a characterxoccurs before a characteryinorder, thenxshould occur beforeyin the permuted string. Return any such string. - 04
Word Search
Data Structures & Algorithms · Medium
Open the problemGiven an
m x ngrid of charactersboardand a stringword, returntrueifwordexists 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.
How they prepared
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.