diff --git a/Applications/Computational_Algorithm_Application/stack.cpp b/Applications/Computational_Algorithm_Application/stack.cpp
new file mode 100644
index 0000000..063a6f3
--- /dev/null
+++ b/Applications/Computational_Algorithm_Application/stack.cpp
@@ -0,0 +1,131 @@
+//STACK APPLICATION IN REAL LIFE
+
+/*in real world stack sata structure is used for
+    1)backward and forward button in browsers
+    2)memory management in computer programming
+    3)delimiter checking
+    4)undo and redo options 
+    5)implementation recursion in programming
+    etc.
+*/
+
+/*here we look at some of the real life implementation on small scale which can be enlarged for large data later
+    1)undo and redo
+    2)delimiter
+
+    code is very simple and self explanatory so no comments are given.
+*/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+
+void print(vector<int>arr){
+    cout<<"operation performed in order: ";
+    for (int i = 0; i < arr.size(); i++)
+    {
+        cout<<arr[i]<<' ';
+    }
+    cout<<endl;
+}
+
+void Undo(stack<int>&s,stack<int>&t,vector<int>arr){
+    if(s.size()==0){
+        cout<<"nothing to undo";
+        return;
+    }
+    t.push(s.top());
+    s.pop();
+    cout<<"undo done:"<<endl;
+    for (int i = 0; i < s.size(); i++)
+    {
+        cout<<arr[i]<<' ';
+    }
+    cout<<endl;
+    return;
+}
+
+void Redo(stack<int>&s,stack<int>&t,vector<int>arr){
+    if(t.size()==0){
+        cout<<"nothing to redo"<<endl;
+        return;
+    }
+    s.push(t.top());
+    t.pop();
+    cout<<"redo done:"<<endl;
+    for (int i = 0; i < s.size(); i++)
+    {
+        cout<<arr[i]<<' ';
+    }
+    cout<<endl;
+    return;
+}
+//delimiter is a way of checking if an sequence have an end for every start
+// here look that application with use of brackets balancing.
+
+void delimiterCheck(string l){
+    stack<char>s;
+    for (int i = 0; i < l.length(); i++)
+    {
+        if(l[i]=='('||l[i]=='{'||l[i]=='['){
+            s.push(l[i]);
+        }
+        else if (l[i]==')'||l[i]=='}'||l[i]==']')
+        {
+            if(s.empty()==true){
+                cout<<"brackets are not balanced"<<endl;
+                return;
+            }
+
+            char top=s.top();
+            if((top=='('&&l[i]==')')||(top=='{'&&l[i]=='}')||(top=='['&&l[i]==']')){
+                s.pop();
+            }
+            else {
+                cout<<"brackets are not balanced";
+                return;
+            }
+        }
+    }
+    if(s.empty()==true){
+        cout<<"brackets are balanced"<<endl;
+        return;
+
+    }
+    else{
+        cout<<"brackets are not balanced"<<endl;
+        return;
+    }
+}
+
+int main(){
+    int n;
+    cout<<"enter number of operation you want to perform: ";
+    cin>>n;
+
+    vector<int>arr;
+    stack<int>s;
+    stack<int>t;
+
+    for(int i=0;i<n;i++)
+    {
+        int k;
+        cout<<"enter operation number you want to perform(integer value): ";
+        cin>>k;
+        arr.push_back(k);
+        s.push(k);    
+        print(arr);
+    }
+
+    int chk=0;
+    cout<<"perform undo/redo/none (type 0/1/else): ";
+    cin>>chk;
+    if(chk==1)Redo(s,t,arr);
+    else if(chk==0)Undo(s,t,arr);
+
+    cout<<"to check bracket balancing give any operation(eg- (1+2)*5 ): ";
+    string l;
+    cin>>l;
+    delimiterCheck(l);
+    return 0;
+}
\ No newline at end of file
diff --git a/Computational Algorithms/README.md b/Computational Algorithms/README.md
deleted file mode 100644
index 8b13789..0000000
--- a/Computational Algorithms/README.md	
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/DSA algorithms/Two Pointer/Kadane's_Algorithm.bin b/DSA algorithms/Two Pointer/Kadane's_Algorithm.bin
deleted file mode 100644
index e46125f..0000000
Binary files a/DSA algorithms/Two Pointer/Kadane's_Algorithm.bin and /dev/null differ
diff --git a/DSA algorithms/Two Pointer/Kadane's_Algorithm.cpp b/DSA algorithms/Two Pointer/Kadane's_Algorithm.cpp
deleted file mode 100644
index 01b7d22..0000000
--- a/DSA algorithms/Two Pointer/Kadane's_Algorithm.cpp	
+++ /dev/null
@@ -1,44 +0,0 @@
-/*KADANE'S ALGORITHM for finding maximum possible contiguous subarray sum*/
-
-/*Algorithm
-    1)initialize an integer(let's say int sum) with minimum value(INT_MIN)
-    2)inititalize an integer(let's say int current) with value 0
-    3)iterate over an array(int a[])
-    4)update current=max(a[i],a[i]+current)
-    4)if (current>=sum) update sum, make it equal to current
-    5)if (current<sum) do nothing
-*/
-
-#include<bits/stdc++.h>
-using namespace std;
-
-
-int maxSubArray(vector<int> nums) {
-
-    int ans=INT_MIN;
-    int cur=0;
-    for(int num:nums){
-        cur=max(num,cur+num);
-        if(cur>=ans){
-            ans=cur;
-        }
-        else{
-            continue;
-        }
-    }
-    return ans;
-}
-
-/*TWO POINTER APPROACH comes in play when we want to find the length of max subarray*/
-/*  just initialize 3 more integers to save start & end indexes as 0
-    update end whenever sum increases
-    update start whenever sum decreases
-}
-*/
-int main(){
-    vector<int>a={1,-2,-3,4,-1,2,1,-5,4};
-    int ans=maxSubArray(a);
-    cout<<ans;
-}
-
-
diff --git a/DSA algorithms/graphs/cyclicity_in_graph.cpp b/DSA algorithms/graphs/cyclicity_in_graph.cpp
deleted file mode 100644
index d8defbc..0000000
--- a/DSA algorithms/graphs/cyclicity_in_graph.cpp	
+++ /dev/null
@@ -1,77 +0,0 @@
-/*DISJOINT SET UNION*/
-/*Algorithm for finding if an undirected graph is cyclic or acyclic*/
-/*prerequisites
-    -basic knowledge about graphs
-    -should know traversing in graph(BFS, DFS)
-*/
-
-/*SCENARIO
-    There are n cities. They are connected by roads. If city 1 is connected directly with city 2,
-    and city 2 is connected directly with city 3,...., city k is connected with city 1. then we say that 
-    roads form a cycle. i.e.
-
-    1---2---4                               1---2---4---5
-    |  /\                                   |   |    \
-    | /  \                                  |   |     \
-    3     5---6                             6---3      7---8
-    |
-    |
-    7
-
-    in first case we see that roads connecting city 1,2,3 form a cycle.
-    in second case we see that roads connecting ctiy 1,2,3,6 form a cycle.
-*/
-
-/*ALGORITHM
-    1) first label each node as its parent node. i.e. each node is parent node of itself.
-    2) then traverse across the graph and find parent of each node.
-    3) if they have different parent do union of those 2, i.e. make thier parents same.
-    4) if two node have same parent then it must be a cycle.
-*/
-
-#include <bits/stdc++.h>
-using namespace std;
-
-int find(int node,vector<int>&parent){
-    //finding the parent node
-    while(parent[node]!=node){
-        node=parent[node];
-    }
-    return node;
-}
-
-void Union(int i,int j,vector<int>&parent){
-    // union of node, i.e, setting parent as same.
-    int iroot=find(i,parent);
-    int jroot=find(j,parent);
-    if(iroot!=jroot){
-        parent[jroot]=iroot;
-    }
-}
-
-bool dsu(vector<vector<int>>& edges) {
-    //setting parent of each node
-    vector<int>parent(edges.size()+1);
-    for(int i=0;i<edges.size()+1;i++)parent[i]=i;
-
-    //appyling dsu
-    for(auto edge:edges){
-        if(find(edge[0],parent)==find(edge[1],parent))return true;
-        Union(edge[0],edge[1],parent);
-    }
-    return false;
-}
-
-int main(){
-    vector<vector<int>>graph={{1,2},{2,3},{3,4},{1,5},{1,4}};
-    /*
-        graph is:
-        2--1--5
-        |  |
-        3--4
-    */
-    bool ans= dsu(graph);
-
-    if(ans)cout<<"graph is cyclic!"<<endl;
-    else cout<<"graph is acyclic!"<<endl;
-}
\ No newline at end of file
diff --git a/applications/Computational algo/visualising_disjoint_set_union.cpp b/applications/Computational algo/visualising_disjoint_set_union.cpp
deleted file mode 100644
index d8defbc..0000000
--- a/applications/Computational algo/visualising_disjoint_set_union.cpp	
+++ /dev/null
@@ -1,77 +0,0 @@
-/*DISJOINT SET UNION*/
-/*Algorithm for finding if an undirected graph is cyclic or acyclic*/
-/*prerequisites
-    -basic knowledge about graphs
-    -should know traversing in graph(BFS, DFS)
-*/
-
-/*SCENARIO
-    There are n cities. They are connected by roads. If city 1 is connected directly with city 2,
-    and city 2 is connected directly with city 3,...., city k is connected with city 1. then we say that 
-    roads form a cycle. i.e.
-
-    1---2---4                               1---2---4---5
-    |  /\                                   |   |    \
-    | /  \                                  |   |     \
-    3     5---6                             6---3      7---8
-    |
-    |
-    7
-
-    in first case we see that roads connecting city 1,2,3 form a cycle.
-    in second case we see that roads connecting ctiy 1,2,3,6 form a cycle.
-*/
-
-/*ALGORITHM
-    1) first label each node as its parent node. i.e. each node is parent node of itself.
-    2) then traverse across the graph and find parent of each node.
-    3) if they have different parent do union of those 2, i.e. make thier parents same.
-    4) if two node have same parent then it must be a cycle.
-*/
-
-#include <bits/stdc++.h>
-using namespace std;
-
-int find(int node,vector<int>&parent){
-    //finding the parent node
-    while(parent[node]!=node){
-        node=parent[node];
-    }
-    return node;
-}
-
-void Union(int i,int j,vector<int>&parent){
-    // union of node, i.e, setting parent as same.
-    int iroot=find(i,parent);
-    int jroot=find(j,parent);
-    if(iroot!=jroot){
-        parent[jroot]=iroot;
-    }
-}
-
-bool dsu(vector<vector<int>>& edges) {
-    //setting parent of each node
-    vector<int>parent(edges.size()+1);
-    for(int i=0;i<edges.size()+1;i++)parent[i]=i;
-
-    //appyling dsu
-    for(auto edge:edges){
-        if(find(edge[0],parent)==find(edge[1],parent))return true;
-        Union(edge[0],edge[1],parent);
-    }
-    return false;
-}
-
-int main(){
-    vector<vector<int>>graph={{1,2},{2,3},{3,4},{1,5},{1,4}};
-    /*
-        graph is:
-        2--1--5
-        |  |
-        3--4
-    */
-    bool ans= dsu(graph);
-
-    if(ans)cout<<"graph is cyclic!"<<endl;
-    else cout<<"graph is acyclic!"<<endl;
-}
\ No newline at end of file
diff --git a/applications/Computational algo/visualising_disjoint_set_union.exe b/applications/Computational algo/visualising_disjoint_set_union.exe
deleted file mode 100644
index 850fede..0000000
Binary files a/applications/Computational algo/visualising_disjoint_set_union.exe and /dev/null differ
diff --git a/applications/ML Algo/README.md b/applications/ML Algo/README.md
deleted file mode 100644
index adadb78..0000000
--- a/applications/ML Algo/README.md	
+++ /dev/null
@@ -1,2 +0,0 @@
-# Code-Forge
-Folder for ML algorithms
\ No newline at end of file