Screening Interview: a variant of max binary tree path sum: https://leetcode.com/problems/binary-tree-maximum-path-sum/description/. The difference was the paths could only start and end at leaves and the follow-up question was to get the max sum between 2 active nodes in the tree. TreeNode has one more boolean isActive.

Got a call for onsite interview in 10 days. Did anyone gave onsite recently for Doordash? Want to know what type of questions especially for system design were asked by Doordash.