Quick Overview

For every node in a tree of strong and weak neurons weighted +1 and -1, find the best connected nonempty vertex set containing that node. A linear-time rerooting dynamic program combines positive subtree contributions and propagates useful value from the parent side.

Find the Best Connected Strength for Every Tree Node

Company: Microsoft

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Online Assessment

Overview: For every node in a tree of strong and weak neurons weighted +1 and -1, find the best connected nonempty vertex set containing that node. A linear-time rerooting dynamic program combines positive subtree contributions and propagates useful value from the parent side.

Loading…