Skip to content

Implement Containing Nearby Duplicate Problem #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Subhosjx merged 1 commit into from
Oct 28, 2025
Merged

Implement Containing Nearby Duplicate Problem #8

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions 219. Containing Nearby Duplicate Problem.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
int n=nums.size();
unordered_map<int,int> indexmap;

for(int i=0;i<n;i++){
int cur_num=nums[i];
if(indexmap.count(cur_num)){
int prev_index=indexmap[cur_num];
if(i-prev_index<=k){
return true;
}
}
indexmap[cur_num]=i;
}

return false;
}
};