{"id":666,"date":"2025-07-15T13:51:25","date_gmt":"2025-07-15T08:21:25","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=666"},"modified":"2025-07-15T13:51:27","modified_gmt":"2025-07-15T08:21:27","slug":"sort-a-linked-list-of-0s-1s-and-2s","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/sort-a-linked-list-of-0s-1s-and-2s\/","title":{"rendered":"Sort a linked list of 0s, 1s and 2s | GFG Question Explained"},"content":{"rendered":"\n

Given the head<\/strong> of a linked list where nodes can contain values 0s<\/strong>, 1s,<\/strong> and 2s <\/strong>only. Your task is to rearrange<\/strong> the list so that all 0s<\/strong> appear at the beginning, followed by all 1s<\/strong>, and all 2s<\/strong> are placed at the end.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Examples:<\/strong><\/p>\n\n\n\n

Input: <\/strong>head = <\/strong>1 \u2192 2 \u2192 2 \u2192 1 \u2192 2 \u2192 0 \u2192 2 \u2192 2

Output: <\/strong>0 \u2192 1 \u2192 1 \u2192 2 \u2192 2 \u2192 2 \u2192 2 \u2192 2
\nExplanation: <\/strong>All the 0s are segregated to the left end of the linked list, 2s to the right end of the list, and 1s in between.<\/pre>\n\n\n\n
Input: <\/strong>head = 2 \u2192 2 \u2192 0 \u2192 1

Output: <\/strong>0 \u2192 1 \u2192 2 \u2192 2
\nExplanation: <\/strong>After arranging all the 0s, 1s and 2s in the given format, the output will be 0 \u2192 1 \u2192 2 \u2192 2.<\/pre>\n\n\n\n
Constraints:<\/strong>
1 \u2264 no. of nodes \u2264 106<\/sup>
0 \u2264 node->data \u2264 2<\/p>\n\n\n
\n\t\t\t
\n\t\t\t\t
Contents:<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\u00a0[show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>
\n\t\t\t
\n\t\t\t\t