Challenge: Rearrange Sorted List in Max/Min Form

Statement

We're given a sorted list, nums, containing positive integers only. We have to rearrange the list so that when returned, the $0^{th}$ index of the list will have the largest number, the $1^{st}$ index will have the smallest number, the $2^{nd}$ index will have the second largest number, the $3^{rd}$ index will have the second smallest number, and so on.

In the end, we’ll have the largest remaining numbers in descending order and the smallest in ascending order at even and odd positions, respectively.

Constraints:

• $0 \leq$ nums.length $\leq 10^3$

• $1 \leq$ nums[i] $\leq 10^5$

Examples