Linked List Search Problem Solved, DSA, Assignment-2, problem-2

Author: MohammadFahad1

.cph/.Search.cpp_caa1c0b5bb507737e707c81698098574.prob

@@ -0,0 +1 @@
+{"name":"Search","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/search-12","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"id":1720890201471,"input":"4\n1 2 3 4 5 -1\n3\n1 2 3 -1\n5\n1 -1\n1\n10 20 -1\n20\n","output":"2\n-1\n0\n1\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Search"}},"batch":{"id":"4b9a8426-94f1-4091-83da-70b503ca18c0","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Search.cpp"}

Search.bin

@@ -0,0 +1,71 @@
+#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 check_if_exist_and_show_output(Node *head, long int x)
+{
+    Node *tmp = head;
+    int i = 0;
+    while (tmp != NULL)
+    {
+        if (tmp->val == x)
+        {
+            cout << i << endl;
+            return;
+        }
+        else
+            i++;
+        tmp = tmp->next;
+    }
+    cout << "-1" << endl;
+}
+
+int main()
+{
+
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        Node *head = NULL;
+        Node *tail = NULL;
+        while (true)
+        {
+            long int val;
+            cin >> val;
+            if (val == -1)
+                break;
+            insert_at_tail(head, tail, val);
+        }
+
+        long int x;
+        cin >> x;
+        check_if_exist_and_show_output(head, x);
+    }
+
+    return 0;
+}