Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > No Two Neighbours Chosen > Editorial

No Two Neighbours Chosen — Solution & Editorial

Back to the Problem

Tree DP with two states per node (take / skip): take[u] = w[u] + ∑ skip[child]; skip[u] = ∑ max(take, skip) over children. Iterate over a post-order to avoid recursion limits.

Complexity: O(N)