g0201_0300.s0219_contains_duplicate_ii.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation
Show all versions of leetcode-in-kotlin Show documentation
Kotlin-based LeetCode algorithm problem solutions, regularly updated
219\. Contains Duplicate II
Easy
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`.
**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 <= 105
* -109 <= nums[i] <= 109
* 0 <= k <= 105