From f32c12d7dd5cf5aca126e639981674354aa7c903 Mon Sep 17 00:00:00 2001 From: JungHwan Date: Tue, 2 Jul 2024 00:47:26 +0900 Subject: [PATCH 1/2] 7/1 2Q --- JungHwan/NeetCode_ContainsDuplicate.py | 5 +++++ JungHwan/NeetCode_IsAnagram.py | 6 ++++++ 2 files changed, 11 insertions(+) create mode 100644 JungHwan/NeetCode_ContainsDuplicate.py create mode 100644 JungHwan/NeetCode_IsAnagram.py diff --git a/JungHwan/NeetCode_ContainsDuplicate.py b/JungHwan/NeetCode_ContainsDuplicate.py new file mode 100644 index 0000000..b05891c --- /dev/null +++ b/JungHwan/NeetCode_ContainsDuplicate.py @@ -0,0 +1,5 @@ +class Solution: + def hasDuplicate(self, nums: List[int]) -> bool: + for k in nums: + if(nums.count(k) > 1): return True + return False \ No newline at end of file diff --git a/JungHwan/NeetCode_IsAnagram.py b/JungHwan/NeetCode_IsAnagram.py new file mode 100644 index 0000000..d4faaf0 --- /dev/null +++ b/JungHwan/NeetCode_IsAnagram.py @@ -0,0 +1,6 @@ +class Solution: + def isAnagram(self, s: str, t: str) -> bool: + if(len(s) != len(t)): return False + for i in s: + if(s.count(i) != t.count(i)): return False + return True \ No newline at end of file From 6ac13f73a2298956f088bcc0d3d5623a86186fb7 Mon Sep 17 00:00:00 2001 From: JungHwan Date: Tue, 2 Jul 2024 16:55:30 +0900 Subject: [PATCH 2/2] 7/2 1Q --- JungHwan/NeetCode_TwoIntegerSum.py | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 JungHwan/NeetCode_TwoIntegerSum.py diff --git a/JungHwan/NeetCode_TwoIntegerSum.py b/JungHwan/NeetCode_TwoIntegerSum.py new file mode 100644 index 0000000..d91c51e --- /dev/null +++ b/JungHwan/NeetCode_TwoIntegerSum.py @@ -0,0 +1,8 @@ +class Solution: + def twoSum(self, nums: List[int], target: int) -> List[int]: + for i in range(len(nums) - 1): + j = i+1 + while(j < len(nums)): + if(nums[i] + nums[j] == target): return [i,j] + j+=1 +