Due to an NDA, I cannot disclose the actual questions. The behavioral interview was pretty straightforward, where they generally wanted to evaluate how well I could work in a team. The technical questions were leetcode medium-hard type questions on strings, graphs, tries, and hashmaps.
Get ready to be asked questions on traversal, data structures, and algorithms.
Signed NDA. You should practice LeetCode medium questions and talk out loud while you practice them. You should really know your binary trees and graphs. Also do not skimp on the behavioral Googlyness interview: they need to know that you are good at working on a team and communicating with others. During the coding rounds, make sure to always ask clarifying questions before coding and explain your initial approach in detail. And always talk while coding!
Tell me a little about yourself, walk me through your past resume? Strengths/weaknesses? Case-study based questions
implement a calculator - same question from leetcode
The phone interview was a coding question about finding the longest substring that is a legal word. It's similar to the subset question.
The interview comes with two questions, all about basic programming: revert the bit sequence of a number(32 bits), like 0100 0110 0000 0001 -> 1000 0000 0110 0010. Just a reminder: the interviewer did require the most efficient way of programming.
Why are you interested in DoorDash and in this particular role?
The first question was about guessing a secret string based on some score a guessed string would get. The objective was to make as few guesses as possible. The second question was a find the minimum cost path in a grid type of problem. The third was a very simple DP problem.
Didn't go to the interview round
Viewing 2541 - 2550 interview questions