DoorDash Software Engineer Tech Phone Screen: Max Path Sum Between Any Two Leaves in Binary Tree

2022(Jan - Mar)Software EngineerMasterFulltime@doordash| Fail| JobHopper

Interview question focusing on finding the maximum path sum between any two leaves in a binary tree, part of DoorDash's full-time software engineer tech phone screen.

Check more interview questions and experiences about DoorDash

Please log in to view interview details