From 6c722ceedcd0aae8f03b86e918a16ec8c2aaaac3 Mon Sep 17 00:00:00 2001
From: Aditya Prakash <83463518+adityaprakash01@users.noreply.github.com>
Date: Mon, 17 Oct 2022 20:35:45 +0530
Subject: [PATCH 1/3] Create reverse_a_linkedlist.cpp

---
 reverse_a_linkedlist.cpp | 74 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 reverse_a_linkedlist.cpp

diff --git a/reverse_a_linkedlist.cpp b/reverse_a_linkedlist.cpp
new file mode 100644
index 0000000..044f7ef
--- /dev/null
+++ b/reverse_a_linkedlist.cpp
@@ -0,0 +1,74 @@
+#include <iostream>
+using namespace std;
+
+class Node
+{
+public:
+    int data;
+    Node *next;
+
+    Node(int data)
+    {
+        this->data = data;
+        next = NULL;
+    }
+};
+
+void print(Node *head)
+{
+    Node *temp = head;
+    while (temp != NULL)
+    {
+        cout << temp->data << "->";
+        temp = temp->next;
+    }
+    cout << "NULL" << endl;
+}
+Node *reverse(Node *head)
+{
+    Node *curr = head;
+    Node *prev = NULL;
+    while (curr != NULL)
+    {
+        Node *n = curr->next;
+        curr->next = prev;
+        prev = curr;
+        curr = n;
+    }
+    return prev;
+}
+Node *takeInput()
+{
+    int data;
+    cout << "Enter elements:" << endl;
+    cin >> data;
+    Node *head = NULL; /// LL is empty
+    Node *tail = NULL; /// LL is empty
+    while (data != -1)
+    {
+        /// creating LL
+        Node *n = new Node(data);
+        /// 1st node
+        if (head == NULL)
+        {
+            head = n;
+            tail = n;
+        }
+        else
+        {
+            tail->next = n; /// Inserting at Tail
+            tail = n;
+        }
+
+        cin >> data;
+    }
+    return head;
+}
+int main()
+{
+    // Note: add -1 at last in input
+    Node *head = takeInput(); /// inserting at tail
+    head = reverse(head);
+    print(head);
+    return 0;
+}

From b3a7cf148b25f1773aa7a03e30565e4013fddfbf Mon Sep 17 00:00:00 2001
From: Aditya Prakash <83463518+adityaprakash01@users.noreply.github.com>
Date: Mon, 17 Oct 2022 20:46:29 +0530
Subject: [PATCH 2/3] Create remove_adjacent_duplicate.cpp

---
 remove_adjacent_duplicate.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 remove_adjacent_duplicate.cpp

diff --git a/remove_adjacent_duplicate.cpp b/remove_adjacent_duplicate.cpp
new file mode 100644
index 0000000..70a7735
--- /dev/null
+++ b/remove_adjacent_duplicate.cpp
@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+        string superReducedString(string A) {
+        stack<char> s;
+         for(int i=0;i<A.size();i++){
+             if(s.empty() || A[i] != s.top()){
+                 s.push(A[i]);
+             } else {
+                 s.pop();
+             }
+         }
+        string ans="";
+        while(!s.empty()){
+            ans.push_back(s.top());
+            s.pop();
+        }
+        
+        reverse(ans.begin(),ans.end());
+        if(ans.size()==0) return "Empty String";
+        return ans;
+    }
+int main()
+{
+    string s;
+    cout<<"Enter string:"<<endl;
+    cin>>s;
+    string result = superReducedString(s);
+    cout<<result<<"\n";
+    return 0;
+}

From 914065f9f6264857599151347bc92edf639aa029 Mon Sep 17 00:00:00 2001
From: Aditya Prakash <83463518+adityaprakash01@users.noreply.github.com>
Date: Mon, 17 Oct 2022 20:47:37 +0530
Subject: [PATCH 3/3] Delete reverse_a_linkedlist.cpp

---
 reverse_a_linkedlist.cpp | 74 ----------------------------------------
 1 file changed, 74 deletions(-)
 delete mode 100644 reverse_a_linkedlist.cpp

diff --git a/reverse_a_linkedlist.cpp b/reverse_a_linkedlist.cpp
deleted file mode 100644
index 044f7ef..0000000
--- a/reverse_a_linkedlist.cpp
+++ /dev/null
@@ -1,74 +0,0 @@
-#include <iostream>
-using namespace std;
-
-class Node
-{
-public:
-    int data;
-    Node *next;
-
-    Node(int data)
-    {
-        this->data = data;
-        next = NULL;
-    }
-};
-
-void print(Node *head)
-{
-    Node *temp = head;
-    while (temp != NULL)
-    {
-        cout << temp->data << "->";
-        temp = temp->next;
-    }
-    cout << "NULL" << endl;
-}
-Node *reverse(Node *head)
-{
-    Node *curr = head;
-    Node *prev = NULL;
-    while (curr != NULL)
-    {
-        Node *n = curr->next;
-        curr->next = prev;
-        prev = curr;
-        curr = n;
-    }
-    return prev;
-}
-Node *takeInput()
-{
-    int data;
-    cout << "Enter elements:" << endl;
-    cin >> data;
-    Node *head = NULL; /// LL is empty
-    Node *tail = NULL; /// LL is empty
-    while (data != -1)
-    {
-        /// creating LL
-        Node *n = new Node(data);
-        /// 1st node
-        if (head == NULL)
-        {
-            head = n;
-            tail = n;
-        }
-        else
-        {
-            tail->next = n; /// Inserting at Tail
-            tail = n;
-        }
-
-        cin >> data;
-    }
-    return head;
-}
-int main()
-{
-    // Note: add -1 at last in input
-    Node *head = takeInput(); /// inserting at tail
-    head = reverse(head);
-    print(head);
-    return 0;
-}