longest-consecutive-sequence, top-k-frequent-elements

Author: bskkimm

house-robber/bskkimm.py

@@ -0,0 +1,21 @@
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        
+        # [2,7,9,10,5,4]
+        # No Consecutive robbing --> able to skip as many times as wanted
+
+        # which one to add? --> dp 
+
+        # dp[i], dp[i-1] + nums[i+1]
+        if len(nums) == 1:
+            return nums[0]
+  
+
+        dp = [0]*len(nums)
+        dp[0] = nums[0]
+        dp[1] = max(dp[0], nums[1])
+
+        for i in range(2, len(nums)):
+            dp[i] = max(dp[i-1], dp[i-2] + nums[i])
+
+        return dp[-1]

longest-consecutive-sequence/bskkimm.py

@@ -0,0 +1,28 @@
+from collections import defaultdict
+class Solution:
+    def longestConsecutive(self, nums: List[int]) -> int:
+        
+        if not nums:
+            return 0
+
+        dict_consecutive = defaultdict(int)
+        group_num = 0 # consecutive group number
+
+        dict_consecutive[group_num] += 1 # w.r.t the first num of nums
+
+        # sort in the ascending order eliminating duplicates
+        nums = sorted(set(nums))
+
+        # 2. build dict_consecutive
+        for i in range(1, len(nums)):
+            if nums[i] - nums[i-1] == 1:
+                dict_consecutive[group_num] += 1
+            else:
+                group_num += 1
+                dict_consecutive[group_num] += 1
+        
+        # 3. Get the longest group
+        longest_consecutive = max(list(dict_consecutive.values()))
+
+        return longest_consecutive
+