You are given an integer array nums that represents a list compressed with run length encoding.

Consider each adjacent pair of elements [freq, val] = [nums$[2 \cdot i]$, nums$[2 \cdot i + 1]$] for each $i \geq 0$. For every pair, generate freq copies of the value val.

Return the decompressed list formed by concatenating all the generated sublists in order.

Constraints:

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

• nums.length $\bmod 2 = 0$

• $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.