From 7007307845ce507c12c70605d85f82017fb9dd6f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Mon, 2 Mar 2026 15:52:01 +0900 Subject: [PATCH 1/9] Contains Duplicate Solution --- contains-duplicate/treeStone94.py | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 contains-duplicate/treeStone94.py diff --git a/contains-duplicate/treeStone94.py b/contains-duplicate/treeStone94.py new file mode 100644 index 0000000000..e69de29bb2 From 6fcfd864066d7829708564b78cc85824729fcde7 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Mon, 2 Mar 2026 15:53:21 +0900 Subject: [PATCH 2/9] Contains Duplicate Solution update --- contains-duplicate/treeStone94.py | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/contains-duplicate/treeStone94.py b/contains-duplicate/treeStone94.py index e69de29bb2..18dc2aa066 100644 --- a/contains-duplicate/treeStone94.py +++ b/contains-duplicate/treeStone94.py @@ -0,0 +1,6 @@ +class Solution: + def containsDuplicate(self, nums: List[int]) -> bool: + if len(set(nums)) == len(nums): + return False + else: + return True \ No newline at end of file From 0c1602ecc2164cbf2e76a165469162d4e67d6be8 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Mon, 2 Mar 2026 16:16:40 +0900 Subject: [PATCH 3/9] two sum Solution --- two-sum/treeStone94.py | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 two-sum/treeStone94.py diff --git a/two-sum/treeStone94.py b/two-sum/treeStone94.py new file mode 100644 index 0000000000..bd8a8d319d --- /dev/null +++ b/two-sum/treeStone94.py @@ -0,0 +1,8 @@ +class Solution: + def twoSum(self, nums: List[int], target: int) -> List[int]: + answer = [] + for i,n in enumerate(nums): + t = target - n + if t in nums[i+1:]: + answer = [i, (i+1) +nums[i+1:].index(t)] + return answers \ No newline at end of file From a3dbefdd041eadd94b4fbe242af983e2beb76a4b Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Mon, 2 Mar 2026 17:47:48 +0900 Subject: [PATCH 4/9] =?UTF-8?q?=EA=B0=9C=ED=96=89=EB=AC=B8=EC=9E=90=20?= =?UTF-8?q?=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- contains-duplicate/treeStone94.py | 2 +- two-sum/treeStone94.py | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/contains-duplicate/treeStone94.py b/contains-duplicate/treeStone94.py index 18dc2aa066..9574f906c8 100644 --- a/contains-duplicate/treeStone94.py +++ b/contains-duplicate/treeStone94.py @@ -3,4 +3,4 @@ def containsDuplicate(self, nums: List[int]) -> bool: if len(set(nums)) == len(nums): return False else: - return True \ No newline at end of file + return True diff --git a/two-sum/treeStone94.py b/two-sum/treeStone94.py index bd8a8d319d..2796699237 100644 --- a/two-sum/treeStone94.py +++ b/two-sum/treeStone94.py @@ -5,4 +5,4 @@ def twoSum(self, nums: List[int], target: int) -> List[int]: t = target - n if t in nums[i+1:]: answer = [i, (i+1) +nums[i+1:].index(t)] - return answers \ No newline at end of file + return answers From 437f469815a04feaac3a14f768eefba0117dd032 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Mon, 2 Mar 2026 18:02:34 +0900 Subject: [PATCH 5/9] =?UTF-8?q?=ED=8C=8C=EC=9D=BC=EB=AA=85=20=EB=B3=80?= =?UTF-8?q?=EA=B2=BD?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- contains-duplicate/{treeStone94.py => TreeStone94.py} | 0 two-sum/{treeStone94.py => TreeStone94.py} | 0 2 files changed, 0 insertions(+), 0 deletions(-) rename contains-duplicate/{treeStone94.py => TreeStone94.py} (100%) rename two-sum/{treeStone94.py => TreeStone94.py} (100%) diff --git a/contains-duplicate/treeStone94.py b/contains-duplicate/TreeStone94.py similarity index 100% rename from contains-duplicate/treeStone94.py rename to contains-duplicate/TreeStone94.py diff --git a/two-sum/treeStone94.py b/two-sum/TreeStone94.py similarity index 100% rename from two-sum/treeStone94.py rename to two-sum/TreeStone94.py From 77d22fe25a53e344af9459efe254141d4808506a Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Thu, 5 Mar 2026 21:04:34 +0900 Subject: [PATCH 6/9] top k frequent Solution --- top-k-frequent-elements/TreeStone94.py | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 top-k-frequent-elements/TreeStone94.py diff --git a/top-k-frequent-elements/TreeStone94.py b/top-k-frequent-elements/TreeStone94.py new file mode 100644 index 0000000000..b2194a265e --- /dev/null +++ b/top-k-frequent-elements/TreeStone94.py @@ -0,0 +1,15 @@ +class Solution: + def topKFrequent(self, nums: List[int], k: int) -> List[int]: + frequent = {} + for n in nums: + if n not in frequent: + frequent[n] = 1 + else: + frequent[n] += 1 + + answer = [] + for f in sorted(frequent.items(), key=lambda item: item[1], reverse=True): + if k > 0: + answer.append(f[0]) + k -= 1 + return answer \ No newline at end of file From 360a77ad4f25d2fcd089194925d177c2956ca6f6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Thu, 5 Mar 2026 21:04:55 +0900 Subject: [PATCH 7/9] top k frequent Solution update --- top-k-frequent-elements/TreeStone94.py | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/top-k-frequent-elements/TreeStone94.py b/top-k-frequent-elements/TreeStone94.py index b2194a265e..ba5efcbaaf 100644 --- a/top-k-frequent-elements/TreeStone94.py +++ b/top-k-frequent-elements/TreeStone94.py @@ -12,4 +12,5 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]: if k > 0: answer.append(f[0]) k -= 1 - return answer \ No newline at end of file + return answer + From 03743174b0644e304274740b6a6764c2f7935af4 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Fri, 6 Mar 2026 23:01:15 +0900 Subject: [PATCH 8/9] longest-consecutive-sequence Solution --- longest-consecutive-sequence/TreeStone94.py | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 longest-consecutive-sequence/TreeStone94.py diff --git a/longest-consecutive-sequence/TreeStone94.py b/longest-consecutive-sequence/TreeStone94.py new file mode 100644 index 0000000000..4b844a20d6 --- /dev/null +++ b/longest-consecutive-sequence/TreeStone94.py @@ -0,0 +1,20 @@ +class Solution: + def longestConsecutive(self, nums: List[int]) -> int: + answer = [] + count = 0 + pre_num = -9999999999999999999 + for n in sorted(set(nums)): + if pre_num + 1 == n: + count += 1 + else: + answer.append(count) + count = 0 + pre_num = n + + if count != 0: + answer.append(count) + + if answer: + return max(answer) + 1 + else: + return 0 From 4b6be95b873d041c9701d7daf910679220cafab5 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E1=84=82=E1=85=A1=E1=86=B7=E1=84=8B=E1=85=AE=E1=84=89?= =?UTF-8?q?=E1=85=A5=E1=86=A8?= Date: Sat, 7 Mar 2026 01:03:18 +0900 Subject: [PATCH 9/9] house-robber Solution --- house-robber/TreeStone94.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 house-robber/TreeStone94.py diff --git a/house-robber/TreeStone94.py b/house-robber/TreeStone94.py new file mode 100644 index 0000000000..a4d7f5ffdb --- /dev/null +++ b/house-robber/TreeStone94.py @@ -0,0 +1,16 @@ +class Solution: + def rob(self, nums: List[int]) -> int: + if not nums: + return 0 + if len(nums) == 1: + return nums[0] + + dp = [0] * len(nums) + dp[0] = nums[0] + dp[1] = max(nums[0], nums[1]) + + for i in range(2, len(nums)): + dp[i] = max(dp[i-1], dp[i-2] + nums[i]) + + return dp[-1] +