Sort a Quadratically Transformed Sorted Array

Given a non-decreasing integer array nums and integers a, b, and c, compute f(x) = a*x^2 + b*x + c for every element and return the transformed values in non-decreasing order.

Constraints: ...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: