Tech Phone Screen at otter.ai: Binary Tree Maximum Root-to-Leaf Sum and Path Printing

Interview question at otter.ai focused on finding the maximum root-to-leaf sum and printing the path in a binary tree. Candidate uncertain about root requirement after one week without contact.

Check more interview questions and experiences about otter.ai

Please log in to view interview details