diff --git a/Binary-Search/Books Allocation.cpp b/Binary-Search/Books Allocation.cpp
new file mode 100755
index 0000000..0f2ab85
--- /dev/null
+++ b/Binary-Search/Books Allocation.cpp	
@@ -0,0 +1,42 @@
+#define ll long long
+#include<bits/stdc++.h>
+using namespace std;
+
+// Book allocation problems
+// Why binary search? Dont just use it !
+// Brute force solution will be to check for each book
+// note that books are to be allocated in continuous form else it would have been an n subset problem with minimum sum any approaches?
+// Interviewer might can gove you a different problem which seems to be solved this way but actually could have been different
+// STRATEGY->
+// Naive solution
+// Notice the function graph
+// boom! binary search cna be a solution
+
+bool is(ll x, vector<int> & book,int m){
+    ll cnt=1,curr=0;
+    for(int i=0;i<book.size();i++) 
+        if(curr+book[i]<=x) curr+=book[i];  // note curr does not counts the number of books in a set!!
+        else cnt++,curr=book[i];
+    if(cnt<=m) return 1;
+    return 0;
+}
+
+int books(vector<int> &book, int m) {
+    int n=book.size();
+    if((m==0&&n!=0) || m>n) return -1;
+    
+    ll lo=0,hi=0,res=0;
+    for(int i=0;i<n;i++){
+        lo=max(lo,1LL*book[i]);
+        hi+=book[i];
+    }
+    
+    // using binary search
+    while(lo<=hi){
+        ll mid = (hi+lo)>>1;
+        if(is(mid,book,m)) res=mid,hi=mid-1;
+        else lo=mid+1;
+    }
+    
+    return res;
+}
diff --git a/Binary-Search/Good Base.cpp b/Binary-Search/Good Base.cpp
new file mode 100755
index 0000000..56bf23d
--- /dev/null
+++ b/Binary-Search/Good Base.cpp	
@@ -0,0 +1,43 @@
+#define ll long long
+#include<bits/stdc++.h>
+using namespace std;
+// still we not know when to use binary search!
+string solve(string A) {
+    ll n = stoll(A);
+    ll res=n-1,temp,mul;
+    temp=(sqrt(4*n-3)-1)/2;
+
+    if(n!=3 && temp*temp+temp+1==n) res=temp;
+    temp=0;
+
+    for(int i=3;i<64;i++){ // at most 1e6+1e4+1e2...
+        ll j=1; temp=0;
+        // we can use binary search for this !!!!
+        while(temp<n){
+            j++;
+            temp=0; mul=1;
+            for(int k=0;k<=i;k++) temp+=mul,mul*=j;
+        }
+        if(temp==n) res=j;
+    }
+    return to_string(res);
+}
+
+/*
+string Solution::solve(string n) {
+        long long num = stol(n);
+        for (int i = log(num ) / log(2); i >= 2; --i) {
+            long long left = 2, right = pow(num, 1.0 / (i-1)) + 1;
+            while (left < right) {
+                long long mid = left + (right - left) / 2, sum = 0;
+                for (int j = 0; j < i; ++j) {
+                    sum = sum * mid + 1;
+                }
+                if (sum == num) return to_string(mid);
+                else if (sum < num) left = mid + 1;
+                else right = mid;
+            }
+        }
+        return to_string(num - 1);
+}
+*/
\ No newline at end of file
diff --git a/Binary-Search/Matrix Median.cpp b/Binary-Search/Matrix Median.cpp
new file mode 100755
index 0000000..5a0bed2
--- /dev/null
+++ b/Binary-Search/Matrix Median.cpp	
@@ -0,0 +1,28 @@
+// Given a rowWise sorted array find matrix median of the array
+// Naive -> (N*M) log(N*M)              Aux->space O(N*M)
+// MEGRING SORTED ARRAYS-> (N*M) LOG(M) Aux->space O(N*M) 
+// BSearch-> (32*N*LOG(M))              Aux->space O(32)/ Dont say O(32) say constant
+// in bsearch logn steps are there but each step is having O(1) space so even after the search extra space will be used only once
+// but in Merging Sorted arrays recursive func is there so at any time space might be o(1)*logM steps
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int cnt(int x, vector<vector<int>> &A){
+    int cnt=0;
+    for(auto v:A) cnt+=(lower_bound(v.begin(),v.end(),x)-v.begin());    
+    return cnt;
+}
+
+int findMedian(vector<vector<int> > &A) {
+    int hi=INT_MIN,lo=INT_MAX,res=INT_MIN,r=A.size(),c=A[0].size();
+    
+    for(auto v:A) for(auto x:v) hi=max(hi,x), lo=min(lo,x);
+    while(lo<=hi){
+        int mid= (lo+hi)>>1;
+        if(cnt(mid,A)*2<r*c) res=mid,lo=mid+1;
+        else hi=mid-1;
+    }
+    if(res==INT_MIN) return A[0][0];
+    return res;
+}
diff --git a/Binary-Search/Simple Queries.cpp b/Binary-Search/Simple Queries.cpp
new file mode 100644
index 0000000..a1f3f2f
--- /dev/null
+++ b/Binary-Search/Simple Queries.cpp	
@@ -0,0 +1,71 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define vi vector<int>
+#define pb push_back
+#define pii pair<int,int>
+#define fi first
+#define se second
+#define re cin>>
+#define pr cout<<
+#define all(x) x.begin(),x.end()
+#define rep(i,n) for(int i=0;i<n;i++)
+#define rep1(i,n) for(int i=1;i<=n;i++)
+
+
+const int N=2e6+5;
+const int mod=1e9+7;
+
+#define ll unsigned long long
+const int  mod = 1e9+7;
+
+ll count(int x){
+    ll res=1;
+    for(int i=1;i*i<=x;i++){
+        if(x%i==0){
+            res=(res*(i))%mod;
+            if(x==i*i) continue;
+            res=(res*(x/i))%mod;
+        }
+    }
+    return res%mod;
+}
+
+vector<int> solve(vector<int> &A, vector<int> &B) {
+    int n=A.size();
+    vector<ll> times(n+1),order(n);
+    stack<int> st;
+    for(int i=0;i<A.size();i++){
+        while(!st.empty() && A[st.top()]<A[i]){
+            int p=st.top(); st.pop();
+            int l=st.size()?st.top()+1:0;
+            int r=i-1;
+            times[p]=(p-l+1LL)*(r-p+1);
+        }
+        st.push(i);
+    }
+    while(!st.empty()){
+        int p=st.top(); st.pop();
+        int l=st.size()?st.top()+1:0;
+        times[p]=(p-l+1LL)*(n-1-p+1);
+    }
+    
+    vector<pair<int,int>> pp;
+    for(int i=0;i<n;i++) pp.push_back(make_pair(count(A[i]),times[i]));
+    sort(pp.begin(),pp.end(),greater<pair<int,int>>());
+    
+    ll sum=0;
+    for(int i=0;i<n;i++) order[i]=(sum+=pp[i].second);
+    for(int i=0;i<B.size();i++)
+        B[i] =pp[lower_bound(order.begin(),order.end(),B[i])-order.begin()].first;
+    return B;
+}
+
+int main(){
+      
+      cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
+      
+      
+      return 0;
+}
+
diff --git a/DynamicProgramming/Catalan Sequence.cpp b/DynamicProgramming/Catalan Sequence.cpp
new file mode 100755
index 0000000..c9b0a03
--- /dev/null
+++ b/DynamicProgramming/Catalan Sequence.cpp	
@@ -0,0 +1,23 @@
+const int mod =1e9+7;
+void EE(int aa, int bb, int& xx, int& yy){if(aa%bb == 0){xx=0,yy=1;return;}
+EE(bb,aa%bb,xx,yy);int t = xx;xx = yy;yy = t - yy*(aa/bb);}
+int mmi(int aa){int xx,yy;EE(aa,mod,xx,yy);xx = (xx+mod)%mod;return xx;}
+
+int getCatalan(int A){
+    int res=1;
+    for(int i=2;i<=A;i++) res= (1LL*res*(A+i))%mod;
+    for(int i=2;i<=A;i++) res= (1LL*res*mmi(i))%mod;
+    return res;
+}
+
+int dpSol(int A){
+    vector<int>dp(A+1,0);
+    dp[1]=dp[0]=1;
+    for(int i=2;i<=A;i++) for(int j=0;j<i;j++) dp[i]=(dp[i]+1LL*dp[j]*dp[i-1-j])%mod;
+    return dp[A];
+}
+int chordCnt(int A) {
+    if(A==0) return 0;
+    return dpSol(A);
+    return getCatalan(A);
+}
diff --git a/DynamicProgramming/Count Ways in 3Nboard.cpp b/DynamicProgramming/Count Ways in 3Nboard.cpp
new file mode 100755
index 0000000..91afb55
--- /dev/null
+++ b/DynamicProgramming/Count Ways in 3Nboard.cpp	
@@ -0,0 +1,44 @@
+#include<bits/stdc++.h>
+#define ll int64_t
+#define pii pair<int,int>
+#define mp make_pair
+#define pb push_back
+#define vi vector<int>
+#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
+
+using namespace std;
+const ll mod =1e9+7;
+const int N =2e5+1;
+
+
+// for counting->
+int main() {
+    int d[3]={1,2,3};
+    int s[3]={1,2,1};
+    
+    cout<<"For diff->";
+    int same=0,diff=0;
+    for(int i=1;i<=4;i++)
+        for(int j=1;j<=4;j++)
+            for(int k=1;k<=4;k++){
+                if(d[0]==i|| d[1]==j || d[2]==k) continue;
+                if(i==j || j==k) continue;
+                if(i==k) same++;
+                else diff++;
+            }
+    cout<<same<<" "<<diff;
+
+    cout<<"For Same->";
+    same=0,diff=0;
+    for(int i=1;i<=4;i++)
+        for(int j=1;j<=4;j++)
+            for(int k=1;k<=4;k++){
+                if(s[0]==i || s[1]==j|| s[2]==k) continue;
+                if(i==j || j==k) continue;
+                if(i==k) same++;
+                else diff++;
+            }
+
+    cout<<same<<" "<<diff;
+    return 0;
+}
diff --git a/DynamicProgramming/Palindrome Partition.cpp b/DynamicProgramming/Palindrome Partition.cpp
new file mode 100755
index 0000000..3f8f9b1
--- /dev/null
+++ b/DynamicProgramming/Palindrome Partition.cpp	
@@ -0,0 +1,31 @@
+vector<vector<bool>> isPad;
+vector<int> dp;
+
+void cr(string &A){
+    isPad=vector<vector<bool>>(A.size()+1,vector<bool>(A.size()+1));
+    dp=vector<int>(A.size()+1,-1);
+}
+
+void generatePads(string &A){
+    int n=A.size();
+    for(int i=0;i<n;i++) isPad[i][i]=1;
+    for(int i=0;i<n-1;i++) isPad[i][i+1]=A[i]==A[i+1];
+    for(int l=3;l<=n;l++) for(int i=0,j=l-1;j<n;i++,j++)
+        isPad[i][j]=(A[i]==A[j] && isPad[i+1][j-1]);
+}
+
+int solve(int i, string &s){
+    if(i==s.size()) return dp[i]=0;
+    if(dp[i]!=-1)   return dp[i];
+    dp[i]=1e6;
+    for(int k=i;k<s.size();k++) 
+    if(isPad[i][k]) dp[i]=min(dp[i],solve(k+1,s)+1);
+    return dp[i];
+}
+
+int Solution::minCut(string A) {
+    if(A.size()==0) return 0;
+    cr(A);
+    generatePads(A);
+    return solve(0,A)-1;
+}
diff --git a/DynamicProgramming/Super Substring.cpp b/DynamicProgramming/Super Substring.cpp
new file mode 100755
index 0000000..c8d2880
--- /dev/null
+++ b/DynamicProgramming/Super Substring.cpp	
@@ -0,0 +1,116 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int kmp(string &pattern, string & text){
+    int len=0;
+    vector<int>lps(pattern.size(),0); 
+    for(int i=1;i<pattern.size();i++){
+        if(pattern[len]==pattern[i]) lps[i]=++len;
+        else{
+            while(len && pattern[len]!=pattern[i]) len=lps[len-1];
+            if(pattern[len]==pattern[i]) lps[i]=++len;
+        }
+    }
+    int j=0;
+    for(int i=0;i<text.size();i++){
+        if(text[i]==pattern[j]) j++;
+        else{
+            while(j && text[i]!=pattern[j]) j=lps[j-1];
+            if(text[i]==pattern[j]) j++;
+        }
+        if(j==pattern.size()) j=lps[j-1]; 
+    }
+    return j;
+}
+
+int getRedx(string &s1, string  & s2, string &s3){
+    int n1=s1.size(),n2=s2.size(),n3=s3.size();
+    int l=kmp(s2,s1),r=kmp(s3,s2);
+    return l+r;
+}
+
+string combine(string &s1, string  & s2, string &s3){
+    int n1=s1.size(),n2=s2.size(),n3=s3.size();
+    int l=kmp(s2,s1),r=kmp(s3,s2);
+    return (s1+s2.substr(l)+s3.substr(r));
+}
+
+void removeSubStrings(vector<string> & ar){
+    // cerr<<"\nReduced to Vector:";for(auto s:ar) cerr<<s<<" ";
+    vector<string> vec;
+    int n=ar.size();
+    for(int i=0;i<n;i++) {
+        bool add=1;
+        string &temp=ar[i]; 
+        for(int j=0;j<n;j++) if(i!=j && ar[j].find(temp)!=string::npos) {add=0;break;}
+        if(add) vec.push_back(temp);
+    }
+    ar=vec;
+}
+
+string getRes(vector<string> &ar,bool &at){
+    // cerr<<"\nPassed Vector:";for(auto s:ar) cerr<<s<<" ";
+    if(ar.size()==1) return ar[0];
+    removeSubStrings(ar);
+    if(ar.size()==2){
+        int l=kmp(ar[0],ar[1]),r=kmp(ar[1],ar[0]);
+        if(l>r) return ar[1]+ar[0].substr(l);
+        return ar[0]+ar[1].substr(r);
+    }
+    int ii=0,jj=1,kk=2,mx=0,n=ar.size();
+    for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(i!=j) for(int k=0;k<n;k++) if(i!=k && j!=k)  {
+        int x=getRedx(ar[i],ar[j],ar[k]);
+        if(at) { if(x>mx) {mx=x;ii=i,jj=j,kk=k;}}
+        else { if(x>=mx){mx=x;ii=i,jj=j,kk=k;}}
+    }
+    // cerr<<"\nMax reduction->"<<ii<<" "<<jj<<" "<<kk<<" of "<<mx;
+    vector<string> justPassItDude;
+    for(int i=0;i<n;i++) if(i!=ii && i!=jj && i!=kk) justPassItDude.push_back(ar[i]);
+    justPassItDude.push_back(combine(ar[ii],ar[jj],ar[kk]));
+    return getRes(justPassItDude,at);
+}
+
+void removeDups(vector<string> &ar){
+    sort(ar.begin(),ar.end());
+    vector<string> res;
+    for(int i=0;i<ar.size();i++)if(!res.size()||res.back()!=ar[i])res.push_back(ar[i]);
+    ar=res;
+}
+
+int solve(vector<string> &A) {
+    removeDups(A);
+    bool withEquality=0;
+    withEquality=1;
+    string res1 = getRes(A,withEquality); 
+    string res2 = getRes(A,withEquality); 
+    return min(res1.size(),res2.size());
+}
+
+int main() {
+	int n;
+	cin>>n;
+    vector<string> vec(n);
+	for(int i=0;i<n;i++) cin>>vec[i];
+	cerr<<"\n"<<solve(vec);
+	return 0;
+}
+
+/*
+BORDER TEST CASES:
+10 nejqokaplfbrqe cjqpuidbwnbaml naiwqahtpubspt jvidmdlrhjhkjt pjvyhpbqlsm lcgkneuqsydk mruvnqlapmjhp sioft nehtaxnb xlpsgn
+
+5 
+rsdowi 
+xlidxdiixperv 
+eavnwypdinwdr 
+acvanhelkov 
+edcax
+
+6 
+inlocbpjeomukp 
+sqhvo 
+poserdbwicfxqw 
+romveb 
+qtojkyfbpwridm 
+hlvltvcqyvfms
+*/
\ No newline at end of file