Meta Interview Experience E4 | Infra | Pass | USA

meta logo
meta
e4 | infrausaOffer
March 17, 20251 reads

Summary

I successfully passed my Meta E4 On-Site interview for an Infra role in the USA. The process involved a phone screen, system design, two coding rounds, and behavioral interviews, with one behavioral round requiring a redo before I received the offer.

Full Experience

I never thought I would be sharing this, but after passing my Meta E4 On-Site interview for an Infra role, I wanted to give back to the LeetCode community.

Phonescreen

There was an additional question, 1249. Minimum Remove to Make Valid Parentheses, where only the thought process was required, not the code.

Behavioral Interview I

This round covered standard behavioral questions:

  • Discussing a project I was most proud of.
  • Describing a conflict with a co-worker and its resolution.
  • Sharing feedback I had received and how I acted upon it.

System Design I

The core problem was to design a photo messaging app. The interviewer probed deep with follow-up questions:

  • Why I chose SQL over NoSQL.
  • What consistent hashing is.
  • How to scale the system.
  • Capacity estimates for the system.
  • Explaining the upload and download process for photos/videos to/from S3.

I honestly felt I had bombed this round. The interviewer was very directive, asking deep-dive questions even before I finished the High-Level Design (HLD). Estimations were a specific focus.

Coding Interview I

  • Question 1: 50. Pow(x, n). I initially provided an O(N) approach and coded it. The interviewer then pushed for an O(logN) solution. I fumbled a bit and needed some hints but eventually arrived at the recursive O(logN) approach.
  • Question 2: Vertical Order Traversal of a Binary Tree. This was more of a discussion round. I had to explain why BFS is often preferred, why not DFS, and how to implement it with DFS. No code was required, and I answered all questions successfully.

Coding Interview II

After these rounds, I had to do a behavioral redo. Fortunately, the questions were the same as the first behavioral round, and this time, the interviewer was much more pleasant. I had also refined my stories, which helped immensely.

I heard back from the recruiter in 4 days after the onsite, and then again in just 1 day after a follow-up, confirming that I had passed the Hiring Committee (HC).

Timeline:

The journey was quite long. The recruiter first reached out in early December, which was when I started studying, as I was also exploring internal opportunities within my current company. I finished the onsite interviews in March, making it a total of about four months of preparation and interviewing.

Interview Questions (11)

Q1
Valid Palindrome 2
Data Structures & AlgorithmsEasy

Given a string s, return true if the s can be a palindrome after deleting at most one character from it.

Q2
Diameter of Binary Tree
Data Structures & AlgorithmsEasy

Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Q3
Minimum Remove to Make Valid Parentheses
Data Structures & AlgorithmsMedium

Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.

Q4
Describe a Proud Project
Behavioral

Tell me about a project you are most proud of, detailing your contributions and the impact.

Q5
Conflict with a Co-worker
Behavioral

Describe a situation where you had a conflict with a co-worker and how you resolved it.

Q6
Received Feedback
Behavioral

Discuss a piece of feedback you've received, how you reacted, and what you did with it.

Q7
Design a Photo Messaging App
System DesignHard

Design a system for a photo messaging application, including considerations for uploading, storing, and retrieving photos and videos.

Q8
Pow(x, n)
Data Structures & AlgorithmsMedium

Implement pow(x, n), which calculates x raised to the power n (i.e., x^n).

Q9
Vertical Order Traversal of a Binary Tree
Data Structures & AlgorithmsHard

Given the root of a binary tree, return the vertical order traversal of its nodes' values. For each node at (row, col), its left and right children will be at (row + 1, col - 1) and (row + 1, col + 1) respectively. The traversal should be sorted column by column, then by row within each column, and finally by value if multiple nodes are at the same (row, col).

Q10
Subarray Sum Equals K Variant (Return true/false)
Data Structures & AlgorithmsMedium

Given an integer array nums and an integer k, return true if nums has a continuous subarray with a sum equal to k, or false otherwise. I was also asked if I could reduce space/time complexity.

Q11
Antidiagonal of a Matrix
Data Structures & AlgorithmsMedium

Given a square matrix, traverse and return all elements along its anti-diagonals, starting from the top-right and moving towards the bottom-left.

Preparation Tips

For system design, my primary resources were Hello Interview, which was incredibly helpful for understanding the basics and interview strategy, and Alex Xu's System Design books (Part 1 and 2).

For coding interviews, I relied heavily on LeetCode. A huge shoutout goes to CodingWithMinmer on YouTube; their content is fantastic for the community.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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