Скачать или смотреть Longest Substring - Maximum K Distinct Characters

👉 Sign up to book a mock interview just like this one or to watch more interviews in our showcase: https://www.interviewing.io

Longest Substring With Maximum K Distinct Characters problem requires candidates take an input string and output its longest substring that does not exceed K characters. This is a mock Python Interview with a FAANG engineer, where the prospective candidate must tackle a medium level Python question.

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!

📖 Check out feedback from the FAANG interviewer and the full transcript on https://interviewing.io/mocks/faang-p...

📘 Or view other python interviews: https://interviewing.io/mocks

❗ 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 Longest Substring Question Starts
32:19 Problem solve compiler issues
40:00 Behavioral Question
45:05 Feedback from Interviewer