From 8604eda1714af18072f94e2b8f3b0379fd0f7182 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sat, 8 Nov 2025 23:31:43 -0800 Subject: [PATCH 1/9] adding contains-duplicate --- contains-duplicate/daiyongg-kim.py | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 contains-duplicate/daiyongg-kim.py diff --git a/contains-duplicate/daiyongg-kim.py b/contains-duplicate/daiyongg-kim.py new file mode 100644 index 0000000000..e69de29bb2 From 14fe212ac94555707bcc3de52a11043afd2f009d Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 9 Nov 2025 00:03:06 -0800 Subject: [PATCH 2/9] adding two sum --- two-sum/daiyongg-kim.py | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 two-sum/daiyongg-kim.py diff --git a/two-sum/daiyongg-kim.py b/two-sum/daiyongg-kim.py new file mode 100644 index 0000000000..8bb4484879 --- /dev/null +++ b/two-sum/daiyongg-kim.py @@ -0,0 +1,10 @@ +class Solution: + def twoSum(self, nums: List[int], target: int) -> List[int]: + hash_map = {} + for i, num in enumerate(nums): + current = target - num + if current in hash_map: + return [hash_map[current], i] + hash_map[num] = i + return [] + From f39db86b49d726ee5b5a6689549962384b467d44 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 9 Nov 2025 08:56:18 -0800 Subject: [PATCH 3/9] adding top k frequent element --- top-k-frequent-elements/daiyongg-kim.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 top-k-frequent-elements/daiyongg-kim.py diff --git a/top-k-frequent-elements/daiyongg-kim.py b/top-k-frequent-elements/daiyongg-kim.py new file mode 100644 index 0000000000..7b917d460e --- /dev/null +++ b/top-k-frequent-elements/daiyongg-kim.py @@ -0,0 +1,16 @@ +class Solution: + def topKFrequent(self, nums: List[int], k: int) -> List[int]: + counts = Counter(nums) + + items = counts.items() + + sort_by_value = sorted( + items, + key=lambda item: item[1], + reverse = True + ) + result = [] + for i in range(k): + result.append(sort_by_value[i][0]) + return result + \ No newline at end of file From 95ae9dbe3e31d0e6586951dc10e77aa4f27176be Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 9 Nov 2025 09:17:02 -0800 Subject: [PATCH 4/9] adding contains duplicated --- contains-duplicate/daiyongg-kim.py | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/contains-duplicate/daiyongg-kim.py b/contains-duplicate/daiyongg-kim.py index e69de29bb2..f8d5b2094e 100644 --- a/contains-duplicate/daiyongg-kim.py +++ b/contains-duplicate/daiyongg-kim.py @@ -0,0 +1,9 @@ +class Solution: + def containsDuplicate(self, nums: List[int]) -> bool: + my_set = set() + + for num in nums: + if num in my_set: + return True + my_set.add(num) + return False \ No newline at end of file From d06720016555b8dc4838dfbeab171aff5fa9ba5d Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 9 Nov 2025 09:25:54 -0800 Subject: [PATCH 5/9] adding line break --- contains-duplicate/daiyongg-kim.py | 4 +++- top-k-frequent-elements/daiyongg-kim.py | 2 +- 2 files changed, 4 insertions(+), 2 deletions(-) diff --git a/contains-duplicate/daiyongg-kim.py b/contains-duplicate/daiyongg-kim.py index f8d5b2094e..70f08df76a 100644 --- a/contains-duplicate/daiyongg-kim.py +++ b/contains-duplicate/daiyongg-kim.py @@ -6,4 +6,6 @@ def containsDuplicate(self, nums: List[int]) -> bool: if num in my_set: return True my_set.add(num) - return False \ No newline at end of file + return False + + \ No newline at end of file diff --git a/top-k-frequent-elements/daiyongg-kim.py b/top-k-frequent-elements/daiyongg-kim.py index 7b917d460e..4ee3be8c07 100644 --- a/top-k-frequent-elements/daiyongg-kim.py +++ b/top-k-frequent-elements/daiyongg-kim.py @@ -13,4 +13,4 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]: for i in range(k): result.append(sort_by_value[i][0]) return result - \ No newline at end of file + From 0259c41abfd73892fe60a193146b1e251a91a7fa Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 9 Nov 2025 09:26:48 -0800 Subject: [PATCH 6/9] for line break --- contains-duplicate/daiyongg-kim.py | 1 - 1 file changed, 1 deletion(-) diff --git a/contains-duplicate/daiyongg-kim.py b/contains-duplicate/daiyongg-kim.py index 70f08df76a..1ebdb09a9e 100644 --- a/contains-duplicate/daiyongg-kim.py +++ b/contains-duplicate/daiyongg-kim.py @@ -8,4 +8,3 @@ def containsDuplicate(self, nums: List[int]) -> bool: my_set.add(num) return False - \ No newline at end of file From 58ce3bee4f08ad32b6decb0fb1a64123c94e93f9 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 9 Nov 2025 15:05:32 -0800 Subject: [PATCH 7/9] adding longestConsecutive --- longest-consecutive-sequence/daiyongg-kim.py | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 longest-consecutive-sequence/daiyongg-kim.py diff --git a/longest-consecutive-sequence/daiyongg-kim.py b/longest-consecutive-sequence/daiyongg-kim.py new file mode 100644 index 0000000000..1dc080e293 --- /dev/null +++ b/longest-consecutive-sequence/daiyongg-kim.py @@ -0,0 +1,13 @@ +class Solution: + def longestConsecutive(self, nums: List[int]) -> int: + my_set = set(nums) + longest = 0 + length = 1 + for num in my_set: + if num - 1 not in my_set: + length = 1 + while num + length in my_set: + length += 1 + longest = max (longest, length) + + return longest From 41ca9be082e71dfa5f12ebe242a833df8b638434 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Tue, 11 Nov 2025 09:20:57 -0800 Subject: [PATCH 8/9] adding house robber --- house-robber/daiyongg-kim.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 house-robber/daiyongg-kim.py diff --git a/house-robber/daiyongg-kim.py b/house-robber/daiyongg-kim.py new file mode 100644 index 0000000000..bec1553fe7 --- /dev/null +++ b/house-robber/daiyongg-kim.py @@ -0,0 +1,16 @@ +class Solution: + def rob(self, nums: List[int]) -> int: + rob_prev_prev = 0 + rob_prev = 0 + max_today = 0 + for rob_current in nums: + contains_rob_current = rob_current + rob_prev_prev + not_contains_rob_current = rob_prev + + max_today = max(contains_rob_current, not_contains_rob_current) + + rob_prev_prev = rob_prev + rob_prev = max_today + + return max_today + \ No newline at end of file From 35a8d68c88f440cbb1abba1a2ae52e684a6619c1 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Tue, 11 Nov 2025 09:23:59 -0800 Subject: [PATCH 9/9] fix line error --- house-robber/daiyongg-kim.py | 1 - 1 file changed, 1 deletion(-) diff --git a/house-robber/daiyongg-kim.py b/house-robber/daiyongg-kim.py index bec1553fe7..3f1584f282 100644 --- a/house-robber/daiyongg-kim.py +++ b/house-robber/daiyongg-kim.py @@ -13,4 +13,3 @@ def rob(self, nums: List[int]) -> int: rob_prev = max_today return max_today - \ No newline at end of file