Practice Checking Existence of Edge Length Limited Paths
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Checking Existence of Edge Length Limited Paths
Problem Statement
An undirected graph of n nodes is defined by edgeList, where edgeList[i] = [ui, vi, disi] denotes an edge between nodes ui and vi with distance disi. Note that there may be multiple edges between two nodes. Given an array queries, where queries[j] = [pj, qj, limitj], your task is to determine for each queries[j] whether there is a path between pj and qj such that each edge on the path has a distance strictly less than limitj . Return a boolean array answer, where answer.length == queries.length and the jth value of answer is true if there is a path for queries[j] is true, and false otherwise.
Source: Checking Existence of Edge Length Limited Paths on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
n = 3, edgeList = [[0,1,2],[1,2,4],[2,0,8],[1,0,16]], queries = [[0,1,2],[0,2,5]]
[false,true]
# Example 2
n = 5, edgeList = [[0,1,10],[1,2,5],[2,3,9],[3,4,13]], queries = [[0,4,14],[1,4,13]]
[true,false]
Constraints
Related LeetCode Problems
Practice more problems similar to Checking Existence of Edge Length Limited Paths.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.