I applied online. The process took 1 week. I interviewed at Meta in Nov 2015
Interview
The first part was about 10 minutes of talking. Italked about one past project I did and its greatest challenge, and I also learned more about interviewer when he was an intern. Then it was 30 minutes of 2 technical questions. At the end, there were 5 minutes to ask any questions I had.
Interview questions [1]
Question 1
Q: Given an array of ints, print out true if 3 of them add up to 9
Q: Printed out a linked list in reverse order
Overall, the process took a little over two weeks, which felt a bit longer than I anticipated. After a quick screening, I went through two technical rounds focusing on coding and DSA concepts. One of the questions was a classic palindrome check; mid-way through, I realized it was something I had practiced on PracHub just days earlier. The final step was a casual behavioral interview. I was relieved to get an offer shortly after, which I happily accepted.
Interview questions [1]
Question 1
Given a string, determine if it is a valid palindrome considering only alphanumeric characters and ignoring case.
I applied online. I interviewed at Meta (Menlo Park, CA)
Interview
It's honestly striaght from leetcode tagged
There are no surprises if you do tagged you would be good and do well.
System design is much harder. Would recommend using hello interview.
Interview questions [1]
Question 1
Design Twitter and consider if it was suddenly an extremely low latency env
Grateful doesn't even begin to describe how I feel about landing this role. The interview loop was smooth and friendly. They kicked things off with a technical round where I faced a DSA question about verifying an alien dictionary. Lucky for me, the time I'd spent on PracHub paid off, as it had the same type of problem just days before. After that, I had a system design discussion and a behavioral interview. Everything felt very collaborative, and by the end, I received an offer that I was thrilled to accept.
Interview questions [1]
Question 1
Given a list of words written in an alien language and the order of letters in that language's alphabet, determine whether the words are sorted lexicographically (Verifying an Alien Dictionary). Walk through the comparison approach using a character-to-index map, the O(C) time complexity where C is total characters, and how you'd extend it to handle words with mixed-case letters or words containing characters outside the given alphabet.