From 2bfced893d7862ee00312986367902edca47559e Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:25:29 +0900 Subject: [PATCH 01/10] valid anagram --- valid-anagram/do-heewan.py | 4 ++++ 1 file changed, 4 insertions(+) create mode 100644 valid-anagram/do-heewan.py diff --git a/valid-anagram/do-heewan.py b/valid-anagram/do-heewan.py new file mode 100644 index 000000000..486931ab1 --- /dev/null +++ b/valid-anagram/do-heewan.py @@ -0,0 +1,4 @@ +class Solution: + def isAnagram(self, s: str, t: str) -> bool: + return sorted(s) == sorted(t) + \ No newline at end of file From 13a5cdfa32e856f4a77af2cc6ffeac3b073b484b Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:25:42 +0900 Subject: [PATCH 02/10] climbing stairs --- climbing-stairs/do-heewan.py | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 climbing-stairs/do-heewan.py diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py new file mode 100644 index 000000000..ab5fda726 --- /dev/null +++ b/climbing-stairs/do-heewan.py @@ -0,0 +1,10 @@ +class Solution: + def climbStairs(self, n: int) -> int: + dp = [0] * 46 + dp[1] = 1 + dp[2] = 2 + + for i in range(3, n+1): + dp[i] = dp[i-1] + dp[i-2] + + return dp[n] \ No newline at end of file From 787e651df6a1c9110604cb36ca2c04a022a5d3ec Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:30:32 +0900 Subject: [PATCH 03/10] Update do-heewan.py --- climbing-stairs/do-heewan.py | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py index ab5fda726..b3311a6d3 100644 --- a/climbing-stairs/do-heewan.py +++ b/climbing-stairs/do-heewan.py @@ -7,4 +7,5 @@ def climbStairs(self, n: int) -> int: for i in range(3, n+1): dp[i] = dp[i-1] + dp[i-2] - return dp[n] \ No newline at end of file + return dp[n] + From 49866af1c5f980c5b0d3611ea787dbe19d9bdfa9 Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:33:22 +0900 Subject: [PATCH 04/10] Delete do-heewan.py --- climbing-stairs/do-heewan.py | 11 ----------- 1 file changed, 11 deletions(-) delete mode 100644 climbing-stairs/do-heewan.py diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py deleted file mode 100644 index b3311a6d3..000000000 --- a/climbing-stairs/do-heewan.py +++ /dev/null @@ -1,11 +0,0 @@ -class Solution: - def climbStairs(self, n: int) -> int: - dp = [0] * 46 - dp[1] = 1 - dp[2] = 2 - - for i in range(3, n+1): - dp[i] = dp[i-1] + dp[i-2] - - return dp[n] - From 2bbec859bc3999c468b48ed8b06bf7298ff0536f Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:33:31 +0900 Subject: [PATCH 05/10] Create do-heewan.py --- climbing-stairs/do-heewan.py | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 climbing-stairs/do-heewan.py diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py new file mode 100644 index 000000000..b3311a6d3 --- /dev/null +++ b/climbing-stairs/do-heewan.py @@ -0,0 +1,11 @@ +class Solution: + def climbStairs(self, n: int) -> int: + dp = [0] * 46 + dp[1] = 1 + dp[2] = 2 + + for i in range(3, n+1): + dp[i] = dp[i-1] + dp[i-2] + + return dp[n] + From ff3372cb2a98df767ba61520e8e9f1008c4c71bb Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:50:19 +0900 Subject: [PATCH 06/10] Update do-heewan.py --- climbing-stairs/do-heewan.py | 1 + 1 file changed, 1 insertion(+) diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py index b3311a6d3..bb1f03448 100644 --- a/climbing-stairs/do-heewan.py +++ b/climbing-stairs/do-heewan.py @@ -9,3 +9,4 @@ def climbStairs(self, n: int) -> int: return dp[n] + From ecc9a934cc5f3b031b849fef2769734e69cce1f6 Mon Sep 17 00:00:00 2001 From: Noh Date: Tue, 29 Jul 2025 15:51:22 +0900 Subject: [PATCH 07/10] Update do-heewan.py --- climbing-stairs/do-heewan.py | 2 -- 1 file changed, 2 deletions(-) diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py index bb1f03448..9d997bfac 100644 --- a/climbing-stairs/do-heewan.py +++ b/climbing-stairs/do-heewan.py @@ -8,5 +8,3 @@ def climbStairs(self, n: int) -> int: dp[i] = dp[i-1] + dp[i-2] return dp[n] - - From 8fb26d6766f324ce4544df5eb95e5b1d95026fcd Mon Sep 17 00:00:00 2001 From: Noh Date: Wed, 30 Jul 2025 15:15:51 +0900 Subject: [PATCH 08/10] Create do-heewan.py --- product-of-array-except-self/do-heewan.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 product-of-array-except-self/do-heewan.py diff --git a/product-of-array-except-self/do-heewan.py b/product-of-array-except-self/do-heewan.py new file mode 100644 index 000000000..3065f207e --- /dev/null +++ b/product-of-array-except-self/do-heewan.py @@ -0,0 +1,16 @@ +class Solution: + def productExceptSelf(self, nums: List[int]) -> List[int]: + result = [] + + x = 1 + for element in nums: + result.append(x) + x *= element + + x = 1 + for i in range(len(nums)-1, -1, -1): + result[i] *= x + x *= nums[i] + + return result + From 1e85511dfbbcfce90ea4094a2d7d5f2928b00e26 Mon Sep 17 00:00:00 2001 From: Noh Date: Wed, 30 Jul 2025 15:17:34 +0900 Subject: [PATCH 09/10] Update do-heewan.py --- climbing-stairs/do-heewan.py | 1 + 1 file changed, 1 insertion(+) diff --git a/climbing-stairs/do-heewan.py b/climbing-stairs/do-heewan.py index 9d997bfac..b3311a6d3 100644 --- a/climbing-stairs/do-heewan.py +++ b/climbing-stairs/do-heewan.py @@ -8,3 +8,4 @@ def climbStairs(self, n: int) -> int: dp[i] = dp[i-1] + dp[i-2] return dp[n] + From 4e5be4eb491673692f6a81e24d04dae1dc7d5a40 Mon Sep 17 00:00:00 2001 From: Noh Date: Wed, 30 Jul 2025 15:19:09 +0900 Subject: [PATCH 10/10] Update do-heewan.py --- valid-anagram/do-heewan.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/valid-anagram/do-heewan.py b/valid-anagram/do-heewan.py index 486931ab1..b4c73fb00 100644 --- a/valid-anagram/do-heewan.py +++ b/valid-anagram/do-heewan.py @@ -1,4 +1,4 @@ class Solution: def isAnagram(self, s: str, t: str) -> bool: return sorted(s) == sorted(t) - \ No newline at end of file +