Dutch flag sort
Given an array nums with only the values 0, 1, and 2, sort it in place in a single pass using O(1) extra space (the Dutch national flag problem), and return the sorted array. Constraints: 1 <= len(nums) <= 3*10^4, nums[i] in {0,1,2}.
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 22 min
solution.py
InputExpectedGot
[[2,0,2,1,1,0]][0,0,1,1,2,2]not run yetsample