220. Contains Duplicate III

LeetCodeArraySliding WindowSortingBucket SortOrdered SetOpen on judge ↗

You are given an integer array nums and two integers indexDiff and valueDiff. Find a pair of indices (i, j) such that: - i != j, - abs(i - j) <= indexDiff. - abs(nums[i] - nums[j]) <= valueDiff, and Return true if such pair exists or false otherwise. Example 1: Input: nums = [1,2,3,1], indexDiff = 3, valueDiff = 0 Output: true Explanation: We can choose (i, j) = (0, 3). We satisfy the thr

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI