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 ...
Access this course and 1400+ top-rated courses and projects.