Skip to content

Practice Path Existence Queries in a Graph I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3532
LeetCode Problem

Path Existence Queries in a Graph I

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 sorted in non-decreasing order, 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], determine whether there exists a path between nodes ui and vi. Return a boolean array answer, where answer[i] is true if there exists a path between ui and vi in the ith query and false otherwise.

Source: Path Existence Queries in a Graph I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
n = 2, nums = [1,3], maxDiff = 1, queries = [[0,0],[0,1]]
Output
[true,false]

# Example 2

Input
n = 4, nums = [2,5,6,8], maxDiff = 2, queries = [[0,1],[0,2],[1,3],[2,3]]
Output
[false,false,true,true]

Constraints

1 <= n == nums.length <= 10^5
0 <= nums[i] <= 10^5
nums is sorted in non-decreasing order.
0 <= maxDiff <= 10^5
1 <= queries.length <= 10^5
queries[i] == [ui, vi]
0 <= ui, vi < n

Related LeetCode Problems

Practice more problems similar to Path Existence Queries in a Graph I.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.