How should I practice Deterministic Zigzag Sort?

Start by reading the full statement, solve the visible examples, then compare the pattern against related SambaNova Systems phone screen and onsite interview problems in FastPrep.

Is Deterministic Zigzag Sort associated with SambaNova Systems?

FastPrep tags this as a SambaNova Systems phone screen and onsite interview coding practice problem when the problem catalog has that company and stage context.

Deterministic Zigzag Sort

SambaNova Systems● EasyNEW GRADPHONE SCREENONSITE INTERVIEW

Learn

Problem statement

Return a deterministic rearrangement of nums that satisfies a[0] <= a[1] >= a[2] <= a[3] ....

For a unique answer, sort ascending and swap each adjacent pair at indices (1,2), (3,4), and so on. Preserve every input occurrence.

Function

wiggleSort(nums: int[]) → int[]

Examples

Example 1

nums = [1,2,3,4,5]return = [1,3,2,5,4]

Swap the two alternating adjacent pairs.

Example 2

nums = [3,1,2]return = [1,3,2]

Sorting then one swap forms a peak at index one.

Example 3

nums = [2,2,1,1]return = [1,2,1,2]

Duplicates still satisfy non-strict inequalities.

Constraints

1 <= nums.length <= 100000.
-10^9 <= nums[i] <= 10^9.