Available question text
Related questions
Continue with questions that share topics or the same question type.
- Smallest Common Region
Coding · Array · Binary Lifting · Breadth-First Search
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
NVIDIA
Leetcode 3067. Count Pairs of Connectable Servers in a Weighted Tree Network
Reported Dec 19, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 2 records
Rippling
Count Pairs of Connectable Servers in a Weighted Tree Network
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 94.6. This is not an interview probability.
View sourceRippling
Count Pairs of Connectable Servers in a Weighted Tree Network
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 82. This is not an interview probability.
View source