|All-time Popular Problems|
|Delete without head pointer|
|Rotate Array by n elements|
|Reverse array in groups|
|Implement Queue using Linked List|
|Column name from a given column number|
|Element with left side smaller and right side greater|
|Remove duplicate element from sorted Linked List|
|Triplet Sum in Array|
|Reverse an Array|
Given a sorted circular linked list, insert a newnode so that it remains a sorted circular linked list.
In this problem, method takes two argument: the address of the head of the linked list and the data which you have to insert. The function should not read any input from stdin/console.
The Node structure has a data part which stores the data and a next pointer which points to the next element of the linked list.
There are multiple test cases. For each test case, this method will be called individually.
Set the * head_ref to head of resultant linked list.
Note: If you use "Test" or "Expected Output Button" use below example format
3 Size of Linked List
1 2 4 Elements of Linked List
2 Element to be inserted
1 4 7 9
1 2 2 4
1 4 5 7 9