diff --git a/answers/ChimeraElixir/Increasing_array.cpp b/answers/ChimeraElixir/Increasing_array.cpp
new file mode 100644
index 0000000..139cebc
--- /dev/null
+++ b/answers/ChimeraElixir/Increasing_array.cpp
@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define loop for(ll i=0;i<n;i++)
+
+int main(){
+#ifndef ONLINE_JUDGE
+    freopen("input.txt", "r", stdin);
+    freopen("output.txt", "w", stdout);
+#endif
+    
+    ll n;
+    cin>>n;
+    ll  count=0;
+    ll array[n];
+
+    loop{
+        cin>>array[i];
+    }
+
+    loop{
+        if(array[i]>array[i+1]){
+        count+=abs(array[i]-array[i+1]);
+        array[i+1]=array[i];
+        }
+    }
+
+    cout<<count<<endl;
+    
+    return 0;
+}
diff --git a/answers/ChimeraElixir/Permutations.cpp b/answers/ChimeraElixir/Permutations.cpp
new file mode 100644
index 0000000..11a6ba7
--- /dev/null
+++ b/answers/ChimeraElixir/Permutations.cpp
@@ -0,0 +1,40 @@
+#include <iostream>
+#include<vector>
+using namespace std;
+#define ll long long
+#define loop for(ll i=0;i<n;i++)
+
+int main(){
+#ifndef ONLINE_JUDGE
+    freopen("input.txt", "r", stdin);
+    freopen("output.txt", "w", stdout);
+#endif
+    
+    int n;
+    cin>>n;
+    vector <ll> v;
+
+
+    
+    if(n==1){
+        cout<<'1'<<endl;
+    }
+    else if(n<=3 && n!=1){
+        cout<<"NO SOLUTION"<<endl;
+    }
+    else{
+        for (ll i=2;i<n+1;i+=2){
+            v.push_back(i);
+        }
+        for (ll i=1;i<n+1;i+=2){
+            v.push_back(i);
+        }
+    }
+
+    for(auto x:v){
+        cout<<x<<' ';
+    }
+    
+    
+    return 0;
+}
\ No newline at end of file
diff --git a/answers/ChimeraElixir/Repetitions.cpp b/answers/ChimeraElixir/Repetitions.cpp
new file mode 100644
index 0000000..07107ab
--- /dev/null
+++ b/answers/ChimeraElixir/Repetitions.cpp
@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+#ifndef ONLINE_JUDGE
+    freopen("input.txt", "r", stdin);
+    freopen("output.txt", "w", stdout);
+#endif
+    string s;
+    cin>>s;
+    int occurance=1,best=0;
+
+    for (int i=0;i<s.length();i++){
+        if(s[i]==s[i+1]){
+            occurance++;
+        }
+        else{
+            best=max(best,occurance);
+            occurance=1;
+        }
+
+    }
+    
+    cout<<best<<endl;
+
+
+    
+    return 0;
+}