diff --git a/Dynamic Programming/Fibonacci_Bottom_Up.cpp b/Dynamic Programming/Fibonacci_Bottom_Up.cpp
new file mode 100644
index 000000000..cbd0912e8
--- /dev/null
+++ b/Dynamic Programming/Fibonacci_Bottom_Up.cpp	
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+int fib(int n){
+	int res[n+1];
+	res[0] = 0;	res[1] = 1;
+	for(int i=2;i<=n;i++){
+		res[i] = res[i-1] + res[i-2];
+	}
+	return res[n];
+}
+int main(int argc, char const *argv[])
+{
+	int n;
+	cout<<"Enter n: ";
+	cin>>n;
+	cout<<"Fibonacci number is ";
+	cout<<fib(n)<<endl;
+	return 0;
+}
\ No newline at end of file
diff --git a/Dynamic Programming/Fibonacci_Top_Down.cpp b/Dynamic Programming/Fibonacci_Top_Down.cpp
new file mode 100644
index 000000000..657881892
--- /dev/null
+++ b/Dynamic Programming/Fibonacci_Top_Down.cpp	
@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+using namespace std;
+int arr[1000000];
+int fib(int n){
+	if(arr[n]==-1){
+		if(n<=1)
+			arr[n] = n;
+		else
+			arr[n] = fib(n-1) + fib(n-2);
+	}
+	return arr[n];
+}
+int main(int argc, char const *argv[])
+{
+	int n;
+	cout<<"Enter n: ";
+	cin>>n;
+	for (int i = 0; i < n+1; ++i)
+	{
+		arr[i] = -1;
+	}
+	cout<<"Fibonacci number is "<<fib(n)<<endl;
+	return 0;
+}
\ No newline at end of file