DSA Level 2 Data Structures Linked List Segregate Node Of Linkedlist Over Last Index.

Segregate Node Of Linkedlist Over Last Index.

easy

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 &lt;= size Of LinkedList &lt;= 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

Quicksort In Linkedlist

Segregate Node Of Linkedlist Over Pivot Index

Related Questions

easy Reverse A Linkedlist easy Middle Of A Linked List easy Palindrome Linkedlist easy Fold Of Linkedlist easy Unfold Of Linkedlist easy Merge Two Sorted Linkedlist easy Mergesort Linkedlist easy Segregate Even And Odd Nodes In A Linkedlist easy Remove Nth Node From End Of Linkedlist easy Merge K Sorted Linkedlist easy Reverse Node Of Linkedlist In K Group easy Reverse In Range easy Copy Linkedlist With Random Pointers easy Is Cycle Present In Linkedlist easy Add Two Linkedlist medium Subtract Two Linkedlist