meta logo
Meta· E5 Infra

Meta Interview Experience (London E5 Infra)

Location
London
Posted
30 Jun 2025
343 reads

Summary

I shared my Meta E5 Infra interview experience in London, detailing phone screen, DSA, System Design, and Behavioral rounds, ultimately receiving an E4 offer.

How it went

Giving back to the community where I got all the resources from

Phone Screen
1) Diagonal Traversal of matrix (LC 498) :
Similar to LC 498, but didn't need to flip the direction of traversal for each diagonal (so easier version of leetcode question).
2) LC 408 variant.(was asked the leetcode question first and after the approach was provided, he went with the followup which was varaiant)
both word and abbr can be patterns.

Solved first question and gave approach to the follow up for second but didnt have time to finish the question.

Got selected for the onsite rounds

DSA1
1) vertical order traversal (LC 314)
2) K Closest points to origin LC 973

Solved both the questions

DSA2
1) Some max K question (classic miHeap type question, dont remmeber exactly)
2) a variant of two sum

Solved both the questions

System Design
1) Adclick aggregator

Behavioural
Dont remember the questions but the usual behavioural questions.

Got offered E4 (downlevelled) position. Team matching pending but can take time.

Questions asked (7)

  1. 01

    Diagonal Traversal of Matrix (Easier Variant of LC 498)

    Data Structures & Algorithms · Medium

    Similar to LC 498, but didn't need to flip the direction of traversal for each diagonal (so easier version of leetcode question).

  2. 02

    Word Abbreviation Variant (LC 408 - Both Word and Abbr Patterns)

    Data Structures & Algorithms · Easy

    LC 408 variant. both word and abbr can be patterns.

  3. 03

    Vertical Order Traversal of a Binary Tree (LC 314)

    Data Structures & Algorithms · Medium

    vertical order traversal (LC 314)

  4. 04

    K Closest Points to Origin (LC 973)

    Data Structures & Algorithms · Medium

    K Closest points to origin LC 973

  5. 05

    Max K Problem (MinHeap Type)

    Data Structures & Algorithms · Medium

    Some max K question (classic miHeap type question, dont remmeber exactly)

  6. 06

    Two Sum Variant

    Data Structures & Algorithms · Easy

    a variant of two sum

  7. 07

    Adclick Aggregator System Design

    System Design

    Adclick aggregator

How they prepared

You will defintely only have 35mins no matter the round, so make sure you prepare for it that way. You need to solve both questions in the most efficient approach for onside DSA's.
DSA:

DSA questions are repeated by meta, so definitely look into meta's recently asked questions and meta tagged leetcode questions.

Special shout out to codingwithminmer. May god bless you for all the effort you are doing to help out people with your youtube channel and clearing doubts over all the meta tagged posts.

Definitely go over codingwithminmer's playlist of meta questions and variants. If you aren't doing this you are definitely not giving your 100% for your preparation.

System Design
Hello Interview.
I have taken premium , I did like the Guided Practice section of the premium. It does help in simulating kind of an interview experience and gave me pretty good confidence. Even if you dont take the premium, hello interview is still the goto.

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!