Watch 10 video solutions for Wiggle Sort II, a medium level problem involving Array, Divide and Conquer, Greedy. This walkthrough by NeetCode has 106,853 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....
You may assume the input array always has a valid answer.
Example 1:
Input: nums = [1,5,1,1,6,4] Output: [1,6,1,5,1,4] Explanation: [1,4,1,5,1,6] is also accepted.
Example 2:
Input: nums = [1,3,2,2,3,1] Output: [2,3,1,3,1,2]
Constraints:
1 <= nums.length <= 5 * 1040 <= nums[i] <= 5000nums.Follow Up: Can you do it in
O(n) time and/or in-place with O(1) extra space?