special subsequence problem

Author: anishsingh20

Dynamic Programming/LongestRepeatedSubstring.cpp

@@ -50,7 +50,7 @@ string LongestRepeatedSubstr(string s)
 
 int main()
 {
-	string str = "abcpqrabpqpq";
+	string str = "geeksforgeeks";
 
 	cout<<LongestRepeatedSubstr(str);
 	return 0;

Dynamic Programming/SpecialSubsequence.cpp

@@ -0,0 +1,5 @@
+#include<iostream>
+#include<vector>
+
+
+using namespace std;

General Programs/ArrayRotation.cpp

@@ -112,6 +112,7 @@ void RotateEffi(int arr[],int d,int n)
 }
 //T(n) = O(n*d)
 
+rotate()
 int main()
 {
 	int arr[]  = {1,2,3,4,5,6,7};