Code Room
CodingMedium
Question
Given an array a containing only the integers 0, 1, and 2, return the array sorted in ascending order. Solve it in a single pass over the array using only constant extra space (the Dutch national flag partition). The array may have length 1.
Implement
sort_three_colors(a: list[int]) → list[int]Examples
in
[[2,0,2,1,1,0]]out[0,0,1,1,2,2]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.