Contains Duplicate II

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

DescriptionExplanationSolutions

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Example 1

Input: nums = [1,2,3,1], k = 3

Output: true

Example 2

Input: nums = [1,0,1,1], k = 1

Output: true

Example 3

Input: nums = [1,2,3,1,2,3], k = 2

Output: false

Constraints

• 1 <= nums.length <= 10^5
• -10^9 <= nums[i] <= 10^9
• 0 <= k <= 10^5

Hints

No hints yet.

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

JavaJavaScriptTypeScriptPython3C#

Run

class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { } }

Test results

No test cases yet.