The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on PracHub. The rest of the interview followed a straightforward path, with some easy behavioral questions sprinkled in. Overall, it felt very easy, but I wasn’t quite the right fit for what they needed, so I didn’t receive an offer.
Interview questions [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place
I applied through college or university. The process took 2 weeks. I interviewed at Meta in Feb 2016
Interview
We had back and forth emails where they asked for my resume and choice of domain, product or infrastructure. Then, they scheduled my phone interview. The phone interview was with a facebook engineer. There were two phone interviews but I didn't make it to the second one. The interview was 45 minutes long. They took 4 to 5 days to tell me I hadn't been selected.
Interview questions [1]
Question 1
1. Asked me how to reverse a Linked List. Recursive Solution, Non-Recursive Solution, edge cases.
2. Given a matrix of 1s and 0s, find the shortest route between two points in the matrix while considering 1s as walls and 0s as traversable paths.
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