Skip to content

Practice Contains Duplicate II

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

Easy#219
LeetCode Problem

Contains Duplicate II

Problem Statement

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.

Source: Contains Duplicate II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# 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

Related LeetCode Problems

Practice more problems similar to Contains Duplicate II.

Review your practice with PhantomCodeAI

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