Queries Problem Solved

Author: MohammadFahad1

.cph/.Queries.cpp_219064f916d895879e57b44f4f75a801.prob

@@ -0,0 +1 @@
+{"name":"Queries","group":"HackerRank - Assignment 02 | Basic Data Structures | Batch 05","url":"https://www.hackerrank.com/contests/assignment-02-a-basic-data-structures-a-batch-05/challenges/queries-6-1","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"4\n0 10\n1 20\n1 30\n0 40\n","output":"10\n10 20\n10 20 30\n40 10 20 30\n","id":1720920500690},{"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":"10\n10\n10 20\n10 20 30\n40 10 20 30\n10 20 30\n50 10 20 30\n50 10 30\n50 10 30 60\n50 10 30\n50 10 30\n","id":1720920500717},{"id":1720920500759,"input":"10\n1 4\n2 1\n0 9\n0 10\n2 2\n1 5\n2 0\n2 1\n2 5\n2 2\n","output":"4\n4\n9 4\n10 9 4\n10 9\n10 9 5\n9 5\n9\n9\n9\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Queries"}},"batch":{"id":"bb446321-185f-49dd-b0a1-fa8ba51d383a","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Queries.cpp"}

Queries.bin

@@ -0,0 +1,125 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    int val;
+    Node *next;
+    Node(int val)
+    {
+        this->val = val;
+        this->next = NULL;
+    }
+};
+
+void print_linked_list(Node *head)
+{
+    Node *tmp = head;
+    while (tmp != NULL)
+    {
+        cout << tmp->val << " ";
+        tmp = tmp->next;
+    }
+    cout << endl;
+}
+
+void insert_at_head(Node *&head, Node *&tail, long int v)
+{
+    Node *newNode = new Node(v);
+    if (head == NULL)
+    {
+        head = newNode;
+        tail = newNode;
+        return;
+    }
+    newNode->next = head;
+    head = newNode;
+}
+
+void insert_at_tail(Node *&head, Node *&tail, long int val)
+{
+    Node *newNode = new Node(val);
+    if (head == NULL)
+    {
+        head = newNode;
+        tail = newNode;
+        return;
+    }
+    tail->next = newNode;
+    tail = newNode;
+}
+
+int getSize(Node *head)
+{
+    Node *tmp = head;
+    int count = 0;
+    while (tmp != NULL)
+    {
+        count++;
+        tmp = tmp->next;
+    }
+    return count;
+}
+
+void delete_at_index(Node *&head, Node *&tail, int pos)
+{
+    Node *tmp = head;
+    int size = getSize(tmp);
+
+    if (tmp == NULL)
+        return;
+
+    if (pos < 0 || pos >= size)
+        return;
+
+    if (pos == 0)
+    {
+        Node *deleteNode = head;
+        head = head->next;
+        delete deleteNode;
+        if (head == NULL)
+            tail = NULL;
+        return;
+    }
+    else
+    {
+        for (int i = 0; i < pos - 1; i++)
+        {
+            tmp = tmp->next;
+        }
+
+        Node *deleteNode = tmp->next;
+        tmp->next = tmp->next->next;
+        if (tmp->next == NULL)
+        {
+            tail = tmp;
+        }
+        delete deleteNode;
+    }
+}
+
+int main()
+{
+    Node *head = NULL;
+    Node *tail = NULL;
+    int q;
+    cin >> q;
+    while (q--)
+    {
+        int x;
+        long int v;
+        cin >> x >> v;
+
+        if (x == 0)
+            insert_at_head(head, tail, v);
+        else if (x == 1)
+            insert_at_tail(head, tail, v);
+        else if (x == 2)
+            delete_at_index(head, tail, v);
+
+        print_linked_list(head);
+    }
+
+    return 0;
+}