Doordash Swe Phone Screen | Re - Doordash

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.

Full Experience

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

Interview Questions (1)

Maximum Path Sum between Live Nodes in a Binary Tree

Data Structures & AlgorithmsHard

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.

Help the Community

Doordash SWE Phone Screen | Rejected

Summary

Full Experience

Interview Questions (1)

Join the Discussion

No comments yet