Hi all, giving back to the community here. I had my phone screen on March 17, 2025.

Question: https://leetcode.com/problems/binary-tree-maximum-path-sum/description/?envType=company&envId=doordash&favoriteSlug=doordash-all.

He called leaf nodes "live nodes" and wanted the maximum sum of a path that starts and ends at a live node, which is basically the same as the Leetcode question. I solved it optimally, but was a bit slow on the follow up but finished the code.

Follow up: Now you can have "live nodes" anywhere in the tree, how would you modify the code so the maximum path still starts and ends at a "live node"? You cannot pass through a "live node".

Interviewer was super unfriendly and seemed super tired. I did have to run my code so make sure you know syntax for setting up a running environment.

Got rejected in the end.