DoorDash Domain Algorithms and Optimization Questions

Focus on algorithms and optimization problems common to on demand delivery marketplaces, such as batching orders within time windows, routing and vehicle routing problems with capacity and time constraints, dynamic dispatch heuristics, rebalancing, and pricing or compensation computations. Candidates should explain modeling choices, objective functions, evaluation metrics, algorithmic complexity, approximate and exact solution techniques, and considerations for deploying these algorithms in real time systems at scale.