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 difference between i and jis at most k.

Subscribe to see which companies asked this question

class Solution {
public:
	bool containsNearbyDuplicate(vector<int> &nums, int k) {
		if(nums.size()==0) return false;
		map<int, int> maps;
		map<int, int>::iterator it;
		for(int i=0; i<nums.size(); i++) {
			it = maps.find(nums[i]);
			if(it != maps.end()) {
				int index = it->second;
				if(i-index<=k) return true;
			} 

			maps[nums[i]] = i;
		}

		return false;
	}
};