[yuseok89] WEEK 05 Solutions

Author: yuseok89

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

@@ -0,0 +1,13 @@
+# TC: O(N)
+# SC: O(1)
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        min_until_now = prices[0]
+        max_profit = 0
+
+        for price in prices:
+            max_profit = max(max_profit, price - min_until_now)
+            min_until_now = min(min_until_now, price)
+
+        return max_profit
+

group-anagrams/yuseok89.py

@@ -0,0 +1,12 @@
+# TC: O(N * LlogL)
+# SC: O(N * L)
+class Solution:
+    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
+
+        ans = defaultdict(list)
+
+        for s in strs:
+            ans[''.join(sorted(s))].append(s)
+
+        return list(ans.values())
+

implement-trie-prefix-tree/yuseok89.py

@@ -0,0 +1,52 @@
+# TC: O(L)
+# SC: O(L * N)
+class TrieNode:
+    def __init__(self):
+        self.next = {}
+        self.is_end = False
+
+class Trie:
+
+    def __init__(self):
+        self.root = TrieNode()
+
+    def insert(self, word: str) -> None:
+        cur = self.root
+
+        for c in word:
+            if c not in cur.next:
+                cur.next[c] = TrieNode()
+
+            cur = cur.next[c]
+
+        cur.is_end = True
+
+    def search(self, word: str) -> bool:
+        cur = self.root
+
+        for c in word:
+            if c not in cur.next:
+                return False
+
+            cur = cur.next[c]
+
+        return cur.is_end
+
+    def startsWith(self, prefix: str) -> bool:
+        cur = self.root
+
+        for c in prefix:
+            if c not in cur.next:
+                return False
+
+            cur = cur.next[c]
+
+        return True
+
+
+# Your Trie object will be instantiated and called as such:
+# obj = Trie()
+# obj.insert(word)
+# param_2 = obj.search(word)
+# param_3 = obj.startsWith(prefix)
+

word-break/yuseok89.py

@@ -0,0 +1,38 @@
+#TC: O()
+#SC: O()
+class Solution:
+    def wordBreak(self, s: str, wordDict: List[str]) -> bool:
+
+        word_set = set()
+
+        max_len = 0
+        min_len = 300
+
+        for word in wordDict:
+            word_set.add(word)
+            max_len = max(max_len, len(word))
+            min_len = min(min_len, len(word))
+
+        v = set()
+
+        def rec(cur):
+            if cur in v:
+                return False
+
+            v.add(cur)
+
+            if len(cur) == 0:
+                return True
+
+            for l in range(min_len, max_len + 1):
+                if len(cur) < l:
+                    return False
+
+                if cur[0:l] in word_set:
+                    if rec(cur[l:]):
+                        return True
+
+            return False
+
+        return rec(s)
+