Merge pull request #693 from HodaeSsi/main

[HodaeSsi] Week 1

Author: HodaeSsi

contains-duplicate/HodaeSsi.py

@@ -0,0 +1,11 @@
+from typing import List
+
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        dict = {}
+        for num in nums:
+            dict[num] = dict.get(num, 0) + 1
+            if dict[num] > 1:
+                return True
+        return False
+

house-robber/HodaeSsi.py

@@ -0,0 +1,15 @@
+from typing import List
+
+
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        dp = [0] * len(nums)
+
+        for i in range(len(nums)-1, -1, -1):
+            dpMax = 0
+            for j in range(i + 2, len(nums)):
+                dpMax = max(dpMax, dp[j])
+            dp[i] = nums[i] + dpMax
+        
+        return max(dp)
+

longest-consecutive-sequence/HodaeSsi.py

@@ -0,0 +1,38 @@
+from typing import List
+
+
+class Node:
+    def __init__(self, value):
+        self.value = value
+        self.parent = None
+        self.child = None
+
+class Solution:
+    def longestConsecutive(self, nums: List[int]) -> int:
+        answer = 0
+        dict = {}
+
+        for num in nums:
+            if dict.get(num) is None:
+                dict[num] = Node(num)
+                if dict.get(num + 1) is not None:
+                    dict[num + 1].child = dict[num]
+                    dict[num].parent = dict[num + 1]
+                
+                if dict.get(num - 1) is not None:
+                    dict[num].child = dict[num - 1]
+                    dict[num - 1].parent = dict[num]
+                
+        for key in dict.keys():
+            if dict[key].parent is None:
+                node = dict[key]
+                count = 1
+
+                while node.child is not None:
+                    count += 1
+                    node = node.child
+
+                answer = max(answer, count)
+
+        return answer
+

top-k-frequent-elements/HodaeSsi.py

@@ -0,0 +1,10 @@
+from typing import List
+
+class Solution:
+    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
+        dict = {}
+        for num in nums:
+            dict[num] = dict.get(num, 0) + 1
+
+        return sorted(dict.keys(), key=lambda x: dict[x], reverse=True)[:k]
+

valid-palindrome/HodaeSsi.py

@@ -0,0 +1,8 @@
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        s = s.lower()
+
+        s = ''.join(filter(str.isalnum, s))
+
+        return s == s[::-1]
+