LeetCode Question · Nov 2024

UBER L5

SWE Phone Screen Senior

1,026 views 5 replies

Question Details

YOE: 6.5 Sharing question below Uber round 1: there is a tree with each node having value. A starts from root and B starts from node B. calcuate the maximum point A can collect...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree

More from Uber

Reddit Left industry for 5 years, how fucked am I? Reddit Uber | System Design Round | L5 Reddit Uber SWE-1 India Hiring – Cleared OA but Ended Up Waitlisted (Which Basically Means Rejected) Reddit Uber EM Interview Experience Reddit Uber Strategic Operations Interview

← All Uber questions Uber Software Engineer Questions → All Graph Questions →