Skip to content

[hyogshin] WEEK 02 solutions #1741

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 4 commits into from
Aug 4, 2025
+29 −0
Merged

[hyogshin] WEEK 02 solutions #1741

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
67299f4
feat: add 0218 Valid Anagram solution
hyogshin Jul 28, 2025
fdd2a3c
docs: add time and space complexity
hyogshin Jul 28, 2025
5916ab4
chore: merge origin/main
hyogshin Jul 28, 2025
ba006ea
docs: insert a line break at the end of file
hyogshin Aug 4, 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
14 changes: 14 additions & 0 deletions valid-anagram/hyogshin.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
class Solution:
def isAnagram(self, s: str, t: str) -> bool:
l = list(s)
Copy link
Contributor

Choose a reason for hiding this comment

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

리스트에서의 in 체크와 remove()는 매번 선형 탐색이 필요하므로 비효율적. O(n^2) 시간 복잡도 로 collections.Counter, 정렬, 해시맵 기반 풀이 활용 방안 검토 추천합니다

Copy link
Contributor Author

Choose a reason for hiding this comment

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

리뷰 감사합니다!

for d in t:
if d in s and d in l:
l.remove(d)
else:
return False

if not l:
return True
else:
return False