me too jomo

the length of the solution is n. pascalsTriangle(n) returns an array of length n

I see

description updated

you should use an initial solution code snippet

function reverse(str) {
	// Your code here
}

Just take a look at JS values comparison, man:)

It's impossible to do in O(n) since the length of the result is O(n^2).

fastest != best != best practice

But people can always create their own linked list and copy everything to that with the same effect.
RAM is quite cheap now...