DoorDash | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview was conducted over a video call. Initially, I struggled to come up with a solution to the problem presented, resulting in a brute-force approach with a time complexity of O(N^2). After some prompts from the interviewer, I realized that after removing an element, I only needed to check if the neighbors of the removed point became eligible. This led to a more efficient O(N) solution. After the interview, I received a detailed explanation of the solution.
Technical Questions
- Eligible Orders After Removal (Graph, Depth-First Search, Breadth-First Search)
Tips & Insights
Make sure to prepare thoroughly for the interview, especially on topics that you haven’t practiced before, as they can be challenging to articulate during the interview.