Skip to content

[do-heewan] WEEK 01 Solutions #1704

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

[do-heewan] WEEK 01 Solutions #1704

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
f6e158e
Two Sum solved
Do-heewan Jul 23, 2025
2206296
Contains Duplicate solved
Do-heewan Jul 23, 2025
445d292
Two Sum solved
Do-heewan Jul 23, 2025
99826d9
Contains Duplicate solved
Do-heewan Jul 23, 2025
004be14
Top K Frequent
Do-heewan Jul 24, 2025
596cce5
Top K Frequent solved
Do-heewan Jul 24, 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
15 changes: 15 additions & 0 deletions top-k-frequent-elements/do-heewan.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
class Solution(object):
def topKFrequent(self, nums, k):
count = {}
result = []

for i in nums:
Copy link
Contributor

Choose a reason for hiding this comment

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

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.

넵 피드백 감사합니다

if i not in count:
count[i] = 1
else:
count[i] += 1

count = sorted(count.items(), key=lambda x : x[1], reverse=True)

return [item[0] for item in count[:k]]

Loading