<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> <em>if there are two <strong>distinct indices</strong> </em><code>i</code><em> and </em><code>j</code><em> in the array such that </em><code>nums[i] == nums[j]</code><em> and </em><code>abs(i - j) &lt;= k</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,1], k = 3
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,0,1,1], k = 1
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,1,2,3], k = 2
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>0 &lt;= k &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        
        int sz = nums.size();
        vector<int>idx(sz, 0);

        bool f_possible = false;

        for(int i = 0;i < sz;i++)
        {
            idx[i] = i;
        }

        stable_sort(idx.begin(), idx.end(), [&nums](const size_t idx1, const size_t idx2){return nums[idx1] < nums[idx2];});

        sort(nums.begin(), nums.end());

        for(int j = 0;j < idx.size()-1;j++)
        {
            if(nums[j] == nums[j+1])
            {
                if(abs(idx[j+1] - idx[j]) <= k)
                {
                    return true;
                }
            }
        }

        return f_possible;
    }
};
67679