diff --git a/Dynamic programming/binomial_coefficient.cpp b/Dynamic programming/binomial_coefficient.cpp
new file mode 100644
index 0000000..09cde71
--- /dev/null
+++ b/Dynamic programming/binomial_coefficient.cpp	
@@ -0,0 +1,24 @@
+#include<bits/stdc++.h> 
+using namespace std; 
+
+int binomial_coefficient(int n, int k) 
+{ 
+    int C[k+1]; 
+    memset(C, 0, sizeof(C)); 
+    C[0] = 1;  // nC0 is 1 
+
+    for (int i = 1; i <= n; i++) 
+    { 
+        // Compute next row of pascal triangle using the previous row 
+        for (int j = min(i, k); j > 0; j--) 
+            C[j] = C[j] + C[j-1]; 
+    } 
+    return C[k]; 
+} 
+
+int main() 
+{ 
+    int n = 10, k = 3; 
+    printf ("Value of C(%d, %d) is %d ",n, k, binomial_coefficient(n, k) ); 
+    return 0; 
+}