1. Given a singly linklist, Segregate Node of LinkedList over lastindex and return pivot node of linkedlist. 2. pivot is always be last index of linkedlist. 3. After segregation pivot Element should have to be present at correct position as in sorted linkedlist.
Input Format
1->5->2->9->5->14->11->1->10->10->1->3->null
Output Format
3->5->9->5->14->11->10->10->null
Constraints
-10^6 <= size Of LinkedList <= 10^6
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
12 1 5 2 9 5 14 11 1 10 10 1 3
Output
3 5 9 5 14 11 10 10