DoorDash | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview began with a technical phone screen. Initially, I struggled to come up with a solution and ended up writing a brute-force approach with a time complexity of O(N^2). After some guidance, I realized that after removing an element, I only needed to check if the neighboring points became eligible for ordering. This led to an O(N) solution. After the interview, I received a detailed explanation of the problem, which highlighted the importance of preparation for similar questions.
Technical Questions
- Eligible Orders After Removal (Graph, Depth-First Search, Breadth-First Search)
Tips & Insights
It’s crucial to prepare for graph-related questions, especially those that involve understanding the implications of removing elements and their effects on neighboring nodes.