← Questions
Sort a transformed array
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a sorted array and the coefficients a, b, c of f(x) = ax^2 + bx + c, apply f to every element and return the results in sorted order in O(n). Use two pointers from both ends; which end produces the next value depends on the sign of a.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding