-
Notifications
You must be signed in to change notification settings - Fork 126
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.
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
[구문영] Week1 문제 풀이 #311
[구문영] Week1 문제 풀이 #311
Conversation
GUMUNYEONG
commented
Aug 12, 2024
•
edited
Loading
edited
- Contains Duplicate #217
- Number of 1 Bits #232
- Top K Frequent Elements #237
- Kth Smallest Element In a Bst #252
- Palindromic Substrings #267
마지막 라인에 개행 넣어주시면 좋을 것 같습니다. 이유는 아래 링크 보시면 좋을 것 같습니다 : ) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
수고 많으셨습니다. 3문제 푸신 것도 잘 하신 거라고 생각합니다. 모임 전까지 PR 병합 부탁드리겠습니다.
contains-duplicate/GUMUNYEONG.js
Outdated
}; | ||
|
||
// TC: O(n) | ||
// SC: O(n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
마지막에 line break 없는 파일이 메인 브랜치에 유입되지 않도록 각별히 주의바랍니다. (참고: #334)
number-of-1-bits/GUMUNYEONG.js
Outdated
}; | ||
|
||
// TC: O(log n) | ||
// SC: O(log n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
공간 복잡도 분석이 정확한지 재고해보시면 좋을 것 같아요!