Competitive Coding 2

Knapsack.py

@@ -0,0 +1,17 @@
+# Time Complexity : O(m * n)
+# Space Complexity : O(n)
+# Did this code successfully run on Leetcode : Yes
+# Any problem you faced while coding this : No
+# Approach : Use 1D array to keep track of max profit for every capacity.
+
+class Solution:
+    def knapsack(self, W, val, wt):
+        n = W
+        m = len(wt)
+        dp = [0] * (n+1)
+
+        for i in range(m):
+            for j in range(n, wt[i] - 1, -1):
+                dp[j] = max(dp[j], val[i] + dp[j - wt[i]])
+
+        return dp[n]

TwoSum.py

@@ -0,0 +1,17 @@
+# Time Complexity : O(n)
+# Space Complexity : O(n)
+# Did this code successfully run on Leetcode : Yes
+# Any problem you faced while coding this : No
+# Approach : If complement already in map then return the index else store complement.
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        map = dict()
+
+        for i, num in enumerate(nums):
+            if target-num in map:
+                return [i, map[target-num]]
+
+            map[num] = i
+
+        return [-1, -1]