Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1724. Checking Existence of Edge Length Limited Paths II
Design a data structure to handle a sequence of operations that add weighted edges and answer whether two nodes are connected by a path whose every edge is below a given length limit; the core challenge is efficient dynamic connectivity under weight thresholds, typically solved by ordering edges/queries and using union-find variants (e.g., offline processing or DSU with rollback/segment-tree techniques).
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.