delete LL nodes

Author: sachuverma

DSA Crack Sheet/README.md

@@ -155,6 +155,7 @@
 - [Clone a linked list with next and random pointer](https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1# "view question") - [Cpp Solution](./solutions/Clone%20a%20linked%20list%20with%20next%20and%20random%20pointer.cpp)
 - [Merge K sorted linked lists](https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1# "view question") - [Cpp Solution](./solutions/Merge%20K%20sorted%20linked%20lists.cpp)
 - [Multiply two linked lists](https://practice.geeksforgeeks.org/problems/multiply-two-linked-lists/1# "view question") - [Cpp Solution](./solutions/Multiply%20two%20linked%20lists.cpp)
+- [Delete nodes having greater value on right](https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1# "view question") - [Cpp Solution](./solutions/Delete%20nodes%20having%20greater%20value%20on%20right.cpp)
 - []( "view question") - [Cpp Solution](./solutions/.cpp)
 
 ### Binary Tree

DSA Crack Sheet/solutions/Delete nodes having greater value on right.cpp

@@ -0,0 +1,66 @@
+/*
+Delete nodes having greater value on right
+==========================================
+
+Given a singly linked list, remove all the nodes which have a greater value on its following nodes.
+
+Example 1:
+Input:
+LinkedList = 12->15->10->11->5->6->2->3
+Output: 15 11 6 3
+Explanation: Since, 12, 10, 5 and 2 are
+the elements which have greater elements
+on their next node. So, after deleting
+them, the linked list would like be 15,
+11, 6, 3.
+
+Example 2:
+Input:
+LinkedList = 10->20->30->40->50->60
+Output: 60
+Your Task:
+The task is to complete the function compute() which should modify the list as required and return the head of the modified linked list. The printing is done by the driver code,
+
+Expected Time Complexity: O(N)
+Expected Auxiliary Space: O(1)
+
+Constraints:
+1 <= size of linked list <= 1000
+1 <= element of linked list <= 1000
+Note: Try to solve the problem without using any extra space.
+*/
+
+Node *compute(Node *head)
+{
+  if (!head || !(head->next))
+    return head;
+  Node *temp = head, *prev = NULL, *nextnode;
+
+  while (temp && temp->next)
+  {
+    Node *temp2 = temp->next;
+    while (temp2)
+    {
+      if (temp2->data > temp->data)
+        break;
+      temp2 = temp2->next;
+    }
+
+    if (temp2)
+    {
+      nextnode = temp->next;
+      if (prev == NULL)
+        head = nextnode;
+      else
+        prev->next = nextnode;
+      free(temp);
+      temp = nextnode;
+    }
+    else
+    {
+      prev = temp;
+      temp = temp->next;
+    }
+  }
+  return head;
+}