Como se preparar para entrevistas na DoorDash

+15

Tell me about a time you had a conflict with a coworker. How did you resolve it?

+14

What project are you most proud of?

+10

Design a Job Scheduler

Design a distributed job scheduler that can handle high-throughput job processing (10,000+ jobs per second), support both scheduled (cron-based) and ad-hoc job execution, include retry mechanisms for failed jobs, and maintain execution history for up to one year.

+9

Describe your most impactful project

+7

Tell me about a project where the requirements were not clear or kept changing. How did you adapt and maintain productivity?

+7

Give me an example of a tough or critical piece of feedback you received.

+6

Tell me about a conflict you had at work.

The interviewer focused on a conflict that comes from different perspectives or ideas on how to execute a certain task.

+5

Design a Metrics Aggregator

Design a metrics aggregation system that collects count-based metrics (like user signups, system errors, ad clicks) from services via a client library and displays them as histogram data on a dashboard. The system should support querying aggregated metrics within specific time frames for monitoring and analytics purposes.

+4

What was a situation where you didn't agree with your manager or superior's decision?

+4

Describe a time you failed and how you managed the situation

+4

Design Instagram

Design a photo-sharing social media platform where users can upload photos, follow other users, and view a chronological feed of posts from people they follow.

+2

What is the hardest challenge you've overcome at work?

+2

Tell me about a project of your choice and its challenges

+2

Leetcode 210. Course Schedule II

Given numCourses and prerequisite pairs, return any ordering of courses that satisfies all prerequisites or an empty array if impossible — this is essentially computing a topological sort of a directed graph and detecting cycles.

+2

Tell me a time you helped an engineer promote

+1

Describe a time when you had to coach someone

+1

Describe a time when you had to get alignment across the organization

+1

Describe your current role

+1

Leetcode 124. Binary Tree Maximum Path Sum

Find the maximum sum of any non-empty connected path in a binary tree (nodes used at most once), where the path can start and end at any nodes and node values may be negative. You must account for single-node paths when all values are negative.

+1

Leetcode 207. Course Schedule

Given courses as nodes and prerequisite pairs as directed edges, determine whether the directed graph is acyclic — return true if a topological ordering exists (all courses can be completed), otherwise false if a cycle prevents completion.

Tell me about a time when someone on your team was struggling and how you helped them

Tell me about a time when you uncovered a significant problem in your team.

Leetcode 875. Koko Eating Bananas

Find the minimum integer eating speed k such that the total hours required (sum over piles of ceil(piles[i]/k)) is ≤ h; because the required hours decreases monotonically with k, this is solved by binary searching k between 1 and max(piles).

Leetcode 317. Shortest Distance from All Buildings

Given a grid with buildings (1), empty land (0), and obstacles (2), find an empty cell that minimizes the sum of shortest (Manhattan) path distances from all buildings while avoiding obstacles; return that minimum sum or -1 if no empty cell is reachable from every building. This problem primarily requires repeated BFS distance accumulation and reachability checks from each building to identify the globally optimal empty location.