[USA] Meta SWE II (E4), Product First Round
- Result
- Ongoing
- Location
- USA
- Posted
- 13 Oct 2025
Summary
I had my first round interview for a SWE II, Product role at Meta, which was a 45-minute session involving two coding problems. I managed to achieve an optimal solution for the first question and a working solution for the second, and I'm currently awaiting feedback.
How it went
I recently completed my first round for a SWE II, Product role at Meta, for a US-based position. The interview itself was 45 minutes long, and I was expected to solve two problems. My interviewer was quite chill, and I had a good 5-10 minutes at the end to ask them about their experience working on the Brand Ads Team within Monetization. I felt good about my performance on the first question, as I achieved an optimal solution. However, for the second question, I only managed a working solution. I couldn't come up with a more optimal time or space complexity for the second problem, and I'm hoping my working solution is enough to move me forward in the process.
Questions asked (2)
- 01
Shuffle String Based on Ordering
Data Structures & Algorithms
Given a string and an ordering (presumably a mapping or an array of indices), shuffle the characters of the string such that the specified ordering is met. I discussed a few edge cases with the interviewer, but the implementation was really straightforward.
- 02
Shortest Path in Binary Matrix
Data Structures & Algorithms
You are given an M x N grid where '0' represents safe cells and '1' represents walls. You need to determine the shortest path from the top-left cell (0,0) to the bottom-right cell (M-1, N-1). The shortest path is determined by the least number of steps.