Same or Not Using STL Stack & Queue Solved

Author: MohammadFahad1

.cph/.Same_or_Not.cpp_3d4a630c03afc3ddba2ec47249260cd3.prob

@@ -0,0 +1 @@
+{"name":"Same or Not","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-ii","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":1723006246919},{"input":"4 4\n10 20 30 40\n10 20 30 40\n","output":"NO\n","id":1723006246947},{"id":1723006246877,"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":"SameOrNot"}},"batch":{"id":"b19b32af-f448-46c3-a86b-313fadaf2d53","size":1},"srcPath":"c:\\xampp\\htdocs\\Phitron\\Basic_Data_Structures\\Same_or_Not.cpp"}

.cph/.Same_or_Not_II.cpp_1076c9fb6fb14ae6e9c35091d27ad0cd.prob

@@ -0,0 +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"}

Same_or_Not.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+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;
+}