Meta E4 Infra Experience

Posted
15 May 2025
385 reads

Summary

I recently had an interview experience at Meta for an E4 Infra role, where I navigated through screening and onsite rounds, encountering various LeetCode problem variants and a System Design question.

How it went

I recently interviewed at Meta for an E4 Infra position. The interview process consisted of a screening round followed by several onsite rounds, including both coding and system design. During the screening, I encountered two coding problems: a variant of 'Best Time to Buy and Sell Stock' and 'Minimum Remove to Make Valid Parentheses'.

For the onsite rounds, I faced several more coding challenges, all of which were variants of well-known LeetCode problems such as 'Diameter of Binary Tree', 'Basic Calculator II' (with an O(1) space constraint), 'Shortest Path in Binary Matrix', and 'Simplify Path'. The System Design round focused on designing a Game Leaderboard.

Questions asked (7)

  1. 01

    Best Time to Buy and Sell Stock (Variant)

    Data Structures & Algorithms

    A variant of the classic 'Best Time to Buy and Sell Stock' problem. The core idea is to find the maximum profit by buying and selling a stock, possibly with modified constraints or additional conditions not specified in the base problem.

    Open the problem
  2. 02

    Minimum Remove to Make Valid Parentheses

    Data Structures & Algorithms · Medium

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

    Open the problem
  3. 03

    Diameter of Binary Tree (Variant)

    Data Structures & Algorithms

    A variant of the 'Diameter of Binary Tree' problem. The standard problem asks to find the length of the longest path between any two nodes in a binary tree. The variant might involve additional constraints or slight modifications to the tree structure or definition of 'diameter'.

    Open the problem
  4. 04

    Basic Calculator II (Variant with O(1) space)

    Data Structures & Algorithms

    A variant of the 'Basic Calculator II' problem, specifically requiring an O(1) space solution. The standard problem involves evaluating a simple arithmetic expression string containing non-negative integers, '+', '-', '*', '/' operators and empty spaces. The variant likely imposes the strict space complexity constraint.

    Open the problem
  5. 05

    Shortest Path in Binary Matrix (Variant)

    Data Structures & Algorithms

    A variant of the 'Shortest Path in Binary Matrix' problem. The original problem asks for the length of the shortest clear path in a binary matrix from the top-left to the bottom-right cell. The variant might introduce different obstacles, path rules, or start/end points.

    Open the problem
  6. 06

    Simplify Path (Variant)

    Data Structures & Algorithms

    A variant of the 'Simplify Path' problem. The original problem involves simplifying an absolute path for a Unix-style file system. The variant might add complexities such as different path components, additional special directories, or edge cases.

    Open the problem
  7. 07

    Design a Game Leaderboard

    System Design

    Design a scalable system for a game leaderboard. Consider aspects like storing scores, retrieving top N players, handling updates, and ensuring low latency and high availability for a large number of users and games.

How they prepared

I prepared for the coding rounds by focusing on variants of common LeetCode problems, leveraging resources like @CodingWithMinmer's videos. For the System Design interview, I found the HelloInterview Premium subscription to be immensely helpful for a month.

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!