meta logo
Meta· E4

Meta | E4 | Seattle | Dec 2021 [Offer]

Result
Offer
Location
Seattle
Experience
2.5 years
Posted
29 Jan 2022
343 reads

Summary

I interviewed at Meta for an E4 position in Seattle in December 2021 and successfully received an offer. The interview process included a phone screen and several onsite rounds covering coding, machine learning design, and behavioral aspects.

How it went

I recently interviewed at Meta for an E4 Software Engineer role in Seattle. At the time, I had 2.5 years of experience, working as an SDE2 at another top tech company. My interview journey consisted of a phone screen followed by a comprehensive onsite loop, ultimately resulting in an offer.

Meta Phone Screen

Meta Onsite

Coding Interview 1
  • The first problem was to add two numbers represented as strings, like LeetCode - Add Strings.
  • This was followed by a problem to multiply two numbers represented as strings, similar to LeetCode - Multiply Strings.
  • I also had follow-up questions for these problems, such as handling negative string inputs or preceding zeros.
Coding Interview 2
ML Design 1

This round involved a discussion centered around my past projects. I was presented with a problem that was a modification of one of my previous projects, prompting a deep dive into trade-offs, data collection strategies, and deployment considerations.

ML Design 2

The second ML design round was an open-ended problem focused on recommendation systems. The discussion covered various aspects including data sources, relevant metrics, feature engineering techniques, potential improvements, and runtime efficiency.

Behavioral Interview

The behavioral round primarily focused on my project experiences. I was asked to describe different situations, including conflicts with managers, my motivations for wanting to work at Meta, how I handled tough deadlines, and my experiences with mentoring others.

Questions asked (10)

  1. 01

    Validate Binary Search Tree

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, determine if it is a valid binary search tree (BST).

    A valid BST is defined as follows:

    • The left subtree of a node contains only nodes with keys less than the node's key.
    • The right subtree of a node contains only nodes with keys greater than the node's key.
    • Both the left and right subtrees must also be binary search trees.
    Open the problem
  2. 02

    Merge Two Interval Lists

    Data Structures & Algorithms · Medium

    Given two lists of sorted disjoint intervals, merge them into a single list of sorted disjoint intervals.

    For example, given list1 = [[1,3],[6,9]] and list2 = [[2,5]], the result would be [[1,5],[6,9]].

    Open the problem
  3. 03

    Add Strings

    Data Structures & Algorithms · Medium

    Given two non-negative integers num1 and num2 represented as strings, return the sum of num1 and num2 as a string.

    You must not use any built-in BigInteger library or convert the inputs to integers directly.

    Follow-up questions included: What if one of the strings is negative? What if there are preceding zeros?

    Open the problem
  4. 04

    Multiply Strings

    Data Structures & Algorithms · Medium

    Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

    You must not use any BigInteger library or convert the inputs to integers directly.

    Follow-up questions included: What if one of the strings is negative? What if there are preceding zeros?

    Open the problem
  5. 05

    Convert Binary Search Tree to Sorted Doubly Linked List

    Data Structures & Algorithms · Medium

    Convert a Binary Search Tree (BST) into a circular sorted Doubly-Linked List. The list should be sorted in ascending order.

    The conversion should happen in-place. The right pointer of a node should point to the next node in the sorted list, and the left pointer should point to the previous node. For the circular list, the left pointer of the head should point to the tail, and the right pointer of the tail should point to the head.

    Open the problem
  6. 06

    Find Peak Element (Variation)

    Data Structures & Algorithms · Medium

    The problem was similar to finding a peak element in an array. A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.

    Open the problem
  7. 07

    Conflict with a Manager

    Behavioral

    Describe a situation where you had a conflict or disagreement with your manager and how you approached resolving it. What was the outcome?

  8. 08

    Why Meta?

    Behavioral

    What interests you about Meta as a company, and why do you want to work here specifically?

  9. 09

    Tough Deadline Experience

    Behavioral

    Describe a time when you faced a particularly tough deadline on a project. How did you manage the situation, and what was the result?

  10. 10

    Mentoring Experience

    Behavioral

    Describe your experience with mentoring others, either formally or informally. What challenges did you face, and what did you learn?

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!