Merge pull request #35 from leokim0922/main

[Leo] 1st Week solutions

Author: leokim0922

best-time-to-buy-and-sell-stock/Leo.py

@@ -0,0 +1,11 @@
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        minPrice = prices[0]
+        maxPro = 0
+
+        for i in range(1, len(prices)):
+            maxPro = max(maxPro, prices[i] - minPrice)
+            minPrice = min (minPrice, prices[i])
+
+        return maxPro
+        ## TC: O(n) SC: O(1)..?

contains-duplicate/Leo.py

@@ -0,0 +1,13 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(set(nums)) != len(nums)
+
+        # seen = set()
+
+        # for i in nums:   ## O(n)
+        #     if i in seen: ## O(1)
+        #         return True
+        #     else:
+        #         seen.add(i)
+
+        # return False

two-sum/Leo.py

@@ -0,0 +1,13 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        seen = {}
+
+        for key, val in enumerate(nums):
+            diff = target - val
+
+            if diff in seen:
+                return [seen[diff], key]
+            else:
+                seen[val] = key
+
+    # TC: O(n), SC: O(n)

valid-anagram/Leo.py

@@ -0,0 +1,18 @@
+class Solution:
+    def isAnagram(self, s: str, t: str) -> bool:
+
+        counter_dict = collections.defaultdict(int)
+
+        for i in s:
+            counter_dict[i] += 1
+
+        for i in t:
+            counter_dict[i] -= 1
+
+        for val in counter_dict.values():
+            if val != 0:
+                return False
+
+        return True
+        # TC:O(n), SC: O(len(s or t))
+        # return sorted(s) == sorted(t) ## O(nlogn)

valid-palindrome/Leo.py

@@ -0,0 +1,7 @@
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        ans = [i for i in s.lower() if i.isalnum()]
+        return ans == ans[::-1]
+
+        # TC: O(n)
+        # SC: O(n)