Merge pull request #90 from Debashis08/feature-dp-implementation

Debashis08 · web-flow · commit b9ed10564664 · 2025-09-13T03:25:36.000+05:30
fix: size_t warning fix, house robber 2 init
diff --git a/include/0005_DynamicProgramming/0004_MinimumCostClimbingStairs.h b/include/0005_DynamicProgramming/0004_MinimumCostClimbingStairs.h
@@ -17,7 +17,7 @@ namespace MinimumCostClimbingStairs
 	class DynamicProgramming
 	{
 	private:
-		int MinCostRecursive(int step, vector<int>& cost);
+		int MinCostRecursive(size_t step, vector<int>& cost);
 	public:
 		int RecursiveMinimumCostClimbingStairs(vector<int>& cost);
 		int DpMinimumCostClimbingStairs(vector<int>& cost);
diff --git a/include/0005_DynamicProgramming/0005_HouseRobber1.h b/include/0005_DynamicProgramming/0005_HouseRobber1.h
@@ -17,7 +17,7 @@ namespace HouseRobber1
 	class DynamicProgramming
 	{
 	private:
-		int MaxLootRecursive(int house, vector<int>& houseValues);
+		int MaxLootRecursive(size_t house, vector<int>& houseValues);
 	public:
 		int RecursiveMaximumLoot(vector<int>& houseValues);
 		int DpMaximumLoot(vector<int>& houseValues);
diff --git a/include/0005_DynamicProgramming/0006_HouseRobber2.h b/include/0005_DynamicProgramming/0006_HouseRobber2.h
@@ -0,0 +1,28 @@
+#pragma once
+#include<vector>
+using namespace std;
+
+/*
+Pattern 1
+Linear Recurrence
+
+Description
+You are given an array arr[] which represents houses arranged in a circle, where each house has a certain value. A thief aims to maximize the total stolen value without robbing two adjacent houses.
+Determine the maximum amount the thief can steal.
+
+Note: Since the houses are in a circle, the first and last houses are also considered adjacent.
+
+*/
+
+namespace HouseRobber2
+{
+	class DynamicProgramming
+	{
+	private:
+		int MaxLootRecursive(size_t house, vector<int>& houseValues);
+		int MaxLootDp(size_t firstHouse, size_t lastHouse, vector<int>& houseValues);
+	public:
+		int RecursiveMaximumLoot(vector<int>& houseValues);
+		int DpMaximumLoot(vector<int>& houseValues);
+	};
+}
diff --git a/source/0005_DynamicProgramming/0004_MinimumCostClimbingStairs.cc b/source/0005_DynamicProgramming/0004_MinimumCostClimbingStairs.cc
@@ -3,7 +3,7 @@
 
 namespace MinimumCostClimbingStairs
 {
-	int DynamicProgramming::MinCostRecursive(int step, vector<int>& cost)
+	int DynamicProgramming::MinCostRecursive(size_t step, vector<int>& cost)
 	{
 		if (step == 0 || step == 1)
 		{
@@ -15,7 +15,7 @@ namespace MinimumCostClimbingStairs
 
 	int DynamicProgramming::RecursiveMinimumCostClimbingStairs(vector<int>& cost)
 	{
-		int totalSteps = cost.size();
+		size_t totalSteps = cost.size();
 
 		if (totalSteps == 1)
 		{
@@ -27,7 +27,7 @@ namespace MinimumCostClimbingStairs
 
 	int DynamicProgramming::DpMinimumCostClimbingStairs(vector<int>& cost)
 	{
-		int totalSteps = cost.size();
+		size_t totalSteps = cost.size();
 		vector<int> dp(totalSteps, 0);
 
 		if (totalSteps == 1)
@@ -38,7 +38,7 @@ namespace MinimumCostClimbingStairs
 		dp[0] = cost[0];
 		dp[1] = cost[1];
 
-		for (int i = 2; i < totalSteps; i++)
+		for (size_t i = 2; i < totalSteps; i++)
 		{
 			dp[i] = cost[i] + min(dp[i - 1], dp[i - 2]);
 		}
diff --git a/source/0005_DynamicProgramming/0005_HouseRobber1.cc b/source/0005_DynamicProgramming/0005_HouseRobber1.cc
@@ -2,7 +2,7 @@
 
 namespace HouseRobber1
 {
-	int DynamicProgramming::MaxLootRecursive(int house, vector<int>& houseValues)
+	int DynamicProgramming::MaxLootRecursive(size_t house, vector<int>& houseValues)
 	{
 		if (house <= 0)
 		{
@@ -22,19 +22,19 @@ namespace HouseRobber1
 
 	int DynamicProgramming::RecursiveMaximumLoot(vector<int>& houseValues)
 	{
-		int totalNumberOfHouses = houseValues.size();
+		size_t totalNumberOfHouses = houseValues.size();
 		return this->MaxLootRecursive(totalNumberOfHouses, houseValues);
 	}
 
 	int DynamicProgramming::DpMaximumLoot(vector<int>& houseValues)
 	{
-		int totalNumberOfHouses = houseValues.size();
+		size_t totalNumberOfHouses = houseValues.size();
 		vector<int> dp(totalNumberOfHouses + 1, 0);
 
 		dp[0] = 0;
 		dp[1] = houseValues[0];
 
-		for (int i = 2; i <= totalNumberOfHouses; i++)
+		for (size_t i = 2; i <= totalNumberOfHouses; i++)
 		{
 			dp[i] = max(dp[i - 2] + houseValues[i - 1], dp[i - 1]);
 		}
diff --git a/source/0005_DynamicProgramming/0006_HouseRobber2.cc b/source/0005_DynamicProgramming/0006_HouseRobber2.cc
@@ -0,0 +1,95 @@
+#include "../../include/0005_DynamicProgramming/0006_HouseRobber2.h"
+
+namespace HouseRobber2
+{
+	int DynamicProgramming::MaxLootRecursive(size_t house, vector<int>& houseValues)
+	{
+		if (house <= 0)
+		{
+			return 0;
+		}
+
+		if (house == 1)
+		{
+			return houseValues[0];
+		}
+
+		int pickCurrentHouse = houseValues[house - 1] + this->MaxLootRecursive(house - 2, houseValues);
+		int dropCurrentHouse = this->MaxLootRecursive(house - 1, houseValues);
+
+		return max(pickCurrentHouse, dropCurrentHouse);
+	}
+
+	int DynamicProgramming::MaxLootDp(size_t firstHouse, size_t lastHouse, vector<int>& houseValues)
+	{
+		int totalNumberOfHouses = lastHouse - firstHouse + 1;
+
+		if (totalNumberOfHouses == 0)
+		{
+			return 0;
+		}
+
+		if (totalNumberOfHouses == 1)
+		{
+			return houseValues[firstHouse];
+		}
+
+		vector<int> dp(totalNumberOfHouses, 0);
+
+		dp[0] = houseValues[firstHouse];
+		dp[1] = max(houseValues[firstHouse], houseValues[firstHouse + 1]);
+
+		for (size_t i = 2; i < totalNumberOfHouses; i++)
+		{
+			dp[i] = max(houseValues[firstHouse + i] + dp[i - 2], dp[i - 1]);
+		}
+
+		return dp[totalNumberOfHouses - 1];
+	}
+
+	int DynamicProgramming::RecursiveMaximumLoot(vector<int>& houseValues)
+	{
+		if (houseValues.size() == 0)
+		{
+			return 0;
+		}
+
+		if (houseValues.size() == 1)
+		{
+			return houseValues[0];
+		}
+
+		size_t totalNumberOfHouses = houseValues.size()-1;
+
+		// Case 1: Exclude last house.
+		vector<int> pickFirstHouse(houseValues.begin(), houseValues.end() - 1);
+
+		// Case 2: Exlcude first house.
+		vector<int> pickLastHouse(houseValues.begin() + 1, houseValues.end());
+
+		return max(this->MaxLootRecursive(totalNumberOfHouses, pickFirstHouse), this->MaxLootRecursive(totalNumberOfHouses, pickLastHouse));
+	}
+
+	int DynamicProgramming::DpMaximumLoot(vector<int>& houseValues)
+	{
+		size_t totalNumberOfHouses = houseValues.size();
+
+		if (totalNumberOfHouses == 0)
+		{
+			return 0;
+		}
+
+		if (totalNumberOfHouses == 1)
+		{
+			return houseValues[0];
+		}
+
+		// Case 1: Exclude last house.
+		int pickFirstHouse = this->MaxLootDp(0, totalNumberOfHouses - 2, houseValues);
+
+		// Case 2: Exlcude first house.
+		int pickLastHouse = this->MaxLootDp(1, totalNumberOfHouses - 1, houseValues);
+
+		return max(pickFirstHouse, pickLastHouse);
+	}
+}
diff --git a/source/0005_DynamicProgramming/CMakeLists.txt b/source/0005_DynamicProgramming/CMakeLists.txt
@@ -5,6 +5,7 @@ set(0005DYNAMICPROGRAMMING_SOURCES
     0003_ClimbingStairs.cc
     0004_MinimumCostClimbingStairs.cc
     0005_HouseRobber1.cc
+    0006_HouseRobber2.cc
 
 )
 
diff --git a/test/0005_DynamicProgramming/0006_HouseRobber2Test.cc b/test/0005_DynamicProgramming/0006_HouseRobber2Test.cc
@@ -0,0 +1,48 @@
+#include<gtest/gtest.h>
+#include "../../include/0005_DynamicProgramming/0006_HouseRobber2.h"
+
+namespace HouseRobber2
+{
+	TEST(HouseRobber2, RecursionTest01)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		vector<int> houseValues = { 2, 2, 3, 1, 2 };
+		int expectedMaximumLoot = 5;
+
+		// Act
+		int actualMaximumLoot = dp.RecursiveMaximumLoot(houseValues);
+
+		// Assert
+		ASSERT_EQ(expectedMaximumLoot, actualMaximumLoot);
+	}
+
+	TEST(HouseRobber2, DpTest01)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		vector<int> houseValues = { 2, 2, 3, 1, 2 };
+		int expectedMaximumLoot = 5;
+
+		// Act
+		int actualMaximumLoot = dp.DpMaximumLoot(houseValues);
+
+		// Assert
+		ASSERT_EQ(expectedMaximumLoot, actualMaximumLoot);
+	}
+
+	TEST(HouseRobber2, DpTest02)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		vector<int> houseValues = { 9, 1, 8, 2 };
+		int expectedMaximumLoot = 17;
+
+		// Act
+		int actualMaximumLoot = dp.DpMaximumLoot(houseValues);
+
+		// Assert
+		ASSERT_EQ(expectedMaximumLoot, actualMaximumLoot);
+	}
+
+}
diff --git a/test/0005_DynamicProgramming/CMakeLists.txt b/test/0005_DynamicProgramming/CMakeLists.txt
@@ -19,6 +19,7 @@ add_executable(
   0003_ClimbingStairsTest.cc
   0004_MinimumCostClimbingStairsTest.cc
   0005_HouseRobber1Test.cc
+  0006_HouseRobber2Test.cc
 
 )
 

Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ namespace MinimumCostClimbingStairs`
`17`	`17`	`class DynamicProgramming`
`18`	`18`	`{`
`19`	`19`	`private:`
`20`		`- int MinCostRecursive(int step, vector<int>& cost);`
	`20`	`+ int MinCostRecursive(size_t step, vector<int>& cost);`
`21`	`21`	`public:`
`22`	`22`	`int RecursiveMinimumCostClimbingStairs(vector<int>& cost);`
`23`	`23`	`int DpMinimumCostClimbingStairs(vector<int>& cost);`
Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ namespace HouseRobber1`
`17`	`17`	`class DynamicProgramming`
`18`	`18`	`{`
`19`	`19`	`private:`
`20`		`- int MaxLootRecursive(int house, vector<int>& houseValues);`
	`20`	`+ int MaxLootRecursive(size_t house, vector<int>& houseValues);`
`21`	`21`	`public:`
`22`	`22`	`int RecursiveMaximumLoot(vector<int>& houseValues);`
`23`	`23`	`int DpMaximumLoot(vector<int>& houseValues);`
Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@`
`3`	`3`
`4`	`4`	`namespace MinimumCostClimbingStairs`
`5`	`5`	`{`
`6`		`- int DynamicProgramming::MinCostRecursive(int step, vector<int>& cost)`
	`6`	`+ int DynamicProgramming::MinCostRecursive(size_t step, vector<int>& cost)`
`7`	`7`	`{`
`8`	`8`	`if (step == 0 \|\| step == 1)`
`9`	`9`	`{`
`@@ -15,7 +15,7 @@ namespace MinimumCostClimbingStairs`
`15`	`15`
`16`	`16`	`int DynamicProgramming::RecursiveMinimumCostClimbingStairs(vector<int>& cost)`
`17`	`17`	`{`
`18`		`- int totalSteps = cost.size();`
	`18`	`+ size_t totalSteps = cost.size();`
`19`	`19`
`20`	`20`	`if (totalSteps == 1)`
`21`	`21`	`{`
`@@ -27,7 +27,7 @@ namespace MinimumCostClimbingStairs`
`27`	`27`
`28`	`28`	`int DynamicProgramming::DpMinimumCostClimbingStairs(vector<int>& cost)`
`29`	`29`	`{`
`30`		`- int totalSteps = cost.size();`
	`30`	`+ size_t totalSteps = cost.size();`
`31`	`31`	`vector<int> dp(totalSteps, 0);`
`32`	`32`
`33`	`33`	`if (totalSteps == 1)`
`@@ -38,7 +38,7 @@ namespace MinimumCostClimbingStairs`
`38`	`38`	`dp[0] = cost[0];`
`39`	`39`	`dp[1] = cost[1];`
`40`	`40`
`41`		`- for (int i = 2; i < totalSteps; i++)`
	`41`	`+ for (size_t i = 2; i < totalSteps; i++)`
`42`	`42`	`{`
`43`	`43`	`dp[i] = cost[i] + min(dp[i - 1], dp[i - 2]);`
`44`	`44`	`}`
Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`namespace HouseRobber1`
`4`	`4`	`{`
`5`		`- int DynamicProgramming::MaxLootRecursive(int house, vector<int>& houseValues)`
	`5`	`+ int DynamicProgramming::MaxLootRecursive(size_t house, vector<int>& houseValues)`
`6`	`6`	`{`
`7`	`7`	`if (house <= 0)`
`8`	`8`	`{`
`@@ -22,19 +22,19 @@ namespace HouseRobber1`
`22`	`22`
`23`	`23`	`int DynamicProgramming::RecursiveMaximumLoot(vector<int>& houseValues)`
`24`	`24`	`{`
`25`		`- int totalNumberOfHouses = houseValues.size();`
	`25`	`+ size_t totalNumberOfHouses = houseValues.size();`
`26`	`26`	`return this->MaxLootRecursive(totalNumberOfHouses, houseValues);`
`27`	`27`	`}`
`28`	`28`
`29`	`29`	`int DynamicProgramming::DpMaximumLoot(vector<int>& houseValues)`
`30`	`30`	`{`
`31`		`- int totalNumberOfHouses = houseValues.size();`
	`31`	`+ size_t totalNumberOfHouses = houseValues.size();`
`32`	`32`	`vector<int> dp(totalNumberOfHouses + 1, 0);`
`33`	`33`
`34`	`34`	`dp[0] = 0;`
`35`	`35`	`dp[1] = houseValues[0];`
`36`	`36`
`37`		`- for (int i = 2; i <= totalNumberOfHouses; i++)`
	`37`	`+ for (size_t i = 2; i <= totalNumberOfHouses; i++)`
`38`	`38`	`{`
`39`	`39`	`dp[i] = max(dp[i - 2] + houseValues[i - 1], dp[i - 1]);`
`40`	`40`	`}`
Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,7 @@ set(0005DYNAMICPROGRAMMING_SOURCES`
`5`	`5`	`0003_ClimbingStairs.cc`
`6`	`6`	`0004_MinimumCostClimbingStairs.cc`
`7`	`7`	`0005_HouseRobber1.cc`
	`8`	`+ 0006_HouseRobber2.cc`
`8`	`9`
`9`	`10`	`)`
`10`	`11`
Original file line number	Diff line number	Diff line change
`@@ -19,6 +19,7 @@ add_executable(`
`19`	`19`	`0003_ClimbingStairsTest.cc`
`20`	`20`	`0004_MinimumCostClimbingStairsTest.cc`
`21`	`21`	`0005_HouseRobber1Test.cc`
	`22`	`+ 0006_HouseRobber2Test.cc`
`22`	`23`
`23`	`24`	`)`
`24`	`25`