Question 1

Walls and Gates — DoorDash Interview Question

Accepted Answer

"Walls and Gates" is a medium difficulty problem asked at DoorDash interviews. It covers the following topics: Array, Breadth-First Search, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/walls-and-gates

Question 2

Binary Tree Maximum Path Sum — DoorDash Interview Question

Accepted Answer

"Binary Tree Maximum Path Sum" is a hard difficulty problem asked at DoorDash interviews. It covers the following topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. You can practice it on LeetCode: https://leetcode.com/problems/binary-tree-maximum-path-sum

Question 3

Longest Increasing Path in a Matrix — DoorDash Interview Question

Accepted Answer

"Longest Increasing Path in a Matrix" is a hard difficulty problem asked at DoorDash interviews. It covers the following topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Topological Sort, Memoization, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/longest-increasing-path-in-a-matrix

Question 4

Maximum Profit in Job Scheduling — DoorDash Interview Question

Accepted Answer

"Maximum Profit in Job Scheduling" is a hard difficulty problem asked at DoorDash interviews. It covers the following topics: Array, Binary Search, Dynamic Programming, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/maximum-profit-in-job-scheduling

Question 5

Search Suggestions System — DoorDash Interview Question

Accepted Answer

"Search Suggestions System" is a medium difficulty problem asked at DoorDash interviews. It covers the following topics: Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue). You can practice it on LeetCode: https://leetcode.com/problems/search-suggestions-system

Question 6

Koko Eating Bananas — DoorDash Interview Question

Accepted Answer

"Koko Eating Bananas" is a medium difficulty problem asked at DoorDash interviews. It covers the following topics: Array, Binary Search. You can practice it on LeetCode: https://leetcode.com/problems/koko-eating-bananas

#	Question Title	Difficulty	Frequency	Topics
1	Walls and Gates	MEDIUM	100.0	ArrayBreadth-First SearchMatrix
2	Binary Tree Maximum Path Sum	HARD	95.3	Dynamic ProgrammingTreeDepth-First Search+1
3	Longest Increasing Path in a Matrix	HARD	92.4	ArrayDynamic ProgrammingDepth-First Search+5
4	Maximum Profit in Job Scheduling	HARD	87.1	ArrayBinary SearchDynamic Programming+1
5	Search Suggestions System	MEDIUM	82.2	ArrayStringBinary Search+3
6	Koko Eating Bananas	MEDIUM	79.5	ArrayBinary Search
7	Design File System	MEDIUM	75.3	Hash TableStringDesign+1
8	Most Profit Assigning Work	MEDIUM	75.3	ArrayTwo PointersBinary Search+2
9	Check if One String Swap Can Make Strings Equal	EASY	74.4	Hash TableStringCounting
10	Shortest Distance from All Buildings	HARD	72.9	ArrayBreadth-First SearchMatrix

Explore 450+ Companies

Companies

DoorDash

Want to see more?

DoorDash Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

DoorDash

Want to see more?

DoorDash Interview Questions

Ai Assistant Kas