From 8a3e5a249a4e378208d878668a930db48392a742 Mon Sep 17 00:00:00 2001
From: SUJAY GIJRE <sujaygijre@gmail.com>
Date: Thu, 1 Jan 2026 09:58:37 -0500
Subject: [PATCH 1/2] Create house-robber

---
 house-robber | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 house-robber

diff --git a/house-robber b/house-robber
new file mode 100644
index 00000000..d986b3d9
--- /dev/null
+++ b/house-robber
@@ -0,0 +1,27 @@
+Time complexity - O(n)
+Space complexity - O(1)
+
+class Solution {
+public:
+    int rob(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> dp(n, 0);
+
+        if (n == 1)
+            return nums[0];
+
+        if (n == 2)
+            return max(nums[0], nums[1]);
+
+        dp[0]=nums[0];
+        dp[1]=max(nums[0], nums[1]);
+
+        int result = max(dp[0], dp[1]); 
+
+        for (int i = 2;i<n;i++)
+        {
+            dp[i] = max(dp[i-2] + nums[i], dp[i-1]);
+        }
+        return dp[n-1];
+    }
+};

From f205d81232b60d8014c0a6aba06775bede5bca0d Mon Sep 17 00:00:00 2001
From: SUJAY GIJRE <sujaygijre@gmail.com>
Date: Thu, 1 Jan 2026 10:02:06 -0500
Subject: [PATCH 2/2] coin-change

---
 coin-change | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 coin-change

diff --git a/coin-change b/coin-change
new file mode 100644
index 00000000..7b82c1fa
--- /dev/null
+++ b/coin-change
@@ -0,0 +1,19 @@
+// Time complexity - O(n)
+// Space complexity - O(n)
+
+class Solution {
+public:
+    int coinChange(vector<int>& coins, int amount) {
+        int n = coins.size();
+        vector<int> dp(amount+1, amount+1);
+        dp[0] = 0;
+        for (int i=1;i<=amount;i++) {
+            for (int j=0;j<coins.size();j++) {
+                if (coins[j] <= i) {
+                    dp[i] = min(dp[i], dp[i-coins[j]]+1);
+                }
+            }
+        }
+        return dp[amount] >= amount+1 ? -1 : dp[amount];
+    }
+};