Wiggle sort array
Given an integer array `nums`, reorder it in place so that nums[0] < nums[1] > nums[2] < nums[3] ... (strict alternation). It is guaranteed a valid arrangement exists. Return the reordered array. A correct, simpler-to-reason approach: sort a copy, then fill the odd indices from the largest values downward and the even indices from the remaining values downward (interleaving the two halves so equal medians never sit adjacent). Length up to 5*10^4.
Implement
wiggle_sort(nums: list[int]) → list[int]Examples
in
[[1,5,1,1,6,4]]out[1,6,1,5,1,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 30 min
solution.py
InputExpectedGot
[[1,5,1,1,6,4]][1,6,1,5,1,4]not run yetsample