This is a Mock Python Interview where the prospective candidate must tackle two E3/E4 level Data Structures and Algorithms questions from a Facebook Engineer. "Odd Even Linked List" requires candidates to return a reordered linked list with all the odd node indices together, and even node indices together. Watch now to learn how to traverse the linked list using pointers to achieve the desired output. Keep watching for a second bonus question covering Binary Trees, where the candidate will have to use BFS and queue to append the maximum values at each level.
👉 Get $100 off your first professional mock interview with this link!: https://iio.sh/r/CQ76
📖 Check out feedback from the Facebook interviewer and the full transcript on https://interviewing.io/recordings/Python-Facebook-10/
📘 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:00 Introductions
06:55 Question 1 Starts: Odd Even Linked List
26:24 Question 2 Starts: Find Largest Value in Each Tree Row
44:35 Feedback