Sort colors Dutch flag
Given an array `nums` containing only the integers 0, 1, and 2 representing colors, sort it in place so all 0s come first, then 1s, then 2s, using a SINGLE pass and O(1) extra space (the Dutch National Flag partition). Do not use the library sort or counting into a second array. Return the sorted array. Length up to 3*10^4.
Implement
sort_colors(nums: 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.
0:00 of about 18 min
solution.py
InputExpectedGot
[[2,0,2,1,1,0]][0,0,1,1,2,2]not run yetsample