Meta | E5 | Phone Screen | US (Passed)
- Location
- US
- Posted
- 31 Jul 2025
320 reads
Summary
I passed the phone screen interview at Meta for the E5 role in the US, where I was asked two LeetCode problems for which I provided optimal solutions.
How it went
Updated: Passed.
1. https://leetcode.com/problems/shortest-path-in-binary-matrix/description/
2. https://leetcode.com/problems/minimum-window-substring
Self-eval:
1. Gave the optimal solution and dry-run perfectly
2. Gave the optimal solution but only dry-run half of an example due to time constraint (Crazy to think that I was targeted for this question & just had 15 mins)
Verdict: 50-50 game.
Questions asked (2)
- 01
Shortest Path in Binary Matrix
Data Structures & Algorithms
Open the problemPlease refer to the LeetCode link for the full problem description.
- 02
Minimum Window Substring
Data Structures & Algorithms
Open the problemPlease refer to the LeetCode link for the full problem description.