Skip to content

[SAM] WEEK 01 Solutions #1711

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
merged 2 commits into from
Jul 26, 2025
Merged

[SAM] WEEK 01 Solutions #1711

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d8dff05
feat : solve contains-duplicate
SamTheKorean Jul 24, 2025
8c0007e
fix : file name
SamTheKorean Jul 24, 2025
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
17 changes: 17 additions & 0 deletions contains-duplicate/SamTheKorean.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
// TC : O(n) : it iterates for the length of nums
// SC : O(n) : hashmap is created with the size of nums

func containsDuplicate(nums []int) bool {
hashmap := make(map[int]bool)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

해시맵을 사용해서 풀이한게 인상적이네요.


for i:=0;i<len(nums);i++ {
if hashmap[nums[i]] {
return true
}

hashmap[nums[i]] = true
}

return false
}