Available question text
Reorder an unsorted array in-place into a wiggle sequence such that nums[0] < nums[1] > nums[2] < nums[3] ... (or any equivalent alternating < and > pattern). The challenge is to handle duplicates and produce any valid arrangement efficiently, typically requiring median-based partitioning and careful indexing to achieve linear time and constant extra space.
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 280. Wiggle Sort
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source