Meta E5 phone screen — Chances with borderline performance?
Question Details
Hi all, I had a Meta E5 (senior SWE) US phone screen this morning and now I’m spiraling wondering if I blew it or not. Would love to hear from anyone who has
passed with a “borderline” performance. Q1
Full Details
Hi all, I had a Meta E5 (senior SWE) US phone screen this morning and now I’m spiraling wondering if I blew it or not. Would love to hear from anyone who has
passed with a “borderline” performance. Q1 (medium - harder one, 138) * I understood the problem after some clarification (fumbled on the understanding and input). * took some advice from the interviewer by start small, since I still fumbled during the time. then I implemented a standard solution using a hashmap. interviewer tried to poke around why i did this (and questioned whether if this would answer the question), and i explained how it work. * The interviewer pointed out that my implementation would have an issue in a certain edge case (duplicates). But because we ran out of time, we then move to Q2. but before that i did verbally mention use reference instead of relying on a value for map. * After Q2 is done. we came back to the question, interviewer wanted me to fix the hashmap, i asked that can i propose a more optimal solution as i dont want to dwell on the "not working"
solution considering that we have few minutes left. The interviewer agreed and listened to my idea. i explained the optimal o(1)
solution (interweaving node), and he said he got it. * But i saw from posts that this is a big nono sign for E5 - because 1. i refuse to work with interviewer? 2. This question has higher weight? Q2 (medium - much easier, 791) * Able to implement it in one go. Interviewer asked a follow up on edge case, I adjusted implementation. dry run and it works. * Interviewer asked for time complexity (and i did it correctly) In the end he said "Thanks, I’ll submit my feedback to committee. Best of luck in future interviews." Which felt… neutral/leaning to no move on to final round?
About This Question
This is a reported interview question from a meta interview for a swe role (senior level) during the phone screen round reported in 2025.
It covers the following topics: Hash Table .
Difficulty rating: Medium