Wiggle sort
Reorder an integer array into a 'wiggle' arrangement satisfying nums[0] <= nums[1] >= nums[2] <= nums[3] >= ... and return it. The given reference produces a canonical wiggle by a single left-to-right pass that swaps each adjacent pair whenever it violates the alternating relation at that position. Duplicates are allowed; the array has length >= 1.
Implement
wiggle_sort(nums: list[int]) → list[int]Examples
in
[[3,5,2,1,6,4]]out[3,5,1,6,2,4]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 20 min
solution.py
InputExpectedGot
[[3,5,2,1,6,4]][3,5,1,6,2,4]not run yetsample