โ† Amazon questions

Maximum Non-Adjacent Sum in N-ary Tree

Filed under Amazon

Given an N-ary tree where each node has a weight, find the maximum sum of a subset of nodes such that no two connected nodes are included (maximum independent set / non-adjacent sum).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.