Skip to content

[jeongyunjae] WEEK 02 solutions #1755

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
Aug 2, 2025
Merged

[jeongyunjae] WEEK 02 solutions #1755

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
ccaf0e0
[main] valid anagram solution
jeongyunjae Jul 30, 2025
9e576b8
[main] climbStairs solution
jeongyunjae Aug 2, 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
6 changes: 6 additions & 0 deletions valid-anagram/jeongyunjae.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
class Solution:
Copy link
Contributor

Choose a reason for hiding this comment

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

정렬을 사용하기 때문에 시간 복잡도가 O(n) 풀이보다 떨어질 수 있습니다 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.

감사합니다!

def isAnagram(self, s: str, t: str) -> bool:
sort_s = ''.join(sorted(s))
sort_t = ''.join(sorted(t))

return sort_s == sort_t