Solution: Rearrange Sorted List in Max/Min Form

Let’s solve the Rearrange Sorted List in Max/Min Form problem.

We'll cover the following

Statement
Solution 1: Create a new list
- Complexity analysis
Solution 2: Use modulus (%) and two pointers
- Complexity analysis

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$

Solution 1: Create a new list

In this solution, we start by initializing an empty list, result, where we populate elements from the given input list, nums, in a specific order before returning it. The solution involves iterating from the start of nums up to its midpoint, where we calculate this midpoint as such:

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.

Introduction to Complexity Measures

Introduction to Lists

Introduction to Linked Lists

Introduction to Stacks and Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

Solution: Rearrange Sorted List in Max/Min Form

Statement

Solution 1: Create a new list