Merge pull request #996 from AnantB1/main

Absolute List Sorting.cpp

Author: Sirajmolla

92. Reverse Linked List II/Absolute List Sorting.cpp

@@ -0,0 +1,97 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// Linked List Node
+struct Node
+{
+    Node* next;
+    int data;
+};
+void sortList(Node** head);
+// Utility function to insert a node at the
+// beginning
+void push(Node** head, int data)
+{
+    Node* newNode = new Node;
+    newNode->next = (*head);
+    newNode->data = data;
+    (*head) = newNode;
+}
+
+// Utility function to print a linked list
+void printList(Node* head)
+{
+    while (head != NULL)
+    {
+        cout << head->data;
+        if (head->next != NULL)
+            cout << " ";
+        head = head->next;
+    }
+    cout<<endl;
+}
+
+
+// Driver code
+int main()
+{
+
+int t=0;
+int n = 0;
+cin>>t;
+while(t--)
+{
+ Node* head = NULL;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    {
+        cin>>arr[i];
+       // push(&head, a);
+    }
+    for(int i=n-1;i>=0;i--)
+    {
+        push(&head, arr[i]);
+    }
+   // printList(head);
+
+    sortList(&head);
+
+    printList(head);
+
+}
+    return 0;
+}
+// } Driver Code Ends
+
+
+/* The structure of the Linked list Node is as follows:
+struct Node
+{
+    Node* next;
+    int data;
+}; */
+
+/*Your method shouldn't print anything
+ it should transform the passed linked list */
+void sortList(Node** head)
+{
+    // Your Code Here
+    Node *cur=*head,*temp;
+    
+    while(cur!=NULL && cur->next!=NULL)
+    {
+        if(cur->next->data < 0)
+        {
+            temp=cur->next;
+            cur->next=temp->next;
+            temp->next=*head;
+            *head=temp;
+        }
+        else
+        {
+            cur=cur->next;
+        }
+        
+    }
+}

92. Reverse Linked List II/Check if Linked List is Palindrome.cpp

@@ -0,0 +1,86 @@
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <iostream>
+#include <stack>
+using namespace std;
+/* Link list Node */
+struct Node {
+  int data;
+  struct Node *next;
+  Node(int x) {
+    data = x;
+    next = NULL;
+  }
+};
+
+
+
+bool isPalindrome(Node *head);
+/* Driver program to test above function*/
+int main()
+{
+  int T,i,n,l,firstdata;
+    cin>>T;
+    while(T--)
+    {
+        
+        struct Node *head = NULL,  *tail = NULL;
+        cin>>n;
+        // taking first data of LL
+        cin>>firstdata;
+        head = new Node(firstdata);
+        tail = head;
+        // taking remaining data of LL
+        for(i=1;i<n;i++)
+        {
+            cin>>l;
+            tail->next = new Node(l);
+            tail = tail->next;
+        }
+   	cout<<isPalindrome(head)<<endl;
+    }
+    return 0;
+}
+
+// } Driver Code Ends
+
+
+/*
+struct Node {
+  int data;
+  struct Node *next;
+  Node(int x) {
+    data = x;
+    next = NULL;
+  }
+};
+*/
+/*You are required to complete this method */
+bool isPalindrome(Node *head)
+{
+    //Your code here
+    deque <int> q;
+    Node *cur=head;
+    while(cur!=NULL)
+    {
+        q.push_back(cur->data);
+        cur=cur->next;
+    }
+    
+    while(q.size() >1)
+    {
+        if(q.front()==q.back())
+        {
+            q.pop_front();
+            q.pop_back();
+        }
+        else
+        {
+            return false;
+        }
+        
+    }
+    return true;
+    
+}