I applied through college or university. The process took 1 day. I interviewed at Meta in Aug 2015
Interview
Several engineers came to recruit to my university. I didn't feel the process was aimed at finding out about my thought process. I felt the interview was more about whether I got the answer and how quickly I figured it out. I did figure it out. The interviewer was at several times messaging on his/her mobile phone while I was explaining my reasoning. I felt he/she was rude at time, too. Some friends that interviewed with other recruiters got easier questions and passed to the second interviews. I searched for the question later online and my solution was correct and optimal. Bad taste on the whole experience.
Interview questions [1]
Question 1
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that only one letter can be changed at a time and each intermediate word must exist in the dictionary.
For example, given:start =
"hit"
end = "cog"
dict = ["hot","dot","dog","lot","log"]
From: http://www.programcreek.com/2012/12/leetcode-word-ladder/
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.
1 leetcode med, 1 leetcode hard. make sure you know your DSA and leetcode questions. I wasn't able to get an offer bc i didnt complete the second question. Got a reply 2 days later saying they would move on