Remember Previous Queries Solved

Author: MohammadFahad1

.cph/.Remember_Previous_Queries.cpp_c4ad5ba7181eff2517e16bf4b516f537.prob

@@ -0,0 +1 @@
+{"name":"Remember Previous Queries?","group":"HackerRank - Mid Term Exam | Basic Data Structures | Batch 05","url":"https://www.hackerrank.com/contests/mid-term-exam-a-basic-data-structures-a-batch-05/challenges/remember-previous-queries","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"4\n0 10\n1 20\n1 30\n0 40\n","output":"L -> 10\nR -> 10\nL -> 10 20\nR -> 20 10\nL -> 10 20 30\nR -> 30 20 10\nL -> 40 10 20 30\nR -> 30 20 10 40\n","id":1722000354757},{"input":"9\n0 10\n2 1\n2 0\n1 20\n0 10\n2 2\n2 1\n2 2\n2 0\n","output":"L -> 10\nR -> 10\nL -> 10\nR -> 10\nL ->\nR ->\nL -> 20\nR -> 20\nL -> 10 20\nR -> 20 10\nL -> 10 20\nR -> 20 10\nL -> 10\nR -> 10\nL -> 10\nR -> 10\nL ->\nR ->\n","id":1722000354795},{"input":"11\n0 10\n2 5\n1 20\n1 30\n0 40\n2 0\n0 50\n2 2\n1 60\n2 3\n2 3\n","output":"L -> 10\nR -> 10\nL -> 10\nR -> 10\nL -> 10 20\nR -> 20 10\nL -> 10 20 30\nR -> 30 20 10\nL -> 40 10 20 30\nR -> 30 20 10 40\nL -> 10 20 30\nR -> 30 20 10\nL -> 50 10 20 30\nR -> 30 20 10 50\nL -> 50 10 30\nR -> 30 10 50\nL -> 50 10 30 60\nR -> 60 30 10 50\nL -> 50 10 30\nR -> 30 10 50\nL -> 50 10 30\nR -> 30 10 50\n","id":1722000354745},{"input":"10\n1 4\n2 1\n0 9\n0 10\n2 2\n1 5\n2 0\n2 1\n2 5\n2 2\n","output":"L -> 4\nR -> 4\nL -> 4\nR -> 4\nL -> 9 4\nR -> 4 9\nL -> 10 9 4\nR -> 4 9 10\nL -> 10 9\nR -> 9 10\nL -> 10 9 5\nR -> 5 9 10\nL -> 9 5\nR -> 5 9\nL -> 9\nR -> 9\nL -> 9\nR -> 9\nL -> 9\nR -> 9\n","id":1722000354792}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"RememberPreviousQueries"}},"batch":{"id":"6b9b29af-ae73-4df4-a4e3-ffda6385b01f","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Remember_Previous_Queries.cpp"}

Remember_Previous_Queries.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    list<int> myList;
+    int q;
+    cin >> q;
+    while (q--)
+    {
+        int x, v;
+        cin >> x >> v;
+        if (x == 0)
+            myList.push_front(v);
+        else if (x == 1)
+            myList.push_back(v);
+        else if (x == 2 && int(v) < int(myList.size()))
+            myList.erase(next(myList.begin(), v));
+
+        cout << "L -> ";
+        for (int val : myList)
+        {
+            cout << val << " ";
+        }
+        cout << endl;
+
+        list<int> listcpy = myList;
+        listcpy.reverse();
+
+        cout << "R -> ";
+        for (int reverseVal : listcpy)
+        {
+            cout << reverseVal << " ";
+        }
+        cout << endl;
+    }
+
+    return 0;
+}

Remember_Previous_Queries.exe

@@ -1,11 +1,5 @@
-10
+4
 0 10
 1 20
-0 30
-1 40
-6 50
-0 60
-4 70
-4 80
-2 90
-1 100
+1 30
+0 40

input.txt

@@ -0,0 +1,8 @@
+L -> 10 
+R -> 10 
+L -> 10 20 
+R -> 20 10 
+L -> 20 10 30 
+R -> 30 10 20 
+L -> 40 30 10 20 
+R -> 20 10 30 40