Problem: Sort Colors

med

30 min

Explore how to efficiently sort colors represented by 0, 1, and 2 in an array by applying the two pointers approach. This lesson helps you understand a one-pass algorithm that rearranges colors in place without extra space, preparing you to solve similar linear data structure problems.

Statement

You are given an array nums of length n, where each element represents an object colored either red, white, or blue. The integers 0, 1, and 2 are used to represent red, white, and blue, respectively.

Sort the array in place so that all objects of the same color are grouped together, arranged in the order: red (0), white (1), and blue (2).

You must solve this problem without using any library sort function.

Note: Could you come up with a one pass algorithm using only constant extra space?

Constraints:

$n$ $==$ colors.length
$1 \leq$ $n$ $\leq 300$
colors[i] is either 0, 1, or 2

Problem: Sort Colors

med

30 min

Statement

Sort the array in place so that all objects of the same color are grouped together, arranged in the order: red (0), white (1), and blue (2).

You must solve this problem without using any library sort function.

Note: Could you come up with a one pass algorithm using only constant extra space?

Constraints:

$n$ $==$ colors.length
$1 \leq$ $n$ $\leq 300$
colors[i] is either 0, 1, or 2

Problem: Sort Colors

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Sort Colors

Statement

Examples

Understand the problem

Figure it out!

Try it yourself