← Google questions

Tree Coloring Constraint

Filed under Google

Given a tree where each node is colored black or white, find the minimum cost to recolor nodes such that no two adjacent nodes are black.

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 Google questions

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