meta logo
Meta· Software Engineer E4

Meta E4 Product Screen + Onsite

Location
US
Posted
11 May 2025
375 reads

Summary

I successfully completed my Meta E4 product screen and onsite interviews a few months ago, and I am sharing the specific questions I encountered during the process.

How it went

Giving back to the community. Done a few months ago

Screen: i18n + range sum bst

Coding 1: minimum window substring + max diameter

Coding 2: sum root to leaf + dot product (array method)

Product Arch: ticket booking with focus on API/DB schema

Passed. US location

Questions asked (7)

  1. 01

    i18n (Internationalization)

    Other

    This question likely involved concepts related to internationalization (i18n), potentially covering system design aspects, API considerations, or implementation details for supporting multiple languages and regions within a software product. Given it was a product screen, it might have involved discussions around product implications or technical solutions for i18n.

  2. 02

    Range Sum of BST

    Data Structures & Algorithms · Easy

    Given the root node of a binary search tree and two integers low and high, return the sum of all nodes' values that are in the inclusive range [low, high].

  3. 03

    Minimum Window Substring

    Data Structures & Algorithms · Hard

    Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

  4. 04

    Diameter of Binary Tree

    Data Structures & Algorithms · Easy

    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.

  5. 05

    Sum Root to Leaf Numbers

    Data Structures & Algorithms · Medium

    You are given the root of a binary tree where each node has a value 0 to 9. Each root-to-leaf path represents a number. For example, if the path is 1->2->3, the number is 123. Return the total sum of all root-to-leaf numbers.

  6. 06

    Dot Product (Array Method)

    Data Structures & Algorithms

    Implement a function to calculate the dot product of two arrays or vectors. The 'array method' specification suggests a direct implementation rather than focusing on sparse matrix optimizations, though that could have been an extension.

  7. 07

    Design a Ticket Booking System

    System Design · Hard

    Design a system for booking tickets, with a primary focus on defining the API endpoints and the database schema. This typically involves considerations for user management, event/ticket management, the booking process, payment integration, and handling concurrency.

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!