Meta SWE ML E4 Phone Screen Round
- Posted
- 17 May 2025
Summary
I had a phone screen for a Meta SWE ML E4 position and was asked two coding problems. I received positive feedback and am now preparing for the full loop.
How it went
Hey everyone,
I had my phone screen for the Meta SWE ML position about two weeks ago. Here are the questions I was asked:
Minimum Round Trip Cost – Given two arrays, one representing departure costs [d1, d2, d3, d4] and the other return costs [r1, r2, r3, r4], find the minimum total cost for a round trip.
Robot Room Cleaner Variant (Mouse and Cheese) – This was a variation of the classic robot room cleaner problem. I hadn’t come across this problem before the interview and wasn’t aware of related resources like CodingWithMingmer. I was able to solve it eventually, but interviewer told me to improve my time management during coding as I took 4-5 minutes more to finish the code for this.
I gave dfs approach, and as a follow up at last, he asked me to think about bfs one .
Hope this helps !
The recruiter got back to me the next day with positive feedback.
I am currently preparing for full loop. Wish me luck .
Questions asked (2)
- 01
Minimum Round Trip Cost
Data Structures & Algorithms
Given two arrays, one representing departure costs [d1, d2, d3, d4] and the other return costs [r1, r2, r3, r4], find the minimum total cost for a round trip.
- 02
Robot Room Cleaner Variant (Mouse and Cheese)
Data Structures & Algorithms
A variation of the classic robot room cleaner problem.