ByteDance / TikTokCodingMembers
Equalize Root-to-Leaf Path Sums in an N-ary Tree
Members only
After a warm-up (most frequent array element, ties broken toward the smaller number), the main problem gives an n-ary tree of integers where each operation increments one node's value by 1; return the...
SWE
tree
dfs
greedy
medium
Frequency
Single report
Last asked
2026-07-14
Stage
phone-screen
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
