Added a Few Basic DP questions

DP/DP Fibonacci.cpp

@@ -0,0 +1,41 @@
+// C++ program for Fibonacci Series using Dynamic Programming  
+
+#include<bits/stdc++.h> 
+using namespace std; 
+
+
+int fib(int n) 
+{ 
+
+    // Declare an array to store  
+    // Fibonacci numbers. 
+    // 1 extra to handle  
+    // case, n = 0  
+    int f[n + 2];  
+    int i; 
+
+    // 0th and 1st number of the  
+    // series are 0 and 1 
+    f[0] = 0; 
+    f[1] = 1; 
+
+    for(i = 2; i <= n; i++) 
+    { 
+
+       //Add the previous 2 numbers  
+       // in the series and store it 
+       f[i] = f[i - 1] + f[i - 2]; 
+    } 
+    return f[n]; 
+}  
+
+
+int main () 
+{  
+    int n;
+    cin>>n; 
+
+    cout <<fib(n); 
+
+    return 0;
+ } 

DP/DP factorial.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+int result[1000] = {0};
+int fact(int n) {
+   if (n >= 0) {
+      result[0] = 1;
+      for (int i = 1; i <= n; ++i) {
+         result[i] = i * result[i - 1];
+      }
+      return result[n];
+   }
+}
+int main() {
+   int n;
+   while (1) {
+      cout<<"Enter integer to compute factorial (enter 0 to exit): ";
+      cin>>n;
+      if (n == 0)
+      break;
+      cout<<fact(n)<<endl;
+   }
+   return 0;
+}