Skip to content

[prograsshopper] Week 1 Solutions #1720

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 3 commits into from
Jul 27, 2025
Merged

[prograsshopper] Week 1 Solutions #1720

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
7c26d77
week 1: two sum
prograsshopper Jul 25, 2025
124f26a
week 1: contains duplicate
prograsshopper Jul 25, 2025
12faf10
week 1: top k elements
prograsshopper Jul 26, 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
8 changes: 8 additions & 0 deletions top-k-frequent-elements/prograsshopper.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
class Solution:
def topKFrequent(self, nums: List[int], k: int) -> List[int]:
from collections import defaultdict
frequent_dict = defaultdict(int)
for num in nums:
frequent_dict[num] += 1
sorted_dict = dict(sorted(frequent_dict.items(), key=operator.itemgetter(1), reverse=True))
Copy link
Contributor

Choose a reason for hiding this comment

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

operator 모듈을 사용하고 있지만 import되지 않았습니다.

return list(sorted_dict)[:k]
Copy link
Contributor

Choose a reason for hiding this comment

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

list(dict)는 key만 리스트로 변환되므로, 여기서는 top k frequent elements를 의미하긴 하지만 비효율적입니다.