LeetCode Question · Sep 2019 · Los Angeles

Facebook | Phone Screen | Sums of all the root-to-leaf paths & Kth largest element

SWE Phone Screen
Sign in to bookmark Original →
1 upvote 1,214 views 5 replies

Question Details

Q1: Write a function that, given a binary tree of integers, returns the sums of all the root-to-leaf paths. Input: 2 / \\ 3 5 / \\ 1 5 Output: [6, 10, 7] Q2:

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree Arrays Heap

More from Meta

Reddit Leetcode is cooked in 2026 and we don't hire people who only grind leetcode. Reddit Returning to SWE work after 3 years of cancer treatment Reddit 2026 New Grad Recap Reddit Most likely failed meta phone screen Reddit Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops
← All Meta questions Meta Software Engineer Questions → All Binary Tree Questions →