Sort Colors

mediumPROSorting & SearchingNetflix DSA

Given an array with n objects colored red (0), white (1), or blue (2), sort them in-place so same colors are adjacent in order 0, 1, 2.

The function modifies nums in place and returns nothing; the tests print the sorted nums space-separated.

Example

Input

2,0,2,1,1,0

Output

0 0 1 1 2 2

Reasoning

The input 2,0,2,1,1,0 is a list of $n = 6$ colour codes: $0$ = red, $1$ = white, $2$ = blue. Each value is only a label, so the task is grouping, not general ordering.
Tally the colours: red appears $2$ times (positions $1$ and $5$ ), white $2$ times (positions $3$ and $4$ ), blue $2$ times (positions $0$ and $2$ ). The total is $2 + 2 + 2 = 6$ .
Rearranging never creates or destroys a value, so the result must hold exactly those tallies: reds fill positions $0$ to $1$ , whites positions $2$ to $3$ , blues positions $4$ to $5$ .
That gives 0 0 1 1 2 2, the same six numbers in non-decreasing order, printed space-separated.
Notice that "in-place" means the list passed in is itself changed: after the call, nums holds the grouped order, and nothing needs to be returned. With $k$ reds and $w$ whites, the blues always start at position $k + w$ .

Constraints

1 <= len(nums) <= 300
nums[i] is 0, 1, or 2

Learn this in

FundamentalsDSA Study Plan

More from Netflix DSA

Search a 2D Matrixeasy Merge Intervalsmedium Kth Largest Element in an Arraymedium Missing Numbereasy Find All Duplicates in Arraymedium

PRO

Editor locked

The code editor is locked for Pro problems. It is only available for free problems. Please upgrade to gain access to the code editor for all problems.

solution.py

Python 3.13

Test results