meta logo
Meta· E5/E6

Meta - Phone Screen (London) Interview E5/E6 [Passed]

Location
London
Posted
3 Apr 2025
298 reads

Summary

I successfully passed a Meta E5/E6 phone screen in London, despite making critical mistakes on one of the two coding questions, emphasizing the importance of strong communication and adaptability during the interview process.

How it went

  1. On question one i made a huge mistake, because task was presented without any constraints. So i jumped into the coding taking care of just numbers and letters and Inteviewer quickly presented test case to show me my incompentence. Please, please. Speak with your Interviewer before coding! Verify question, verify constraints, discuss even before presenting approach.. It could cost me rejection. Luckily i responded very quickly and adapted, so in next few minutes i quickly veryfied constrainst and came with good creative test cases. I guess it saved my ass.
  2. On question two after discussion i quickly came with linear approach, and i think expressed my process very clearly. What is more important i came also with binary search approach, but i didn't repeat my mistake from question one and started dicussing my quick BS implementation. Together with the Interviewer we quickly verified test cases and i realized how tricky is this variant, and probably binary search is not possible and we should fall back to linear approach.

As you see i made a mistakes, and still passed. I assume it's because i kept Interviewer engaged, i responded quickly to the feedback and also was ready to deeply discuss approach, not just a coding. That should be the lesson for us.

Interviewer was extremely professional and very metodic, so it made things much more easy to understand expectations. So i guess i was lucky meeting this Interviewer, he built very positive experience.

Questions asked (2)

  1. 01

    Valid String (Lighter Variant of Valid Number)

    Data Structures & Algorithms

    A lighter variant of Valid Number without taking care about exponent. Variant presented here.

    Open the problem
  2. 02

    Find Local Minimum (Variant of Find Peak Element)

    Data Structures & Algorithms

    Find local minimum, a variant of this LeetCode Find Peak Element. Input can have repeated numbers and minimums are inclusive (>=lm<=). Worth watching this video.

    Open the problem

How they prepared

Thanks for Minmer&Summer for their fantastic job on YT channel, it's so helpful.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Meta recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!