feature: dp pattern 1 fibonacci, tribonacci added

Author: Debashis08

include/0005_DynamicProgramming/0001_FibonacciNumber.h

@@ -0,0 +1,23 @@
+#pragma once
+#include<vector>
+using namespace std;
+
+/*
+Pattern 1
+Linear Recurrence
+
+Description
+Print the n'th Fibonacci number.
+
+*/
+
+namespace FibonacciNumber
+{
+	class DynamicProgramming
+	{
+	private:
+	public:
+		int RecursiveNthFibonacci(int n);
+		int DpNthFibonacci(int n);
+	};
+}

include/0005_DynamicProgramming/0002_TribonacciNumber.h

@@ -0,0 +1,23 @@
+#pragma once
+#include<vector>
+using namespace std;
+
+/*
+Pattern 1
+Linear Recurrence
+
+Description
+Print the n'th Tribonacci number.
+
+*/
+
+namespace TribonacciNumber
+{
+	class DynamicProgramming
+	{
+	private:
+	public:
+		int RecursiveNthTribonacci(int n);
+		int DpNthTribonacci(int n);
+	};
+}

source/0005_DynamicProgramming/0001_FibonacciNumber.cc

@@ -0,0 +1,28 @@
+#include "../../include/0005_DynamicProgramming/0001_FibonacciNumber.h"
+
+namespace FibonacciNumber
+{
+	int DynamicProgramming::RecursiveNthFibonacci(int n)
+	{
+		if (n <= 1)
+		{
+			return n;
+		}
+
+		return this->RecursiveNthFibonacci(n - 1) + this->RecursiveNthFibonacci(n - 2);
+	}
+
+	int DynamicProgramming::DpNthFibonacci(int n)
+	{
+		vector<int> dp(n + 1, 0);
+		dp[0] = 0;
+		dp[1] = 1;
+
+		for (int i = 2; i <= n; i++)
+		{
+			dp[i] = dp[i - 1] + dp[i - 2];
+		}
+
+		return dp[n];
+	}
+}

source/0005_DynamicProgramming/0002_TribonacciNumber.cc

@@ -0,0 +1,33 @@
+#include "../../include/0005_DynamicProgramming/0002_TribonacciNumber.h"
+
+namespace TribonacciNumber
+{
+	int DynamicProgramming::RecursiveNthTribonacci(int n)
+	{
+		if (n == 0 || n == 1 || n == 2)
+		{
+			return 0;
+		}
+
+		if (n == 3)
+		{
+			return 1;
+		}
+
+		return this->RecursiveNthTribonacci(n - 1) + this->RecursiveNthTribonacci(n - 2) + this->RecursiveNthTribonacci(n - 3);
+	}
+
+	int DynamicProgramming::DpNthTribonacci(int n)
+	{
+		vector<int> dp(n, 0);
+		dp[0] = dp[1] = 0;
+		dp[2] = 1;
+
+		for (int i = 3; i < n; i++)
+		{
+			dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
+		}
+		
+		return dp[n - 1];
+	}
+}

source/0005_DynamicProgramming/CMakeLists.txt

@@ -0,0 +1,9 @@
+# Specify the source files
+set(0005DYNAMICPROGRAMMING_SOURCES
+    0001_FibonacciNumber.cc
+    0002_TribonacciNumber.cc
+
+)
+
+# Create a library target
+add_library(0005DYNAMICPROGRAMMING ${0005DYNAMICPROGRAMMING_SOURCES})

test/0005_DynamicProgramming/0001_FibonacciNumberTest.cc

@@ -0,0 +1,34 @@
+#include<gtest/gtest.h>
+#include "../../include/0005_DynamicProgramming/0001_FibonacciNumber.h"
+using namespace std;
+
+namespace FibonacciNumber
+{
+	TEST(FibonacciNumber, RecursiveTest)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		int n = 5;
+		int expectedFib = 5;
+		
+		// Act
+		int actualFib = dp.RecursiveNthFibonacci(n);
+
+		// Assert
+		ASSERT_EQ(expectedFib, actualFib);
+	}
+
+	TEST(FibonacciNumber, DpTest)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		int n = 5;
+		int expectedFib = 5;
+
+		// Act
+		int actualFib = dp.DpNthFibonacci(n);
+
+		// Assert
+		ASSERT_EQ(expectedFib, actualFib);
+	}
+}

test/0005_DynamicProgramming/0002_TribonacciNumberTest.cc

@@ -0,0 +1,34 @@
+#include<gtest/gtest.h>
+#include "../../include/0005_DynamicProgramming/0002_TribonacciNumber.h"
+using namespace std;
+
+namespace TribonacciNumber
+{
+	TEST(TribonacciNumber, RecursiveTest)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		int n = 5;
+		int expectedFib = 2;
+
+		// Act
+		int actualFib = dp.RecursiveNthTribonacci(n);
+
+		// Assert
+		ASSERT_EQ(expectedFib, actualFib);
+	}
+
+	TEST(TribonacciNumber, DpTest)
+	{
+		// Arrange
+		DynamicProgramming dp;
+		int n = 10;
+		int expectedFib = 44;
+
+		// Act
+		int actualFib = dp.DpNthTribonacci(n);
+
+		// Assert
+		ASSERT_EQ(expectedFib, actualFib);
+	}
+}

test/0005_DynamicProgramming/CMakeLists.txt

@@ -0,0 +1,34 @@
+cmake_policy(SET CMP0135 NEW)
+
+include(FetchContent)
+FetchContent_Declare(
+  googletest
+  URL https://github.com/google/googletest/archive/03597a01ee50ed33e9dfd640b249b4be3799d395.zip
+)
+
+# For Windows: Prevent overriding the parent project's compiler/linker settings
+set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
+FetchContent_MakeAvailable(googletest)
+
+enable_testing()
+
+add_executable(
+  0005DynamicProgrammingTests
+  0001_FibonacciNumberTest.cc
+  0002_TribonacciNumberTest.cc
+
+)
+
+target_link_libraries(
+  0005DynamicProgrammingTests
+  GTest::gtest_main
+  0005DYNAMICPROGRAMMING
+)
+
+# Add .clang-tidy configuration to this library.
+if(CLANG_TIDY_EXE)
+  set_target_properties(0005DYNAMICPROGRAMMING PROPERTIES CXX_CLANG_TIDY "${CLANG_TIDY_COMMAND}")
+endif()
+
+include(GoogleTest)
+gtest_discover_tests(0005DynamicProgrammingTests DISCOVERY_TIMEOUT 30)