From b9c9413575db2fcafeb58bcf8fbe429148f74c73 Mon Sep 17 00:00:00 2001
From: "Md. Zarif Ul Alam" <zarif98sjs@gmail.com>
Date: Fri, 10 Jul 2020 21:49:59 +0600
Subject: [PATCH] Geo Template Added

---
 Cheat Sheet/Game Theory/Nim.md                |  11 +
 .../test.cpp                                  |  42 +--
 .../test2.cpp                                 | 115 ++++---
 .../02 Geometry Template (Point & Line).cpp   | 316 ++++++++++++++++++
 .../03 Geometry Template (Rectangle).cpp      | 181 ++++++++++
 ...orrect Bracket Sequence (Segment Tree).cpp | 222 ------------
 .../00 Substring Search [Suffix Array].cpp    | 263 ---------------
 .../01 Counting Substrings [Suffix Array].cpp | 296 ----------------
 .../String/02 Counting Substrings [KMP].cpp   | 152 ---------
 ...of Different Substrings [Suffix Array].cpp | 249 --------------
 ...Substring of two string [Suffix Array].cpp | 274 ---------------
 ...er of occurrences of each prefix [KMP].cpp | 174 ----------
 12 files changed, 585 insertions(+), 1710 deletions(-)
 create mode 100644 Cheat Sheet/Game Theory/Nim.md
 rename Miscellaneous/Problems/Popular/00 Correct Bracket Sequence.cpp => Data Structure/test.cpp (80%)
 rename Miscellaneous/Problems/String/06 Make Palindrome adding minimum characters [KMP].cpp => Data Structure/test2.cpp (50%)
 create mode 100644 Miscellaneous/02 Geometry Template (Point & Line).cpp
 create mode 100644 Miscellaneous/03 Geometry Template (Rectangle).cpp
 delete mode 100644 Miscellaneous/Problems/Popular/01 Correct Bracket Sequence (Segment Tree).cpp
 delete mode 100644 Miscellaneous/Problems/String/00 Substring Search [Suffix Array].cpp
 delete mode 100644 Miscellaneous/Problems/String/01 Counting Substrings [Suffix Array].cpp
 delete mode 100644 Miscellaneous/Problems/String/02 Counting Substrings [KMP].cpp
 delete mode 100644 Miscellaneous/Problems/String/03 Number of Different Substrings [Suffix Array].cpp
 delete mode 100644 Miscellaneous/Problems/String/04 Longest Common Substring of two string [Suffix Array].cpp
 delete mode 100644 Miscellaneous/Problems/String/05 Counting the number of occurrences of each prefix [KMP].cpp

diff --git a/Cheat Sheet/Game Theory/Nim.md b/Cheat Sheet/Game Theory/Nim.md
new file mode 100644
index 0000000..5a33a98
--- /dev/null
+++ b/Cheat Sheet/Game Theory/Nim.md	
@@ -0,0 +1,11 @@
+# Nim
+
+## Optimal Strategy
+
+> “If both A and B play optimally (i.e- they don’t make any mistakes), then the player starting first is guaranteed to win if the Nim-Sum at the beginning of the game is non-zero. Otherwise, if the Nim-Sum evaluates to zero, then player A will lose definitely.”
+
+### Reasoning 
+Couple of deductions about bitwise XOR necessary for understanding the Optimal Strategy :
+- If the XOR sum of ‘n’ numbers is already zero then there is no possibility to make the XOR sum zero by single reduction of a number. 
+- If the XOR sum of ‘n’ numbers is non-zero then there is at least a single approach by which if you reduce a number, the XOR sum is zero.
+
diff --git a/Miscellaneous/Problems/Popular/00 Correct Bracket Sequence.cpp b/Data Structure/test.cpp
similarity index 80%
rename from Miscellaneous/Problems/Popular/00 Correct Bracket Sequence.cpp
rename to Data Structure/test.cpp
index af8d549..016c299 100644
--- a/Miscellaneous/Problems/Popular/00 Correct Bracket Sequence.cpp	
+++ b/Data Structure/test.cpp	
@@ -10,9 +10,10 @@ using namespace std;
 #define MP make_pair
 #define F first
 #define S second
+#define INF INT_MAX
 
 #define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
+#define DBG(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << endl
 #define READ        freopen("alu.txt", "r", stdin)
 #define WRITE       freopen("vorta.txt", "w", stdout)
 
@@ -62,38 +63,24 @@ string to_str(T x)
 //
 //}
 
-bool isCorrectBracket(string s)
-{
-    vector<char>v;
-
-    for(int i=0;i<(int)s.size();i++)
-    {
-        if(s[i]=='(') v.push_back(s[i]);
-
-        if(v.empty()) return false;
-
-        if(s[i]==')') v.pop_back();
-
-//        cout<<v<<endl;
-    }
-
-    return v.empty();
-}
-
 int main()
 {
+    //freopen("out.txt","w",stdout);
+
     optimizeIO();
 
-    int tc;
-    cin>>tc;
+    multiset<int> a {1, 1 ,3, 7, 10, 10 , 13, 20 , 20 , 20};
+	multiset<int> b {2, 3, 5, 7, 7, 11, 11, 11, 13, 15, 19};
 
-    while(tc--)
-    {
-        string s;
-        cin>>s;
+	vector<int> v;
+	merge(a.begin(), a.end(), b.begin(), b.end(), back_inserter(v));
 
-        cout<<isCorrectBracket(s)<<endl;
-    }
+	multiset<int> m(v.begin(), v.end());
+
+	for(const auto &element : m) {
+		cout << element << " ";
+	}
+	cout << endl;
 
     return 0;
 }
@@ -133,3 +120,4 @@ ostream &operator <<(ostream &os, set<T>&v)
 }
 
 
+
diff --git a/Miscellaneous/Problems/String/06 Make Palindrome adding minimum characters [KMP].cpp b/Data Structure/test2.cpp
similarity index 50%
rename from Miscellaneous/Problems/String/06 Make Palindrome adding minimum characters [KMP].cpp
rename to Data Structure/test2.cpp
index 5e77357..d287933 100644
--- a/Miscellaneous/Problems/String/06 Make Palindrome adding minimum characters [KMP].cpp	
+++ b/Data Structure/test2.cpp	
@@ -1,24 +1,25 @@
 
 /**
 
-KMP
+NOT KNOWING THIS MULTISET VARIENT OF PBDS COST A PROBLEM IN ICPC PRELI 2019 :)
 
-Idea :
+Policy Based Data Structure (MULTI SET)
+===========================
 
-Let , s  = acbabab
-and   rs = bababca (reverse of string s)
+SEE PBDS SET FOR AVAILABLE FUNCTIONS
 
-How can we make Palindrome of shortest length ?
+Implementation 2 : using "pair<,>" in declaration
+--------------------------------------------------
 
- acbabab
- --bababca
+This uses a dummy second variable to use this PBDS as a multiset.
+Works fine with almost all the functions .
 
-So ,  We need to know the Longest Prefix of rs in s .
-We can do that using Prefix Function , KMP .
 
 **/
 
-/** Which of the favors of your Lord will you deny ? **/
+/**Which of the favors of your Lord will you deny ?**/
+
+//#undef _GLIBCXX_DEBUG
 
 #include<bits/stdc++.h>
 using namespace std;
@@ -29,9 +30,10 @@ using namespace std;
 #define MP make_pair
 #define F first
 #define S second
+#define INF INT_MAX
 
 #define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
+#define DBG(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << endl
 #define READ        freopen("alu.txt", "r", stdin)
 #define WRITE       freopen("vorta.txt", "w", stdout)
 
@@ -39,7 +41,10 @@ using namespace std;
 #include <ext/pb_ds/tree_policy.hpp>
 using namespace __gnu_pbds;
 
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
+template<class TIn>
+using indexed_multiset = tree<
+                    pair<TIn,TIn>, null_type, less< pair<TIn,TIn> >,
+                    rb_tree_tag, tree_order_statistics_node_update>;
 
 /**
 
@@ -59,13 +64,14 @@ ostream &operator <<(ostream &os, vector<T>&v);
 template <class T>
 ostream &operator <<(ostream &os, set<T>&v);
 
+
 inline void optimizeIO()
 {
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
 }
 
-const int nmax = 2e5+7;
+const int nmax = 1e6+7;
 const LL LINF = 1e17;
 
 template <class T>
@@ -76,64 +82,69 @@ string to_str(T x)
     return ss.str();
 }
 
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-vector<int> prefix_function(string s) {
-    int n = (int)s.length();
-    vector<int> pi(n);
-    for (int i = 1; i < n; i++) {
-        int j = pi[i-1];
-        while (j > 0 && s[i] != s[j])
-            j = pi[j-1];
-        if (s[i] == s[j])
-            j++;
-        pi[i] = j;
-    }
-    return pi;
-}
+indexed_multiset<int> MS;
+indexed_multiset<int> MS2;
 
-int minimumPalindromeLength(string s)
+template <class T>
+void erase_all_occurrence(T val) /** O(n) **/
 {
-    int sz = s.size();
-    string rs = s;
-    reverse(ALL(rs));
-
-    vector<int>pi = prefix_function(rs+"#"+s);
-    int psz = pi.size();
+    while((*MS.lower_bound({val,0})).F==val)
+        MS.erase(MS.lower_bound({val,0}));
+}
 
-    int maximum_match = pi[psz-1];
+template <class T>
+void erase_one_occurrence(T val) /** O(logN) **/
+{
+    MS.erase(MS.lower_bound({val,0}));
+}
 
-    int ans = sz + (sz-maximum_match);
-    return ans;
+void printMS()
+{
+    for(auto x:MS)
+        cout<<x<<" ";
+    cout<<endl;
 }
 
 int main()
 {
     optimizeIO();
 
-    int tc;
-    cin>>tc;
+    MS.clear();
 
-    for(int qq=1;qq<=tc;qq++)
+    int n;
+    cin>>n;
+
+    for(int i=1;i<=n;i++)
     {
-        string s;
-        cin>>s;
+        int x;
+        cin>>x;
 
-        int ans = minimumPalindromeLength(s);
+        MS.insert({x,i}); /** insert **/
+        MS2.insert({x,i}); /** insert **/
+    }
+
+    printMS();
+
+    vector<int> v;
+	merge(MS.begin(), MS.end(), MS2.begin(), MS2.end(), back_inserter(v));
+
+	multiset<int> m(v.begin(), v.end());
+
+	for(const auto &element : m) {
+		cout << element << " ";
+	}
+	cout << endl;
 
-        cout<<"Case "<<qq<<": ";
-        cout<<ans<<endl;
 
-    }
 
-    return 0;
 }
 
+
 /**
 
+8
+30 10 20 10 40 30 20 20
+
 **/
 
 template<class T1, class T2>
@@ -165,5 +176,3 @@ ostream &operator <<(ostream &os, set<T>&v)
     os<<" ]";
     return os;
 }
-
-
diff --git a/Miscellaneous/02 Geometry Template (Point & Line).cpp b/Miscellaneous/02 Geometry Template (Point & Line).cpp
new file mode 100644
index 0000000..8126aeb
--- /dev/null
+++ b/Miscellaneous/02 Geometry Template (Point & Line).cpp	
@@ -0,0 +1,316 @@
+
+/**
+
+STRUCTURE
+---------
+1. PT
+2. LINE
+
+FUNCTION OVERVIEW
+-----------------
+
+double dot(PT p, PT q)
+double cross(PT p, PT q)
+double dist2(PT p, PT q)
+
+PT RotateCCW90(PT p)
+PT RotateCW90(PT p)
+PT RotateCCW(PT p, double t)
+
+PT LineIntersectionUsingPoint(PT a, PT b, PT c, PT d)
+PT LineIntersectionUsingLine(LINE l1, LINE l2)
+
+PT Middle(PT p, PT q)
+
+LINE points_to_line(PT p, PT q)
+LINE perpendicular(LINE l, PT p)
+
+PT ComputeCircleCenter(PT a, PT b, PT c)
+
+bool LinesParallel(PT a, PT b, PT c, PT d)
+bool LinesCollinear(PT a, PT b, PT c, PT d)
+
+PT ProjectPointLine(PT a, PT b, PT c)
+PT ProjectPointSegment(PT a, PT b, PT c)
+double DistancePointSegment(PT a, PT b, PT c)
+double DistancePointLine(PT a, PT b, PT c)
+
+double HeronTriangleArea(double a,double b,double c)
+double PassPointThroughLine(PT a,LINE l)
+
+**/
+
+
+/** Which of the favors of your Lord will you deny ? **/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define LL long long
+#define PII pair<int,int>
+#define PLL pair<LL,LL>
+#define F first
+#define S second
+
+#define DBL long long
+//#define DBL double
+
+#define ALL(x)      (x).begin(), (x).end()
+#define READ        freopen("alu.txt", "r", stdin)
+#define WRITE       freopen("vorta.txt", "w", stdout)
+
+#ifndef ONLINE_JUDGE
+#define DBG(x)      cout << __LINE__ << " says: " << #x << " = " << (x) << endl
+#else
+#define DBG(x)
+#endif
+
+template<class T1, class T2>
+ostream &operator <<(ostream &os, pair<T1,T2>&p);
+template <class T>
+ostream &operator <<(ostream &os, vector<T>&v);
+template <class T>
+ostream &operator <<(ostream &os, set<T>&v);
+
+inline void optimizeIO()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+}
+
+const int nmax = 2e5+7;
+
+double INF = 1e100;
+double EPS = 1e-12;
+
+const double eps = 1e-11;
+int cmp(double x, double y)
+{
+    return (x <= y + eps) ? (x + eps < y) ? -1 : 0 : 1; /// 0 -> x equal y , 1 -> x>y , -1 -> x<y
+}
+
+struct PT
+{
+    double x,y;
+    PT() {}
+    PT(double x,double y) : x(x), y(y) {}
+    PT(const PT &p) :   x(p.x), y(p.y) {}
+
+    bool operator==(const PT &p)
+    {
+        return (cmp(x,p.x) == 0 && cmp(y,p.y) == 0);
+    }
+
+    PT operator + (const PT &p) const
+    {
+        return PT(x+p.x, y+p.y);
+    }
+    PT operator - (const PT &p) const
+    {
+        return PT(x-p.x, y-p.y);
+    }
+    PT operator * (double c)    const
+    {
+        return PT(x*c, y*c  );
+    }
+    PT operator / (double c)    const
+    {
+        return PT(x/c, y/c  );
+    }
+};
+
+struct LINE
+{
+    double a,b,c;
+};
+
+double dot(PT p, PT q)
+{
+    return p.x*q.x+p.y*q.y;
+}
+double cross(PT p, PT q)
+{
+    return p.x*q.y-p.y*q.x;
+}
+
+double dist2(PT p, PT q)
+{
+    return dot(p-q,p-q);
+}
+
+/// rotate a point CCW or CW around the origin
+PT RotateCCW90(PT p)
+{
+    return PT(-p.y,p.x);
+}
+PT RotateCW90(PT p)
+{
+    return PT(p.y,-p.x);
+}
+PT RotateCCW(PT p, double t)
+{
+    return PT(p.x*cos(t)-p.y*sin(t), p.x*sin(t)+p.y*cos(t));
+}
+
+PT LineIntersectionUsingPoint(PT a, PT b, PT c, PT d)
+{
+    b=b-a;
+    d=c-d;
+    c=c-a;
+    assert(dot(b, b) > EPS && dot(d, d) > EPS);
+    return a + b*cross(c, d)/cross(b, d);
+}
+
+PT LineIntersectionUsingLine(LINE l1, LINE l2)
+{
+    PT p;
+
+    p.y = (l2.c * l1.a - l1.c * l2.a) / (l1.b * l2.a - l2.b * l1.a);
+    p.x = (l2.c * l1.b - l1.c * l2.b) / (l1.a * l2.b - l2.a * l1.b);
+
+    return p;
+}
+
+PT Middle(PT p, PT q)
+{
+    PT m = { (p.x + q.x) / 2, (p.y + q.y) / 2 };
+
+    return m;
+}
+
+LINE points_to_line(PT p, PT q)
+{
+    LINE l;
+
+    l.a = p.y - q.y;
+    l.b = q.x - p.x;
+    l.c = -l.a * p.x - l.b * p.y;
+
+    return l;
+}
+
+LINE perpendicular(LINE l, PT p)
+{
+    LINE per;
+
+    per.a = -l.b;
+    per.b = l.a;
+    per.c = -per.a * p.x - per.b * p.y;
+
+    return per;
+}
+
+PT ComputeCircleCenter(PT a, PT b, PT c)
+{
+    b=(a+b)/2;
+    c=(a+c)/2;
+    return LineIntersectionUsingPoint(b, b+RotateCW90(a-b), c, c+RotateCW90(a-c));
+}
+
+
+bool LinesParallel(PT a, PT b, PT c, PT d)
+{
+    return fabs(cross(b-a, c-d)) < EPS;
+}
+
+bool LinesCollinear(PT a, PT b, PT c, PT d)
+{
+    return LinesParallel(a, b, c, d)
+           && fabs(cross(a-b, a-c)) < EPS
+           && fabs(cross(c-d, c-a)) < EPS;
+}
+
+/// project point c onto line through a and b
+/// assuming a != b
+PT ProjectPointLine(PT a, PT b, PT c)
+{
+    return a + (b-a)*dot(c-a, b-a)/dot(b-a, b-a);
+}
+
+/// project point c onto line segment through a and b
+PT ProjectPointSegment(PT a, PT b, PT c)
+{
+    double r = dot(b-a,b-a);
+    if (fabs(r) < EPS)
+        return a;
+    r = dot(c-a, b-a)/r;
+    if (r < 0)
+        return a;
+    if (r > 1)
+        return b;
+    return a + (b-a)*r;
+}
+
+/// compute distance from c to segment between a and b
+double DistancePointSegment(PT a, PT b, PT c)
+{
+    return sqrt(dist2(c, ProjectPointSegment(a, b, c)));
+}
+
+/// compute distance from c to line between a and b
+double DistancePointLine(PT a, PT b, PT c)
+{
+    return sqrt(dist2(c, ProjectPointLine(a, b, c)));
+}
+
+double HeronTriangleArea(double a,double b,double c)
+{
+    double s=(a+b+c)*0.5;
+    double area=sqrt(s*(s-a)*(s-b)*(s-c));
+    return area;
+}
+
+double PassPointThroughLine(PT a,LINE l)
+{
+    return (l.a*a.x+l.b*a.y+l.c);
+}
+
+int main()
+{
+    optimizeIO();
+
+    int tc;
+    cin>>tc;
+
+    while(tc--)
+    {
+
+    }
+
+    return 0;
+}
+
+/**
+
+**/
+
+template<class T1, class T2>
+ostream &operator <<(ostream &os, pair<T1,T2>&p)
+{
+    os<<"{"<<p.first<<", "<<p.second<<"} ";
+    return os;
+}
+template <class T>
+ostream &operator <<(ostream &os, vector<T>&v)
+{
+    os<<"[ ";
+    for(int i=0; i<v.size(); i++)
+    {
+        os<<v[i]<<" " ;
+    }
+    os<<" ]";
+    return os;
+}
+
+template <class T>
+ostream &operator <<(ostream &os, set<T>&v)
+{
+    os<<"[ ";
+    for(T i:v)
+    {
+        os<<i<<" ";
+    }
+    os<<" ]";
+    return os;
+}
+
diff --git a/Miscellaneous/03 Geometry Template (Rectangle).cpp b/Miscellaneous/03 Geometry Template (Rectangle).cpp
new file mode 100644
index 0000000..10544e0
--- /dev/null
+++ b/Miscellaneous/03 Geometry Template (Rectangle).cpp	
@@ -0,0 +1,181 @@
+
+/** Which of the favors of your Lord will you deny ? **/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define LL long long
+#define PII pair<int,int>
+#define PLL pair<LL,LL>
+#define F first
+#define S second
+
+#define DBL long long
+//#define DBL double
+
+#define ALL(x)      (x).begin(), (x).end()
+#define READ        freopen("alu.txt", "r", stdin)
+#define WRITE       freopen("vorta.txt", "w", stdout)
+
+#ifndef ONLINE_JUDGE
+#define DBG(x)      cout << __LINE__ << " says: " << #x << " = " << (x) << endl
+#else
+#define DBG(x)
+#endif
+
+template<class T1, class T2>
+ostream &operator <<(ostream &os, pair<T1,T2>&p);
+template <class T>
+ostream &operator <<(ostream &os, vector<T>&v);
+template <class T>
+ostream &operator <<(ostream &os, set<T>&v);
+
+inline void optimizeIO()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+}
+
+const int nmax = 2e5+7;
+
+double INF = 1e100;
+double EPS = 1e-12;
+
+struct PT
+{
+    DBL x,y;
+    PT() {}
+    PT(DBL x,DBL y) : x(x), y(y) {}
+    PT(const PT &p) :   x(p.x), y(p.y) {}
+
+    PT operator + (const PT &p) const
+    {
+        return PT(x+p.x, y+p.y);
+    }
+    PT operator - (const PT &p) const
+    {
+        return PT(x-p.x, y-p.y);
+    }
+    PT operator * (DBL c)    const
+    {
+        return PT(x*c, y*c  );
+    }
+    PT operator / (DBL c)    const
+    {
+        return PT(x/c, y/c  );
+    }
+};
+
+/**
+
+Rectangles are defined by two points.
+One is the LOWER_LEFT and the other one is the UPPER_RIGHT
+
+**/
+
+/**
+Intersecting Points of 2 Rectangle
+returns false if No Intersection
+**/
+bool intersectingPoints(PT a,PT b,PT c,PT d,PT &na,PT &nb)
+{
+    na.x = max(a.x,c.x);
+    na.y = max(a.y,c.y);
+
+    nb.x = min(b.x,d.x);
+    nb.y = min(b.y,d.y);
+
+    if(na.x>nb.x || na.y>nb.y)
+        return false;
+
+    return true;
+}
+
+
+///Calculates Area of a Rectangle
+LL computeArea(PT a,PT b)
+{
+    return (b.x-a.x) * (b.y-a.y);
+}
+
+
+///Calculate the overlapping area of two rectangles.
+LL overlapArea(PT a,PT b,PT c,PT d)
+{
+    /** Check if there is indeed an overlap.
+     * e.g.  c.x>=b.x  i.e. the most left point of the rectangle (c,d) is
+     *       on the right side of the most right point of the rectangle (a,b),
+     *       therefore there is no overlapping.
+     */
+    if ( (c.x>=b.x) || (c.y>= b.y) || (a.x>=d.x) || (a.y >= d.y) )
+        return 0;
+
+    /** bottom left polong long of the overlapping area. */
+    LL bl_x = max(a.x, c.x);
+    LL bl_y = max(a.y, c.y);
+
+    /** top right polong long of the overlapping area. */
+    LL tr_x = min(b.x, d.x);
+    LL tr_y = min(b.y, d.y);
+
+    return ((tr_x - bl_x) * (tr_y - bl_y));
+}
+
+/**
+Find the total area covered by two rectilinear rectangles in a 2D plane.
+Each rectangle is defined by its bottom left corner and top right corner.
+**/
+LL computeTotalArea(PT a,PT b,PT c,PT d)
+{
+    /// The addition of area of the two rectangles minus the overlapping area.
+    return (computeArea(a,b) + computeArea(c,d) - overlapArea(a,b,c,d));
+}
+
+int main()
+{
+    PT a1(2,2) , b1(4,4) , a2(1,1) , b2(3,5) , a3(3,1) , b3(5,5);
+
+    PT c1,d1,c2,d2;
+
+    intersectingPoints(a1,b1,a2,b2,c1,d1);
+    intersectingPoints(a1,b1,a3,b3,c2,d2);
+
+    cout<<c1.x<<" "<<c1.y<<"  ,  "<<d1.x<<" "<<d1.y<<endl;
+    cout<<c2.x<<" "<<c2.y<<"  ,  "<<d2.x<<" "<<d2.y<<endl;
+
+}
+
+/**
+
+**/
+
+template<class T1, class T2>
+ostream &operator <<(ostream &os, pair<T1,T2>&p)
+{
+    os<<"{"<<p.first<<", "<<p.second<<"} ";
+    return os;
+}
+template <class T>
+ostream &operator <<(ostream &os, vector<T>&v)
+{
+    os<<"[ ";
+    for(int i=0; i<v.size(); i++)
+    {
+        os<<v[i]<<" " ;
+    }
+    os<<" ]";
+    return os;
+}
+
+template <class T>
+ostream &operator <<(ostream &os, set<T>&v)
+{
+    os<<"[ ";
+    for(T i:v)
+    {
+        os<<i<<" ";
+    }
+    os<<" ]";
+    return os;
+}
+
diff --git a/Miscellaneous/Problems/Popular/01 Correct Bracket Sequence (Segment Tree).cpp b/Miscellaneous/Problems/Popular/01 Correct Bracket Sequence (Segment Tree).cpp
deleted file mode 100644
index b33f25b..0000000
--- a/Miscellaneous/Problems/Popular/01 Correct Bracket Sequence (Segment Tree).cpp	
+++ /dev/null
@@ -1,222 +0,0 @@
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-const int nmax = 1e6+5;
-const int nmax2 = nmax<<2;
-
-string s;
-int n;
-
-struct node
-{
-    int left,right;
-
-    node()
-    {
-        left = right = 0;
-    }
-
-    void merge_nodes(node &a,node &b)
-    {
-        int matched = min(a.left,b.right);
-        left = a.left + b.left - matched;
-        right = a.right + b.right - matched;
-    }
-
-    void create_leaf(char ch)
-    {
-        if(ch=='(') left = 1 , right = 0;
-        else if(ch==')') left = 0 , right = 1;
-    }
-
-};
-
-node Tree[nmax2];
-
-void build(int cur,int start,int end)
-{
-    if(start==end)
-    {
-        Tree[cur].create_leaf(s[start]);
-        return;
-    }
-
-    int lc = 2*cur, rc = 2*cur+1;
-    int mid = (start+end)/2;
-
-    build(lc,start,mid);
-    build(rc,mid+1,end);
-
-    Tree[cur].merge_nodes(Tree[lc],Tree[rc]);
-
-}
-
-void update(int cur, int start, int end, int updex, char value) /** POINT update , replaces the current value **/
-{
-    if (start == end)
-    {
-        Tree[cur].create_leaf(value);
-        return;
-    }
-
-    int mid = (start + end)>>1;
-    int lc = cur<<1, rc = lc|1;
-
-    if (updex <= mid)
-        update(lc, start, mid, updex, value);
-    else
-        update(rc, mid+1, end, updex, value);
-
-    Tree[cur].merge_nodes(Tree[lc],Tree[rc]);
-}
-
-
-void query(node &res,int cur,int start,int end,int l,int r)
-{
-    if(start>=l && end<=r)
-    {
-        res = Tree[cur];
-        return;
-    }
-
-    int lc = 2*cur, rc = 2*cur+1;
-    int mid = (start+end)/2;
-
-    if(r<=mid)
-        query(res,lc,start,mid,l,r);
-    else if(l>mid)
-        query(res,rc,mid+1,end,l,r);
-    else
-    {
-        node left,right;
-        query(left,lc,start,mid,l,r);
-        query(right,rc,mid+1,end,l,r);
-        res.merge_nodes(left,right);
-    }
-}
-
-int main()
-{
-    optimizeIO();
-
-    cin>>s;
-    s = "#" + s;
-
-    n = s.size();
-
-    build(1,1,n);
-
-    int q;
-    cin>>q;
-
-    while(q--)
-    {
-        int l , r;
-        cin>>l>>r;
-
-        node res;
-        query(res,1,1,n,l,r);
-
-       if(res.left > 0 || res.right > 0) cout<<"Not Correct Bracket Sequence"<<endl;
-       else cout<<"Correct Bracket Sequence"<<endl;
-
-    }
-
-    return 0;
-}
-
-/**
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-
diff --git a/Miscellaneous/Problems/String/00 Substring Search [Suffix Array].cpp b/Miscellaneous/Problems/String/00 Substring Search [Suffix Array].cpp
deleted file mode 100644
index 1b08b1d..0000000
--- a/Miscellaneous/Problems/String/00 Substring Search [Suffix Array].cpp	
+++ /dev/null
@@ -1,263 +0,0 @@
-
-/**
-
-If we use Radix Sort , sorting complexity will be O(N)
-
-Time Complexity : O( N (logN) )
-
-**/
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const int nmax = 2e5+7;
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-void radix_sort(vector<pair<PII,int>> &v)
-{
-    int n = v.size();
-
-    {
-        vector<int>cnt(n); /// for counting sort
-
-        for(auto el:v)
-            cnt[el.F.S]++; /// first sort according to second element
-
-        vector<pair<PII,int>> nv(n);
-        vector<int>pos(n); /// pos[i] = first empty position in bucket i
-
-        pos[0] = 0;
-        for(int i=1; i<n; i++)
-            pos[i] = pos[i-1] + cnt[i-1];
-
-        for(auto el:v)
-        {
-            int i = el.F.S; /// bucket
-            nv[pos[i]] = el; /// putting element in bucket
-            pos[i]++; /// empty position in bucket i increased
-        }
-
-        v = nv;
-    }
-
-    {
-        vector<int>cnt(n); /// for counting sort
-
-        for(auto el:v)
-            cnt[el.F.F]++; /// first sort according to second element
-
-        vector<pair<PII,int>> nv(n);
-        vector<int>pos(n); /// pos[i] = first empty position in bucket i
-
-        pos[0] = 0;
-        for(int i=1; i<n; i++)
-            pos[i] = pos[i-1] + cnt[i-1];
-
-        for(auto el:v)
-        {
-            int i = el.F.F; /// bucket
-            nv[pos[i]] = el; /// putting element in bucket
-            pos[i]++; /// empty position in bucket i increased
-        }
-
-        v = nv;
-    }
-}
-
-vector<int> buildSuffixArray(string s)
-{
-    s += "$";
-
-    int n = s.size();
-
-    /// init p , c
-
-    vector<PII>v(n);
-
-    for(int i=0; i<n; i++)
-        v[i] = {s[i],i};
-    sort(ALL(v));
-
-    vector<int>p(n), c(n);
-    for(int i=0; i<n; i++)
-        p[i] = v[i].S;
-
-    c[p[0]] = 0;
-    for(int i=1; i<n; i++)
-    {
-        if(v[i].F!=v[i-1].F)
-            c[p[i]] = c[p[i-1]] + 1;
-        else
-            c[p[i]] = c[p[i-1]];
-    }
-
-    /// logN times
-
-    int k = 0;
-
-    while((1<<k) < n)
-    {
-        vector<pair<PII,int>>v(n);
-
-        for(int i=0; i<n; i++)
-            v[i] = {{ c[i],c[(i+(1<<k))%n] }, i};
-
-        radix_sort(v);
-
-        for(int i=0; i<n; i++)
-            p[i] = v[i].S;
-
-        c[p[0]] = 0;
-        for(int i=1; i<n; i++)
-        {
-            if(v[i].F!=v[i-1].F)
-                c[p[i]] = c[p[i-1]] + 1;
-            else
-                c[p[i]] = c[p[i-1]];
-        }
-
-        k++;
-    }
-
-    return p;
-}
-
-bool binarySearch(int lo,int hi,string s,string key,vector<int> &ara)
-{
-    while(lo<=hi)
-    {
-        int mid = lo + (hi-lo)/2;
-
-        string chk = s.substr(ara[mid],key.size());
-
-        if(chk<key) lo = mid + 1;
-        else if (chk>key) hi = mid - 1;
-        else return true;
-    }
-
-    return false;
-}
-
-int main()
-{
-    optimizeIO();
-
-    string s;
-    cin>>s;
-
-    int n = s.size();
-
-    vector<int>p = buildSuffixArray(s);
-
-//    for(int i=0; i<(int)p.size(); i++)
-//        cout<<p[i]<<" ";
-
-    int q;
-    cin>>q;
-
-    while(q--)
-    {
-        string sub;
-        cin>>sub;
-
-        if(binarySearch(0,n,s,sub,p)) cout<<"Yes"<<endl;
-        else cout<<"No"<<endl;
-    }
-
-
-
-    return 0;
-}
-
-/**
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-
diff --git a/Miscellaneous/Problems/String/01 Counting Substrings [Suffix Array].cpp b/Miscellaneous/Problems/String/01 Counting Substrings [Suffix Array].cpp
deleted file mode 100644
index bb984fc..0000000
--- a/Miscellaneous/Problems/String/01 Counting Substrings [Suffix Array].cpp	
+++ /dev/null
@@ -1,296 +0,0 @@
-
-/**
-
-If we use Radix Sort , sorting complexity will be O(N)
-
-Time Complexity : O( N (logN) )
-
-**/
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const int nmax = 2e5+7;
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-void radix_sort(vector<pair<PII,int>> &v)
-{
-    int n = v.size();
-
-    {
-        vector<int>cnt(n); /// for counting sort
-
-        for(auto el:v)
-            cnt[el.F.S]++; /// first sort according to second element
-
-        vector<pair<PII,int>> nv(n);
-        vector<int>pos(n); /// pos[i] = first empty position in bucket i
-
-        pos[0] = 0;
-        for(int i=1; i<n; i++)
-            pos[i] = pos[i-1] + cnt[i-1];
-
-        for(auto el:v)
-        {
-            int i = el.F.S; /// bucket
-            nv[pos[i]] = el; /// putting element in bucket
-            pos[i]++; /// empty position in bucket i increased
-        }
-
-        v = nv;
-    }
-
-    {
-        vector<int>cnt(n); /// for counting sort
-
-        for(auto el:v)
-            cnt[el.F.F]++; /// first sort according to second element
-
-        vector<pair<PII,int>> nv(n);
-        vector<int>pos(n); /// pos[i] = first empty position in bucket i
-
-        pos[0] = 0;
-        for(int i=1; i<n; i++)
-            pos[i] = pos[i-1] + cnt[i-1];
-
-        for(auto el:v)
-        {
-            int i = el.F.F; /// bucket
-            nv[pos[i]] = el; /// putting element in bucket
-            pos[i]++; /// empty position in bucket i increased
-        }
-
-        v = nv;
-    }
-}
-
-vector<int> buildSuffixArray(string s)
-{
-    s += "$";
-
-    int n = s.size();
-
-    /// init p , c
-
-    vector<PII>v(n);
-
-    for(int i=0; i<n; i++)
-        v[i] = {s[i],i};
-    sort(ALL(v));
-
-    vector<int>p(n), c(n);
-    for(int i=0; i<n; i++)
-        p[i] = v[i].S;
-
-    c[p[0]] = 0;
-    for(int i=1; i<n; i++)
-    {
-        if(v[i].F!=v[i-1].F)
-            c[p[i]] = c[p[i-1]] + 1;
-        else
-            c[p[i]] = c[p[i-1]];
-    }
-
-    /// logN times
-
-    int k = 0;
-
-    while((1<<k) < n)
-    {
-        vector<pair<PII,int>>v(n);
-
-        for(int i=0; i<n; i++)
-            v[i] = {{ c[i],c[(i+(1<<k))%n] }, i};
-
-        radix_sort(v);
-
-        for(int i=0; i<n; i++)
-            p[i] = v[i].S;
-
-        c[p[0]] = 0;
-        for(int i=1; i<n; i++)
-        {
-            if(v[i].F!=v[i-1].F)
-                c[p[i]] = c[p[i-1]] + 1;
-            else
-                c[p[i]] = c[p[i-1]];
-        }
-
-        k++;
-    }
-
-    return p;
-}
-
-bool binarySearch(int lo,int hi,string s,string key,vector<int> &ara)
-{
-    while(lo<=hi)
-    {
-        int mid = lo + (hi-lo)/2;
-
-        string chk = s.substr(ara[mid],key.size());
-
-        if(chk<key) lo = mid + 1;
-        else if (chk>key) hi = mid - 1;
-        else return true;
-    }
-
-    return false;
-}
-
-int lowerBound(int lo,int hi,string s,string key,vector<int> &ara)
-{
-    while(lo!=hi)
-    {
-        int mid = lo + (hi-lo)/2;
-
-        string chk = s.substr(ara[mid],key.size());
-
-        if(chk<key) lo = mid + 1;
-        else hi = mid;
-    }
-
-    return lo;
-
-}
-
-int upperBound(int lo,int hi,string s,string key,vector<int> &ara)
-{
-    while(lo!=hi)
-    {
-        int mid = lo + (hi-lo)/2;
-
-        string chk = s.substr(ara[mid],key.size());
-
-        if(chk<=key) lo = mid + 1;
-        else hi = mid;
-    }
-
-    return lo;
-}
-
-int main()
-{
-    optimizeIO();
-
-    string s;
-    cin>>s;
-
-    int n = s.size();
-
-    vector<int>p = buildSuffixArray(s);
-
-//    for(int i=0; i<(int)p.size(); i++)
-//        cout<<p[i]<<" ";
-
-    int q;
-    cin>>q;
-
-    while(q--)
-    {
-        string sub;
-        cin>>sub;
-
-        int lo = lowerBound(0,n+1,s,sub,p);
-        int hi = upperBound(0,n+1,s,sub,p);
-
-        cout<<hi-lo<<endl;
-    }
-
-
-
-    return 0;
-}
-
-/**
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-
diff --git a/Miscellaneous/Problems/String/02 Counting Substrings [KMP].cpp b/Miscellaneous/Problems/String/02 Counting Substrings [KMP].cpp
deleted file mode 100644
index aeb94da..0000000
--- a/Miscellaneous/Problems/String/02 Counting Substrings [KMP].cpp	
+++ /dev/null
@@ -1,152 +0,0 @@
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const int nmax = 2e5+7;
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-vector<int> prefix_function(string s) {
-    int n = (int)s.length();
-    vector<int> pi(n);
-    for (int i = 1; i < n; i++) {
-        int j = pi[i-1];
-        while (j > 0 && s[i] != s[j])
-            j = pi[j-1];
-        if (s[i] == s[j])
-            j++;
-        pi[i] = j;
-    }
-    return pi;
-}
-
-int countSubstring(string s,string sub)
-{
-    string v = sub + "#" + s;
-
-    vector<int>pre = prefix_function(v);
-
-    int subsz = sub.size();
-
-    int cnt = 0;
-
-    for(int i=subsz+1;i<pre.size();i++) /// starting after the sub
-        if(pre[i]==subsz)
-            cnt++;
-
-    return cnt;
-}
-
-int main()
-{
-    optimizeIO();
-
-    int tc;
-    cin>>tc;
-
-    for(int qq=1;qq<=tc;qq++)
-    {
-        string s,sub;
-        cin>>s>>sub;
-
-        int ans = countSubstring(s,sub);
-
-        cout<<"Case "<<qq<<": ";
-        cout<<ans<<endl;
-
-    }
-
-    return 0;
-}
-
-/**
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-
diff --git a/Miscellaneous/Problems/String/03 Number of Different Substrings [Suffix Array].cpp b/Miscellaneous/Problems/String/03 Number of Different Substrings [Suffix Array].cpp
deleted file mode 100644
index 3a8c868..0000000
--- a/Miscellaneous/Problems/String/03 Number of Different Substrings [Suffix Array].cpp	
+++ /dev/null
@@ -1,249 +0,0 @@
-
-/**
-
-LCP Array Construction
-
-Time Complexity : O( N )
-
-**/
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const int nmax = 2e5+7;
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-void count_sort(vector<int> &p,vector<int> &c)
-{
-    int n = p.size();
-
-    vector<int>cnt(n);
-
-    for(auto el:c)
-        cnt[el]++;
-
-    vector<int>np(n);
-    vector<int>pos(n); /// pos[i] = first empty position in bucket i
-
-    pos[0] = 0;
-    for(int i=1; i<n; i++)
-        pos[i] = pos[i-1] + cnt[i-1];
-
-    for(auto el:p)
-    {
-        int i = c[el]; /// bucket
-        np[pos[i]] = el; /// putting element in bucket
-        pos[i]++; /// empty position in bucket i increased
-    }
-
-    p = np;
-
-}
-
-vector<int> buildSuffixArray(string s)
-{
-    s += "$";
-
-    int n = s.size();
-
-    /// init p , c
-
-    vector<PII>v(n);
-
-    for(int i=0; i<n; i++)
-        v[i] = {s[i],i};
-    sort(ALL(v));
-
-    vector<int>p(n), c(n);
-    for(int i=0; i<n; i++)
-        p[i] = v[i].S;
-
-    c[p[0]] = 0;
-    for(int i=1; i<n; i++)
-    {
-        if(v[i].F!=v[i-1].F)
-            c[p[i]] = c[p[i-1]] + 1;
-        else
-            c[p[i]] = c[p[i-1]];
-    }
-
-    /// logN times
-
-    int k = 0;
-
-    while((1<<k) < n)
-    {
-        for(int i=0; i<n; i++)
-            p[i] = (p[i] - (1<<k) + n)%n;
-
-        count_sort(p,c);
-
-        vector<int>nc(n);
-
-        nc[p[0]] = 0;
-        for(int i=1; i<n; i++)
-        {
-            PII now  = { c[p[i]] , c[ (p[i]+(1<<k))%n] };
-            PII prev = { c[p[i-1]] , c[ (p[i-1]+(1<<k))%n] };
-
-            if(now!=prev)
-                nc[p[i]] = nc[p[i-1]] + 1;
-            else
-                nc[p[i]] = nc[p[i-1]];
-        }
-
-        c = nc;
-        k++;
-    }
-
-    /// after all the iterations , c[i] = position of the suffix i in p
-
-    return p;
-}
-
-vector<int> buildLCPArray(string s,vector<int> &p)
-{
-    s+="$";
-    int n = s.size();
-
-    vector<int>rnk(n);
-
-    for(int i=0;i<n;i++)
-        rnk[p[i]] = i; /// this is basically the c array after all iterations
-
-    vector<int>lcp(n);
-
-    int k = 0;
-
-    for(int i=0;i<n-1;i++)
-    {
-        int pi = rnk[i];
-        int j = p[pi-1];
-
-        /// lcp[i] = lcp(s[i...],s[j...])
-
-        while(s[i+k]==s[j+k]) k++;
-        lcp[pi] = k;
-        k = max(k-1,0);
-    }
-
-    return lcp;
-}
-
-LL totalSubstring(LL n)
-{
-    return (n*(n+1))/2;
-}
-
-int main()
-{
-    optimizeIO();
-
-    string s;
-    cin>>s;
-
-    vector<int>p = buildSuffixArray(s);
-    vector<int>lcp = buildLCPArray(s,p);
-
-    LL repeat = 0;
-    for(int i=1; i<(int)lcp.size(); i++)
-        repeat += lcp[i];
-
-    LL distinct = totalSubstring(s.size()) - repeat;
-    cout<<distinct<<endl;
-
-    return 0;
-}
-
-/**
-abb@bbabb
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-
diff --git a/Miscellaneous/Problems/String/04 Longest Common Substring of two string [Suffix Array].cpp b/Miscellaneous/Problems/String/04 Longest Common Substring of two string [Suffix Array].cpp
deleted file mode 100644
index fc41761..0000000
--- a/Miscellaneous/Problems/String/04 Longest Common Substring of two string [Suffix Array].cpp	
+++ /dev/null
@@ -1,274 +0,0 @@
-
-/**
-
-LCP Array Construction
-
-Time Complexity : O( N )
-
-**/
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const int nmax = 2e5+7;
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-void count_sort(vector<int> &p,vector<int> &c)
-{
-    int n = p.size();
-
-    vector<int>cnt(n);
-
-    for(auto el:c)
-        cnt[el]++;
-
-    vector<int>np(n);
-    vector<int>pos(n); /// pos[i] = first empty position in bucket i
-
-    pos[0] = 0;
-    for(int i=1; i<n; i++)
-        pos[i] = pos[i-1] + cnt[i-1];
-
-    for(auto el:p)
-    {
-        int i = c[el]; /// bucket
-        np[pos[i]] = el; /// putting element in bucket
-        pos[i]++; /// empty position in bucket i increased
-    }
-
-    p = np;
-
-}
-
-vector<int> buildSuffixArray(string s)
-{
-//    s += "$";
-
-    int n = s.size();
-
-    /// init p , c
-
-    vector<PII>v(n);
-
-    for(int i=0; i<n; i++)
-        v[i] = {s[i],i};
-    sort(ALL(v));
-
-    vector<int>p(n), c(n);
-    for(int i=0; i<n; i++)
-        p[i] = v[i].S;
-
-    c[p[0]] = 0;
-    for(int i=1; i<n; i++)
-    {
-        if(v[i].F!=v[i-1].F)
-            c[p[i]] = c[p[i-1]] + 1;
-        else
-            c[p[i]] = c[p[i-1]];
-    }
-
-    /// logN times
-
-    int k = 0;
-
-    while((1<<k) < n)
-    {
-        for(int i=0; i<n; i++)
-            p[i] = (p[i] - (1<<k) + n)%n;
-
-        count_sort(p,c);
-
-        vector<int>nc(n);
-
-        nc[p[0]] = 0;
-        for(int i=1; i<n; i++)
-        {
-            PII now  = { c[p[i]] , c[ (p[i]+(1<<k))%n] };
-            PII prev = { c[p[i-1]] , c[ (p[i-1]+(1<<k))%n] };
-
-            if(now!=prev)
-                nc[p[i]] = nc[p[i-1]] + 1;
-            else
-                nc[p[i]] = nc[p[i-1]];
-        }
-
-        c = nc;
-        k++;
-    }
-
-    /// after all the iterations , c[i] = position of the suffix i in p
-
-    return p;
-}
-
-vector<int> buildLCPArray(string s,vector<int> &p)
-{
-//    s+="$";
-    int n = s.size();
-
-    vector<int>rnk(n);
-
-    for(int i=0;i<n;i++)
-        rnk[p[i]] = i; /// this is basically the c array after all iterations
-
-    vector<int>lcp(n);
-
-    int k = 0;
-
-    for(int i=0;i<n-1;i++)
-    {
-        int pi = rnk[i];
-        int j = p[pi-1];
-
-        /// lcp[i] = lcp(s[i...],s[j...])
-
-        while(s[i+k]==s[j+k]) k++;
-        lcp[pi] = k;
-        k = max(k-1,0);
-    }
-
-    return lcp;
-}
-
-int main()
-{
-    optimizeIO();
-
-
-    string s1,s2;
-    cin>>s1>>s2;
-
-    string s = s1 + char(38) + s2 +  char(37) ;
-
-    vector<int>p = buildSuffixArray(s);
-    vector<int>lcp = buildLCPArray(s,p);
-
-//    for(int i=0; i<(int)p.size(); i++)
-//        cout<<p[i]<<" ";
-//    cout<<endl;
-//
-//    for(int i=1; i<(int)lcp.size(); i++)
-//        cout<<lcp[i]<<" ";
-//    cout<<endl;
-//
-//    for(int i=0; i<(int)p.size(); i++)
-//        cout<<p[i]<<" "<<lcp[i]<<" "<<s.substr(p[i],s.size()-p[i])<<endl;
-//    cout<<endl;
-
-    int mx = 0;
-    string ans = "";
-
-    for(int i=1; i<(int)lcp.size(); i++)
-    {
-        int now = p[i];
-        int prev = p[i-1];
-        int first_len = s1.size();
-
-        if((now<first_len && prev>first_len) || (now>first_len && prev<first_len))
-        {
-            if(lcp[i]>mx)
-            {
-                mx = lcp[i];
-                ans = s.substr(now,mx);
-            }
-        }
-    }
-
-//    cout<<mx<<endl;
-    cout<<ans<<endl;
-
-    return 0;
-}
-
-/**
-abb@bbabb
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-
diff --git a/Miscellaneous/Problems/String/05 Counting the number of occurrences of each prefix [KMP].cpp b/Miscellaneous/Problems/String/05 Counting the number of occurrences of each prefix [KMP].cpp
deleted file mode 100644
index 46388e9..0000000
--- a/Miscellaneous/Problems/String/05 Counting the number of occurrences of each prefix [KMP].cpp	
+++ /dev/null
@@ -1,174 +0,0 @@
-
-/**
-
-Algorithm       : Calculating the Number of occurrences of each prefix using Prefix Function (KMP)
-Time Complexity : O(N)
-
-Idea:
-
-Consider the value of the prefix function π[i] at a position i.
-By definition it means that in position i the prefix of length π[i] of the string s appears and ends at position i,
-and there doesn't exists a longer prefix that follows this definition.
-At the same time shorter prefixes can end at this position.
-It is not difficult to see, that we have the same question that we already answered when we computed the prefix function itself:
-    Given a prefix of length j that is a suffix ending at position i, what is the next smaller prefix <j that is also a suffix ending at position i.
-
-Thus at the position i ends the prefix of length π[i], the prefix of length π[π[i]−1], the prefix π[π[π[i]−1]−1], and so on, until the index becomes zero.
-Thus we can compute the answer in the following way.
-
-Here for each value of the prefix function we first count how many times it occurs in the array π,
-and then compute the final answers: if we know that the length prefix i appears exactly ans[i] times,
-then this number must be added to the number of occurrences of its longest suffix that is also a prefix.
-At the end we need to add 1 to each result, since we also need to count the original prefixes also.
-
-**/
-
-/** Which of the favors of your Lord will you deny ? **/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-#define LL long long
-#define PII pair<int,int>
-#define PLL pair<LL,LL>
-#define MP make_pair
-#define F first
-#define S second
-
-#define ALL(x) (x).begin(), (x).end()
-#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
-#define READ        freopen("alu.txt", "r", stdin)
-#define WRITE       freopen("vorta.txt", "w", stdout)
-
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
-using namespace __gnu_pbds;
-
-template<class TIn>using indexed_set = tree<TIn, null_type, less<TIn>,rb_tree_tag, tree_order_statistics_node_update>;
-
-/**
-
-PBDS
--------------------------------------------------
-1) insert(value)
-2) erase(value)
-3) order_of_key(value) // 0 based indexing
-4) *find_by_order(position) // 0 based indexing
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p);
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v);
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v);
-
-inline void optimizeIO()
-{
-    ios_base::sync_with_stdio(false);
-    cin.tie(NULL);
-}
-
-const int nmax = 2e5+7;
-const LL LINF = 1e17;
-
-template <class T>
-string to_str(T x)
-{
-    stringstream ss;
-    ss<<x;
-    return ss.str();
-}
-
-//bool cmp(const PII &A,const PII &B)
-//{
-//
-//}
-
-vector<int> prefix_function(string s)
-{
-    int n = (int)s.length();
-    vector<int> pi(n);
-    for (int i = 1; i < n; i++)
-    {
-        int j = pi[i-1];
-        while (j > 0 && s[i] != s[j])
-            j = pi[j-1];
-        if (s[i] == s[j])
-            j++;
-        pi[i] = j;
-    }
-    return pi;
-}
-
-vector<int> countPrefixOccurence(string s,const vector<int> &pi)
-{
-    int n = s.size();
-
-    vector<int> ans(n + 1); /// ans[i] = the number of occurrence of prefix of length i
-
-    for (int i = 0; i < n; i++)
-        ans[pi[i]]++; /// count the largest prefixes ending at i
-    for (int i = n-1; i > 0; i--)
-        ans[pi[i-1]] += ans[i]; /// adding smaller prefixes which also end at i
-    for (int i = 0; i <= n; i++)
-        ans[i]++; /// adding the prefix itself to the count
-
-    return ans;
-}
-
-int main()
-{
-    optimizeIO();
-
-    while(1)
-    {
-        string s;
-        cin>>s;
-
-        vector<int>pi = prefix_function(s);
-        cout<<pi<<endl;
-
-        vector<int>cnt = countPrefixOccurence(s,pi);
-        cout<<cnt<<endl;
-    }
-
-    return 0;
-}
-
-/**
-
-**/
-
-template<class T1, class T2>
-ostream &operator <<(ostream &os, pair<T1,T2>&p)
-{
-    os<<"{"<<p.first<<", "<<p.second<<"} ";
-    return os;
-}
-template <class T>
-ostream &operator <<(ostream &os, vector<T>&v)
-{
-    os<<"[ ";
-    for(int i=0; i<v.size(); i++)
-    {
-        os<<v[i]<<" " ;
-    }
-    os<<" ]";
-    return os;
-}
-
-template <class T>
-ostream &operator <<(ostream &os, set<T>&v)
-{
-    os<<"[ ";
-    for(T i:v)
-    {
-        os<<i<<" ";
-    }
-    os<<" ]";
-    return os;
-}
-
-