DoorDash

DoorDash Software Engineer Onsite Coding Questions

38+ questions from real DoorDash Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

38
Questions
8
Topic Areas
10+
Sources

What does the DoorDash Onsite Coding round test?

The DoorDash onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

DoorDash Software Engineer Onsite Coding Questions

Say if DoorDash along with other partners across US is sponsoring for 3-day charity event where huge partipation of more than 3 million customers are expected to participare and simply...

I went to the nearest DashMart for the coding interview. I was interviewed by a middle-aged white man with a strong classmate vibe; there wasn't much interaction during the interview. SD asked us to d

There were four rounds in total. Coding - Codecraft The Dasher payment question used a scanline approach. Everything had to be written from the class definition onwards. Using Java meant I was incredi

Round 1: System Design + Domain Knowledge The problem focused on designing an Ads Click Aggregator. The session was conducted by a Data Engineer and proved difficult due to the interviewer’s appar

**Problem Statement** You are given a city represented as a 2D grid containing the following cell types: * `' '`: Open road. Travel is allowed in four directions (up, down, left, right). * `'X'`: Bloc

**Context and Format** The interview consisted of a collaborative, practical coding exercise rather than a standard algorithmic problem. The scenario involved migrating from a monolith to a microservi

Overview * 5 minute intro * 50 minutes on debugging exercise * 5 minutes for Q/A ## Debugging Dasher Assignment Service You have a single `main.py` file (or equivalent in your chosen programming lan

This round was a pretty fun round and you do need to come with a local editor with an AI setup. A ChatGPT tab is not enough. You need to use stuff like VSCode with Copilot, Cursor, claude code, etc. I

HM BQ: The hiring manager was very nice and kept asking follow-up questions about the impact. Branding Round: I worked on a file system and had to implement a Trie tree. I talked a bit about OOP funda

First question: LeetCode 200. Number of Islands (https://leetcode.com/problems/number-of-islands/) * Follow-up: LeetCode 695. Max Area of Island (https://leetcode.com/problems/max-area-of-island/)

Same question as this post: https://leetcode.com/discuss/interview-question/1544410/Doordash-TPS-Senior-Software-Engineer At DoorDash, many deliveries are scheduled well in advance. To improve our assignment rate, we want to enable dashers to claim these scheduled deliveries early....

From an onsite Given a binary tree, find the maximum path sum from any two "alive nodes" within the tree. We can assume a node is an alive node if and...

I heard that you should practice from this pool koko-eating-bananas subarray-sum-equals-k swim-in-rising-water asteroid-collision longest-common-subsequence operations-on-tree my-calendar-ii car-pooling minimum-size-subarray-sum k-diff-pairs-in-an-array next-greater-element-iii basic-calculator serialize-and-deserialize-binary-tree decode-ways unique-paths-ii I gotserialize and deserialize a binary tree and a question about restaurant names, which was just about anagrams and swapping letters in...

Doordash virtual onsite question: Given a set list of pickups and deliveries for order, figure out if the given list is valid or not. A delivery cannot happen for an order before...

DoorDash virtual onsite question: Asked this: https://leetcode.com/discuss/interview-question/846916/Validate-Orders-Path-(Doordash) Follow up: Find longest valid subarray Ex 1: orders = [\'P1\', \'P1\', \'D1\'], return [\'P1\', \'D1\'] Ex 2: orders = [\'P1\', \'P1\', \'D1\', \'D1\'], return [\'P1\',...

Implement (code) a Key value store with transactions. Write a Fully funcitonal code in 25-30 min in interview with test cases Set Get Delete are methods in Key value store for transactions Begin Commit Rollback Ideas are welcome,

LeetCode #286: Walls and Gates. Difficulty: Medium. Topics: Array, Breadth-First Search, Matrix. Asked at DoorDash in the last 6 months.

LeetCode #1235: Maximum Profit in Job Scheduling. Difficulty: Hard. Topics: Array, Binary Search, Dynamic Programming, Sorting. Asked at DoorDash in the last 6 months.

LeetCode #1268: Search Suggestions System. Difficulty: Medium. Topics: Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue). Asked at DoorDash in the last 6 months.

LeetCode #456: 132 Pattern. Difficulty: Medium. Topics: Array, Binary Search, Stack, Monotonic Stack, Ordered Set. Asked at DoorDash in the last 6 months.

See All 38 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access