Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 324. Wiggle Sort II
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source