Skip to main content
mediumGrind 75

Sort Colors

Sort an array containing 0, 1, and 2 in-place 0 = red, 1 = white, 2 = blue Example: [2,0,2,1,1,0] => [0,0,1,1,2,2]

Sort Colors looks brute-forceable, but it's really about moving pointers with a reason. Interviewers love it because it reveals your invariant-driven scanning and your edge-case discipline. The trap is moving the wrong pointer and silently skipping the real answer.

Meet Coco

Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Sign in free to type with Coco, up to a daily limit, and to talk with her for one hour. After that, talking comes with the $79 pack. Anyone can open the editor and run their code.

1Sort Colorsmedium
2Part 2
3Part 3

Each locked part opens in the editor once the part before it passes.

Based onLeetCode

Prep guides that list this problem

Our company tags come from public interview write-ups. None of these is a confirmed question.

Get a note when something new lands

New company guides, new problems and big changes to Coco. Rare, and you can leave any time. By joining you agree to get these emails.