Quick Overview

Count tree vertices whose positive distances to three fixed vertices form a Pythagorean triple, including distance ordering and large-tree edge cases.

Count Tree Vertices with Pythagorean Distances

Company: IBM

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Online Assessment

Overview: Count tree vertices whose positive distances to three fixed vertices form a Pythagorean triple, including distance ordering and large-tree edge cases.

Read the full IBM Software Engineer interview experience this question came from

Loading…