diff --git a/Dynamic Programming/Longest Increasing Subsequence.cpp b/Dynamic Programming/Longest Increasing Subsequence.cpp
new file mode 100644
index 000000000..e2d6111c8
--- /dev/null
+++ b/Dynamic Programming/Longest Increasing Subsequence.cpp	
@@ -0,0 +1,38 @@
+//Program to calculate length of longest increasing subsequence in an array
+#include <bits/stdc++.h>
+using namespace std;
+int LIS(int a[],int n){
+	int lis[n];
+	for (int i = 0; i < n; ++i)
+	{
+		lis[i] = 1;
+	}
+	for (int i = 0; i < n; ++i)
+	{
+		for (int j = 0; j < i; ++j)
+		{
+			if(a[i]>a[j] && lis[i]<lis[j]+1)
+				lis[i] = lis[j] + 1;
+		}
+	}
+	int res = 0;
+	for (int i = 0; i < n; ++i)
+	{
+		res = max(res,lis[i]);
+	}
+	return res;
+}
+int main(int argc, char const *argv[])
+{
+	int n;
+	cout<<"Enter size of array: ";
+	cin>>n;
+	int a[n];
+	cout<<"Enter array elements: ";
+	for (int i = 0; i < n; ++i)
+	{
+		cin>>a[i];
+	}
+	cout<<LIS(a,n)<<endl;
+	return 0;
+}
\ No newline at end of file