diff --git a/Algorithms/C++/anagrams.cpp b/Algorithms/C++/anagrams.cpp
new file mode 100644
index 00000000..9f74f437
--- /dev/null
+++ b/Algorithms/C++/anagrams.cpp
@@ -0,0 +1,39 @@
+#include<bits/stdc++.h>
+using namespace std ;
+vector<vector<int> >anagrams(const vector<string> &A) {
+    for(int i=0;i<A.size();i++){
+        sort(A[i].begin(),A[i].end());
+    }
+    vector<vector<int> >v;
+    unordered_map<int,int> mp;
+    for(int i=0;i<A.size();i++){
+        if(mp.find(A[i])==mp.end()){
+            mp[A[i]]=i;
+        }
+        else{
+            vector<int> s={i+1,mp[A[i]]+1};
+            v.push_back(s);
+            
+        }
+    }
+    return v;
+}
+
+int main()
+{
+	int mod = 1000000007;
+    int n;
+    cin>>n;
+	vector<string> a;
+    for(int i=0;i<n;i++){
+        string b; cin>>b;
+        a.push_back(b);
+    }
+    vector<vector<int> > v=anagrams(a);
+    for(int i=0;i<v.size();i++){
+        for(int j=0;i<v[0].size();j++){
+            cout<<v[i][j];
+        }
+    }
+	return 0;
+}
\ No newline at end of file
diff --git a/Algorithms/C++/longest_paloindromic_sequence.cpp b/Algorithms/C++/longest_paloindromic_sequence.cpp
new file mode 100644
index 00000000..ac3a07bf
--- /dev/null
+++ b/Algorithms/C++/longest_paloindromic_sequence.cpp
@@ -0,0 +1,32 @@
+#include<bits/stdc++.h>
+using namespace std ;
+int lcs(string a,string b,int m,int n){
+    int t[m+1][n+1];
+    for(int i=0;i<=m;i++){
+        for(int j=0;j<=n;j++){
+            if(i==0||j==0)
+                t[i][j]=0;
+            else if(a[i-1]==b[j-1])
+                t[i][j]=t[i-1][j-1]+1;
+            else 
+                t[i][j]=max(t[i-1][j],t[i][j-1]);
+        }
+        
+    }
+    return t[m][n];
+}
+int solve(string A) {
+    int m=A.length();
+    string B=A;
+    reverse(A.begin(),A.end());
+    
+    return lcs(A,B,m,m);
+}
+int main()
+{
+	int mod = 1000000007;
+	string A;
+	cin>>A;
+	cout<<solve(A);
+	return 0;
+}
\ No newline at end of file