3820. Pythagorean Distance Nodes in a Tree

LeetCodeTreeBreadth-First SearchOpen on judge ↗

You are given an integer n and an undirected tree with n nodes numbered from 0 to n - 1. The tree is represented by a 2D array edges of length n - 1, where edges[i] = [ui, vi] indicates an undirected edge between ui and vi. You are also given three distinct target nodes x, y, and z. For any node u in the tree: - Let dx be the distance from u to node x - Let dy be the distance from u to node y

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI