Skip to content

[youngduck] WEEK 01 Solutions #2912

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

Open
youngduck wants to merge 4 commits into
base: main
Choose a base branch
from
+10 −0
Open

[youngduck] WEEK 01 Solutions #2912

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
0f9d868
feat: Contains Duplicate 풀이
youngduck Nov 9, 2026
05a1650
Merge branch 'main' into week1
youngduck Nov 9, 2026
460d45e
fix: Contains Dupilicate 개행라인 추가
youngduck Nov 9, 2026
75437be
Merge branch 'week1' of https://github.com/youngduck/leetcode-study i…
youngduck Nov 9, 2026
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
10 changes: 10 additions & 0 deletions contains-duplicate/youngduck.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
// 시간복잡도 : new Set은 n번 x add O(1) 인 함수, 즉 배열의 모든 원소를 한번씩 순회하므로 O(n)
// 공간복잡도 : n개의 원소를 Set에 저장하므로 O(n)

function containsDuplicate(nums: number[]): boolean {

const uniqueNumsSet = new Set(nums);

return uniqueNumsSet.size !== nums.length;
};

Loading