Skip to content

Practice Minimum Absolute Difference Between Elements With Constraint

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

Medium#2817
LeetCode Problem

Minimum Absolute Difference Between Elements With Constraint

ArrayBinary SearchOrdered Set

Problem Statement

You are given a 0-indexed integer array nums and an integer x. Find the minimum absolute difference between two elements in the array that are at least x indices apart. In other words, find two indices i and j such that abs(i - j) >= x and abs(nums[i] - nums[j]) is minimized. Return an integer denoting the minimum absolute difference between two elements that are at least x indices apart.

Source: Minimum Absolute Difference Between Elements With Constraint on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [4,3,2,4], x = 2
Output
0

# Example 2

Input
nums = [5,3,2,10,15], x = 1
Output
1

# Example 3

Input
nums = [1,2,3,4], x = 3
Output
3

Constraints

1 <= nums.length <= 10^5
1 <= nums[i] <= 10^9
0 <= x < nums.length

Related LeetCode Problems

Practice more problems similar to Minimum Absolute Difference Between Elements With Constraint.

4 Median of Two Sorted Arrays Hard33 Search in Rotated Sorted Array Medium34 Find First and Last Position of Element in Sorted Array Medium35 Search Insert Position Easy1 Two Sum Easy
← Previous Double a Number Represented as a Linked ListNext → Apply Operations to Maximize Score

Review your practice with PhantomCodeAI

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

Start Free