Contains Duplicate II

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

Output: true

The element 1 appears at index 0 and index 3. Since abs(0 - 3) = 3 <= k, we return true.

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

Output: true

The element 1 appears at index 2 and index 3. Since abs(2 - 3) = 1 <= k, we return true.

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

Output: false

While there are duplicates, no pair of duplicate values are within k = 2 indices of each other. The closest duplicate pair (1 at index 0 and 3) has distance 3 > k.

Contains Duplicate II

Problem

Constraints

Examples