Meta Phone Screen
- Posted
- 7 Apr 2025
Summary
I had a phone screen with Meta where I was asked two coding questions, including a LeetCode problem and a variant of another. Despite my approach, I was rejected a few days later.
How it went
I was asked two coding questions during my phone screen.
One was a straightforward problem, and the other was a variant that caught me off guard. I tried a two-pass DFS approach for the second question but couldn't get it working in one pass. In hindsight, BFS with queue length for level traversal would have been a better approach for both left and right side views.
I got rejected a few days later.
The role was not for a specific location, but the recruiter mentioned current openings are mainly in Menlo Park and Seattle.
Questions asked (2)
- 01
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms
Open the problemRefer to the problem description at the provided LeetCode link: https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/
- 02
Binary Tree Left and Right Side View (Variant)
Data Structures & Algorithms
Open the problemRefer to the problem description at the provided LeetCode link: https://leetcode.com/problems/binary-tree-right-side-view/description/. The variant specifically asked for both left and right side views.