Search
⌘K
Get Premium
Leetcode 1697. Checking Existence of Edge Length Limited Paths
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.