From a74fb95802c34434f02b20394c3f76039902d8ba Mon Sep 17 00:00:00 2001
From: Venkata Varaha Kumar Yadla <yashpakala@Yashashvinis-MacBook-Air.local>
Date: Tue, 16 Jun 2026 19:55:01 -0500
Subject: [PATCH] solved Competitive-Coding-2

---
 Problem1.java | 23 +++++++++++++++++++++++
 Problem2.java | 16 ++++++++++++++++
 2 files changed, 39 insertions(+)

diff --git a/Problem1.java b/Problem1.java
index e69de29b..e410a893 100644
--- a/Problem1.java
+++ b/Problem1.java
@@ -0,0 +1,23 @@
+// Time Complexity: O(m*n)
+// SpaceComplexity: O(m*n)
+class Knapsack {
+    public int knapsack(int W, int val[], int wt[]) {
+
+        int m= wt.length;
+        int n = W;
+
+        int [][] dp = new int [m+1][n+1];
+
+        for(int i = 1; i<=m; i++){
+            int weight = wt[i-1];
+            for(int j= 0; j<=n; j++) {
+                if(j < weight) {
+                    dp[i][j] = dp[i-1][j];
+                } else {
+                    dp[i][j] = Math.max(dp[i-1][j], val[i-1]+dp[i-1][j-weight]);
+                }
+            }
+        }
+        return dp[m][n];
+    }
+}
\ No newline at end of file
diff --git a/Problem2.java b/Problem2.java
index e69de29b..6473b481 100644
--- a/Problem2.java
+++ b/Problem2.java
@@ -0,0 +1,16 @@
+// Time Complexity: O(n)
+// SpaceComplexity: O(n)
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        HashMap<Integer, Integer> map = new HashMap<>();
+        for (int i =0; i< nums.length; i++){
+            int diff = target - nums[i];
+            if(map.containsKey(diff)){
+                return new int[] {i, map.get(diff)};
+            } else {
+                map.put(nums[i],i);
+            }
+        }
+        return new int[2];
+    }
+}
\ No newline at end of file