Practice Wiggle Sort II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Wiggle Sort II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,5,1,1,6,4]
Output
[1,6,1,5,1,4]
# Example 2
Input
nums = [1,3,2,2,3,1]
Output
[2,3,1,3,1,2]
Constraints
1 <= nums.length <= 5 * 10^4
0 <= nums[i] <= 5000
It is guaranteed that there will be an answer for the given input nums.
Related LeetCode Problems
Practice more problems similar to Wiggle Sort II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.