doordash logo
DoorDash· Software Engineer

Doordash SWE Phone Screen | Rejected

Posted
4 Apr 2025
355 reads

Summary

I had a phone screen with Doordash for a Software Engineer role where I was asked a modified version of 'Binary Tree Maximum Path Sum'. Despite solving most of it, I missed a corner case and was ultimately rejected.

How it went

Hi all, I had my phone screen recently with Doordash.

Question: https://leetcode.com/problems/binary-tree-maximum-path-sum/description/

He called leaf nodes "live nodes" and wanted the maximum sum of a path that starts and ends at a live node. I solved it but missed a corner case.

I had to run my code so make sure you know syntax for setting up a running environment, like create a TreeNode, and set the left and right nodes etc.

Got rejected in the end

Questions asked (1)

  1. 01

    Maximum Path Sum between Live Nodes in a Binary Tree

    Data Structures & Algorithms · Hard

    The interviewer presented a problem based on 'Binary Tree Maximum Path Sum'. The modification was that leaf nodes were referred to as 'live nodes', and the task was to find the maximum sum of a path that starts and ends at a live node.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at DoorDash recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!