From b34a7752ab20548fa265f425af999fb1ff4f8e1e Mon Sep 17 00:00:00 2001
From: BharathVuppala96 <bharathv8696@gmail.com>
Date: Mon, 2 Feb 2026 11:06:08 -0800
Subject: [PATCH] 2problems completed

---
 kanpsack.py | 16 ++++++++++++++++
 two sum.py  |  9 +++++++++
 2 files changed, 25 insertions(+)
 create mode 100644 kanpsack.py
 create mode 100644 two sum.py

diff --git a/kanpsack.py b/kanpsack.py
new file mode 100644
index 00000000..a08a0115
--- /dev/null
+++ b/kanpsack.py
@@ -0,0 +1,16 @@
+class Solution:
+    def knapsack(self, W, val, wt):
+        # code here
+        m=len(wt)
+        dp = [[0] * (W+ 1) for _ in range(m + 1)]
+         
+        for i in range(1,m+1):
+            for j in range(1,W+1):
+                
+                if j<wt[i-1]:
+                    dp[i][j]=dp[i-1][j]
+                else:
+                    dp[i][j]=max(dp[i-1][j],val[i-1]+dp[i-1][j-wt[i-1]])
+        
+        return dp[m][W]
+       
\ No newline at end of file
diff --git a/two sum.py b/two sum.py
new file mode 100644
index 00000000..62ab94d5
--- /dev/null
+++ b/two sum.py	
@@ -0,0 +1,9 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        map={}
+
+        for i in range(len(nums)):
+            if target-nums[i] in map:
+                return([i,map[target-nums[i]]])
+            else:
+                map[nums[i]]=i
\ No newline at end of file