OA: Disk Storage, Count Palindrome-Rearrangeable Paths to the Root

Also reported as Count Paths That Can Form a Palindrome in a Tree · LeetCode 2791 Variant

OAUberLast reported August 2026Medium Frequency
Reported
6× across candidate reports
First seen
November 2025
Last reported
August 2026
Reported outcome
mixed

Problem Overview

Uber online assessment question, reconstructed from 6 candidate reports (November 2025 to August 2026). The write-up includes a Python solution that passes 7 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.
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.
Is this helpful?