Meta | E5 | Phone Screen | US (Passed)

meta logo
meta
E5US
July 31, 20253 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.

Full Experience

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.

Interview Questions (2)

Q1
Shortest Path in Binary Matrix
Data Structures & Algorithms

Please refer to the LeetCode link for the full problem description.

Q2
Minimum Window Substring
Data Structures & Algorithms

Please refer to the LeetCode link for the full problem description.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!