This is a mock Python Interview with a FAANG engineer, where the prospective candidate must tackle a medium level Python question. The question, "Longest Substring With Maximum K Distinct Characters", requires candidates to take an input string and output its longest substring that does not exceed K characters. This solution is done using the sliding window approach. Keep an eye out for the errors our candidate initially runs into and how they resolve them, as well as the amazing advice the interviewer gives to improve 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-faang-13
📘 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
01:30 Introductions
05:50 Question Starts
32:19 Problem solve compiler issues
40:00 Behavioral Question
45:05 Feedback from Interviewer