ByteDance / TikTokCoding·60 minMembers
Binary Tree Maximum Path Sum (with path reconstruction)
Members only
Classic 'max path sum that may bend at any node' on a binary tree, plus the harder follow-up of reconstructing the actual node sequence — not just the score.
SWE
tree
dfs
recursion
dp
hard
Frequency
Low
Last asked
2026-01-26
Stage
phone-screen · onsite-coding
Log in to continue reading the full content
