You are given a $0$ indexed integer array nums. Rearrange the elements of nums according to the following rules:

• Sort the values present at odd indices in descending order.

• Sort the values present at even indices in ascending order.

Return the modified array nums after applying these rearrangements.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.