Leetcode 324. Wiggle Sort II

Reorder an integer array into a wiggle sequence nums[0] < nums[1] > nums[2] < nums[3] ... while correctly handling duplicates (a valid arrangement is guaranteed). The follow-up asks for an in-place, O(n)-time solution (commonly via median selection and careful indexing).