Available question text
Given n and a threshold, determine for each query whether two nodes in 1..n are connected in the graph where an edge exists between x and y iff gcd(x,y) > threshold. The core challenge is efficiently answering connectivity queries by grouping numbers that share any divisor > threshold (typically done with a union-find/DSU over multiples of each divisor).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1627. Graph Connectivity With Threshold
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source