Comparing if two singly linked list are the same solved

Author: MohammadFahad1

.cph/.Same_to_Same.cpp_9b02b217a8ff62717c83468e03fca69a.prob

@@ -0,0 +1 @@
+{"name":"Same to Same","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/same-to-same-1","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"10 20 30 40 -1\n10 20 30 40 -1\n","output":"YES\n","id":1720893617212},{"input":"10 20 30 40 -1\n10 20 30 -1\n","output":"NO\n","id":1720893617207},{"id":1720893617156,"input":"10 20 30 40 -1\n40 30 20 10 -1\n","output":"NO\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SameToSame"}},"batch":{"id":"d254daed-c58a-487e-88bf-cd9b36f8d677","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Same_to_Same.cpp"}

Same_to_Same.bin

@@ -0,0 +1,77 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    long int val;
+    Node *next;
+    Node(int val)
+    {
+        this->val = val;
+        this->next = NULL;
+    }
+};
+
+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;
+}
+
+void compare_and_show_output(Node *n1, Node *n2)
+{
+    Node *Node1 = n1;
+    Node *Node2 = n2;
+    while (Node1 != NULL && Node2 != NULL)
+    {
+        if (Node1->val != Node2->val)
+        {
+            cout << "NO" << endl;
+            return;
+        }
+        Node1 = Node1->next;
+        Node2 = Node2->next;
+    }
+
+    if (Node1 == NULL && Node2 == NULL)
+        cout << "YES" << endl;
+    else
+        cout << "NO" << endl;
+}
+
+int main()
+{
+    Node *N1 = NULL;
+    Node *N1Tail = NULL;
+    Node *N2 = NULL;
+    Node *N2Tail = NULL;
+
+    while (true)
+    {
+        long int val;
+        cin >> val;
+        if (val == -1)
+            break;
+        insert_at_tail(N1, N1Tail, val);
+    }
+    while (true)
+    {
+        long int val;
+        cin >> val;
+        if (val == -1)
+            break;
+        insert_at_tail(N2, N2Tail, val);
+    }
+
+    compare_and_show_output(N1, N2);
+
+    return 0;
+}