Question d’entretien chez DoorDash

coding 1. minimum path sum from one leaf node to another follow up: minimum sum from one active node to another, active node could appear anywhere, leaf node are active node recursion 3 steps coding 2. minimum sum of distance to all local restaurant find median for rows and cols 3. system design design a 3-day donation promo event 4. engineering values conflict, etc