Given an integer array nums sorted in ascending order and three integers a, b, and c, apply the quadratic function $f(x) = a \cdot x^2 + b \cdot x + c$ to each element nums[i] in the array.

Return an array containing all the transformed values sorted in non decreasing order.

Constraints:

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

• $-100 \leq$ nums[i], a, b, c $\leq 100$

• nums is sorted in ascending order.

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.