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 hints 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.
Technical Questions
- Eligible Orders After Removal (Graph, Depth-First Search, Breadth-First Search)
Tips & Insights
Prepare for the interview by practicing problems that involve graph traversal and understanding how to optimize solutions. It’s important to be ready for questions that may require a deeper understanding of algorithms and data structures.