How should I practice Periodic-Color Binary Forest Roots?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Periodic-Color Binary Forest Roots associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Periodic-Color Binary Forest Roots

Google● HardFULLTIMEPHONE SCREEN

Problem statement

You are given an undirected forest with nodes numbered from 0 through n - 1. The array edges contains its undirected edges, and colors[i] is R, W, or B.

Choose one root for every connected component. In each rooted component:

The problem statement continues

Pro

Examples

Example 1

n = 4edges = [[0,1],[1,2],[1,3]]colors = "RWBB"return = [0]

Rooting at node 0 gives depth colors R, W, then B. Every node has at most two children.

Original screenshot from the interview report

Pro

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights