This is a mock Python interview with a Microsoft engineer, where the prospective candidate must tackle a medium level python question, typical for intermediate/level two Engineers. The question, "Sneak to Exit Grid with Guards and Obstacles", requires candidates to find if it is possible for the player to sneak to the bottom-right cell of the board, containing guards and obstacles, undetected. This solution is done recursively, using a set and depth first search approach to keep track of visited paths. Keep an eye out for the alternative and optimal approach given by the interviewer at the end!
👉 Get $100 off your first professional mock interview with this link!: https://iio.sh/r/CQ76
📖 Check out feedback from the FAANG interviewer and the full transcript on https://interviewing.io/recordings/Python-Microsoft-19
📘 Or view other python interviews: https://interviewing.io/python-interview-questions
❗ Disclaimer: All interviews are shared with explicit permission from the interviewer and the interviewee, and all interviews are anonymous. interviewing.io has the sole right to distribute this content.
TIMESTAMPS
00:00 Start
00:27 Introductions
02:47 Question Starts + Planning
31:30 Coding Begins
50:16 Feedback