Solution: Rearrange Sorted List in Max/Min Form

Explore two methods to rearrange a sorted list so elements alternate between max and min values. Learn an approach using an extra list and a modulus-based in-place algorithm to optimize space, understanding the time and space complexity for each.

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.Introduction to Complexity Measures

2.Introduction to Lists

3.Introduction to Linked Lists

4.Introduction to Stacks and Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Mock Interview

Solution: Rearrange Sorted List in Max/Min Form

Statement