Vertical Order Traversal of a Binary Tree

Phone ScreenUberLast reported March 2026Low Frequency

Problem Overview

Uber phone-screen question, reconstructed from 1 candidate report (March 2026). The write-up includes a Python solution that passes 6 test cases.

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.

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.