Same or Not Using Doubly Linked List, Stack & Queue Solved

Author: MohammadFahad1

.cph/.Same_or_Not_II.cpp_1076c9fb6fb14ae6e9c35091d27ad0cd.prob

@@ -1 +1 @@
-{"name":"Same or Not II","group":"HackerRank - Assignment 03 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-03-a-basic-data-structure-a-batch-05/challenges/same-or-not-4","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5 5\n10 20 30 40 50\n50 40 30 20 10\n","output":"YES\n","id":1723011278114},{"input":"4 4\n10 20 30 40\n10 20 30 40\n","output":"NO\n","id":1723011278154},{"input":"5 4\n1 2 3 4 5\n5 4 3 2\n","output":"NO\n","id":1723011278140}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SameOrNotII"}},"batch":{"id":"9f4f7301-443d-4fb2-bf72-b064f7afd343","size":1},"srcPath":"c:\\xampp\\htdocs\\Phitron\\Basic_Data_Structures\\Same_or_Not_II.cpp"}
+{"name":"Same or Not II","group":"HackerRank - Assignment 03 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-03-a-basic-data-structure-a-batch-05/challenges/same-or-not-4","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"5 5\n10 20 30 40 50\n50 40 30 20 10\n","output":"YES\n","id":1723011278114},{"input":"4 4\n10 20 30 40\n10 20 30 40\n","output":"NO\n","id":1723011278154},{"id":1723011278140,"input":"5 4\n1 2 3 4 5\n5 4 3 2\n","output":"NO\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SameOrNotII"}},"batch":{"id":"9f4f7301-443d-4fb2-bf72-b064f7afd343","size":1},"srcPath":"c:\\xampp\\htdocs\\Phitron\\Basic_Data_Structures\\Same_or_Not_II.cpp"}

.vscode/settings.json

@@ -1,7 +1,9 @@
 {
   "files.associations": {
+    "*.js": "javascriptreact",
     "iostream": "cpp",
     "ostream": "cpp",
-    "*.tcc": "cpp"
+    "*.tcc": "cpp",
+    "new": "cpp"
   }
 }

Same_or_Not_II.cpp

@@ -0,0 +1,163 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    int val;
+    Node *prev;
+    Node *next;
+    Node(int val)
+    {
+        this->val = val;
+        this->next = NULL;
+        this->prev = NULL;
+    }
+};
+
+class myStack
+{
+    Node *head = NULL, *tail = NULL;
+    int sz = 0;
+
+    void push(int x)
+    {
+        sz++;
+        Node *newNode = new Node(x);
+        if (head == NULL)
+        {
+            head = newNode;
+            tail = newNode;
+            return;
+        }
+        tail->next = newNode;
+        newNode->prev = tail;
+        tail = newNode;
+    }
+
+    void pop()
+    {
+        if (tail == NULL)
+            return;
+        Node *deleteNode = tail;
+        tail = tail->prev;
+        if (tail == NULL)
+            head = NULL;
+        else
+            tail->next = NULL;
+        delete deleteNode;
+        sz--;
+    }
+
+    int top()
+    {
+        return tail->val;
+    }
+
+    int size()
+    {
+        return sz;
+    }
+
+    bool empty()
+    {
+        return sz == 0;
+    }
+};
+
+class myQueue
+{
+    Node *head = NULL, *tail = NULL;
+    int sz = 0;
+
+    void push(int x)
+    {
+        sz++;
+        Node *newNode = new Node(x);
+        if (head == NULL)
+        {
+            head = newNode;
+            tail = newNode;
+            return;
+        }
+        tail->next = newNode;
+        newNode->prev = tail;
+        tail = newNode;
+    }
+
+    void pop()
+    {
+        Node *deleteNode = head;
+        head = head->next;
+        if (head == NULL)
+            tail = NULL;
+        else
+            head->prev = NULL;
+        delete deleteNode;
+        sz--;
+    }
+
+    int front()
+    {
+        return head->val;
+    }
+
+    int size()
+    {
+        return sz;
+    }
+
+    bool empty()
+    {
+        return sz == 0;
+    }
+};
+
+int main()
+{
+    int n, m;
+    cin >> n >> m;
+
+    if (n != m)
+    {
+        cout << "NO" << endl;
+        return 0;
+    }
+
+    stack<int> st;
+    queue<int> q;
+
+    for (int i = 0; i < n; i++)
+    {
+        int x;
+        cin >> x;
+        st.push(x);
+    }
+
+    for (int i = 0; i < m; i++)
+    {
+        int x;
+        cin >> x;
+        q.push(x);
+    }
+
+    bool flag = true;
+
+    while (!st.empty() && !q.empty())
+    {
+        if (st.top() != q.front())
+        {
+            flag = false;
+            break;
+        }
+        st.pop();
+        q.pop();
+    }
+
+    if (flag)
+        cout << "YES" << endl;
+    else
+        cout << "NO" << endl;
+
+    return 0;
+}