Wiggle sort with adjacent swaps
Given an integer array a, rearrange it into a 'wiggle' order so that a[0] <= a[1] >= a[2] <= a[3] >= ... using a single left-to-right pass of adjacent swaps. Return one valid arrangement produced by the greedy rule: at each index i, if the local wiggle constraint is violated, swap a[i] and a[i+1]. The array may have length 1.
Implement
wiggle_arrange(a: 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 25 min
solution.py
InputExpectedGot
[[3,5,2,1,6,4]][3,5,1,6,2,4]not run yetsample