# Blogs Hub

### by Sumit Chourasia | Sep 25, 2020 | Category :coding | Tags : algorithmarrayडेटा-संरचनाआसानleetcode

#### Contains Duplicate II - Array - Easy - LeetCode - मिनी टीवी

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most 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

``````public class Solution {
public bool ContainsNearbyDuplicate(int[] nums, int k) {
var map = new Dictionary<int,int>();
for(int i=0;i<nums.Length;i++){
if(map.ContainsKey(nums[i])){
if(i-map[nums[i]]<=k){
return true;
}
else{
map[nums[i]]=i;
}
}
else{
}
}

return false;
}
}``````

Time Complexity: O(n)

Space Complexity: O(n)

Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia