# [219\. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)

:::spoiler Solution HashMap

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k)
    {
        unordered_map<int, int> m;
        for (int i = 0; i < nums.size(); ++i)
        {
            if (i > k && m[nums[i - k - 1]] < i - k + 1)
            {
                m.erase(nums[i - k - 1]);
            }
            
            if (m.count(nums[i])) return true;
            m[nums[i]] = i;
        }
        return false;
    }
};

- 時間複雜度：$O(n)$
- 空間複雜度：$O(n)$
:::