From dd3119e68ca56ec0d52b36ede5844b58c1cf2a54 Mon Sep 17 00:00:00 2001
From: Satish Mallikarjun Paraddi <satishparaddi2@gmail.com>
Date: Thu, 27 Aug 2026 21:07:04 -0400
Subject: [PATCH 1/2] Complete Problem1.py

---
 Problem1.java |  0
 Problem1.py   | 14 ++++++++++++++
 2 files changed, 14 insertions(+)
 delete mode 100644 Problem1.java
 create mode 100644 Problem1.py

diff --git a/Problem1.java b/Problem1.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/Problem1.py b/Problem1.py
new file mode 100644
index 00000000..d1bf77c5
--- /dev/null
+++ b/Problem1.py
@@ -0,0 +1,14 @@
+#Time Complexity : O(n)
+#Space Complexity : O(n)
+#Did this code successfully run on Leetcode :Yes
+
+class Solution:
+    def twoSum(self, nums, target):
+        n = len(nums)
+
+        for i in range(n):
+            for j in range(i + 1, n):
+                if nums[i] + nums[j] == target:
+                    return [i, j]
+
+        return [-1, -1]

From 3f00bcad758fca5db69e2d011e4e260a1e879121 Mon Sep 17 00:00:00 2001
From: Satish Mallikarjun Paraddi <satishparaddi2@gmail.com>
Date: Thu, 27 Aug 2026 21:14:17 -0400
Subject: [PATCH 2/2] Complete Problem2.py

---
 Problem2.java |  0
 Problem2.py   | 14 ++++++++++++++
 2 files changed, 14 insertions(+)
 delete mode 100644 Problem2.java
 create mode 100644 Problem2.py

diff --git a/Problem2.java b/Problem2.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/Problem2.py b/Problem2.py
new file mode 100644
index 00000000..9e375448
--- /dev/null
+++ b/Problem2.py
@@ -0,0 +1,14 @@
+#Time Complexity : O(n*m)
+#Space Complexity : O(n)
+class Solution:
+    @staticmethod
+    def findMax(weights, profit, totalCapacity):
+        n = totalCapacity
+        m = len(weights)
+        dp = [0] * (n + 1)
+
+        for i in range(m):
+            for j in range(n, weights[i] - 1, -1):
+                dp[j] = max(dp[j], profit[i] + dp[j - weights[i]])
+
+        return dp[n]