Contains Duplicate II
Easy
Hashing
Given an integer array and an integer k, print true if there are two distinct indices i and j with nums[i] == nums[j] and |i - j| <= k.
Constraints
1 <= n <= 10^5 -10^9 <= nums[i] <= 10^9 0 <= k <= 10^5
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.