← Google questions

Minimum weight edge deletion to disconnect all leaf pairs in a tree

Filed under Google

Given an edge-weighted tree with positive weights, find a subset of edges with the minimum total weight to delete such that no two leaf nodes from the original tree are connected by a path in the…

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.