N-ary Tree: Total Sum, Max Path Sum, and the Max Path Nodes

Phone ScreenUberLast reported February 2026Low Frequency

Reported: 2× across candidate reports
First seen: January 2026
Last reported: February 2026
Reported outcome: unknown

Problem Overview

Uber phone-screen question, reconstructed from 2 candidate reports (January 2026 to February 2026). Candidates reported 2 follow-ups. The write-up includes a Python solution that passes 9 test cases.

2 candidate-reported follow-ups — the probes candidates report being asked, with the trigger for each
The full problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Unlock the full Uber catalog

Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Uber question.

Unlock with Pro

Already a member? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.