Contains Duplicate II

Try to solve the Contains Duplicate II problem.

We'll cover the following

Statement

You are given an integer array, nums, and an integer k. Determine whether two distinct indices, i and j, are in the array, such that nums[i] == nums[j] and the absolute difference between i and j is at most k. Return TRUE if such indices exist; otherwise, return FALSE.

Constraints:

  • 1≤1 \leq nums.length ≤103\leq 10^3

  • −103≤-10^3 \leq nums[i] ≤103\leq 10^3

  • 0≤0 \leq k ≤104\leq 10^4

Examples

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.