Segregate 012 Node Of Linkedlist Over Swapping Nodes

easy
Question Solve Solutions 
1. Given a singly linklist, Segregate 012 Node of LinkedList and return pivot node of linkedlist.
2. After segregation zero nodes should come first and then ones node followed by two's nodes.

Input Format

1->0->1->0->0->1->2->1->1->1->2->1->1->null

Output Format

0->0->0->1->1->1->1->1->1->1->1->2->2->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
17
2 2 0 2 1 0 0 2 2 1 2 1 2 0 1 0 0
Output
0 0 0 0 0 0 1 1 1 1 2 2 2 2 2 2 2
Previous
Segregate 01 Node Of Linkedlist By Swapping Data
Next
Segregate 012 Node Of Linkedlist By Swapping Data

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