Had First Round for SWE II, Product role for Meta (US based role).

Format

• 45 minute interview. You needed to solve 2 interview problems
• Very chill interviewer and I had 5-10 minutes for Q/A to ask about experience at Meta. Interviewer worked on Brand Ads Team part of Monetization

Questions
Q1: Given a string and an ordering, shuffle the string such that ordering is met. Interviewer and I discussed a few edge cases, but implementation was really straightforward

Q2: You are given an MxN grid where 0 are safe cells and 1 is wall. You need to determine shortest path from top left to bottom right. Shortest path is determined by least number of steps

I got optimal for Q1, but a working solution for Q2. Couldn't think of a more optimal solution time complexity and space complexity wise for Q2. Hopefully it's enough to move forward