# Input:
# 2
# / \
# 3 5
# / \
# 1 5
#
# Output:
# [6, 10, 7]
#
# path_sums(TreeNode root) -> int[]
This Meta interview question asks for all root-to-leaf path sums in a binary tree. A depth-first search is used to propagate the running sum, recording values when a leaf is reached. It tests recursion, tree traversal, and handling of leaf conditions.
The VOprep team has long accompanied candidates through various major company OAs and VOs, including Meta, Amazon, Citadel, SIG, providing real-time voice assistance, remote practice, and interview pacing reminders to help you stay smooth during critical moments. If you are preparing for these companies, you can check out our customized support plans—from coding interviews to system design, we offer full guidance to help you succeed.
END
