E5 Meta Phone screen
- Location
- us
- Posted
- 25 Aug 2025
Summary
I had a phone screen interview for an E5 role at Meta in the US, where I was tested on two specific LeetCode problems: Lowest Common Ancestor of a Binary Tree III and Group Shifted Strings.
How it went
I recently interviewed with Meta for an E5 position, participating in a phone screen located in the US. During the interview, I was presented with two coding challenges. The first problem involved finding the Lowest Common Ancestor in a binary tree (LCA III), and the second task was to group strings that are "shifted" versions of each other. I focused on discussing my approaches and implementing efficient solutions for both.
Questions asked (2)
- 01
Lowest Common Ancestor of a Binary Tree III
Data Structures & Algorithms
Open the problemThe problem asks to find the lowest common ancestor of two given nodes in a binary tree. Full description is available via the provided LeetCode link.
- 02
Group Shifted Strings
Data Structures & Algorithms
Open the problemThe task is to group strings into lists where each group contains strings that can be obtained from one another by shifting letters. Full description is available via the provided LeetCode link.