I applied online. The process took 5 weeks. I interviewed at Meta in Jun 2025
Interview
The interview process began with a 90-minute OA that included two medium-to-hard algorithm questions. The format was very similar to what I had seen on Hack2Hire, which made it easier to prepare. After passing the OA, I had a technical phone screen with one engineer. It involved one coding problem and follow-up questions on edge cases and time complexity. I mainly prepared using LeetCode, Hack2Hire, and 1point3acres, which were helpful for understanding the style of Meta’s questions.
Interview questions [1]
Question 1
solve a coding problem involving arrays, where I had to implement an efficient algorithm and then walk through edge cases. I also needed to explain the time and space complexity and justify my approach.
Took about a month altogether, which felt longer given the intensity of the process. Kicked off with a technical screening, followed by two rigorous coding interviews. The DSA question on binary tree vertical order traversal hit me hard at first, but then I recognized the prompt instantly — I had just worked through something similar on PracHub. The final round was focused on system design, and while I ended up receiving an offer, I ultimately declined it. Overall, a challenging experience that definitely sharpened my skills.
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
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.