Practice Path Existence Queries in a Graph II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer n representing the number of nodes in a graph, labeled from 0 to n - 1. You are also given an integer array nums of length n and an integer maxDiff. An undirected edge exists between nodes i and j if the absolute difference between nums[i] and nums[j] is at most maxDiff (i.e., |nums[i] - nums[j]| <= maxDiff). You are also given a 2D integer array queries. For each queries[i] = [ui, vi], find the minimum distance between nodes ui and vi. If no path exists between the two nodes, return -1 for that query. Return an array answer, where answer[i] is the result of the ith query. Note: The edges between the nodes are unweighted. Example 1: Example 2: Thus, the output is [1, 2, -1, 1].
Source: Path Existence Queries in a Graph II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
n = 5, nums = [1,8,3,4,2], maxDiff = 3, queries = [[0,3],[2,4]]
[1,1]
# Example 2
n = 5, nums = [5,3,1,9,10], maxDiff = 2, queries = [[0,1],[0,2],[2,3],[4,3]]
[1,2,-1,1]
# Example 3
n = 3, nums = [3,6,1], maxDiff = 1, queries = [[0,0],[0,1],[1,2]]
[0,-1,-1]
Constraints
Related LeetCode Problems
Practice more problems similar to Path Existence Queries in a Graph II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.