diff --git a/Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence.cpp b/Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence.cpp
new file mode 100644
index 000000000..b47431566
--- /dev/null
+++ b/Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence.cpp	
@@ -0,0 +1,45 @@
+/**
+ * The program finds the length of the Longest subsequence (may not be
+ * continuous) such that the subsequence is in increasing order
+ */
+#include <bits/stdc++.h>
+using namespace std;
+
+
+
+int findMax(int arr[], int length) {
+    int max = 0;
+    for (int i = 0; i < length; i++) {
+        if (max < arr[i]) {
+            max = arr[i];	
+        }			
+    }
+    return max;
+}
+
+int findLongestIncSubLength(int arr[],int length) {
+    int dp[length];
+    int i, j, max = 0;
+
+    // Initialize Longest Increasing Subsequence values
+    for (i = 0; i < length; i++) {
+        dp[i] = 1;			
+    }
+    
+    for (i = 1; i < length; i++) {
+        for (j = 0; j < i; j++) {
+            if (arr[i] > arr[j] && dp[i] < dp[j] + 1) {
+                dp[i] = dp[j] + 1;	
+            }				
+        }
+    }
+    max = findMax(dp, length);
+    return max;
+}
+
+int main() {
+    int arr[] = { 1, 4, 2, 10, 8 };
+    int lisLength = findLongestIncSubLength(arr,5);
+    cout << "Longest Increasing Subsequence Length is : " << lisLength << endl;
+    
+}