Tap here to switch tabs
Problem
Submissions

Problem: Sort Colors

Sort Colors asks you to rearrange an array of red, white, and blue objects, represented by zero, one, and two, in place so each color is grouped in order, without using a library sort.

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:

  • nn ==== colors.length

  • 1≤1 \leq nn ≤300\leq 300

  • colors[i] is either 0, 1, or 2

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Sort Colors

Sort Colors asks you to rearrange an array of red, white, and blue objects, represented by zero, one, and two, in place so each color is grouped in order, without using a library sort.

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:

  • nn ==== colors.length

  • 1≤1 \leq nn ≤300\leq 300

  • colors[i] is either 0, 1, or 2