Meta E4 Software Engineer | Offer
- Posted
- 16 May 2025
Summary
I received an offer from Meta for an E4 Software Engineer role after completing phone screen and onsite rounds, which included coding, system design, and behavioral interviews.
How it went
Hi,
I just received an offer from Meta for E4 SE role. Sharing my interview experience and giving back to the community.
Phone Screen:
Question 1:
Given a list of integers, return the maximum sum of two numbers. Constraint is that the two numbers should not be adjacent to each other
Question 2:
Given a list of Node references, return the root node of the tree if all the nodes in the list belong to one tree else return null.
Was provided with the below node definition
class Node {
Node left;
Node right;
}
Received a call from the recruiter 2 days later that I was moving on to the onsite rounds.
Onsite rounds
Round 1 (Coding):
LC 938: Range Sum of BST
LC 56: Merge Intervals. I was asked the variant of it. Given 2 sorted lists and asked to merge the intervals. You can refer to CodingWithMinmer youtube channel for all variants.
Round 2 (System Design):
Status search - similar to FB post search on HelloInterview.
Round 3 (Coding):
LC 346: Moving average from Data Stream
LC 1650: Lowest Common Ancestor of Binary Tree III
Round 4 (Behavioral):
Common behavioral questions
Questions asked (8)
- 01
Maximum Sum of Two Non-Adjacent Numbers
Data Structures & Algorithms
Given a list of integers, return the maximum sum of two numbers. Constraint is that the two numbers should not be adjacent to each other
- 02
Find Root of Tree from Node References
Data Structures & Algorithms
Given a list of Node references, return the root node of the tree if all the nodes in the list belong to one tree else return null.
class Node { Node left; Node right; } - 03
Range Sum of BST
Data Structures & Algorithms
LC 938: Range Sum of BST
- 04
Merge Intervals (Variant: Merge Two Sorted Interval Lists)
Data Structures & Algorithms
LC 56: Merge Intervals. I was asked the variant of it. Given 2 sorted lists and asked to merge the intervals.
- 05
Status Search
System Design
Status search - similar to FB post search on HelloInterview.
- 06
Moving Average from Data Stream
Data Structures & Algorithms
LC 346: Moving average from Data Stream
- 07
Lowest Common Ancestor of Binary Tree III
Data Structures & Algorithms
LC 1650: Lowest Common Ancestor of Binary Tree III
- 08
Common Behavioral Questions
Behavioral
Common behavioral questions