Available question text
Given an undirected weighted graph, determine for each query whether there exists a path between two nodes using only edges with weights strictly less than a given limit. This is typically solved offline by sorting queries by limit and incrementally connecting edges by weight using a disjoint-set (union-find).
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 1697. Checking Existence of Edge Length Limited Paths
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source